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/Order/SuccPred/Limit.lean | Order.isPredLimit_iff_lt_pred | [] | [
368,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.coe_sub | [] | [
1387,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1386,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.direction_bot | [
{
"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\nS : AffineSpace V P\np₁ p₂ : P\n⊢ direction ⊥ = ⊥",
"tactic": "rw [direction_eq_vectorSpan, bot_coe, vectorSpan_def, vsub_empty, Submodule.span_empty]"
... | [
830,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
829,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean | CategoryTheory.Limits.BinaryBicone.binary_cofan_inr_toCocone | [] | [
1045,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1044,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.LiftRelRec.lem | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nR : α → β → Prop\nC : Computation α → Computation β → Prop\nH : ∀ {ca : Computation α} {cb : Computation β}, C ca cb → LiftRelAux R C (destruct ca) (destruct cb)\nca : Computation α\na : α\nha : a ∈ ca\n⊢ ∀ (cb : Computation β), C ca cb → LiftRel R ca cb",
... | [
1296,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1285,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.mem_inv_smul_finset_iff | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.832295\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.832304\ninst✝² : DecidableEq β\ninst✝¹ : Group α\ninst✝ : MulAction α β\ns t : Finset β\na : α\nb : β\n⊢ b ∈ a⁻¹ • s ↔ a • b ∈ s",
"tactic": "rw [← smul_mem_smul_finset_iff a, smul_inv_smul]"
}
] | [
1964,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1963,
1
] |
Mathlib/Topology/Separation.lean | SeparatedNhds.disjoint_closure_right | [] | [
147,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Algebra/Ring/Commute.lean | Commute.add_right | [] | [
38,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Data/Vector3.lean | vectorAllP_cons | [] | [
278,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Computability/Partrec.lean | Computable.encode_iff | [] | [
415,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | SubgroupClass.inclusion_self | [
{
"state_after": "case mk\nG : Type u_1\nG' : Type ?u.59883\ninst✝⁶ : Group G\ninst✝⁵ : Group G'\nA : Type ?u.59892\ninst✝⁴ : AddGroup A\nM : Type ?u.59898\nS : Type u_2\ninst✝³ : DivInvMonoid M\ninst✝² : SetLike S M\nhSM : SubgroupClass S M\nH K : S\ninst✝¹ : SetLike S G\ninst✝ : SubgroupClass S G\nval✝ : G\np... | [
320,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
318,
1
] |
Mathlib/Analysis/LocallyConvex/Basic.lean | Balanced.mem_smul_iff | [
{
"state_after": "case inl\n𝕜 : Type u_1\n𝕝 : Type ?u.103382\nE : Type u_2\nι : Sort ?u.103388\nκ : ι → Sort ?u.103393\ninst✝⁶ : NormedField 𝕜\ninst✝⁵ : NormedRing 𝕝\ninst✝⁴ : NormedSpace 𝕜 𝕝\ninst✝³ : AddCommGroup E\ninst✝² : Module 𝕜 E\ninst✝¹ : SMulWithZero 𝕝 E\ninst✝ : IsScalarTower 𝕜 𝕝 E\ns t u v... | [
310,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Computability/Partrec.lean | Nat.rfind_min | [] | [
87,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Algebra/Homology/Exact.lean | CategoryTheory.Functor.exact_of_exact_map | [] | [
367,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.comp_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₂\nx✝ : A₂\n⊢ ↑(AlgHom.comp ↑e ↑(symm e)) x✝ = ↑(AlgHom.id... | [
423,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
421,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/KernelPair.lean | CategoryTheory.IsKernelPair.of_isIso_of_mono | [
{
"state_after": "C : Type u\ninst✝² : Category C\nR X Y Z : C\nf : X ⟶ Y\na b : R ⟶ X\ninst✝¹ : IsIso a\ninst✝ : Mono f\n⊢ IsPullback a a f f",
"state_before": "C : Type u\ninst✝² : Category C\nR X Y Z : C\nf : X ⟶ Y\na b : R ⟶ X\ninst✝¹ : IsIso a\ninst✝ : Mono f\n⊢ IsKernelPair f a a",
"tactic": "chan... | [
220,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/Analysis/Normed/Group/Hom.lean | NormedAddGroupHom.opNorm_nonneg | [] | [
238,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.nat_lt_limit | [] | [
2443,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2441,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.infinitePos_abs_iff_infinite_abs | [] | [
520,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
519,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.isCircuit_copy | [
{
"state_after": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu' : V\np : Walk G u' u'\n⊢ IsCircuit (Walk.copy p (_ : u' = u') (_ : u' = u')) ↔ IsCircuit p",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph ... | [
902,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
899,
1
] |
Mathlib/Data/Pi/Algebra.lean | Subsingleton.pi_mulSingle_eq | [
{
"state_after": "no goals",
"state_before": "I : Type u\nα✝ : Type ?u.35145\nβ : Type ?u.35148\nγ : Type ?u.35151\nf : I → Type v₁\ng : I → Type v₂\nh : I → Type v₃\nx✝ y : (i : I) → f i\ni✝ : I\nα : Type u_1\ninst✝² : DecidableEq I\ninst✝¹ : Subsingleton I\ninst✝ : One α\ni : I\nx : α\nj : I\n⊢ Pi.mulSing... | [
439,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
437,
1
] |
Std/Data/RBMap/WF.lean | Std.RBNode.All.append | [
{
"state_after": "α✝ : Type u_1\nl r : RBNode α✝\np : α✝ → Prop\nhl : All p l\nhr : All p r\n⊢ All p\n (match l, r with\n | nil, x => x\n | x, nil => x\n | node red a x b, node red c y d =>\n match append b c with\n | node red b' z c' => node red (node red a x b') z (node red c' y d)\n ... | [
311,
36
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
303,
11
] |
Mathlib/Algebra/Star/StarAlgHom.lean | StarAlgHom.ext | [] | [
380,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
379,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Combination.lean | Finset.centroid_def | [] | [
846,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
845,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.inf_eq_bot_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.86298\nι : Sort x\nf✝ g✝ : Filter α\ns t : Set α\nf g : Filter α\n⊢ f ⊓ g = ⊥ ↔ ∃ U, U ∈ f ∧ ∃ V, V ∈ g ∧ U ∩ V = ∅",
"tactic": "simp only [← disjoint_iff, Filter.disjoint_iff, Set.disjoint_iff_inter_eq_empty]"... | [
726,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
725,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.nat_cast_eq_zero | [] | [
2321,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2320,
1
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.equiv'_toAlgHom | [] | [
686,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
684,
1
] |
Mathlib/Data/Seq/Seq.lean | Stream'.Seq.mem_cons | [] | [
191,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | TendstoLocallyUniformly.continuous | [] | [
902,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
899,
11
] |
Mathlib/RingTheory/Nilpotent.lean | Commute.isNilpotent_mul_left | [
{
"state_after": "case intro\nR S : Type u\nx y : R\ninst✝ : Semiring R\nh_comm : Commute x y\nn : ℕ\nhn : x ^ n = 0\n⊢ IsNilpotent (x * y)",
"state_before": "R S : Type u\nx y : R\ninst✝ : Semiring R\nh_comm : Commute x y\nh : IsNilpotent x\n⊢ IsNilpotent (x * y)",
"tactic": "obtain ⟨n, hn⟩ := h"
},
... | [
161,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.IsBasis.filter_eq_generate | [
{
"state_after": "α : Type u_1\nβ : Type ?u.9602\nγ : Type ?u.9605\nι : Sort u_2\nι' : Sort ?u.9611\np : ι → Prop\ns : ι → Set α\nh : IsBasis p s\n⊢ IsBasis.filter h = FilterBasis.filter (IsBasis.filterBasis h)",
"state_before": "α : Type u_1\nβ : Type ?u.9602\nγ : Type ?u.9605\nι : Sort u_2\nι' : Sort ?u.9... | [
225,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.Red.length_le | [] | [
401,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean | Real.differentiable_rpow_const | [] | [
359,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
358,
1
] |
Mathlib/Topology/DenseEmbedding.lean | DenseEmbedding.dense_image | [] | [
296,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
295,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean | Real.pi_div_two_eq_arcsin | [] | [
250,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPowerSeries.monomial_zero_one | [] | [
201,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Mathlib/CategoryTheory/Limits/Opposites.lean | CategoryTheory.Limits.hasCoproducts_of_opposite | [] | [
375,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
374,
1
] |
Mathlib/Algebra/GeomSum.lean | geom_sum_mul_neg | [
{
"state_after": "α : Type u\ninst✝ : Ring α\nx : α\nn : ℕ\nthis : -((∑ i in range n, x ^ i) * (x - 1)) = -(x ^ n - 1)\n⊢ (∑ i in range n, x ^ i) * (1 - x) = 1 - x ^ n",
"state_before": "α : Type u\ninst✝ : Ring α\nx : α\nn : ℕ\n⊢ (∑ i in range n, x ^ i) * (1 - x) = 1 - x ^ n",
"tactic": "have := congr_... | [
233,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Order/Hom/Basic.lean | RelEmbedding.orderEmbeddingOfLTEmbedding_apply | [] | [
633,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
630,
1
] |
Mathlib/Order/Bounded.lean | Set.unbounded_gt_iff | [] | [
82,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/CategoryTheory/Generator.lean | CategoryTheory.isCoseparator_iff_faithful_yoneda_obj | [] | [
521,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
518,
1
] |
Mathlib/Data/Polynomial/Eval.lean | Polynomial.eval_eq_sum_range | [
{
"state_after": "case h\nR : Type u\nS : Type v\nT : Type w\nι : Type y\na b : R\nm n : ℕ\ninst✝ : Semiring R\np✝ q r : R[X]\nx✝ : R\np : R[X]\nx : R\n⊢ ∀ (n : ℕ), 0 * x ^ n = 0",
"state_before": "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]\nx✝ : R\np... | [
323,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
321,
1
] |
Std/Data/Array/Lemmas.lean | Array.get?_push_lt | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na : Array α\nx : α\ni : Nat\nh : i < size a\n⊢ (push a x)[i]? = some a[i]",
"tactic": "rw [getElem?_pos, get_push_lt]"
}
] | [
80,
33
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
78,
1
] |
Mathlib/Combinatorics/Colex.lean | Colex.lt_trans | [
{
"state_after": "case intro.intro.intro.intro.intro.intro\nα : Type u_1\ninst✝ : LinearOrder α\na b c : Colex α\nk₁ : α\nk₁z : ∀ {x : α}, k₁ < x → (x ∈ a ↔ x ∈ b)\nnotinA : ¬k₁ ∈ a\ninB : k₁ ∈ b\nk₂ : α\nk₂z : ∀ {x : α}, k₂ < x → (x ∈ b ↔ x ∈ c)\nnotinB : ¬k₂ ∈ b\ninC : k₂ ∈ c\n⊢ a < c",
"state_before": "α... | [
160,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | extChartAt_preimage_inter_eq | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_3\nE : Type u_1\nM : Type u_2\nH : Type u_4\nE' : Type ?u.225289\nM' : Type ?u.225292\nH' : Type ?u.225295\ninst✝¹⁰ : NontriviallyNormedField 𝕜\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : NormedSpace 𝕜 E\ninst✝⁷ : TopologicalSpace H\ninst✝⁶ : Topologi... | [
1236,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1233,
1
] |
Mathlib/RingTheory/WittVector/Basic.lean | WittVector.mapFun.zero | [
{
"state_after": "no goals",
"state_before": "p : ℕ\nR : Type u_2\nS : Type u_1\nT : Type ?u.30320\nhp : Fact (Nat.Prime p)\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : CommRing T\nα : Type ?u.30335\nβ : Type ?u.30338\nf : R →+* S\nx y : 𝕎 R\n⊢ mapFun (↑f) 0 = 0",
"tactic": "map_fun_tac"
}
] | [
109,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Data/Nat/Sqrt.lean | Nat.sqrt_succ_le_succ_sqrt | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ sqrt n * sqrt n + sqrt n ≤ Nat.mul (succ (succ (sqrt n))) (succ (sqrt n))",
"tactic": "refine' add_le_add (Nat.mul_le_mul_right _ _) _ <;> exact Nat.le_add_right _ 2"
}
] | [
171,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Init/Data/Nat/Bitwise.lean | Nat.testBit_lxor' | [] | [
520,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
519,
1
] |
Mathlib/Order/Heyting/Regular.lean | Heyting.IsRegular.disjoint_compl_right_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : HeytingAlgebra α\na b : α\nhb : IsRegular b\n⊢ Disjoint a (bᶜ) ↔ a ≤ b",
"tactic": "rw [← le_compl_iff_disjoint_right, hb.eq]"
}
] | [
86,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
11
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.eval₂_eq_eval_map | [
{
"state_after": "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\nf : R →+* S₁\ng : σ → S₁\np : MvPolynomial σ R\n⊢ eval₂ f g p = ↑(eval₂Hom (RingHom.id S₁) g) (↑(eval₂Hom (Rin... | [
1242,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1230,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Nat.cast_prod | [] | [
2218,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2216,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.LiftRel.trans | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nR : α → α → Prop\nH : Transitive R\ns✝ t u✝ : WSeq α\nh1 : LiftRel R s✝ t\nh2 : LiftRel R t u✝\ns u : WSeq α\nh : (fun s u => ∃ t, LiftRel R s t ∧ LiftRel R t u) s u\n⊢ Computation.LiftRel (LiftRelO R fun s u => ∃ t, LiftRel R s t ∧ LiftRel R t u) (destruct ... | [
599,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
570,
1
] |
Mathlib/Combinatorics/SimpleGraph/Ends/Defs.lean | SimpleGraph.end_hom_mk_of_mk | [
{
"state_after": "V : Type u\nG : SimpleGraph V\nK✝ L✝ L' M : Set V\ns : (j : (Finset V)ᵒᵖ) → (componentComplFunctor G).obj j\nsec : s ∈ SimpleGraph.end G\nK L : (Finset V)ᵒᵖ\nh : L ⟶ K\nv : V\nvnL : ¬v ∈ L.unop\nhs : s L = componentComplMk G vnL\n⊢ (componentComplFunctor G).map h (componentComplMk G vnL) = com... | [
276,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
272,
1
] |
Mathlib/Data/Set/Intervals/Infinite.lean | Set.Ioc_infinite | [] | [
60,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.lt_max'_of_mem_erase_max' | [] | [
1489,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1487,
1
] |
Mathlib/Data/Nat/Parity.lean | Nat.div_two_mul_two_add_one_of_odd | [
{
"state_after": "no goals",
"state_before": "m n : ℕ\nh : Odd n\n⊢ n / 2 * 2 + 1 = n",
"tactic": "rw [← odd_iff.mp h, div_add_mod']"
}
] | [
235,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/Algebra/Hom/Units.lean | IsUnit.of_leftInverse | [
{
"state_after": "no goals",
"state_before": "F : Type u_1\nG : Type u_4\nα : Type ?u.38455\nM : Type u_2\nN : Type u_3\ninst✝³ : Monoid M\ninst✝² : Monoid N\ninst✝¹ : MonoidHomClass F M N\ninst✝ : MonoidHomClass G N M\nf : F\nx : M\ng : G\nhfg : LeftInverse ↑g ↑f\nh : IsUnit (↑f x)\n⊢ IsUnit x",
"tacti... | [
231,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Data/Set/Finite.lean | Set.iInter_iUnion_of_monotone | [] | [
1540,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1537,
1
] |
Mathlib/Analysis/Normed/Group/AddTorsor.lean | nndist_eq_nnnorm_vsub | [] | [
81,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/MeasureTheory/Measure/FiniteMeasure.lean | MeasureTheory.FiniteMeasure.zero_testAgainstNN_apply | [
{
"state_after": "no goals",
"state_before": "Ω : Type u_1\ninst✝⁵ : MeasurableSpace Ω\nR : Type ?u.53064\ninst✝⁴ : SMul R ℝ≥0\ninst✝³ : SMul R ℝ≥0∞\ninst✝² : IsScalarTower R ℝ≥0 ℝ≥0∞\ninst✝¹ : IsScalarTower R ℝ≥0∞ ℝ≥0∞\ninst✝ : TopologicalSpace Ω\nf : Ω →ᵇ ℝ≥0\n⊢ testAgainstNN 0 f = 0",
"tactic": "simp... | [
366,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | HasDerivWithinAt.sinh | [] | [
896,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
894,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iInter_univ | [] | [
702,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
701,
1
] |
Mathlib/Data/List/Cycle.lean | List.nextOr_mem | [
{
"state_after": "α : Type u_1\ninst✝ : DecidableEq α\nxs : List α\nx d : α\n⊢ d ∈ xs → nextOr xs x d ∈ xs",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\nxs : List α\nx d : α\nhd : d ∈ xs\n⊢ nextOr xs x d ∈ xs",
"tactic": "revert hd"
},
{
"state_after": "α : Type u_1\ninst✝ : DecidableE... | [
110,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Analysis/Analytic/Basic.lean | HasFPowerSeriesOnBall.eventually_hasSum_sub | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type u_3\nG : Type ?u.458834\ninst✝⁶ : NontriviallyNormedField 𝕜\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedS... | [
497,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
495,
1
] |
Mathlib/Algebra/BigOperators/Option.lean | Finset.prod_eraseNone | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nM : Type u_2\ninst✝ : CommMonoid M\nf : α → M\ns : Finset (Option α)\n⊢ ∏ x in ↑eraseNone s, f x = ∏ x in s, Option.elim' 1 f x",
"tactic": "classical calc\n (∏ x in eraseNone s, f x) = ∏ x in (eraseNone s).map Embedding.some, Option.elim' 1... | [
42,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/Deprecated/Submonoid.lean | IsSubmonoid.preimage | [
{
"state_after": "no goals",
"state_before": "M : Type u_2\ninst✝² : Monoid M\ns✝ : Set M\nA : Type ?u.24553\ninst✝¹ : AddMonoid A\nt : Set A\nN : Type u_1\ninst✝ : Monoid N\nf : M → N\nhf : IsMonoidHom f\ns : Set N\nhs : IsSubmonoid s\n⊢ f 1 ∈ s",
"tactic": "(rw [IsMonoidHom.map_one hf]; exact hs.one_m... | [
183,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/Data/List/Sort.lean | List.Sorted.rel_of_mem_take_of_mem_drop | [
{
"state_after": "case intro.mk\nα : Type uu\nr : α → α → Prop\na : α\nl✝ l : List α\nh : Sorted r l\nk : ℕ\nx : α\nhx : x ∈ take k l\niy : ℕ\nhiy : iy < length (drop k l)\nhy : get (drop k l) { val := iy, isLt := hiy } ∈ drop k l\n⊢ r x (get (drop k l) { val := iy, isLt := hiy })",
"state_before": "α : Typ... | [
138,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Order/Basic.lean | le_of_forall_le_of_dense | [] | [
1310,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1306,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.withDensity_mul | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.1814114\nγ : Type ?u.1814117\nδ : Type ?u.1814120\nm m0 : MeasurableSpace α\nμ : Measure α\nf g : α → ℝ≥0∞\nhf : Measurable f\nhg : Measurable g\ns : Set α\nhs : MeasurableSet s\n⊢ ↑↑(Measure.withDensity μ (f * g)) s = ↑↑(Measure.withDensity (Measure.withDensi... | [
1898,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1894,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.support_symmDiff_support_subset_support_add | [
{
"state_after": "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\ninst✝ : DecidableEq σ\np q : MvPolynomial σ R\n⊢ support p \\ support q ∪ support q \\ support p ⊆ support (... | [
760,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
754,
1
] |
Mathlib/Algebra/EuclideanDomain/Basic.lean | EuclideanDomain.xgcdAux_fst | [
{
"state_after": "R : Type u\ninst✝¹ : EuclideanDomain R\ninst✝ : DecidableEq R\nx y x✝ s✝ t✝ s'✝ t'✝ : R\n⊢ (xgcdAux 0 s✝ t✝ x✝ s'✝ t'✝).fst = gcd 0 x✝",
"state_before": "R : Type u\ninst✝¹ : EuclideanDomain R\ninst✝ : DecidableEq R\nx y : R\n⊢ ∀ (x s t s' t' : R), (xgcdAux 0 s t x s' t').fst = gcd 0 x",
... | [
203,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.equiv_refl | [] | [
758,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
757,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieModuleHom.coe_sub | [] | [
888,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
887,
1
] |
Mathlib/GroupTheory/Coset.lean | rightCosetEquivalence_rel | [] | [
116,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/CategoryTheory/Sites/CompatibleSheafification.lean | CategoryTheory.GrothendieckTopology.sheafificationWhiskerLeftIso_hom_app | [
{
"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 : β → α... | [
88,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.bsup_eq_of_brange_eq | [] | [
1574,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1572,
1
] |
Mathlib/Topology/PathConnected.lean | Joined.trans | [] | [
789,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
788,
1
] |
Mathlib/Algebra/Order/Group/Abs.lean | abs_sub_le_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedAddCommGroup α\na b c d : α\n⊢ abs (a - b) ≤ c ↔ a - b ≤ c ∧ b - a ≤ c",
"tactic": "rw [abs_le, neg_le_sub_iff_le_add, sub_le_iff_le_add', and_comm, sub_le_iff_le_add']"
}
] | [
285,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/Algebra/MonoidAlgebra/Support.lean | MonoidAlgebra.mem_span_support | [
{
"state_after": "no goals",
"state_before": "k : Type u₁\nG : Type u₂\ninst✝¹ : Semiring k\ninst✝ : MulOneClass G\nf : MonoidAlgebra k G\n⊢ f ∈ Submodule.span k (↑(of k G) '' ↑f.support)",
"tactic": "erw [of, MonoidHom.coe_mk, ← supported_eq_span_single, Finsupp.mem_supported]"
}
] | [
110,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/Algebra/Field/Basic.lean | div_neg_eq_neg_div | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.27142\nβ : Type ?u.27145\nK : Type u_1\ninst✝¹ : DivisionMonoid K\ninst✝ : HasDistribNeg K\na✝ b✝ a b : K\n⊢ b / -a = b * (1 / -a)",
"tactic": "rw [← inv_eq_one_div, division_def]"
},
{
"state_after": "no goals",
"state_before": "α : ... | [
113,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | UniqueFactorizationMonoid.normalizedFactors_prod_eq | [
{
"state_after": "case empty\nα : Type u_1\ninst✝³ : CancelCommMonoidWithZero α\ninst✝² : DecidableEq α\ninst✝¹ : NormalizationMonoid α\ninst✝ : UniqueFactorizationMonoid α\ns : Multiset α\nhs✝ : ∀ (a : α), a ∈ s → Irreducible a\nhs : ∀ (a : α), a ∈ 0 → Irreducible a\n⊢ normalizedFactors (Multiset.prod 0) = Mul... | [
718,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
706,
1
] |
Mathlib/CategoryTheory/Adjunction/Mates.lean | CategoryTheory.transferNatTransSelf_comp | [
{
"state_after": "case w.h\nC : Type u₁\nD : Type u₂\ninst✝¹ : Category C\ninst✝ : Category D\nL₁ L₂ L₃ : C ⥤ D\nR₁ R₂ R₃ : D ⥤ C\nadj₁ : L₁ ⊣ R₁\nadj₂ : L₂ ⊣ R₂\nadj₃ : L₃ ⊣ R₃\nf : L₂ ⟶ L₁\ng : L₃ ⟶ L₂\nx✝ : D\n⊢ (↑(transferNatTransSelf adj₁ adj₂) f ≫ ↑(transferNatTransSelf adj₂ adj₃) g).app x✝ =\n (↑(tran... | [
205,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/GroupTheory/Index.lean | Subgroup.relindex_bot_left_eq_card | [] | [
262,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | normalize_apply | [] | [
136,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | MonoidAlgebra.single_algebraMap_eq_algebraMap_mul_of | [
{
"state_after": "no goals",
"state_before": "k : Type u₁\nG : Type u₂\nR : Type ?u.1010908\nA : Type u_1\ninst✝³ : CommSemiring k\ninst✝² : Semiring A\ninst✝¹ : Algebra k A\ninst✝ : Monoid G\na : G\nb : k\n⊢ single a (↑(algebraMap k A) b) = ↑(algebraMap k (MonoidAlgebra A G)) b * ↑(of A G) a",
"tactic"... | [
834,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
832,
1
] |
Mathlib/CategoryTheory/Preadditive/Mat.lean | CategoryTheory.Mat_.id_def | [] | [
128,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/Topology/Category/Profinite/CofilteredLimit.lean | Profinite.exists_locallyConstant_finite_aux | [
{
"state_after": "case intro\nJ : Type u\ninst✝² : SmallCategory J\ninst✝¹ : IsCofiltered J\nF : J ⥤ Profinite\nC : Cone F\nα : Type u_1\ninst✝ : Finite α\nhC : IsLimit C\nf : LocallyConstant (↑C.pt.toCompHaus.toTop) α\nval✝ : Fintype α\n⊢ ∃ j g,\n LocallyConstant.map (fun a b => if a = b then 0 else 1) f =\... | [
182,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.noZeroSMulDivisors_of_prime_of_degree_ne_zero | [] | [
381,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/Data/Int/Parity.lean | Int.emod_two_ne_one | [
{
"state_after": "no goals",
"state_before": "m n : ℤ\n⊢ ¬n % 2 = 1 ↔ n % 2 = 0",
"tactic": "cases' emod_two_eq_zero_or_one n with h h <;> simp [h]"
}
] | [
30,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
29,
1
] |
Mathlib/CategoryTheory/Limits/Presheaf.lean | CategoryTheory.ColimitAdj.restrictYonedaHomEquiv_natural | [
{
"state_after": "case w.h.h\nC : Type u₁\ninst✝¹ : SmallCategory C\nℰ : Type u₂\ninst✝ : Category ℰ\nA : C ⥤ ℰ\nP : Cᵒᵖ ⥤ Type u₁\nE₁ E₂ : ℰ\ng : E₁ ⟶ E₂\nc : Cocone ((CategoryOfElements.π P).leftOp ⋙ A)\nt : IsColimit c\nk : c.pt ⟶ E₁\nx : Cᵒᵖ\nX : P.obj x\n⊢ (↑(restrictYonedaHomEquiv A P E₂ t) (k ≫ g)).app x... | [
127,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/Analysis/Convex/Basic.lean | convex_Iio | [
{
"state_after": "𝕜 : Type u_1\nE : Type ?u.86645\nF : Type ?u.86648\nβ : Type u_2\ninst✝⁷ : OrderedSemiring 𝕜\ninst✝⁶ : AddCommMonoid E\ninst✝⁵ : AddCommMonoid F\ninst✝⁴ : Module 𝕜 E\ninst✝³ : Module 𝕜 F\ns : Set E\nx✝ : E\ninst✝² : OrderedCancelAddCommMonoid β\ninst✝¹ : Module 𝕜 β\ninst✝ : OrderedSMul 𝕜... | [
287,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
278,
1
] |
Mathlib/Data/List/Sort.lean | List.split_cons_of_eq | [
{
"state_after": "no goals",
"state_before": "α : Type uu\nr : α → α → Prop\ninst✝ : DecidableRel r\na : α\nl l₁ l₂ : List α\nh : split l = (l₁, l₂)\n⊢ split (a :: l) = (a :: l₂, l₁)",
"tactic": "rw [split, h]"
}
] | [
315,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Data/Polynomial/Degree/TrailingDegree.lean | Polynomial.trailingDegree_eq_top | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b : R\nn m : ℕ\ninst✝ : Semiring R\np q r : R[X]\nh : p = 0\n⊢ trailingDegree p = ⊤",
"tactic": "simp [h]"
}
] | [
102,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.one_le_blocksFun | [] | [
198,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/SetTheory/Cardinal/Continuum.lean | Cardinal.aleph0_le_continuum | [] | [
83,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.SimpleFunc.setToSimpleFunc_smul_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nE : Type ?u.241077\nF : Type u_2\nF' : Type u_3\nG : Type ?u.241086\n𝕜 : Type ?u.241089\np : ℝ≥0∞\ninst✝⁶ : NormedAddCommGroup E\ninst✝⁵ : NormedSpace ℝ E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : NormedSpace ℝ F\ninst✝² : NormedAddCommGroup F'\nin... | [
433,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
431,
1
] |
Mathlib/Algebra/MonoidAlgebra/ToDirectSum.lean | AddMonoidAlgebra.toDirectSum_toAddMonoidAlgebra | [] | [
103,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/SetTheory/Ordinal/Exponential.lean | Ordinal.opow_mul_add_lt_opow_succ | [
{
"state_after": "case h.e'_4\nb u v w : Ordinal\nhvb : v < b\nhw : w < b ^ u\n⊢ b ^ succ u = b ^ u * b",
"state_before": "b u v w : Ordinal\nhvb : v < b\nhw : w < b ^ u\n⊢ b ^ u * v + w < b ^ succ u",
"tactic": "convert (opow_mul_add_lt_opow_mul_succ v hw).trans_le (mul_le_mul_left' (succ_le_of_lt hvb)... | [
410,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
406,
1
] |
Mathlib/Logic/Encodable/Basic.lean | ULower.down_up | [] | [
525,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
524,
1
] |
Mathlib/GroupTheory/Torsion.lean | Monoid.IsTorsion.torsion_eq_top | [
{
"state_after": "case h\nG : Type u_1\nH : Type ?u.193982\ninst✝ : CommMonoid G\ntG : IsTorsion G\nx✝ : G\n⊢ x✝ ∈ torsion G ↔ x✝ ∈ ⊤",
"state_before": "G : Type u_1\nH : Type ?u.193982\ninst✝ : CommMonoid G\ntG : IsTorsion G\n⊢ torsion G = ⊤",
"tactic": "ext"
},
{
"state_after": "no goals",
... | [
270,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.