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/GroupTheory/Subgroup/Basic.lean | Subgroup.center_le_centralizer | [] | [
2306,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2305,
1
] |
Mathlib/Data/TypeVec.lean | TypeVec.lastFun_comp | [] | [
293,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Topology/Compactification/OnePoint.lean | OnePoint.comap_coe_nhds | [] | [
301,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Combinatorics/Catalan.lean | catalan_one | [
{
"state_after": "no goals",
"state_before": "⊢ catalan 1 = 1",
"tactic": "simp [catalan_succ]"
}
] | [
82,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/RingTheory/Polynomial/Basic.lean | Polynomial.sup_ker_aeval_eq_ker_aeval_mul_of_coprime | [
{
"state_after": "R : Type u\nS : Type ?u.741072\nσ : Type v\nM : Type w\ninst✝³ : CommRing R\ninst✝² : CommRing S\ninst✝¹ : AddCommGroup M\ninst✝ : Module R M\nf : M →ₗ[R] M\np q : R[X]\nhpq : IsCoprime p q\n⊢ LinearMap.ker (↑(aeval f) (p * q)) ≤ LinearMap.ker (↑(aeval f) p) ⊔ LinearMap.ker (↑(aeval f) q)",
... | [
1054,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1031,
1
] |
Mathlib/Algebra/Homology/ImageToKernel.lean | factorThruImageSubobject_comp_imageToKernel | [
{
"state_after": "case h\nι : Type ?u.7186\nV : Type u\ninst✝³ : Category V\ninst✝² : HasZeroMorphisms V\nA B C : V\nf : A ⟶ B\ninst✝¹ : HasImage f\ng : B ⟶ C\ninst✝ : HasKernel g\nw : f ≫ g = 0\n⊢ (factorThruImageSubobject f ≫ imageToKernel f g w) ≫ Subobject.arrow (kernelSubobject g) =\n factorThruKernelSu... | [
75,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Order/Basic.lean | LE.le.not_gt_iff_eq | [] | [
272,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.map_one | [] | [
770,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
769,
1
] |
Mathlib/Analysis/Calculus/TangentCone.lean | uniqueDiffWithinAt_univ | [
{
"state_after": "𝕜 : Type u_1\ninst✝⁶ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nF : Type ?u.108058\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nG : Type ?u.108148\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nx y : E\ns t : S... | [
270,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.restrict_empty | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.808539\nδ : Type ?u.808542\ninst✝¹ : MeasurableSpace α\nK : Type ?u.808548\ninst✝ : Zero β\nf : α →ₛ β\n⊢ restrict f ∅ = 0",
"tactic": "simp [restrict]"
}
] | [
763,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
763,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.map_id | [
{
"state_after": "no goals",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nf : G →g G'\nf' : G' →g G''\nu v u' v' : V\np✝ p : Walk G u v\n⊢ Walk.map Hom.id p = p",
"tactic": "induction p with\n| nil => rfl\n| cons _ p' ih => simp [... | [
1476,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1473,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.symm_symm | [
{
"state_after": "case h\nR : Type u\nA₁ : Type v\nA₂ : Type w\nA₃ : Type u₁\ninst✝⁶ : CommSemiring R\ninst✝⁵ : Semiring A₁\ninst✝⁴ : Semiring A₂\ninst✝³ : Semiring A₃\ninst✝² : Algebra R A₁\ninst✝¹ : Algebra R A₂\ninst✝ : Algebra R A₃\ne✝ e : A₁ ≃ₐ[R] A₂\na✝ : A₁\n⊢ ↑(symm (symm e)) a✝ = ↑e a✝",
"state_bef... | [
350,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/Combinatorics/Additive/Energy.lean | Finset.multiplicativeEnergy_univ_left | [
{
"state_after": "α : Type u_1\ninst✝² : DecidableEq α\ninst✝¹ : CommGroup α\ninst✝ : Fintype α\ns t : Finset α\n⊢ card (filter (fun x => x.fst.fst * x.snd.fst = x.fst.snd * x.snd.snd) (univ ×ˢ t ×ˢ t)) = card (univ ×ˢ t ×ˢ t)",
"state_before": "α : Type u_1\ninst✝² : DecidableEq α\ninst✝¹ : CommGroup α\nin... | [
162,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Algebra/Hom/NonUnitalAlg.lean | NonUnitalAlgHom.coe_to_distribMulActionHom | [] | [
199,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/Algebra/DirectSum/Module.lean | DirectSum.ext_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝⁴ : Semiring R\nι : Type v\ndec_ι : DecidableEq ι\nM : ι → Type w\ninst✝³ : (i : ι) → AddCommMonoid (M i)\ninst✝² : (i : ι) → Module R (M i)\nN : Type u₁\ninst✝¹ : AddCommMonoid N\ninst✝ : Module R N\nφ : (i : ι) → M i →ₗ[R] N\nψ ψ' : (⨁ (i : ι)... | [
215,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Data/Set/Basic.lean | Set.inter_eq_compl_compl_union_compl | [] | [
1713,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1712,
1
] |
Mathlib/CategoryTheory/Limits/Preserves/Shapes/Biproducts.lean | CategoryTheory.Functor.biprodComparison_snd | [] | [
336,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
335,
1
] |
Mathlib/Data/Sign.lean | SignType.le_neg_one_iff | [] | [
192,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/Topology/Constructions.lean | isOpenMap_sigma | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.531581\nδ : Type ?u.531584\nε : Type ?u.531587\nζ : Type ?u.531590\nι : Type u_1\nκ : Type ?u.531596\nσ : ι → Type u_2\nτ : κ → Type ?u.531606\ninst✝² : (i : ι) → TopologicalSpace (σ i)\ninst✝¹ : (k : κ) → TopologicalSpace (τ ... | [
1549,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1548,
1
] |
Mathlib/Order/Filter/Archimedean.lean | Int.comap_cast_atBot | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.3522\nR : Type u_1\ninst✝¹ : StrictOrderedRing R\ninst✝ : Archimedean R\nr : R\nn : ℕ\nhn : -r ≤ ↑n\n⊢ ↑(-↑n) ≤ r",
"tactic": "simpa [neg_le] using hn"
}
] | [
56,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/Computability/NFA.lean | NFA.eval_singleton | [] | [
100,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/GroupTheory/Complement.lean | Subgroup.isComplement'_top_left | [] | [
200,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/LinearAlgebra/Matrix/IsDiag.lean | Matrix.IsDiag.conjTranspose | [] | [
130,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Algebra/Squarefree.lean | IsRadical.squarefree | [
{
"state_after": "case intro\nR : Type u_1\ninst✝ : CancelCommMonoidWithZero R\nz w : R\nh0 : z * z * w ≠ 0\nh : IsRadical (z * z * w)\n⊢ IsUnit z",
"state_before": "R : Type u_1\ninst✝ : CancelCommMonoidWithZero R\nx : R\nh0 : x ≠ 0\nh : IsRadical x\n⊢ Squarefree x",
"tactic": "rintro z ⟨w, rfl⟩"
},
... | [
195,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.prod.map_comp_id | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\nX✝ Y✝ X Y Z W : C\nf : X ⟶ Y\ng : Y ⟶ Z\ninst✝² : HasBinaryProduct X W\ninst✝¹ : HasBinaryProduct Z W\ninst✝ : HasBinaryProduct Y W\n⊢ map (f ≫ g) (𝟙 W) = map f (𝟙 W) ≫ map g (𝟙 W)",
"tactic": "simp"
}
] | [
769,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
767,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.submatrix_diagonal_equiv | [] | [
2484,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2482,
1
] |
Mathlib/NumberTheory/Divisors.lean | Nat.perfect_iff_sum_properDivisors | [] | [
299,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithTop.coe_le_one | [] | [
71,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.vector_ofFn | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.368006\nγ : Type ?u.368009\nσ : Type u_2\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nn : ℕ\nf : Fin n → α → σ\nhf : ∀ (i : Fin n), Primrec (f i)\n⊢ Primrec fun a => Vector.toList (Vect... | [
1325,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1323,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.IsFundamentalSequence.trans | [
{
"state_after": "α : Type ?u.70093\nr : α → α → Prop\na✝ o✝ : Ordinal\nf✝ : (b : Ordinal) → b < o✝ → Ordinal\na o o' : Ordinal\nf : (b : Ordinal) → b < o → Ordinal\nhf : IsFundamentalSequence a o f\ng : (b : Ordinal) → b < o' → Ordinal\nhg : IsFundamentalSequence o o' g\ni : Ordinal\nhi : i < o'\n⊢ g i hi < bl... | [
610,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
601,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.mem_seq_iff | [] | [
1957,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1955,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Cardinal.isStrongLimit_beth | [
{
"state_after": "case inl\nα : Type ?u.114391\nr : α → α → Prop\nH : IsSuccLimit 0\n⊢ IsStrongLimit (beth 0)\n\ncase inr\nα : Type ?u.114391\nr : α → α → Prop\no : Ordinal\nH : IsSuccLimit o\nh : o ≠ 0\n⊢ IsStrongLimit (beth o)",
"state_before": "α : Type ?u.114391\nr : α → α → Prop\no : Ordinal\nH : IsSuc... | [
894,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
885,
1
] |
Mathlib/GroupTheory/Exponent.lean | Monoid.pow_eq_mod_exponent | [
{
"state_after": "no goals",
"state_before": "G : Type u\ninst✝ : Monoid G\nn : ℕ\ng : G\n⊢ g ^ n = g ^ (n % exponent G + exponent G * (n / exponent G))",
"tactic": "rw [Nat.mod_add_div]"
},
{
"state_after": "no goals",
"state_before": "G : Type u\ninst✝ : Monoid G\nn : ℕ\ng : G\n⊢ g ^ (n % ... | [
115,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.toNat_rightInverse | [] | [
1725,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1724,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_filter_mul_prod_filter_not | [
{
"state_after": "ι : Type ?u.288824\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g : α → β\ninst✝² : CommMonoid β\ns : Finset α\np : α → Prop\ninst✝¹ : DecidablePred p\ninst✝ : (x : α) → Decidable ¬p x\nf : α → β\nthis : DecidableEq α\n⊢ (∏ x in filter p s, f x) * ∏ x in filter (fun x =>... | [
422,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.EventuallyLE.antisymm | [] | [
1679,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1677,
1
] |
Mathlib/FieldTheory/PerfectClosure.lean | rightInverse_pthRoot_frobenius | [] | [
90,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/CategoryTheory/Adhesive.lean | CategoryTheory.IsPushout.IsVanKampen.mono_of_mono_right | [
{
"state_after": "no goals",
"state_before": "J : Type v'\ninst✝² : Category J\nC : Type u\ninst✝¹ : Category C\nW X Y Z : C\nf : W ⟶ X\ng : W ⟶ Y\nh : X ⟶ Z\ni : Y ⟶ Z\ninst✝ : Mono g\nH : IsPushout f g h i\nH' : IsVanKampen H\n⊢ f ≫ 𝟙 X = 𝟙 W ≫ f",
"tactic": "simp"
},
{
"state_after": "no go... | [
221,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
216,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.Nonempty.vsub | [] | [
1492,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1491,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.BicartesianSq.flip | [] | [
921,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
920,
1
] |
Mathlib/Data/Rat/NNRat.lean | NNRat.sub_def | [] | [
323,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
322,
1
] |
Mathlib/MeasureTheory/Decomposition/SignedHahn.lean | MeasureTheory.SignedMeasure.exists_subset_restrict_nonpos | [
{
"state_after": "α : Type u_1\nβ : Type ?u.54598\ninst✝³ : MeasurableSpace α\nM : Type ?u.54604\ninst✝² : AddCommMonoid M\ninst✝¹ : TopologicalSpace M\ninst✝ : OrderedAddCommMonoid M\ns : SignedMeasure α\ni j : Set α\nhi : ↑s i < 0\nhi₁ : MeasurableSet i\n⊢ ∃ j, MeasurableSet j ∧ j ⊆ i ∧ restrict s j ≤ restric... | [
332,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/Data/Nat/PartENat.lean | PartENat.dom_some | [] | [
92,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/RingTheory/Algebraic.lean | Transcendental.pow | [] | [
181,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.image_mul_right' | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.125686\nα : Type u_1\nβ : Type ?u.125692\nγ : Type ?u.125695\ninst✝ : Group α\ns t : Set α\na b : α\n⊢ (fun x => x * b⁻¹) '' t = (fun x => x * b) ⁻¹' t",
"tactic": "simp"
}
] | [
1216,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1216,
1
] |
Mathlib/Init/Data/Quot.lean | Quot.exact | [] | [
40,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
38,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.measure_union_null_iff | [] | [
306,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/Algebra/AddTorsor.lean | vadd_right_injective | [] | [
114,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Topology/Separation.lean | normalSpaceOfT3SecondCountable | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝² : TopologicalSpace α\ninst✝¹ : SecondCountableTopology α\ninst✝ : T3Space α\nkey :\n ∀ {s t : Set α},\n IsClosed t →\n Disjoint s t →\n ∃ U,\n (s ⊆ ⋃ (u : ↑(countableBasis α)) (_ : u ∈ U), ↑u) ∧\n (∀ (u : ↑(countableBasis α)), ... | [
1806,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1766,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Midpoint.lean | midpoint_eq_midpoint_iff_vsub_eq_vsub | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nV : Type u_3\nV' : Type ?u.99989\nP : Type u_1\nP' : Type ?u.99995\ninst✝⁷ : Ring R\ninst✝⁶ : Invertible 2\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P... | [
185,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/CategoryTheory/Monoidal/OfHasFiniteProducts.lean | CategoryTheory.monoidalOfHasFiniteProducts.rightUnitor_inv | [] | [
119,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.symm_swap | [] | [
1583,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1582,
1
] |
Mathlib/Order/Antichain.lean | IsAntichain.mono | [] | [
54,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.encode | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.18969\nσ : Type ?u.18972\ninst✝² : Primcodable α\ninst✝¹ : Primcodable β\ninst✝ : Primcodable σ\nn : ℕ\n⊢ encode (decode n) = encode (Option.map encode (decode n))",
"tactic": "cases @decode α _ n <;> rfl"
}
] | [
223,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
11
] |
Mathlib/Analysis/Calculus/FDerivAnalytic.lean | AnalyticOn.contDiffOn | [
{
"state_after": "𝕜 : Type u_2\ninst✝⁵ : NontriviallyNormedField 𝕜\nE : Type u_3\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : NormedSpace 𝕜 E\nF : Type u_1\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedSpace 𝕜 F\np : FormalMultilinearSeries 𝕜 E F\nr : ℝ≥0∞\nf : E → F\nx : E\ns : Set E\ninst✝ : CompleteSpace F... | [
161,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Algebra/Hom/Group.lean | MonoidHom.map_one | [] | [
906,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
905,
11
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.normSq_nat_cast | [
{
"state_after": "no goals",
"state_before": "S : Type ?u.633387\nT : Type ?u.633390\nR : Type u_1\ninst✝ : CommRing R\nr x y z : R\na b c : ℍ[R]\nn : ℕ\n⊢ ↑normSq ↑n = ↑n ^ 2",
"tactic": "rw [← coe_nat_cast, normSq_coe]"
}
] | [
1216,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1215,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.bounded_empty | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.484689\nι : Type ?u.484692\ninst✝ : PseudoMetricSpace α\nx : α\ns t : Set α\nr : ℝ\n⊢ ∀ (x : α), x ∈ ∅ → ∀ (y : α), y ∈ ∅ → dist x y ≤ 0",
"tactic": "simp"
}
] | [
2303,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2303,
9
] |
Mathlib/Algebra/Order/Field/Power.lean | zpow_strictAnti | [] | [
77,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.monomial_zero_eq_C_apply | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Semiring R\na : R\n⊢ ↑(monomial R 0) a = ↑(C R) a",
"tactic": "simp"
}
] | [
1409,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1409,
1
] |
Mathlib/Data/Int/ModEq.lean | Int.add_modEq_right | [
{
"state_after": "no goals",
"state_before": "m n a b c d : ℤ\n⊢ n ∣ a + n - a",
"tactic": "simp"
}
] | [
267,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.pair_mk_mk | [] | [
277,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
1
] |
Mathlib/Data/Finmap.lean | Finmap.induction_on₂ | [] | [
152,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | TendstoUniformly.tendsto_at | [] | [
186,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.subtypeDomain_eq_zero_iff' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.486127\nγ : Type ?u.486130\nι : Type ?u.486133\nM : Type u_2\nM' : Type ?u.486139\nN : Type ?u.486142\nP : Type ?u.486145\nG : Type ?u.486148\nH : Type ?u.486151\nR : Type ?u.486154\nS : Type ?u.486157\ninst✝ : Zero M\np : α → Prop\nf :... | [
1048,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1046,
1
] |
Mathlib/Topology/Bases.lean | TopologicalSpace.secondCountableTopology_induced | [
{
"state_after": "case intro.intro\nα : Type u\nt✝ : TopologicalSpace α\nβ : Type u_1\nt : TopologicalSpace β\ninst✝ : SecondCountableTopology β\nf : α → β\nb : Set (Set β)\nhb : Set.Countable b\neq : t = generateFrom b\n⊢ SecondCountableTopology α",
"state_before": "α : Type u\nt✝ : TopologicalSpace α\nβ :... | [
676,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
671,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | vectorSpan_pair | [
{
"state_after": "no goals",
"state_before": "k : Type u_2\nV : Type u_1\nP : Type u_3\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\nι : Type ?u.358935\np₁ p₂ : P\n⊢ vectorSpan k {p₁, p₂} = Submodule.span k {p₁ -ᵥ p₂}",
"tactic": "simp_rw [vectorSpan_eq_span_vs... | [
1246,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1244,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.map_subtype_le | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nR₁ : Type ?u.1536535\nR₂ : Type ?u.1536538\nR₃ : Type ?u.1536541\nR₄ : Type ?u.1536544\nS : Type ?u.1536547\nK : Type ?u.1536550\nK₂ : Type ?u.1536553\nM : Type u_2\nM' : Type ?u.1536559\nM₁ : Type ?u.1536562\nM₂ : Type ?u.1536565\nM₃ : Type ?u.153... | [
1626,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1625,
1
] |
Mathlib/Computability/Halting.lean | ComputablePred.computable_iff_re_compl_re | [
{
"state_after": "case intro.intro\nα : Type u_1\nσ : Type ?u.307161\ninst✝² : Primcodable α\ninst✝¹ : Primcodable σ\np : α → Prop\ninst✝ : DecidablePred p\nx✝ : RePred p ∧ RePred fun a => ¬p a\nh₁ : RePred p\nh₂ : RePred fun a => ¬p a\nk : α →. Bool\npk : Partrec k\nhk :\n ∀ (a : α) (x : Bool),\n x ∈ k a ↔... | [
260,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/RingTheory/DedekindDomain/Basic.lean | Ring.DimensionLEOne.isIntegralClosure | [] | [
68,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.coe_int_cast | [] | [
1021,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1021,
1
] |
Mathlib/Data/List/Infix.lean | List.map_reverse_inits | [
{
"state_after": "α : Type u_1\nβ : Type ?u.47694\nl✝ l₁ l₂ l₃ : List α\na b : α\nm n : ℕ\nl : List α\n⊢ map reverse (reverse (map reverse (tails (reverse l)))) = reverse (tails (reverse l))",
"state_before": "α : Type u_1\nβ : Type ?u.47694\nl✝ l₁ l₂ l₃ : List α\na b : α\nm n : ℕ\nl : List α\n⊢ map reverse... | [
417,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.add_def | [] | [
430,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
429,
1
] |
Mathlib/Algebra/Order/Interval.lean | NonemptyInterval.fst_inv | [] | [
489,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
488,
1
] |
Mathlib/Analysis/Analytic/Basic.lean | HasFPowerSeriesAt.isBigO_sub_partialSum_pow | [
{
"state_after": "case intro\n𝕜 : Type u_1\nE : Type u_2\nF : Type u_3\nG : Type ?u.718032\ninst✝⁶ : NontriviallyNormedField 𝕜\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace 𝕜 G\nf g : E →... | [
708,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
698,
1
] |
Mathlib/Analysis/Convex/Join.lean | convexJoin_subset_convexHull | [] | [
128,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Analysis/Complex/ReImTopology.lean | Complex.closure_preimage_im | [] | [
85,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/Topology/UniformSpace/Equicontinuity.lean | UniformEquicontinuous.comp | [] | [
209,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
Mathlib/RingTheory/FiniteType.lean | modulePolynomialOfEndo_smul_def | [
{
"state_after": "R : Type ?u.726463\ninst✝² : CommRing R\nM : Type ?u.726469\ninst✝¹ : AddCommGroup M\ninst✝ : Module R M\nf : M →ₗ[R] M\nn : R[X]\na : M\nthis : Module R[X] M := modulePolynomialOfEndo f\n⊢ HSMul R[X] M ((fun x => M) a)",
"state_before": "R : Type ?u.726463\ninst✝² : CommRing R\nM : Type ?... | [
645,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
642,
1
] |
Mathlib/NumberTheory/Liouville/LiouvilleWith.lean | LiouvilleWith.add_int_iff | [
{
"state_after": "no goals",
"state_before": "p q x y : ℝ\nr : ℚ\nm : ℤ\nn : ℕ\n⊢ LiouvilleWith p (x + ↑m) ↔ LiouvilleWith p x",
"tactic": "rw [← Rat.cast_coe_int m, add_rat_iff]"
}
] | [
216,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Data/Polynomial/Monic.lean | Polynomial.Monic.of_mul_monic_left | [
{
"state_after": "R : Type u\nS : Type v\na b : R\nm n : ℕ\nι : Type y\ninst✝ : Semiring R\np q r : R[X]\nhp : Monic p\nhpq : ¬Monic q\n⊢ ¬Monic (p * q)",
"state_before": "R : Type u\nS : Type v\na b : R\nm n : ℕ\nι : Type y\ninst✝ : Semiring R\np q r : R[X]\nhp : Monic p\nhpq : Monic (p * q)\n⊢ Monic q",
... | [
143,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Data/MvPolynomial/Supported.lean | MvPolynomial.exists_restrict_to_vars | [
{
"state_after": "σ : Type u_2\nτ : Type ?u.131145\nR✝ : Type u\nS : Type v\nr : R✝\ne : ℕ\nn m : σ\ninst✝¹ : CommSemiring R✝\np q : MvPolynomial σ R✝\ns t : Set σ\nR : Type u_1\ninst✝ : CommRing R\nF : MvPolynomial σ ℤ\nhF : ∃ x, ↑(rename Subtype.val) x = F\n⊢ ∃ f, ∀ (x : σ → R), f (x ∘ Subtype.val) = ↑(aeval ... | [
144,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Std/Data/List/Lemmas.lean | List.nil_diff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\nl : List α\n⊢ List.diff [] l = []",
"tactic": "induction l <;> simp [*, erase_of_not_mem]"
}
] | [
1504,
45
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1503,
9
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Raised.add_right | [
{
"state_after": "α : Type ?u.244728\nk n m : ℕ\nH : Raised n m\n⊢ Raised (k + n) (k + m)",
"state_before": "α : Type ?u.244728\nk n m : ℕ\nH : Raised n m\n⊢ Raised (n + k) (m + k)",
"tactic": "rw [add_comm, add_comm m]"
},
{
"state_after": "no goals",
"state_before": "α : Type ?u.244728\nk ... | [
807,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
806,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | vadd_mem_spanPoints_of_mem_spanPoints_of_mem_vectorSpan | [
{
"state_after": "case intro.intro.intro.intro\nk : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\ns : Set P\np : P\nv : V\nhv : v ∈ vectorSpan k s\np2 : P\nhp2 : p2 ∈ s\nv2 : V\nhv2 : v2 ∈ vectorSpan k s\nhv2p : p = v2 +ᵥ p2\n⊢ v +ᵥ... | [
136,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Topology/MetricSpace/Gluing.lean | Metric.inductiveLimitDist_eq_dist | [
{
"state_after": "case mk\nX : ℕ → Type u\ninst✝ : (n : ℕ) → MetricSpace (X n)\nf : (n : ℕ) → X n → X (n + 1)\nI : ∀ (n : ℕ), Isometry (f n)\ny : (n : ℕ) × X n\nhy : y.fst ≤ 0\ni : ℕ\nx : X i\nhx : { fst := i, snd := x }.fst ≤ 0\n⊢ inductiveLimitDist f { fst := i, snd := x } y =\n dist (leRecOn hx (fun {k} =... | [
579,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
561,
1
] |
Mathlib/Algebra/FreeMonoid/Basic.lean | FreeMonoid.toList_ofList | [] | [
63,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.cycleFactorsFinset_eq_finset | [
{
"state_after": "case intro.intro\nι : Type ?u.2683291\nα : Type u_1\nβ : Type ?u.2683297\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf σ : Perm α\nl : List (Perm α)\nhl : List.Nodup l\n⊢ cycleFactorsFinset σ = List.toFinset l ↔\n (∀ (f : Perm α), f ∈ List.toFinset l → IsCycle f) ∧\n ∃ h,\n nonc... | [
1387,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1381,
1
] |
Mathlib/Topology/Instances/Matrix.lean | Continuous.matrix_map | [] | [
86,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Type.lean | Equiv.Perm.subgroup_eq_top_of_swap_mem | [
{
"state_after": "α : Type u_1\ninst✝¹ : Fintype α\ninst✝ : DecidableEq α\nH : Subgroup (Perm α)\nd : DecidablePred fun x => x ∈ H\nτ : Perm α\nh0 : Nat.Prime (Fintype.card α)\nh1 : Fintype.card α ∣ Fintype.card { x // x ∈ H }\nh2 : τ ∈ H\nh3 : IsSwap τ\nthis : Fact (Nat.Prime (Fintype.card α))\n⊢ H = ⊤",
"... | [
511,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
500,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | algebraMap.coe_sum | [] | [
202,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Mathlib/Topology/Order/Basic.lean | IsLUB.nhdsWithin_neBot | [] | [
1994,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1992,
1
] |
Mathlib/Order/Bounds/Basic.lean | IsLUB.inter_Ici_of_mem | [] | [
475,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
471,
1
] |
Mathlib/Data/Real/Pointwise.lean | Real.sSup_smul_of_nonpos | [
{
"state_after": "case inl\nι : Sort ?u.10683\nα : Type u_1\ninst✝² : LinearOrderedField α\ninst✝¹ : Module α ℝ\ninst✝ : OrderedSMul α ℝ\na : α\nha : a ≤ 0\n⊢ sSup (a • ∅) = a • sInf ∅\n\ncase inr\nι : Sort ?u.10683\nα : Type u_1\ninst✝² : LinearOrderedField α\ninst✝¹ : Module α ℝ\ninst✝ : OrderedSMul α ℝ\na : ... | [
102,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Data/Polynomial/Degree/TrailingDegree.lean | Polynomial.coeff_natTrailingDegree_eq_zero_of_trailingDegree_lt | [] | [
509,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
507,
1
] |
src/lean/Init/Data/List/Basic.lean | List.reverseAux_eq_append | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nas bs : List α\n⊢ reverseAux as bs = reverseAux as nil ++ bs",
"tactic": "induction as generalizing bs with\n| nil => simp [reverseAux]\n| cons a as ih =>\n simp [reverseAux]\n rw [ih (a :: bs), ih [a], append_assoc]\n ... | [
169,
8
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
163,
1
] |
Mathlib/Algebra/Divisibility/Basic.lean | dvd_mul_of_dvd_left | [] | [
85,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/CategoryTheory/Subobject/Lattice.lean | CategoryTheory.Subobject.inf_le_right | [] | [
392,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.measure_iUnion_le | [] | [
237,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
236,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.pUnit | [] | [
81,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.