file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/CategoryTheory/Bicategory/Basic.lean | CategoryTheory.Bicategory.whiskerRight_id_symm | [
{
"state_after": "no goals",
"state_before": "B : Type u\ninst✝ : Bicategory B\na b c d e : B\nf g : a ⟶ b\nη : f ⟶ g\n⊢ η = (ρ_ f).inv ≫ η ▷ 𝟙 b ≫ (ρ_ g).hom",
"tactic": "simp"
}
] | [
414,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
413,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | mul_le_mul | [] | [
415,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
413,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.union_erase_of_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.265932\nγ : Type ?u.265935\ninst✝ : DecidableEq α\ns t✝ u v : Finset α\na b : α\nha : a ∈ s\nt : Finset α\n⊢ s ∪ erase t a = s ∪ t",
"tactic": "rw [← insert_erase (mem_union_left t ha), erase_union_distrib, ← insert_union, insert_er... | [
2282,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2281,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_C_mul_X_pow | [] | [
318,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Mathlib/Data/Sigma/Interval.lean | Sigma.Ico_mk_mk | [] | [
90,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Data/Set/Prod.lean | Set.prod_preimage_eq | [] | [
201,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/Data/Complex/Exponential.lean | Real.cos_sq_le_one | [
{
"state_after": "x y : ℝ\n⊢ cos x ^ 2 ≤ sin x ^ 2 + cos x ^ 2",
"state_before": "x y : ℝ\n⊢ cos x ^ 2 ≤ 1",
"tactic": "rw [← sin_sq_add_cos_sq x]"
},
{
"state_after": "no goals",
"state_before": "x y : ℝ\n⊢ cos x ^ 2 ≤ sin x ^ 2 + cos x ^ 2",
"tactic": "exact le_add_of_nonneg_left (sq_n... | [
1255,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1254,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.abs_exp_eq_iff_re_eq | [
{
"state_after": "no goals",
"state_before": "x y : ℂ\n⊢ ↑abs (exp x) = ↑abs (exp y) ↔ x.re = y.re",
"tactic": "rw [abs_exp, abs_exp, Real.exp_eq_exp]"
}
] | [
2046,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2045,
1
] |
Mathlib/Combinatorics/Quiver/Path.lean | Prefunctor.mapPath_nil | [] | [
221,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Data/Nat/ModEq.lean | Nat.add_mod_add_of_le_add_mod | [
{
"state_after": "no goals",
"state_before": "m n a✝ b✝ c✝ d a b c : ℕ\nhc : c ≤ a % c + b % c\n⊢ (a + b) % c + c = a % c + b % c",
"tactic": "rw [← add_mod_add_ite, if_pos hc]"
}
] | [
444,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
443,
1
] |
Mathlib/Analysis/SpecificLimits/Normed.lean | isLittleO_pow_pow_of_abs_lt_left | [
{
"state_after": "α : Type ?u.72372\nβ : Type ?u.72375\nι : Type ?u.72378\nr₁ r₂ : ℝ\nh : abs r₁ < abs r₂\n⊢ (fun x => ‖r₁ ^ x‖) =o[atTop] fun x => ‖r₂ ^ x‖",
"state_before": "α : Type ?u.72372\nβ : Type ?u.72375\nι : Type ?u.72378\nr₁ r₂ : ℝ\nh : abs r₁ < abs r₂\n⊢ (fun n => r₁ ^ n) =o[atTop] fun n => r₂ ^... | [
112,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Tactic/NormNum/Basic.lean | Mathlib.Meta.NormNum.isInt_sub | [] | [
297,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
295,
1
] |
Mathlib/Data/Semiquot.lean | Semiquot.blur_eq_blur' | [
{
"state_after": "α : Type u_1\nβ : Type ?u.2311\nq : Semiquot α\ns : Set α\nh : q.s ⊆ s\n⊢ blur' q (_ : q.s ⊆ s ∪ q.s) = blur' q h",
"state_before": "α : Type u_1\nβ : Type ?u.2311\nq : Semiquot α\ns : Set α\nh : q.s ⊆ s\n⊢ blur s q = blur' q h",
"tactic": "unfold blur"
},
{
"state_after": "cas... | [
94,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.sub_le | [] | [
546,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
545,
1
] |
Mathlib/Data/Dfinsupp/WellFounded.lean | Dfinsupp.Lex.acc_single | [
{
"state_after": "case intro\nι : Type u_1\nα : ι → Type u_2\ninst✝¹ : (i : ι) → Zero (α i)\nr : ι → ι → Prop\ns : (i : ι) → α i → α i → Prop\nhbot : ∀ ⦃i : ι⦄ ⦃a : α i⦄, ¬s i a 0\nhs : ∀ (i : ι), WellFounded (s i)\ninst✝ : DecidableEq ι\ni✝ i : ι\nh✝ : ∀ (y : ι), (rᶜ ⊓ fun x x_1 => x ≠ x_1) y i → Acc (rᶜ ⊓ fun... | [
155,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_smul_of_tower | [
{
"state_after": "no goals",
"state_before": "m : Type ?u.1316454\nn : Type u_2\ninst✝⁸ : DecidableEq n\ninst✝⁷ : Fintype n\ninst✝⁶ : DecidableEq m\ninst✝⁵ : Fintype m\nR : Type v\ninst✝⁴ : CommRing R\nα : Type u_1\ninst✝³ : Monoid α\ninst✝² : DistribMulAction α R\ninst✝¹ : IsScalarTower α R R\ninst✝ : SMul... | [
289,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiffAt.hasStrictDerivAt' | [] | [
1961,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1959,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean | Ideal.IsHomogeneous.sup | [
{
"state_after": "ι : Type u_2\nσ : Type u_3\nR : Type ?u.119538\nA : Type u_1\ninst✝⁵ : Semiring A\ninst✝⁴ : DecidableEq ι\ninst✝³ : AddMonoid ι\ninst✝² : SetLike σ A\ninst✝¹ : AddSubmonoidClass σ A\n𝒜 : ι → σ\ninst✝ : GradedRing 𝒜\nI J : Ideal A\nHI : ∃ S, I = span (Subtype.val '' S)\nHJ : ∃ S, J = span (Su... | [
274,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Order/Grade.lean | covby_iff_lt_covby_grade | [] | [
123,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Algebra/Group/Prod.lean | MonoidHom.fst_comp_inl | [] | [
518,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
517,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.nonneg_total | [] | [
751,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
11
] |
Mathlib/Algebra/Order/Hom/Monoid.lean | OrderMonoidHom.comp_assoc | [] | [
444,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ico_diff_Ico_right | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.158202\nα : Type u_1\ninst✝¹ : LinearOrder α\ninst✝ : LocallyFiniteOrder α\na✝ b✝ a b c : α\n⊢ Ico a b \\ Ico c b = Ico a (min b c)",
"tactic": "cases le_total b c with\n| inl h => rw [Ico_eq_empty_of_le h, sdiff_empty, min_eq_left h]\n| inr h =>... | [
831,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
825,
1
] |
Mathlib/Data/Set/NAry.lean | Set.image_subset_image2_left | [] | [
73,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Algebra/Star/StarAlgHom.lean | NonUnitalStarAlgHom.inr_apply | [] | [
593,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
592,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.comp_swap_eq_update | [
{
"state_after": "no goals",
"state_before": "α : Sort u_2\ninst✝ : DecidableEq α\nβ : Sort u_1\ni j : α\nf : α → β\n⊢ f ∘ ↑(swap i j) = update (update f j (f i)) i (f j)",
"tactic": "rw [swap_eq_update, comp_update, comp_update, comp.right_id]"
}
] | [
1604,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1602,
1
] |
Mathlib/Combinatorics/Composition.lean | composition_card | [
{
"state_after": "n✝ n : ℕ\n⊢ Fintype.card (Composition n) = Fintype.card (CompositionAsSet n)",
"state_before": "n✝ n : ℕ\n⊢ Fintype.card (Composition n) = 2 ^ (n - 1)",
"tactic": "rw [← compositionAsSet_card n]"
},
{
"state_after": "no goals",
"state_before": "n✝ n : ℕ\n⊢ Fintype.card (Com... | [
1087,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1085,
1
] |
Mathlib/Data/List/Destutter.lean | List.destutter_of_chain' | [] | [
160,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Topology/MetricSpace/Isometry.lean | IsometryEquiv.comp_continuous_iff | [] | [
530,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
528,
1
] |
Mathlib/Data/List/BigOperators/Lemmas.lean | List.alternatingProd_append | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.13107\nα : Type u_1\nM : Type ?u.13113\nN : Type ?u.13116\nP : Type ?u.13119\nM₀ : Type ?u.13122\nG : Type ?u.13125\nR : Type ?u.13128\ninst✝ : CommGroup α\nl₂ : List α\n⊢ alternatingProd ([] ++ l₂) = alternatingProd [] * alternatingProd l₂ ^ (-1) ^ ... | [
108,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Topology/MetricSpace/Isometry.lean | Isometry.mapsTo_closedBall | [] | [
267,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.Nnreal.upper_bound | [
{
"state_after": "F : Type ?u.1563197\nα✝ : Type u\nβ : Type v\nγ : Type w\nα : Type u_1\ninst✝ : TopologicalSpace α\nf : α →ᵇ ℝ≥0\nx : α\nkey : nndist (↑f x) (↑0 x) ≤ nndist f 0\n⊢ ↑f x ≤ nndist f 0",
"state_before": "F : Type ?u.1563197\nα✝ : Type u\nβ : Type v\nγ : Type w\nα : Type u_1\ninst✝ : Topologic... | [
1433,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1429,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion_inter | [] | [
526,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
525,
1
] |
Mathlib/Algebra/TrivSqZeroExt.lean | TrivSqZeroExt.fst_neg | [] | [
269,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/LinearAlgebra/Projection.lean | Submodule.linearProjOfIsCompl_ker | [] | [
190,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.mkOfCompact_one | [] | [
635,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
635,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.domLCongr_symm | [] | [
626,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
625,
1
] |
Mathlib/LinearAlgebra/Matrix/IsDiag.lean | Matrix.IsDiag.neg | [
{
"state_after": "α : Type u_1\nβ : Type ?u.3130\nR : Type ?u.3133\nn : Type u_2\nm : Type ?u.3139\ninst✝ : AddGroup α\nA : Matrix n n α\nha : IsDiag A\ni j : n\nh : i ≠ j\n⊢ (-A) i j = 0",
"state_before": "α : Type u_1\nβ : Type ?u.3130\nR : Type ?u.3133\nn : Type u_2\nm : Type ?u.3139\ninst✝ : AddGroup α\... | [
87,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/CategoryTheory/Conj.lean | CategoryTheory.Iso.conj_id | [] | [
96,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Analysis/Calculus/Inverse.lean | ApproximatesLinearOn.surjOn_closedBall_of_nonlinearRightInverse | [
{
"state_after": "𝕜 : Type u_1\ninst✝⁹ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁶ : NormedAddCommGroup F\ninst✝⁵ : NormedSpace 𝕜 F\nG : Type ?u.63211\ninst✝⁴ : NormedAddCommGroup G\ninst✝³ : NormedSpace 𝕜 G\nG' : Type ?u.63314\ni... | [
325,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Analysis/Calculus/Deriv/ZPow.lean | differentiableOn_zpow | [] | [
89,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/CategoryTheory/Sites/Whiskering.lean | CategoryTheory.GrothendieckTopology.Cover.multicospanComp_hom_app_right | [] | [
86,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.lift_min | [] | [
1162,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1161,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Restrict.lean | AffineMap.restrict.surjective | [
{
"state_after": "case mk\nk : Type u_1\nV₁ : Type u_2\nP₁ : Type u_3\nV₂ : Type u_4\nP₂ : Type u_5\ninst✝⁸ : Ring k\ninst✝⁷ : AddCommGroup V₁\ninst✝⁶ : AddCommGroup V₂\ninst✝⁵ : Module k V₁\ninst✝⁴ : Module k V₂\ninst✝³ : AddTorsor V₁ P₁\ninst✝² : AddTorsor V₂ P₂\nφ : P₁ →ᵃ[k] P₂\nE : AffineSubspace k P₁\nF : ... | [
90,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | norm_deriv_eq | [] | [
76,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
9
] |
Mathlib/Order/Chain.lean | chainClosure_succ_total_aux | [
{
"state_after": "case succ\nα : Type u_1\nβ : Type ?u.11219\nr : α → α → Prop\nc c₁ c₂ c₃ s t : Set α\na b x y : α\nh : ∀ ⦃c₃ : Set α⦄, ChainClosure r c₃ → c₃ ⊆ c₂ → c₂ = c₃ ∨ SuccChain r c₃ ⊆ c₂\ns✝ : Set α\na✝ : ChainClosure r s✝\na_ih✝ : SuccChain r c₂ ⊆ s✝ ∨ s✝ ⊆ c₂\n⊢ SuccChain r c₂ ⊆ SuccChain r s✝ ∨ Suc... | [
224,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
9
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.Nonsquare.ns | [] | [
883,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
883,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | IsUnit.integrable_smul_iff | [] | [
1027,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1025,
1
] |
Mathlib/AlgebraicTopology/DoldKan/Projections.lean | AlgebraicTopology.DoldKan.Q_f_idem | [] | [
166,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | hasDerivWithinAt_iff_isLittleO | [] | [
270,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.add_isNormal | [] | [
519,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
518,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.transpose_map | [
{
"state_after": "case a.h\nl : Type ?u.929277\nm : Type u_1\nn : Type u_2\no : Type ?u.929286\nm' : o → Type ?u.929291\nn' : o → Type ?u.929296\nR : Type ?u.929299\nS : Type ?u.929302\nα : Type v\nβ : Type w\nγ : Type ?u.929309\nf : α → β\nM : Matrix m n α\ni✝ : n\nx✝ : m\n⊢ map Mᵀ f i✝ x✝ = (map M f)ᵀ i✝ x✝",... | [
2020,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2018,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.ord_compl_dvd_ord_compl_iff_dvd | [
{
"state_after": "a b : ℕ\nh : ∀ (p : ℕ), a / p ^ ↑(factorization a) p ∣ b / p ^ ↑(factorization b) p\n⊢ a ∣ b",
"state_before": "a b : ℕ\n⊢ (∀ (p : ℕ), a / p ^ ↑(factorization a) p ∣ b / p ^ ↑(factorization b) p) ↔ a ∣ b",
"tactic": "refine' ⟨fun h => _, fun hab p => ord_compl_dvd_ord_compl_of_dvd hab ... | [
643,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
630,
1
] |
Mathlib/Order/Height.lean | Set.chainHeight_insert_of_forall_lt | [
{
"state_after": "α : Type u_1\nβ : Type ?u.37265\ns t : Set α\ninst✝ : Preorder α\na : α\nha : ∀ (b : α), b ∈ s → b < a\n⊢ chainHeight (↑ofDual ⁻¹' insert a s) = chainHeight (↑ofDual ⁻¹' s) + 1",
"state_before": "α : Type u_1\nβ : Type ?u.37265\ns t : Set α\ninst✝ : Preorder α\na : α\nha : ∀ (b : α), b ∈ s... | [
315,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.lintegral_edist_lt_top | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.936048\nδ : Type ?u.936051\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝² : MeasurableSpace δ\ninst✝¹ : NormedAddCommGroup β\ninst✝ : NormedAddCommGroup γ\nf g : α → β\nhf : Integrable f\nhg : Integrable g\n⊢ (HasFiniteIntegral fun a => f a) ∧ HasFinite... | [
642,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
637,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm'_norm | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nE : Type ?u.1595212\nF : Type u_2\nG : Type ?u.1595218\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nf : α → F\n⊢ snorm' (fun a => ‖f a‖) q μ... | [
471,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
471,
1
] |
Mathlib/Order/Heyting/Basic.lean | himp_himp | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.30204\nα : Type u_1\nβ : Type ?u.30210\ninst✝ : GeneralizedHeytingAlgebra α\na✝ b✝ c✝ d✝ a b c d : α\n⊢ d ≤ a ⇨ b ⇨ c ↔ d ≤ a ⊓ b ⇨ c",
"tactic": "simp_rw [le_himp_iff, inf_assoc]"
}
] | [
383,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
382,
1
] |
Mathlib/Data/Set/Image.lean | Set.preimage_subset_image_of_inverse | [] | [
403,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
1
] |
Mathlib/Algebra/Homology/Additive.lean | ChainComplex.single₀MapHomologicalComplex_inv_app_zero | [] | [
386,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
384,
1
] |
Mathlib/Data/List/Basic.lean | List.nthLe_singleton | [] | [
1320,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1320,
1
] |
Mathlib/GroupTheory/GroupAction/Prod.lean | Prod.smul_fst | [] | [
49,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/Topology/ContinuousFunction/Algebra.lean | min_eq_half_add_sub_abs_sub | [
{
"state_after": "case inl\nR : Type u_1\ninst✝ : LinearOrderedField R\nx y : R\nh : x ≤ y\n⊢ x + x = x + y - (y - x)",
"state_before": "R : Type u_1\ninst✝ : LinearOrderedField R\nx y : R\n⊢ min x y = 2⁻¹ * (x + y - abs (x - y))",
"tactic": "cases' le_total x y with h h <;> field_simp [h, abs_of_nonneg... | [
917,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
915,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | measurable_of_isOpen | [
{
"state_after": "α : Type ?u.149199\nβ : Type ?u.149202\nγ : Type u_1\nγ₂ : Type ?u.149208\nδ : Type u_2\nι : Sort y\ns t u : Set α\ninst✝¹² : TopologicalSpace α\ninst✝¹¹ : MeasurableSpace α\ninst✝¹⁰ : OpensMeasurableSpace α\ninst✝⁹ : TopologicalSpace β\ninst✝⁸ : MeasurableSpace β\ninst✝⁷ : OpensMeasurableSpac... | [
341,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Analysis/NormedSpace/FiniteDimension.lean | IsCompact.exists_mem_frontier_infDist_compl_eq_dist | [
{
"state_after": "case inl\nE : Type u_1\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℝ E\ninst✝ : Nontrivial E\nx : E\nK : Set E\nhK : IsCompact K\nhx : x ∈ K\nhx' : x ∈ interior K\n⊢ ∃ y, y ∈ frontier K ∧ Metric.infDist x (Kᶜ) = dist x y\n\ncase inr\nE : Type u_1\ninst✝² : NormedAddCommGroup E\ninst✝¹... | [
653,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
638,
8
] |
Mathlib/FieldTheory/Adjoin.lean | IntermediateField.botEquiv_def | [
{
"state_after": "no goals",
"state_before": "F : Type u_1\ninst✝² : Field F\nE : Type u_2\ninst✝¹ : Field E\ninst✝ : Algebra F E\nx : F\n⊢ ↑(botEquiv F E) (↑(algebraMap F { x // x ∈ ⊥ }) x) = x",
"tactic": "simp"
}
] | [
222,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | inner_re_symm | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.1223229\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx y : E\n⊢ ↑re (inner x y) = ↑re (inner y x... | [
469,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
469,
1
] |
Mathlib/NumberTheory/LucasLehmer.lean | LucasLehmer.X.right_distrib | [
{
"state_after": "no goals",
"state_before": "q : ℕ+\nx y z : X q\n⊢ (x + y) * z = x * z + y * z",
"tactic": "ext <;> dsimp <;> ring"
}
] | [
302,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Order/WellFounded.lean | WellFounded.isAsymm | [] | [
33,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
32,
11
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.erase_neg | [] | [
931,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
929,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.closure_mono | [] | [
585,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
584,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.coe_pi | [] | [
309,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/GroupTheory/Submonoid/Operations.lean | Submonoid.top_prod_top | [] | [
885,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
884,
1
] |
Mathlib/Order/SymmDiff.lean | bihimp_hnot_self | [] | [
383,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
382,
1
] |
Mathlib/Data/Rat/Defs.lean | Rat.ofInt_eq_cast | [] | [
48,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Combinatorics/Derangements/Exponential.lean | numDerangements_tendsto_inv_e | [
{
"state_after": "s : ℕ → ℝ := fun n => ∑ k in Finset.range n, (-1) ^ k / ↑(Nat.factorial k)\n⊢ Tendsto (fun n => ↑(numDerangements n) / ↑(Nat.factorial n)) atTop (𝓝 (Real.exp (-1)))",
"state_before": "⊢ Tendsto (fun n => ↑(numDerangements n) / ↑(Nat.factorial n)) atTop (𝓝 (Real.exp (-1)))",
"tactic":... | [
57,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
29,
1
] |
Mathlib/LinearAlgebra/Dimension.lean | LinearMap.rank_le_range | [] | [
1319,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1318,
1
] |
Std/Data/Int/DivMod.lean | Int.mul_ediv_assoc' | [
{
"state_after": "no goals",
"state_before": "b a c : Int\nh : c ∣ a\n⊢ a * b / c = a / c * b",
"tactic": "rw [Int.mul_comm, Int.mul_ediv_assoc _ h, Int.mul_comm]"
}
] | [
728,
58
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
726,
11
] |
Mathlib/RingTheory/IntegralClosure.lean | normalizeScaleRoots_coeff_mul_leadingCoeff_pow | [
{
"state_after": "R : Type u_1\nA : Type ?u.865622\nB : Type ?u.865625\nS : Type ?u.865628\ninst✝⁵ : CommRing R\ninst✝⁴ : CommRing A\ninst✝³ : CommRing B\ninst✝² : CommRing S\ninst✝¹ : Algebra R A\ninst✝ : Algebra R B\nf : R →+* S\np : R[X]\nx : S\ni : ℕ\nhp : 1 ≤ natDegree p\n⊢ (if coeff p i = 0 then 0\n el... | [
721,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
710,
1
] |
Std/Data/String/Lemmas.lean | String.utf8ByteSize_mk | [] | [
45,
77
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
45,
9
] |
Mathlib/RingTheory/Ideal/Basic.lean | Ideal.mem_sSup_of_mem | [] | [
421,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
419,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.Equiv.realize_sentence | [
{
"state_after": "no goals",
"state_before": "L : Language\nL' : Language\nM : Type w\nN : Type u_1\nP : Type ?u.654592\ninst✝² : Structure L M\ninst✝¹ : Structure L N\ninst✝ : Structure L P\nα : Type u'\nβ : Type v'\nn : ℕ\nT : Theory L\ng : M ≃[L] N\nφ : Sentence L\n⊢ M ⊨ φ ↔ N ⊨ φ",
"tactic": "rw [Se... | [
978,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
977,
1
] |
Mathlib/Topology/ContinuousOn.lean | nhdsWithin_eq_iff_eventuallyEq | [] | [
132,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Subalgebra.smul_mem | [] | [
123,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/LinearAlgebra/Projection.lean | LinearMap.ofIsCompl_eq | [
{
"state_after": "case h\nR : Type u_2\ninst✝⁹ : Ring R\nE : Type u_1\ninst✝⁸ : AddCommGroup E\ninst✝⁷ : Module R E\nF : Type u_3\ninst✝⁶ : AddCommGroup F\ninst✝⁵ : Module R F\nG : Type ?u.241525\ninst✝⁴ : AddCommGroup G\ninst✝³ : Module R G\np q : Submodule R E\nS : Type ?u.242488\ninst✝² : Semiring S\nM : Typ... | [
249,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.uniformInducing_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.60022\nι : Type ?u.60025\ninst✝¹ : PseudoMetricSpace α\nx y z : α\nδ ε ε₁ ε₂ : ℝ\ns : Set α\ninst✝ : PseudoMetricSpace β\nf : α → β\n⊢ (∀ (i' : ℝ), 0 < i' → ∃ i, 0 < i ∧ Prod.map f f ⁻¹' {p | dist p.fst p.snd < i} ⊆ {p | dist ... | [
841,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
836,
8
] |
Mathlib/Order/Basic.lean | max_def_lt | [
{
"state_after": "ι : Type ?u.76638\nα : Type u\nβ : Type v\nγ : Type w\nπ : ι → Type ?u.76649\nr : α → α → Prop\ninst✝ : LinearOrder α\np : α → Prop\nx✝ y✝ x y : α\n⊢ (if ¬y ≤ x then y else x) = if x < y then y else x",
"state_before": "ι : Type ?u.76638\nα : Type u\nβ : Type v\nγ : Type w\nπ : ι → Type ?u... | [
963,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
961,
1
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.minpoly_root | [
{
"state_after": "R : Type u\nS : Type v\nK : Type w\ninst✝¹ : CommRing R\ng : R[X]\ninst✝ : Field K\nf : K[X]\nhf : f ≠ 0\nf'_monic : Monic (f * ↑C (Polynomial.leadingCoeff f)⁻¹)\n⊢ minpoly K (root f) = f * ↑C (Polynomial.leadingCoeff f)⁻¹",
"state_before": "R : Type u\nS : Type v\nK : Type w\ninst✝¹ : Com... | [
564,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
547,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.rescale_zero_apply | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : CommSemiring R\n⊢ ↑(rescale 0) X = ↑(C R) (↑(constantCoeff R) X)",
"tactic": "simp"
}
] | [
1776,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1776,
1
] |
Mathlib/Analysis/SpecificLimits/Basic.lean | Set.Countable.exists_pos_forall_sum_le | [
{
"state_after": "case intro.intro.intro.intro\nα : Type ?u.475376\nβ : Type ?u.475379\nι✝ : Type ?u.475382\nι : Type u_1\ns : Set ι\nhs : Set.Countable s\nε : ℝ\nhε : 0 < ε\nε' : ι → ℝ\nhpos : ∀ (i : ι), 0 < ε' i\nc : ℝ\nhε'c : HasSum (fun i => ε' ↑i) c\nhcε : c ≤ ε\n⊢ ∃ ε', (∀ (i : ι), 0 < ε' i) ∧ ∀ (t : Fins... | [
484,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
477,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.coe_eq_coe | [] | [
40,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
39,
1
] |
Mathlib/Topology/Basic.lean | nhds_def' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\na✝ : α\ns s₁ s₂ t : Set α\np p₁ p₂ : α → Prop\ninst✝ : TopologicalSpace α\na : α\n⊢ 𝓝 a = ⨅ (s : Set α) (_ : IsOpen s) (_ : a ∈ s), 𝓟 s",
"tactic": "simp only [nhds_def, mem_setOf_eq, @and_comm (a ∈ _), iInf_and]"
}
] | [
855,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
854,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.Tendsto.atTop_mul_atTop | [
{
"state_after": "ι : Type ?u.175674\nι' : Type ?u.175677\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.175686\ninst✝ : StrictOrderedSemiring α\nl : Filter β\nf g : β → α\nhf : Tendsto f l atTop\nhg : Tendsto g l atTop\n⊢ g ≤ᶠ[l] fun x => f x * g x",
"state_before": "ι : Type ?u.175674\nι' : Type ?u.175677\nα : ... | [
882,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
878,
1
] |
Mathlib/Order/LocallyFinite.lean | Finset.map_subtype_embedding_Iio | [
{
"state_after": "α : Type u_1\nβ : Type ?u.226217\ninst✝² : Preorder α\np : α → Prop\ninst✝¹ : DecidablePred p\ninst✝ : LocallyFiniteOrderBot α\na : Subtype p\nhp : ∀ ⦃a x : α⦄, x ≤ a → p a → p x\n⊢ map (Embedding.subtype p) (Finset.subtype p (Iio ↑a)) = Iio ↑a",
"state_before": "α : Type u_1\nβ : Type ?u.... | [
1362,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1360,
1
] |
Mathlib/Data/Finset/NAry.lean | Finset.image₂_image_left_comm | [] | [
439,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/Data/Fin/Tuple/Basic.lean | Fin.mem_find_of_unique | [] | [
947,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
945,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.sum_C_mul_X_pow_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u\na b : R\nm n : ℕ\ninst✝ : Semiring R\np✝ q p : R[X]\n⊢ (sum p fun n a => ↑C a * X ^ n) = p",
"tactic": "simp_rw [C_mul_X_pow_eq_monomial, sum_monomial_eq]"
}
] | [
1013,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1012,
1
] |
Mathlib/RingTheory/Valuation/Integers.lean | Valuation.Integers.isUnit_of_one | [
{
"state_after": "no goals",
"state_before": "R : Type u\nΓ₀ : Type v\ninst✝⁵ : CommRing R\ninst✝⁴ : LinearOrderedCommGroupWithZero Γ₀\nv : Valuation R Γ₀\nO : Type w\ninst✝³ : CommRing O\ninst✝² : Algebra O R\ninst✝¹ : CommRing O\ninst✝ : Algebra O R\nhv : Integers v O\nx : O\nhx : IsUnit (↑(algebraMap O R... | [
93,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Data/MvPolynomial/Monad.lean | MvPolynomial.rename_bind₁ | [] | [
255,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Topology/Order/Basic.lean | countable_setOf_isolated_right | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : LinearOrder α\ninst✝¹ : OrderTopology α\ninst✝ : SecondCountableTopology α\n⊢ Set.Countable ({a | IsTop a} ∪ {a | ∃ b, a ⋖ b})",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝... | [
1649,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1646,
1
] |
Mathlib/Data/Int/Interval.lean | Int.card_Ico | [
{
"state_after": "a b : ℤ\n⊢ card (map (Function.Embedding.trans Nat.castEmbedding (addLeftEmbedding a)) (range (toNat (b - a)))) = toNat (b - a)",
"state_before": "a b : ℤ\n⊢ card (Ico a b) = toNat (b - a)",
"tactic": "change (Finset.map _ _).card = _"
},
{
"state_after": "no goals",
"state... | [
115,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.