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/Data/List/Perm.lean | List.singleton_perm_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type uu\nβ : Type vv\nl₁ l₂ : List α\na b : α\n⊢ [a] ~ [b] ↔ a = b",
"tactic": "simp"
}
] | [
221,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Algebra/GroupWithZero/Power.lean | Commute.zpow_zpow_self₀ | [] | [
144,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Data/Polynomial/Div.lean | Polynomial.modByMonic_X | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\nA : Type z\na b : R\nn : ℕ\ninst✝ : CommRing R\np✝ q p : R[X]\n⊢ p %ₘ X = ↑C (eval 0 p)",
"tactic": "rw [← modByMonic_X_sub_C_eq_C_eval, C_0, sub_zero]"
}
] | [
458,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
457,
1
] |
Mathlib/Data/Polynomial/AlgebraMap.lean | Polynomial.eval₂_algebraMap_X | [
{
"state_after": "R✝ : Type u\nS : Type v\nT : Type w\nA✝ : Type z\nA' : Type ?u.303170\nB' : Type ?u.303173\na b : R✝\nn : ℕ\ninst✝⁷ : CommSemiring A'\ninst✝⁶ : Semiring B'\ninst✝⁵ : CommSemiring R✝\np✝ q r : R✝[X]\ninst✝⁴ : Semiring A✝\ninst✝³ : Algebra R✝ A✝\nR : Type u_1\nA : Type u_2\ninst✝² : CommSemiring... | [
134,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Topology/DenseEmbedding.lean | DenseEmbedding.prod | [] | [
272,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
11
] |
Mathlib/MeasureTheory/Function/SimpleFuncDense.lean | MeasureTheory.SimpleFunc.tendsto_approxOn | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nι : Type ?u.59478\nE : Type ?u.59481\nF : Type ?u.59484\n𝕜 : Type ?u.59487\ninst✝⁴ : MeasurableSpace α\ninst✝³ : PseudoEMetricSpace α\ninst✝² : OpensMeasurableSpace α\ninst✝¹ : MeasurableSpace β\nf✝ f : β → α\nhf : Measurable f\ns : Set α\ny₀ : α\nh₀ : y₀ ∈ s\ninst... | [
167,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Data/Finsupp/Defs.lean | Finsupp.support_zero | [] | [
181,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.coeFn_sup | [] | [
467,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
466,
1
] |
Mathlib/Topology/Algebra/Algebra.lean | continuous_algebraMap | [] | [
56,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Topology/ContinuousFunction/Basic.lean | ContinuousMap.comp_apply | [] | [
246,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Topology/FiberBundle/IsHomeomorphicTrivialBundle.lean | IsHomeomorphicTrivialFiberBundle.quotientMap_proj | [] | [
65,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
11
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.image_mul_right | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.122781\nα : Type u_1\nβ : Type ?u.122787\nγ : Type ?u.122790\ninst✝ : Group α\ns t : Set α\na b : α\n⊢ (fun x => x * b) '' t = (fun x => x * b⁻¹) ⁻¹' t",
"tactic": "rw [image_eq_preimage_of_inverse] <;> intro c <;> simp"
}
] | [
1206,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1205,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.SimpleFunc.memℒp_zero | [] | [
298,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
297,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.sup_span | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nR₂ : Type ?u.48643\nK : Type ?u.48646\nM : Type u_1\nM₂ : Type ?u.48652\nV : Type ?u.48655\nS : Type ?u.48658\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\nx : M\np p' : Submodule R M\ninst✝² : Semiring R₂\nσ₁₂ : R →+* R₂\nin... | [
254,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/Order/Heyting/Basic.lean | Disjoint.disjoint_sdiff_left | [] | [
518,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
517,
1
] |
Mathlib/CategoryTheory/Sites/CompatibleSheafification.lean | CategoryTheory.GrothendieckTopology.toSheafify_comp_sheafifyCompIso_inv | [
{
"state_after": "C : Type u\ninst✝⁸ : Category C\nJ : GrothendieckTopology C\nD : Type w₁\ninst✝⁷ : Category D\nE : Type w₂\ninst✝⁶ : Category E\nF : D ⥤ E\ninst✝⁵ : ∀ (α β : Type (max v u)) (fst snd : β → α), HasLimitsOfShape (WalkingMulticospan fst snd) D\ninst✝⁴ : ∀ (α β : Type (max v u)) (fst snd : β → α),... | [
143,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/Data/List/BigOperators/Basic.lean | List.headI_add_tail_sum | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.160749\nα : Type ?u.160752\nM : Type ?u.160755\nN : Type ?u.160758\nP : Type ?u.160761\nM₀ : Type ?u.160764\nG : Type ?u.160767\nR : Type ?u.160770\nL : List ℕ\n⊢ headI L + sum (tail L) = sum L",
"tactic": "cases L <;> simp"
}
] | [
603,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
602,
1
] |
Mathlib/Analysis/Normed/Group/InfiniteSum.lean | summable_of_norm_bounded | [
{
"state_after": "ι : Type u_2\nα : Type ?u.14525\nE : Type u_1\nF : Type ?u.14531\ninst✝² : SeminormedAddCommGroup E\ninst✝¹ : SeminormedAddCommGroup F\ninst✝ : CompleteSpace E\nf : ι → E\ng : ι → ℝ\nhg : Summable g\nh : ∀ (i : ι), ‖f i‖ ≤ g i\n⊢ CauchySeq fun s => ∑ b in s, f b",
"state_before": "ι : Type... | [
118,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/CategoryTheory/Preadditive/Basic.lean | CategoryTheory.Preadditive.cokernelCoforkOfCofork_π | [] | [
386,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | IntervalIntegrable.intervalIntegrable_norm_iff | [
{
"state_after": "ι : Type ?u.3012325\n𝕜 : Type ?u.3012328\nE : Type u_1\nF : Type ?u.3012334\nA : Type ?u.3012337\ninst✝ : NormedAddCommGroup E\nf✝ : ℝ → E\na✝ b✝ c d : ℝ\nμ✝ ν : MeasureTheory.Measure ℝ\nf : ℝ → E\nμ : MeasureTheory.Measure ℝ\na b : ℝ\nhf : AEStronglyMeasurable f (Measure.restrict μ (Ι a b))\... | [
184,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/MeasureTheory/Group/FundamentalDomain.lean | MeasureTheory.IsFundamentalDomain.lintegral_eq_tsum_of_ac | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\nH : Type ?u.165138\nα : Type u_2\nβ : Type ?u.165144\nE : Type ?u.165147\ninst✝¹⁰ : Group G\ninst✝⁹ : Group H\ninst✝⁸ : MulAction G α\ninst✝⁷ : MeasurableSpace α\ninst✝⁶ : MulAction H β\ninst✝⁵ : MeasurableSpace β\ninst✝⁴ : NormedAddCommGroup E\ns ... | [
231,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Data/Polynomial/Derivative.lean | Polynomial.derivative_comp_one_sub_X | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\nι : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : CommRing R\np : R[X]\n⊢ ↑derivative (comp p (1 - X)) = -comp (↑derivative p) (1 - X)",
"tactic": "simp [derivative_comp]"
}
] | [
641,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
640,
1
] |
Mathlib/CategoryTheory/Generator.lean | CategoryTheory.isDetecting_unop_iff | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\n𝒢 : Set Cᵒᵖ\n⊢ IsDetecting (Set.unop 𝒢) ↔ IsCodetecting 𝒢",
"tactic": "rw [← isCodetecting_op_iff, Set.unop_op]"
}
] | [
144,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.mapDomain_id | [] | [
469,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
468,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.aleph'_isNormal | [
{
"state_after": "no goals",
"state_before": "o : Ordinal\nl : Ordinal.IsLimit o\na : Ordinal\n⊢ (ord ∘ aleph') o ≤ a ↔ ∀ (b : Ordinal), b < o → (ord ∘ aleph') b ≤ a",
"tactic": "simp [ord_le, aleph'_le_of_limit l]"
}
] | [
336,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/Data/Real/Cardinality.lean | Cardinal.mk_real | [
{
"state_after": "case a\nc : ℝ\nf g : ℕ → Bool\nn : ℕ\n⊢ (#ℝ) ≤ 𝔠\n\ncase a\nc : ℝ\nf g : ℕ → Bool\nn : ℕ\n⊢ 𝔠 ≤ (#ℝ)",
"state_before": "c : ℝ\nf g : ℕ → Bool\nn : ℕ\n⊢ (#ℝ) = 𝔠",
"tactic": "apply le_antisymm"
},
{
"state_after": "case a\nc : ℝ\nf g : ℕ → Bool\nn : ℕ\n⊢ (#CauSeq.Completion.C... | [
213,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Tactic/NormNum/Basic.lean | Mathlib.Meta.NormNum.isRat_neg | [
{
"state_after": "α : Type u_1\ninst✝ : Ring α\nnum✝ : ℤ\ndenom✝ : ℕ\nh : Invertible ↑denom✝\n⊢ ↑(-num✝) * ⅟↑denom✝ = ↑(Int.neg num✝) * ⅟↑denom✝",
"state_before": "α : Type u_1\ninst✝ : Ring α\nnum✝ : ℤ\ndenom✝ : ℕ\nh : Invertible ↑denom✝\n⊢ -(↑num✝ * ⅟↑denom✝) = ↑(Int.neg num✝) * ⅟↑denom✝",
"tactic": "... | [
259,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_mem_multiset | [
{
"state_after": "case a\nι : Type ?u.612021\nβ : Type u\nα : Type v\nγ : Type w\ns s₁ s₂ : Finset α\na : α\nf✝ g✝ : α → β\ninst✝¹ : CommMonoid β\ninst✝ : DecidableEq α\nm : Multiset α\nf : { x // x ∈ m } → β\ng : α → β\nhfg : ∀ (x : { x // x ∈ m }), f x = g ↑x\nx✝³ x✝² : { x // x ∈ m }\nx✝¹ : x✝³ ∈ univ\nx✝ : ... | [
1350,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1344,
1
] |
Mathlib/Data/Set/Pointwise/SMul.lean | Set.smul_set_mono | [] | [
358,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
1
] |
Mathlib/Data/Set/Equitable.lean | Set.equitableOn_singleton | [] | [
81,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Algebra/Lie/Nilpotent.lean | Function.Injective.lieAlgebra_isNilpotent | [
{
"state_after": "case mk.intro\nR : Type u\nL : Type v\nL' : Type w\ninst✝⁴ : CommRing R\ninst✝³ : LieRing L\ninst✝² : LieAlgebra R L\ninst✝¹ : LieRing L'\ninst✝ : LieAlgebra R L'\nh₁ : LieAlgebra.IsNilpotent R L'\nf : L →ₗ⁅R⁆ L'\nh₂ : Injective ↑f\nk : ℕ\nhk : lowerCentralSeries R L' L' k = ⊥\n⊢ ∃ k, lowerCen... | [
627,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
621,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Raised.dist_le | [
{
"state_after": "case intro\nα : Type ?u.244025\nn m : ℕ\nH : Raised n m\nH1 : n ≤ m\nH2 : m ≤ n + 1\n⊢ Nat.dist n m ≤ 1",
"state_before": "α : Type ?u.244025\nn m : ℕ\nH : Raised n m\n⊢ Nat.dist n m ≤ 1",
"tactic": "cases' raised_iff.1 H with H1 H2"
},
{
"state_after": "no goals",
"state_b... | [
793,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
792,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | inv_le_one | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.52528\nα : Type u_1\nβ : Type ?u.52534\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n : ℤ\nha : 1 ≤ a\n⊢ a⁻¹ ≤ 1",
"tactic": "rwa [inv_le (zero_lt_one.trans_le ha) zero_lt_one, inv_one]"
}
] | [
308,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/Analysis/Analytic/Basic.lean | hasFPowerSeriesOnBall_const | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type u_3\nG : Type ?u.487033\ninst✝⁶ : NontriviallyNormedField 𝕜\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace 𝕜 G\nf g : E → F\np pf pg ... | [
521,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
518,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.ofReal_inv | [
{
"state_after": "no goals",
"state_before": "r : ℝ\n⊢ (↑r⁻¹).re = (↑r)⁻¹.re ∧ (↑r⁻¹).im = (↑r)⁻¹.im",
"tactic": "simp [ofReal']"
}
] | [
748,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
747,
1
] |
Std/Data/Int/DivMod.lean | Int.eq_zero_of_ediv_eq_zero | [
{
"state_after": "no goals",
"state_before": "d n : Int\nh : d ∣ n\nH : n / d = 0\n⊢ n = 0",
"tactic": "rw [← Int.mul_ediv_cancel' h, H, Int.mul_zero]"
}
] | [
791,
49
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
790,
11
] |
Mathlib/Analysis/Calculus/IteratedDeriv.lean | iteratedDerivWithin_succ | [
{
"state_after": "𝕜 : Type u_1\ninst✝⁴ : NontriviallyNormedField 𝕜\nF : Type u_2\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nE : Type ?u.68719\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nn : ℕ\nf : 𝕜 → F\ns : Set 𝕜\nx✝ x : 𝕜\nhxs : UniqueDiffWithinAt 𝕜 s x\n⊢ ↑(↑(ContinuousLin... | [
196,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Algebra/Module/LinearMap.lean | IsLinearMap.map_sub | [] | [
728,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
727,
1
] |
Mathlib/Analysis/Convex/Exposed.lean | IsExposed.subset | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\ninst✝⁴ : TopologicalSpace 𝕜\ninst✝³ : OrderedRing 𝕜\ninst✝² : AddCommMonoid E\ninst✝¹ : TopologicalSpace E\ninst✝ : Module 𝕜 E\nl : E →L[𝕜] 𝕜\nA B C : Set E\nX : Finset E\nx✝ : E\nhAB : IsExposed 𝕜 A B\nx : E\nhx : x ∈ B\n⊢ x ∈ A",
"state_before": "𝕜 : T... | [
93,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
11
] |
Mathlib/MeasureTheory/Integral/CircleIntegral.lean | ContinuousOn.circleIntegrable | [] | [
298,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Algebra/DirectSum/Ring.lean | DirectSum.mul_eq_dfinsupp_sum | [
{
"state_after": "ι : Type u_2\ninst✝⁴ : DecidableEq ι\nA : ι → Type u_1\ninst✝³ : (i : ι) → AddCommMonoid (A i)\ninst✝² : AddMonoid ι\ninst✝¹ : GSemiring A\ninst✝ : (i : ι) → (x : A i) → Decidable (x ≠ 0)\na a' : ⨁ (i : ι), A i\n⊢ ↑(↑(mulHom fun i => A i) a) a' =\n Dfinsupp.sum a fun i ai => Dfinsupp.sum a'... | [
326,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/Algebra/Module/Basic.lean | two_smul' | [] | [
110,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
15
] |
Mathlib/Data/Nat/Log.lean | Nat.le_pow_iff_clog_le | [
{
"state_after": "case h\nb : ℕ\nhb : 1 < b\ny✝ x : ℕ\nih : ∀ (m : ℕ), m < x → ∀ {y : ℕ}, m ≤ b ^ y ↔ clog b m ≤ y\ny : ℕ\n⊢ x ≤ b ^ y ↔ clog b x ≤ y",
"state_before": "b : ℕ\nhb : 1 < b\nx y : ℕ\n⊢ x ≤ b ^ y ↔ clog b x ≤ y",
"tactic": "induction' x using Nat.strong_induction_on with x ih generalizing y... | [
310,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Data/MvPolynomial/Monad.lean | MvPolynomial.join₁_rename | [] | [
214,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.mul_union | [] | [
446,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.wSameSide_iff_exists_left | [
{
"state_after": "case mp\nR : Type u_1\nV : Type u_2\nV' : Type ?u.233854\nP : Type u_3\nP' : Type ?u.233860\ninst✝⁶ : LinearOrderedField R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\ns : AffineSubspace R P\nx y... | [
454,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
438,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.prime_def_lt' | [
{
"state_after": "no goals",
"state_before": "p : ℕ\np2 : 2 ≤ p\nm : ℕ\nh : m < p → m ∣ p → m = 1\nm2 : 2 ≤ m\nl : m < p\nd : m ∣ p\n⊢ 1 < 2",
"tactic": "decide"
},
{
"state_after": "case zero\np : ℕ\np2 : 2 ≤ p\nh : 2 ≤ zero → zero < p → ¬zero ∣ p\nl : zero < p\nd : zero ∣ p\n⊢ zero = 1\n\ncase... | [
132,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/MeasureTheory/Covering/BesicovitchVectorSpace.lean | Besicovitch.one_lt_goodτ | [
{
"state_after": "E : Type u_1\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℝ E\ninst✝ : FiniteDimensional ℝ E\n⊢ 1 <\n 1 +\n Exists.choose\n (_ :\n ∃ δ,\n 0 < δ ∧\n δ < 1 ∧\n ∀ (s : Finset E),\n (∀ (c : E), c ∈ ... | [
303,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | zpow_pow_orderOf | [
{
"state_after": "case pos\nG : Type u\nA : Type v\nx y : G\na b : A\nn m : ℕ\ninst✝¹ : Group G\ninst✝ : AddGroup A\ni : ℤ\nh : IsOfFinOrder x\n⊢ (x ^ i) ^ orderOf x = 1\n\ncase neg\nG : Type u\nA : Type v\nx y : G\na b : A\nn m : ℕ\ninst✝¹ : Group G\ninst✝ : AddGroup A\ni : ℤ\nh : ¬IsOfFinOrder x\n⊢ (x ^ i) ^ ... | [
587,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
584,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.eventually_ne_atTop | [] | [
198,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Topology/MetricSpace/CantorScheme.lean | CantorScheme.ClosureAntitone.antitone | [] | [
92,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
11
] |
Mathlib/Data/TwoPointing.lean | TwoPointing.to_nontrivial | [] | [
75,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/GroupTheory/SemidirectProduct.lean | SemidirectProduct.left_inl | [] | [
121,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Analysis/SpecialFunctions/Bernstein.lean | bernstein_apply | [
{
"state_after": "n ν : ℕ\nx : ↑I\n⊢ Polynomial.eval (↑x) (↑(Nat.choose n ν) * Polynomial.X ^ ν * (1 - Polynomial.X) ^ (n - ν)) =\n ↑(Nat.choose n ν) * ↑x ^ ν * (1 - ↑x) ^ (n - ν)",
"state_before": "n ν : ℕ\nx : ↑I\n⊢ ↑(bernstein n ν) x = ↑(Nat.choose n ν) * ↑x ^ ν * (1 - ↑x) ^ (n - ν)",
"tactic": "d... | [
67,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.zpow_eq_one_iff_dvd | [
{
"state_after": "case pos\nM : Type ?u.2651834\nN : Type ?u.2651837\nG : Type u_1\nR : Type ?u.2651843\nS : Type ?u.2651846\nF : Type ?u.2651849\ninst✝² : CommMonoid M\ninst✝¹ : CommMonoid N\ninst✝ : DivisionCommMonoid G\nk l✝ : ℕ\nζ : G\nh : IsPrimitiveRoot ζ k\nl : ℤ\nh0 : 0 ≤ l\n⊢ ζ ^ l = 1 ↔ ↑k ∣ l\n\ncase... | [
568,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
561,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.le_ofWithBot | [
{
"state_after": "ι : Type u_1\nI J✝ J₁ J₂ : Box ι\nπ π₁ π₂ : Prepartition I\nx : ι → ℝ\nπi πi₁ πi₂ : (J : Box ι) → Prepartition J\nboxes : Finset (WithBot (Box ι))\nle_of_mem : ∀ (J : WithBot (Box ι)), J ∈ boxes → J ≤ ↑I\npairwise_disjoint : Set.Pairwise (↑boxes) Disjoint\nH : ∀ (J : Box ι), J ∈ π → ∃ J', J' ∈... | [
451,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
444,
1
] |
Mathlib/Topology/Order/LowerTopology.lean | LowerTopology.isLowerSet_of_isOpen | [
{
"state_after": "α : Type u_1\nβ : Type ?u.5122\ninst✝² : Preorder α\ninst✝¹ : TopologicalSpace α\ninst✝ : LowerTopology α\ns : Set α\nh : GenerateOpen {t | ∃ a, Ici aᶜ = t} s\n⊢ IsLowerSet s",
"state_before": "α : Type u_1\nβ : Type ?u.5122\ninst✝² : Preorder α\ninst✝¹ : TopologicalSpace α\ninst✝ : LowerT... | [
194,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.power_bit1 | [
{
"state_after": "no goals",
"state_before": "α β : Type u\na b : Cardinal\n⊢ a ^ bit1 b = a ^ b * a ^ b * a",
"tactic": "rw [bit1, ← power_bit0, power_add, power_one]"
}
] | [
553,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
552,
1
] |
Mathlib/FieldTheory/Minpoly/Field.lean | minpoly.aeval_of_isScalarTower | [] | [
109,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Algebra/Hom/GroupAction.lean | DistribMulActionHom.coe_fn_coe | [] | [
272,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Std/Data/String/Lemmas.lean | String.prev_zero | [] | [
294,
61
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
294,
9
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.diff | [
{
"state_after": "case intro\nα : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns t : Set α\na✝ : Fintype ↑s\n⊢ Set.Finite (s \\ t)",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns : Set α\nhs : Set.Finite s\nt : Set α\n⊢ Set.Finite (s \\ t)",
"tactic": "cases hs"
},
{
"state_a... | [
768,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
766,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.mod_eq_zero_of_dvd | [
{
"state_after": "case intro\nα : Type ?u.263181\nβ : Type ?u.263184\nγ : Type ?u.263187\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nb c : Ordinal\n⊢ b * c % b = 0",
"state_before": "α : Type ?u.263181\nβ : Type ?u.263184\nγ : Type ?u.263187\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\n... | [
1073,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1069,
1
] |
Mathlib/Data/MvPolynomial/Derivation.lean | MvPolynomial.derivation_eqOn_supported | [] | [
86,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.factorization_zero | [
{
"state_after": "no goals",
"state_before": "⊢ factorization 0 = 0",
"tactic": "simp [factorization]"
}
] | [
123,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/GroupTheory/Submonoid/Basic.lean | Submonoid.copy_eq | [] | [
223,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/Topology/Order/Basic.lean | exists_seq_strictMono_tendsto | [
{
"state_after": "case intro\nα : Type u\nβ : Type v\nγ : Type w\ninst✝⁸ : TopologicalSpace α\ninst✝⁷ : TopologicalSpace β\ninst✝⁶ : LinearOrder α\ninst✝⁵ : LinearOrder β\ninst✝⁴ : OrderTopology α\ninst✝³ : OrderTopology β\ninst✝² : DenselyOrdered α\ninst✝¹ : NoMinOrder α\ninst✝ : FirstCountableTopology α\nx y ... | [
2142,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2138,
1
] |
Mathlib/Analysis/Calculus/Taylor.lean | monomial_has_deriv_aux | [
{
"state_after": "𝕜 : Type ?u.246282\nE : Type ?u.246285\nF : Type ?u.246288\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℝ E\nt x : ℝ\nn : ℕ\n⊢ HasDerivAt (fun y => (-y + x) ^ (n + 1)) (-(↑n + 1) * (-t + x) ^ n) t",
"state_before": "𝕜 : Type ?u.246282\nE : Type ?u.246285\nF : Type ?u.246288\ninst✝... | [
148,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Algebra/TrivSqZeroExt.lean | TrivSqZeroExt.snd_smul | [] | [
294,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/Combinatorics/SimpleGraph/Ends/Defs.lean | SimpleGraph.ComponentCompl.hom_infinite | [] | [
229,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/Data/Polynomial/Eval.lean | Polynomial.eval₂_eq_sum_range' | [
{
"state_after": "R : Type u\nS : Type v\nT : Type w\nι : Type y\na b : R\nm n✝ : ℕ\ninst✝¹ : Semiring R\np✝ q r : R[X]\ninst✝ : Semiring S\nf✝ : R →+* S\nx✝ : S\nf : R →+* S\np : R[X]\nn : ℕ\nhn : natDegree p < n\nx : S\n⊢ ∀ (n : ℕ), ↑f 0 * x ^ n = 0",
"state_before": "R : Type u\nS : Type v\nT : Type w\nι... | [
250,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.X_pow_eq_monomial | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np q : MvPolynomial σ R\n⊢ X n ^ e = ↑(monomial (Finsupp.single n e)) 1",
"tactic": "simp [X, monomi... | [
323,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
322,
1
] |
Mathlib/Order/Lattice.lean | inf_idem | [] | [
489,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
488,
1
] |
Mathlib/Topology/SubsetProperties.lean | Bornology.inCompact.isBounded_iff | [
{
"state_after": "α : Type u\nβ : Type v\nι : Type ?u.53826\nπ : ι → Type ?u.53831\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpace β\ns t : Set α\n⊢ sᶜ ∈ cocompact α ↔ ∃ t, IsCompact t ∧ s ⊆ t",
"state_before": "α : Type u\nβ : Type v\nι : Type ?u.53826\nπ : ι → Type ?u.53831\ninst✝¹ : TopologicalSpa... | [
634,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
631,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.boundary_last | [
{
"state_after": "no goals",
"state_before": "n : ℕ\nc : Composition n\n⊢ ↑(boundary c) (Fin.last (length c)) = Fin.last n",
"tactic": "simp [boundary, Fin.ext_iff]"
}
] | [
271,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.inv_epsilon | [] | [
177,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/Data/Nat/Sqrt.lean | Nat.eq_sqrt | [] | [
123,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Analysis/Convex/Combination.lean | affineCombination_mem_convexHull | [
{
"state_after": "R : Type u_2\nE : Type u_3\nF : Type ?u.131675\nι : Type u_1\nι' : Type ?u.131681\nα : Type ?u.131684\ninst✝⁷ : LinearOrderedField R\ninst✝⁶ : AddCommGroup E\ninst✝⁵ : AddCommGroup F\ninst✝⁴ : LinearOrderedAddCommGroup α\ninst✝³ : Module R E\ninst✝² : Module R F\ninst✝¹ : Module R α\ninst✝ : O... | [
249,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Analysis/ODE/Gronwall.lean | dist_le_of_approx_trajectories_ODE | [] | [
192,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Algebra/Support.lean | Function.support_int_cast | [] | [
339,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Algebra/Order/Hom/Monoid.lean | OrderMonoidWithZeroHom.toMonoidWithZeroHom_eq_coe | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.148141\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.148150\nδ : Type ?u.148153\nhα : Preorder α\nhα' : MulZeroOneClass α\nhβ : Preorder β\nhβ' : MulZeroOneClass β\nf : α →*₀o β\n⊢ f.toMonoidWithZeroHom = ↑f",
"tactic": "rfl"
}
] | [
763,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
762,
1
] |
Mathlib/Algebra/Hom/GroupAction.lean | DistribMulActionHom.map_zero | [] | [
305,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
304,
11
] |
Mathlib/Data/List/Basic.lean | List.indexOf_inj | [
{
"state_after": "ι : Type ?u.94752\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\ninst✝ : DecidableEq α\nl : List α\nx y : α\nhx : x ∈ l\nhy : y ∈ l\nh : indexOf x l = indexOf y l\nx_eq_y :\n get l { val := indexOf x l, isLt := (_ : indexOf x l < length l) } =\n get l { val := indexOf y l... | [
1435,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1428,
1
] |
Mathlib/Data/List/Forall2.lean | List.forall₂_iff_nthLe | [] | [
186,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean | Balanced.subset_balancedCore_of_subset | [] | [
104,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Data/Polynomial/Derivative.lean | Polynomial.derivative_sum | [] | [
175,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.Theory.IsMaximal.mem_of_models | [
{
"state_after": "L : Language\nT : Theory L\nα : Type w\nn : ℕ\nh : IsMaximal T\nφ : Sentence L\nhφ : T ⊨ᵇ φ\ncon : Formula.not φ ∈ T\n⊢ False",
"state_before": "L : Language\nT : Theory L\nα : Type w\nn : ℕ\nh : IsMaximal T\nφ : Sentence L\nhφ : T ⊨ᵇ φ\n⊢ φ ∈ T",
"tactic": "refine' (h.mem_or_not_mem φ... | [
407,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
404,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.star_moveRight | [] | [
1854,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1853,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.inf_sup_distrib_right | [] | [
553,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
551,
1
] |
Mathlib/Data/Prod/Basic.lean | Prod.id_prod | [] | [
134,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
Std/Data/Nat/Gcd.lean | Nat.div_gcd_pos_of_pos_left | [] | [
98,
97
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
97,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.eq_iff_eq | [] | [
800,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
799,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | DifferentiableAt.hasFDerivAt | [
{
"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.256180\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nG' : Type ?u.256275\... | [
521,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
516,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.natAdd_castAdd | [
{
"state_after": "case h\nn✝ m✝ p m n : ℕ\ni : Fin n\n⊢ ↑(↑(natAdd m) (↑(castAdd p) i)) = ↑(↑(cast (_ : m + n + p = m + (n + p))) (↑(castAdd p) (↑(natAdd m) i)))",
"state_before": "n✝ m✝ p m n : ℕ\ni : Fin n\n⊢ ↑(natAdd m) (↑(castAdd p) i) = ↑(cast (_ : m + n + p = m + (n + p))) (↑(castAdd p) (↑(natAdd m) i... | [
1443,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1440,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | inner_self_nonpos | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.1688070\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx : E\n⊢ ↑re (inner x x) ≤ 0 ↔ x = 0",
... | [
623,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
622,
1
] |
Mathlib/Logic/Basic.lean | dite_ne_right_iff | [
{
"state_after": "no goals",
"state_before": "α : Sort u_1\nβ : Sort ?u.35831\nσ : α → Sort ?u.35827\nf : α → β\nP Q : Prop\ninst✝¹ : Decidable P\ninst✝ : Decidable Q\na b c : α\nA : P → α\nB : ¬P → α\n⊢ (dite P A fun x => b) ≠ b ↔ ∃ h, A h ≠ b",
"tactic": "simp only [Ne.def, dite_eq_right_iff, not_fora... | [
1165,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1164,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | isOfFinOrder_inv_iff | [] | [
552,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
551,
1
] |
Mathlib/Algebra/Group/Ext.lean | RightCancelMonoid.toMonoid_injective | [
{
"state_after": "case mk.mk.mk.mk\nM : Type u\ntoOne✝¹ : One M\nnpow✝¹ : ℕ → M → M\nnpow_zero✝¹ : ∀ (x : M), npow✝¹ 0 x = 1\ntoSemigroup✝¹ : Semigroup M\nmul_right_cancel✝¹ : ∀ (a b c : M), a * b = c * b → a = c\none_mul✝¹ : ∀ (a : M), 1 * a = a\nmul_one✝¹ : ∀ (a : M), a * 1 = a\nnpow_succ✝¹ : ∀ (n : ℕ) (x : M... | [
80,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/NumberTheory/LucasLehmer.lean | LucasLehmer.X.ofNat_snd | [] | [
285,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
9
] |
Mathlib/Algebra/Polynomial/BigOperators.lean | Polynomial.natDegree_list_sum_le | [
{
"state_after": "no goals",
"state_before": "R : Type u\nι : Type w\ns : Finset ι\nS : Type u_1\ninst✝ : Semiring S\nl : List S[X]\n⊢ natDegree 0 ≤ 0",
"tactic": "simp"
}
] | [
52,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.