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/Topology/Sober.lean | IsGenericPoint.specializes_iff_mem | [] | [
63,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.total_total | [
{
"state_after": "α✝ : Type ?u.399000\nM : Type u_4\nN : Type ?u.399006\nP : Type ?u.399009\nR : Type u_3\nS : Type ?u.399015\ninst✝¹² : Semiring R\ninst✝¹¹ : Semiring S\ninst✝¹⁰ : AddCommMonoid M\ninst✝⁹ : Module R M\ninst✝⁸ : AddCommMonoid N\ninst✝⁷ : Module R N\ninst✝⁶ : AddCommMonoid P\ninst✝⁵ : Module R P\... | [
713,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
705,
1
] |
Mathlib/CategoryTheory/Abelian/RightDerived.lean | CategoryTheory.NatTrans.rightDerived_comp | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝⁷ : Category C\nD : Type u_2\ninst✝⁶ : Category D\ninst✝⁵ : Abelian C\ninst✝⁴ : HasInjectiveResolutions C\ninst✝³ : Abelian D\nF G H : C ⥤ D\ninst✝² : Functor.Additive F\ninst✝¹ : Functor.Additive G\ninst✝ : Functor.Additive H\nα : F ⟶ G\nβ : G ... | [
149,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.measure_inter_add_diff | [] | [
137,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Topology/Algebra/Algebra.lean | Subalgebra.topologicalClosure_coe | [] | [
109,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Algebra/Group/Semiconj.lean | SemiconjBy.units_of_val | [] | [
159,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Algebra/Tropical/Basic.lean | Tropical.add_eq_left | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝ : LinearOrder R\nx y : Tropical R\nh : x ≤ y\n⊢ untrop (x + y) = untrop x",
"tactic": "simpa using h"
}
] | [
330,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
329,
1
] |
Mathlib/Analysis/Normed/Group/Quotient.lean | norm_mk_zero | [
{
"state_after": "M : Type u_1\nN : Type ?u.359964\ninst✝¹ : SeminormedAddCommGroup M\ninst✝ : SeminormedAddCommGroup N\nS : AddSubgroup M\n⊢ 0 ∈ closure ↑S",
"state_before": "M : Type u_1\nN : Type ?u.359964\ninst✝¹ : SeminormedAddCommGroup M\ninst✝ : SeminormedAddCommGroup N\nS : AddSubgroup M\n⊢ ‖0‖ = 0"... | [
223,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Data/Int/Cast/Lemmas.lean | Int.cast_nonneg | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.10833\nι : Type ?u.10836\nα : Type u_1\nβ : Type ?u.10842\ninst✝¹ : OrderedRing α\ninst✝ : Nontrivial α\nn : ℕ\n⊢ 0 ≤ ↑↑n ↔ 0 ≤ ↑n",
"tactic": "simp"
},
{
"state_after": "F : Type ?u.10833\nι : Type ?u.10836\nα : Type u_1\nβ : Type ?u.108... | [
127,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean | ContinuousAt.const_cpow | [] | [
144,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
8
] |
Mathlib/Topology/ContinuousOn.lean | nhdsWithin_pi_eq_bot | [
{
"state_after": "no goals",
"state_before": "α✝ : Type ?u.126862\nβ : Type ?u.126865\nγ : Type ?u.126868\nδ : Type ?u.126871\ninst✝¹ : TopologicalSpace α✝\nι : Type u_1\nα : ι → Type u_2\ninst✝ : (i : ι) → TopologicalSpace (α i)\nI : Set ι\ns : (i : ι) → Set (α i)\nx : (i : ι) → α i\n⊢ 𝓝[Set.pi I s] x = ⊥... | [
340,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
src/lean/Init/Control/Lawful.lean | ReaderT.run_monadMap | [] | [
199,
79
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
198,
9
] |
Mathlib/Order/ConditionallyCompleteLattice/Finset.lean | Finset.sup'_id_eq_csSup | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.13624\nγ : Type ?u.13627\ninst✝ : ConditionallyCompleteLattice α\ns : Finset α\nH : Finset.Nonempty s\n⊢ sup' s H id = sSup ↑s",
"tactic": "rw [sup'_eq_csSup_image s H, Set.image_id]"
}
] | [
108,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.add_eq_zero_iff | [
{
"state_after": "α✝ : Type ?u.79054\nβ✝ : Type ?u.79057\nγ : Type ?u.79060\nr✝ : α✝ → α✝ → Prop\ns✝ : β✝ → β✝ → Prop\nt : γ → γ → Prop\na b : Ordinal\nα : Type u_1\nr : α → α → Prop\nx✝¹ : IsWellOrder α r\nβ : Type u_1\ns : β → β → Prop\nx✝ : IsWellOrder β s\n⊢ IsEmpty (α ⊕ β) ↔ IsEmpty α ∧ IsEmpty β",
"st... | [
152,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.findGreatest_mono | [] | [
669,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
667,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.coeff_X_zero | [] | [
696,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
695,
1
] |
Mathlib/Data/Polynomial/Splits.lean | Polynomial.splits_prod | [
{
"state_after": "F : Type u\nK : Type v\nL : Type w\ninst✝² : CommRing K\ninst✝¹ : Field L\ninst✝ : Field F\ni : K →+* L\nι : Type u\ns : ι → K[X]\nt✝ : Finset ι\na : ι\nt : Finset ι\nhat : ¬a ∈ t\nih : (∀ (j : ι), j ∈ t → Splits i (s j)) → Splits i (∏ x in t, s x)\nht : ∀ (j : ι), j ∈ insert a t → Splits i (s... | [
158,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/GroupTheory/Submonoid/Membership.lean | Submonoid.powers_subset | [] | [
451,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
449,
1
] |
Std/Data/Fin/Lemmas.lean | USize.mod_toNat | [] | [
31,
17
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
30,
9
] |
Mathlib/Algebra/Star/Unitary.lean | unitary.coe_star | [] | [
83,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Data/Nat/Pow.lean | Nat.lt_of_pow_dvd_right | [
{
"state_after": "p i n : ℕ\nhn : n ≠ 0\nhp : 2 ≤ p\nh : p ^ i ∣ n\n⊢ p ^ i < p ^ n",
"state_before": "p i n : ℕ\nhn : n ≠ 0\nhp : 2 ≤ p\nh : p ^ i ∣ n\n⊢ i < n",
"tactic": "rw [← pow_lt_iff_lt_right hp]"
},
{
"state_after": "no goals",
"state_before": "p i n : ℕ\nhn : n ≠ 0\nhp : 2 ≤ p\nh :... | [
245,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.union_null | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.22430\nR : Type ?u.22433\nR' : Type ?u.22436\nms : Set (OuterMeasure α)\nm✝ m : OuterMeasure α\ns₁ s₂ : Set α\nh₁ : ↑m s₁ = 0\nh₂ : ↑m s₂ = 0\n⊢ ↑m (s₁ ∪ s₂) = 0",
"tactic": "simpa [h₁, h₂] using m.union s₁ s₂"
}
] | [
236,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.tendsto_atBot_principal | [] | [
1270,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1268,
1
] |
Mathlib/Algebra/Homology/Exact.lean | CategoryTheory.exact_comp_mono | [
{
"state_after": "V : Type u\ninst✝⁴ : Category V\ninst✝³ : HasImages V\nA B C D : V\nf : A ⟶ B\ng : B ⟶ C\nh : C ⟶ D\ninst✝² : HasZeroMorphisms V\ninst✝¹ : HasEqualizers V\nhfg : Exact f g\ninst✝ : Mono h\n⊢ Epi (imageToKernel f (g ≫ h) (_ : f ≫ g ≫ h = 0))",
"state_before": "V : Type u\ninst✝⁴ : Category ... | [
208,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.coe_int_mem | [] | [
329,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
11
] |
Mathlib/GroupTheory/GroupAction/Units.lean | Units.smul_def | [] | [
39,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
38,
1
] |
Mathlib/Data/Set/Function.lean | Set.BijOn.inter | [] | [
945,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
942,
1
] |
Mathlib/Order/Filter/Prod.lean | Filter.prod_map_map_eq | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.27268\nβ : Type ?u.27271\nγ : Type ?u.27274\nδ : Type ?u.27277\nι : Sort ?u.27280\ns✝ : Set α\nt : Set β\nf : Filter α\ng : Filter β\nα₁ : Type u\nα₂ : Type v\nβ₁ : Type w\nβ₂ : Type x\nf₁ : Filter α₁\nf₂ : Filter α₂\nm₁ : α₁ → β₁\nm₂ : α₂ → β₂\ns : ... | [
346,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Algebra/Homology/Homotopy.lean | Homotopy.comp_nullHomotopicMap' | [
{
"state_after": "case h\nι : Type u_1\nV : Type u\ninst✝¹ : Category V\ninst✝ : Preadditive V\nc : ComplexShape ι\nC D E : HomologicalComplex V c\nf✝ g : C ⟶ D\nh k : D ⟶ E\ni : ι\nf : C ⟶ D\nhom : (i j : ι) → ComplexShape.Rel c j i → (X D i ⟶ X E j)\nn : ι\n⊢ Hom.f (f ≫ nullHomotopicMap' hom) n = Hom.f (nullH... | [
310,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiffOn.sum | [] | [
1363,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1360,
1
] |
Mathlib/Data/List/Intervals.lean | List.Ico.inter_consecutive | [
{
"state_after": "n m l : ℕ\n⊢ ∀ (a : ℕ), ¬a ∈ Ico n m ∩ Ico m l",
"state_before": "n m l : ℕ\n⊢ Ico n m ∩ Ico m l = []",
"tactic": "apply eq_nil_iff_forall_not_mem.2"
},
{
"state_after": "n m l a : ℕ\n⊢ ¬a ∈ Ico n m ∩ Ico m l",
"state_before": "n m l : ℕ\n⊢ ∀ (a : ℕ), ¬a ∈ Ico n m ∩ Ico m l... | [
113,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean | Real.continuousAt_arctan | [] | [
214,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | csInf_image2_eq_csSup_csInf | [] | [
1425,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1422,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Ordered.lean | map_le_lineMap_iff_slope_le_slope_right | [
{
"state_after": "k : Type u_1\nE : Type u_2\nPE : Type ?u.171730\ninst✝³ : LinearOrderedField k\ninst✝² : OrderedAddCommGroup E\ninst✝¹ : Module k E\ninst✝ : OrderedSMul k E\nf : k → E\na b r : k\nh : 0 < (1 - r) * (b - a)\n⊢ f (↑(lineMap b a) (1 - r)) ≤ ↑(lineMap (f b) (f a)) (1 - r) ↔ slope f a b ≤ slope f (... | [
251,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/RingTheory/MvPolynomial/Symmetric.lean | MvPolynomial.support_esymm | [
{
"state_after": "σ : Type u_1\nR : Type u_2\nτ : Type ?u.193960\nS : Type ?u.193963\ninst✝⁵ : CommSemiring R\ninst✝⁴ : CommSemiring S\ninst✝³ : Fintype σ\ninst✝² : Fintype τ\nn : ℕ\ninst✝¹ : DecidableEq σ\ninst✝ : Nontrivial R\n⊢ (Finset.biUnion (powersetLen n univ) fun t => {∑ i in t, Finsupp.single i 1}) =\n... | [
258,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/Analysis/NormedSpace/Star/Exponential.lean | Commute.expUnitary | [
{
"state_after": "no goals",
"state_before": "A : Type u_1\ninst✝⁵ : NormedRing A\ninst✝⁴ : NormedAlgebra ℂ A\ninst✝³ : StarRing A\ninst✝² : ContinuousStar A\ninst✝¹ : CompleteSpace A\ninst✝ : StarModule ℂ A\na b : { x // x ∈ selfAdjoint A }\nh : Commute ↑a ↑b\n⊢ selfAdjoint.expUnitary a * selfAdjoint.expUn... | [
58,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/CategoryTheory/Linear/Basic.lean | CategoryTheory.Linear.homCongr_apply | [] | [
174,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Data/Int/Bitwise.lean | Int.bodd_coe | [] | [
45,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/Algebra/Lie/CartanSubalgebra.lean | LieIdeal.normalizer_eq_top | [
{
"state_after": "case h\nR✝ : Type u\nL✝ : Type v\ninst✝⁵ : CommRing R✝\ninst✝⁴ : LieRing L✝\ninst✝³ : LieAlgebra R✝ L✝\nH : LieSubalgebra R✝ L✝\nR : Type u\nL : Type v\ninst✝² : CommRing R\ninst✝¹ : LieRing L\ninst✝ : LieAlgebra R L\nI : LieIdeal R L\nx : L\n⊢ x ∈ LieSubalgebra.normalizer (↑R L I) ↔ x ∈ ⊤",
... | [
106,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Data/Fin/Tuple/NatAntidiagonal.lean | List.Nat.antidiagonalTuple_pairwise_pi_lex | [
{
"state_after": "k n : ℕ\n⊢ (∀ (a : ℕ × ℕ),\n a ∈ antidiagonal n →\n Pairwise\n (fun a_2 b => Pi.Lex (fun x x_1 => x < x_1) (fun x x x_1 => x < x_1) (Fin.cons a.fst a_2) (Fin.cons a.fst b))\n (antidiagonalTuple (Nat.add k 0) a.snd)) ∧\n Pairwise\n (fun a₁ a₂ =>\n ∀ ... | [
176,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Algebra/Periodic.lean | Function.periodic_with_period_zero | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.132651\nf✝ g : α → β\nc c₁ c₂ x✝ : α\ninst✝ : AddZeroClass α\nf : α → β\nx : α\n⊢ f (x + 0) = f x",
"tactic": "rw [add_zero]"
}
] | [
329,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.coe_prod | [] | [
1047,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1045,
1
] |
Mathlib/Data/PNat/Factors.lean | PrimeMultiset.coeNat_prime | [
{
"state_after": "case intro.mk.intro\nv : PrimeMultiset\np : ℕ\nh : p ∈ toNatMultiset v\nval✝ : ℕ\nhp' : Nat.Prime val✝\nleft✝ : { val := val✝, property := hp' } ∈ v\nh_eq : Coe.coe { val := val✝, property := hp' } = p\n⊢ Nat.Prime p",
"state_before": "v : PrimeMultiset\np : ℕ\nh : p ∈ toNatMultiset v\n⊢ N... | [
94,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/RingTheory/Ideal/Quotient.lean | Ideal.Quotient.maximal_ideal_iff_isField_quotient | [] | [
260,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
256,
1
] |
Mathlib/Data/Set/Basic.lean | Set.singleton_nonempty | [] | [
1299,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1298,
1
] |
Mathlib/Order/UpperLower/Basic.lean | IsUpperSet.top_mem | [] | [
294,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/Data/List/Count.lean | List.countp_join | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl✝ : List α\np q : α → Bool\na : List α\nl : List (List α)\n⊢ countp p (join (a :: l)) = sum (map (countp p) (a :: l))",
"tactic": "rw [join, countp_append, map_cons, sum_cons, countp_join l]"
}
] | [
98,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.toLinearEquiv_injective | [
{
"state_after": "case mk.mk\nR₁ : Type u_3\nR₂ : Type u_4\nR₃ : Type ?u.1456114\ninst✝²⁴ : Semiring R₁\ninst✝²³ : Semiring R₂\ninst✝²² : Semiring R₃\nσ₁₂ : R₁ →+* R₂\nσ₂₁ : R₂ →+* R₁\ninst✝²¹ : RingHomInvPair σ₁₂ σ₂₁\ninst✝²⁰ : RingHomInvPair σ₂₁ σ₁₂\nσ₂₃ : R₂ →+* R₃\nσ₃₂ : R₃ →+* R₂\ninst✝¹⁹ : RingHomInvPair ... | [
1810,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1807,
1
] |
Mathlib/Order/LiminfLimsup.lean | Filter.cofinite.liminf_set_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.182852\nγ : Type ?u.182855\nι : Type u_2\np : ι → Prop\ns : ι → Set α\n⊢ liminf s cofinite = {x | Set.Finite {n | ¬x ∈ s n}}",
"tactic": "simp only [← cofinite.bliminf_true s, cofinite.bliminf_set_eq, true_and_iff]"
}
] | [
1079,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1078,
1
] |
Mathlib/Data/Nat/GCD/Basic.lean | Nat.gcd_mul_of_coprime_of_dvd | [
{
"state_after": "case intro\na b d : ℕ\nhac : coprime a (d * b)\nb_dvd_c : b ∣ d * b\n⊢ gcd (a * b) (d * b) = b",
"state_before": "a b c : ℕ\nhac : coprime a c\nb_dvd_c : b ∣ c\n⊢ gcd (a * b) c = b",
"tactic": "rcases exists_eq_mul_left_of_dvd b_dvd_c with ⟨d, rfl⟩"
},
{
"state_after": "case in... | [
220,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Images.lean | CategoryTheory.Limits.imageMonoIsoSource_inv_ι | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\nX Y : C\nf : X ⟶ Y\ninst✝ : Mono f\n⊢ (imageMonoIsoSource f).inv ≫ image.ι f = f",
"tactic": "simp [imageMonoIsoSource]"
}
] | [
426,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.Theory.SemanticallyEquivalent.realize_iff | [] | [
455,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
452,
1
] |
Mathlib/Algebra/Order/WithZero.lean | mul_inv_le_iff₀ | [] | [
163,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/RingTheory/JacobsonIdeal.lean | Ideal.mem_jacobson_iff | [
{
"state_after": "R : Type u\nS : Type v\ninst✝¹ : Ring R\ninst✝ : Ring S\nI : Ideal R\nx : R\nhx : x ∈ jacobson I\ny : R\nhxy : I ⊔ span {y * x + 1} = ⊤\np : R\nhpi : p ∈ I\nq : R\nhq : q ∈ span {y * x + 1}\nhpq : p + q = 1\nr : R\nhr : r * (y * x + 1) = q\n⊢ -p ∈ I",
"state_before": "R : Type u\nS : Type ... | [
124,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | ENNReal.tsum_const_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.1694799\nγ : Type ?u.1694802\nδ : Type ?u.1694805\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝¹ : MeasurableSpace α\ninst✝ : MeasurableSingletonClass α\nc : ℝ≥0∞\n⊢ (∑' (x : α), c) = c * ↑↑count univ",
"tactic": "rw [← lintegral_c... | [
1409,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1408,
1
] |
Mathlib/RingTheory/QuotientNilpotent.lean | IsNilpotent.isUnit_quotient_mk_iff | [
{
"state_after": "R✝ : Type ?u.10312\nS : Type ?u.10315\ninst✝³ : CommSemiring R✝\ninst✝² : CommRing S\ninst✝¹ : Algebra R✝ S\nI✝ : Ideal S\nR : Type u_1\ninst✝ : CommRing R\nI : Ideal R\nhI : IsNilpotent I\nx : R\n⊢ IsUnit (↑(Ideal.Quotient.mk I) x) → IsUnit x",
"state_before": "R✝ : Type ?u.10312\nS : Typ... | [
83,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Data/List/MinMax.lean | List.maximum_singleton | [] | [
297,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Analysis/NormedSpace/OperatorNorm.lean | ContinuousLinearMap.isCompact_image_coe_of_bounded_of_closed_image | [] | [
1616,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1613,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.coprod.map_desc | [
{
"state_after": "case h₁\nC : Type u\ninst✝² : Category C\nX Y S T U V W : C\ninst✝¹ : HasBinaryCoproduct U W\ninst✝ : HasBinaryCoproduct T V\nf : U ⟶ S\ng : W ⟶ S\nh : T ⟶ U\nk : V ⟶ W\n⊢ inl ≫ map h k ≫ desc f g = inl ≫ desc (h ≫ f) (k ≫ g)\n\ncase h₂\nC : Type u\ninst✝² : Category C\nX Y S T U V W : C\ninst... | [
868,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
865,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.span_map_id | [] | [
255,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Std/Data/List/Lemmas.lean | List.cons_ne_self | [] | [
22,
100
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
22,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.beth_pos | [] | [
477,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Mathlib/Topology/Algebra/UniformGroup.lean | Filter.HasBasis.uniformity_of_nhds_one_inv_mul | [
{
"state_after": "α : Type u_2\nβ : Type ?u.174194\ninst✝² : UniformSpace α\ninst✝¹ : Group α\ninst✝ : UniformGroup α\nι : Sort u_1\np : ι → Prop\nU : ι → Set α\nh : HasBasis (𝓝 1) p U\n⊢ HasBasis (Filter.comap (fun x => x.fst⁻¹ * x.snd) (𝓝 1)) p fun i => {x | x.fst⁻¹ * x.snd ∈ U i}",
"state_before": "α :... | [
352,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/LinearAlgebra/Matrix/Basis.lean | Basis.toMatrix_isUnitSMul | [] | [
116,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Data/Finset/Card.lean | Finset.card_insert_of_not_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.4409\ns t : Finset α\na b : α\ninst✝ : DecidableEq α\nh : ¬a ∈ s\n⊢ card (insert a s) = card s + 1",
"tactic": "rw [← cons_eq_insert _ _ h, card_cons]"
}
] | [
109,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_permute | [
{
"state_after": "no goals",
"state_before": "m : Type ?u.1058568\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\nσ : Perm n\nM : Matrix n n R\n⊢ ↑sign σ • ↑detRowAlternating M = ↑↑(↑sign σ) * det M",
"tactic": "simp ... | [
245,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Analysis/InnerProductSpace/PiL2.lean | EuclideanSpace.orthonormal_single | [
{
"state_after": "ι : Type u_1\nι' : Type ?u.723850\n𝕜 : Type u_2\ninst✝¹⁰ : IsROrC 𝕜\nE : Type ?u.723859\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : InnerProductSpace 𝕜 E\nE' : Type ?u.723879\ninst✝⁷ : NormedAddCommGroup E'\ninst✝⁶ : InnerProductSpace 𝕜 E'\nF : Type ?u.723897\ninst✝⁵ : NormedAddCommGroup F\ni... | [
319,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/InformationTheory/Hamming.lean | Hamming.ofHamming_sub | [] | [
389,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | Commute.isOfFinOrder_mul | [] | [
420,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/Data/Set/Basic.lean | Set.union_eq_diff_union_diff_union_inter | [] | [
2086,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2085,
1
] |
Mathlib/Algebra/Order/Hom/Ring.lean | OrderRingIso.trans_toRingEquiv | [] | [
485,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
483,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.disjoint_coe | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.80244\nγ : Type ?u.80247\nf : α → β\ns t u : Finset α\na b : α\n⊢ _root_.Disjoint ↑s ↑t ↔ _root_.Disjoint s t",
"tactic": "simp only [Finset.disjoint_left, Set.disjoint_left, mem_coe]"
}
] | [
978,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
977,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | LocalRing.PrimeSpectrum.comap_residue | [
{
"state_after": "R : Type u\nS : Type v\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : LocalRing R\nx : PrimeSpectrum (ResidueField R)\n⊢ ↑(PrimeSpectrum.comap (residue R)) ⊥ = closedPoint R",
"state_before": "R : Type u\nS : Type v\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : LocalRing R\nx : Pr... | [
1017,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1013,
1
] |
Mathlib/Data/List/Zip.lean | List.map_prod_right_eq_zip | [
{
"state_after": "α : Type u\nβ : Type u_1\nγ : Type ?u.88166\nδ : Type ?u.88169\nε : Type ?u.88172\nl : List α\nf : α → β\n⊢ zip (map (fun x => f x) l) (map (fun x => x) l) = zip (map f l) l",
"state_before": "α : Type u\nβ : Type u_1\nγ : Type ?u.88166\nδ : Type ?u.88169\nε : Type ?u.88172\nl : List α\nf ... | [
267,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean | SimpleGraph.IsSRGWith.card_neighborFinset_union_of_not_adj | [
{
"state_after": "V : Type u\ninst✝² : Fintype V\ninst✝¹ : DecidableEq V\nG : SimpleGraph V\ninst✝ : DecidableRel G.Adj\nn k ℓ μ : ℕ\nv w : V\nh : IsSRGWith G n k ℓ μ\nhne : v ≠ w\nha : ¬Adj G v w\n⊢ Finset.card (neighborFinset G v ∪ neighborFinset G w) = 2 * k - Fintype.card ↑(commonNeighbors G v w)",
"sta... | [
106,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/GroupTheory/SemidirectProduct.lean | SemidirectProduct.rightHom_surjective | [] | [
206,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.image_mulSingle_uIcc | [] | [
314,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/Topology/Connected.lean | preconnectedSpace_of_forall_constant | [] | [
1603,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1600,
1
] |
Mathlib/Combinatorics/Additive/Behrend.lean | Behrend.three_le_nValue | [
{
"state_after": "α : Type ?u.740413\nβ : Type ?u.740416\nn d k N : ℕ\nx : Fin n → ℕ\nhN : 64 ≤ N\n⊢ 2 < Real.sqrt (log ↑N)",
"state_before": "α : Type ?u.740413\nβ : Type ?u.740416\nn d k N : ℕ\nx : Fin n → ℕ\nhN : 64 ≤ N\n⊢ 3 ≤ nValue N",
"tactic": "rw [nValue, ← lt_iff_add_one_le, lt_ceil, cast_two]"... | [
406,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
395,
1
] |
Mathlib/MeasureTheory/Group/Action.lean | MeasureTheory.smulInvariantMeasure_tfae | [
{
"state_after": "case tfae_1_iff_2\nG : Type u_1\nM : Type ?u.9701\nα : Type u_2\ns : Set α\nm : MeasurableSpace α\ninst✝³ : Group G\ninst✝² : MulAction G α\ninst✝¹ : MeasurableSpace G\ninst✝ : MeasurableSMul G α\nc : G\nμ : Measure α\n⊢ SMulInvariantMeasure G α μ ↔ ∀ (c : G) (s : Set α), MeasurableSet s → ↑↑μ... | [
154,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.lift_add | [] | [
610,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
608,
1
] |
Mathlib/Data/Set/Pairwise/Basic.lean | Set.pairwise_iff_of_refl | [] | [
97,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/Combinatorics/Composition.lean | List.splitWrtCompositionAux_cons | [
{
"state_after": "no goals",
"state_before": "n✝ : ℕ\nα : Type u_1\nl : List α\nn : ℕ\nns : List ℕ\n⊢ splitWrtCompositionAux l (n :: ns) = take n l :: splitWrtCompositionAux (drop n l) ns",
"tactic": "simp [splitWrtCompositionAux]"
}
] | [
674,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
672,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.incidenceSet_inter_incidenceSet_subset | [] | [
852,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
850,
1
] |
Mathlib/Analysis/SpecialFunctions/CompareExp.lean | Complex.IsExpCmpFilter.of_boundedUnder_im | [] | [
90,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | Int.pow_right_injective | [
{
"state_after": "case h.e'_3.h\nα : Type ?u.317239\nM : Type u\nN : Type v\nG : Type w\nH : Type x\nA : Type y\nB : Type z\nR : Type u₁\nS : Type u₂\nx : ℤ\nh : 1 < natAbs x\nx✝ : ℕ\n⊢ (natAbs ∘ (fun x x_1 => x ^ x_1) x) x✝ = natAbs x ^ x✝",
"state_before": "α : Type ?u.317239\nM : Type u\nN : Type v\nG : ... | [
799,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
794,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | isClosed_setOf_map_mul | [
{
"state_after": "ι : Type ?u.64907\nα : Type ?u.64910\nX : Type ?u.64913\nM : Type ?u.64916\nN : Type ?u.64919\ninst✝⁵ : TopologicalSpace X\nM₁ : Type u_1\nM₂ : Type u_2\ninst✝⁴ : TopologicalSpace M₂\ninst✝³ : T2Space M₂\ninst✝² : Mul M₁\ninst✝¹ : Mul M₂\ninst✝ : ContinuousMul M₂\n⊢ IsClosed (⋂ (i : M₁) (i_1 :... | [
328,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
1
] |
Mathlib/LinearAlgebra/Isomorphisms.lean | Submodule.quotientQuotientEquivQuotientAux_mk_mk | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nM : Type u_1\nM₂ : Type ?u.145062\nM₃ : Type ?u.145065\ninst✝⁶ : Ring R\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : AddCommGroup M₂\ninst✝³ : AddCommGroup M₃\ninst✝² : Module R M\ninst✝¹ : Module R M₂\ninst✝ : Module R M₃\nf : M →ₗ[R] M₂\nS T : Submodule R ... | [
178,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
177,
1
] |
Mathlib/Algebra/Field/Opposite.lean | MulOpposite.unop_ratCast | [] | [
37,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/Analysis/Calculus/Deriv/Polynomial.lean | Polynomial.fderivWithin | [] | [
192,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
11
] |
Mathlib/Analysis/Convex/Combination.lean | Finset.centerMass_singleton | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nE : Type u_2\nF : Type ?u.26653\nι : Type u_3\nι' : Type ?u.26659\nα : Type ?u.26662\ninst✝⁷ : LinearOrderedField R\ninst✝⁶ : AddCommGroup E\ninst✝⁵ : AddCommGroup F\ninst✝⁴ : LinearOrderedAddCommGroup α\ninst✝³ : Module R E\ninst✝² : Module R F\ni... | [
72,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/Order/WellFoundedSet.lean | Finset.wellFoundedOn_sup | [
{
"state_after": "no goals",
"state_before": "ι : Type u_2\nα : Type u_1\nβ : Type ?u.113342\nr : α → α → Prop\ninst✝ : IsStrictOrder α r\ns : Finset ι\nf : ι → Set α\n⊢ Set.WellFoundedOn (sup ∅ f) r ↔ ∀ (i : ι), i ∈ ∅ → Set.WellFoundedOn (f i) r",
"tactic": "simp"
},
{
"state_after": "no goals"... | [
567,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
565,
1
] |
Mathlib/Data/ENat/Basic.lean | ENat.one_le_iff_ne_zero | [] | [
201,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Mathlib/Data/Complex/Exponential.lean | isCauSeq_geo_series | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\ninst✝⁴ : LinearOrderedField α\ninst✝³ : Archimedean α\nβ : Type u_1\ninst✝² : Ring β\ninst✝¹ : Nontrivial β\nabv : β → α\ninst✝ : IsAbsoluteValue abv\nx : β\nhx1 : abv x < 1\nh : abv x = 1\n⊢ False",
"tactic": "simp [h, lt_irrefl] at hx1"
},
... | [
148,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | pow_bit1_nonpos_iff | [
{
"state_after": "α : Type ?u.308458\nM : Type u\nN : Type v\nG : Type w\nH : Type x\nA : Type y\nB : Type z\nR : Type u₁\nS : Type u₂\ninst✝ : LinearOrderedRing R\na : R\nn : ℕ\n⊢ a < 0 ∨ a ^ bit1 n = 0 ↔ a < 0 ∨ a = 0",
"state_before": "α : Type ?u.308458\nM : Type u\nN : Type v\nG : Type w\nH : Type x\nA... | [
737,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
725,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | SequentiallyComplete.seq_pair_mem | [] | [
688,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
686,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Cardinal.ord_le_type | [] | [
1355,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1354,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.equalizer.isoSourceOfSelf_hom | [] | [
910,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
909,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | tsub_tsub_tsub_le_tsub | [
{
"state_after": "α : Type u_1\nβ : Type ?u.13993\ninst✝⁴ : Preorder α\ninst✝³ : AddCommSemigroup α\ninst✝² : Sub α\ninst✝¹ : OrderedSub α\na b c d : α\ninst✝ : CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1\n⊢ c ≤ c - b + (a + (b - a))",
"state_before": "α : Type u_1\nβ : Type ?u.13993\nins... | [
164,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/GroupTheory/Submonoid/Operations.lean | Submonoid.comap_comap | [] | [
207,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.