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/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.aecover_restrict_of_ae_imp | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nι : Type u_2\ninst✝ : MeasurableSpace α\nμ : Measure α\nl : Filter ι\ns : Set α\nφ : ι → Set α\nhs : MeasurableSet s\nae_eventually_mem : ∀ᵐ (x : α) ∂μ, x ∈ s → ∀ᶠ (n : ι) in l, x ∈ φ n\nmeasurable : ∀ (n : ι), MeasurableSet (φ n)\n⊢ ∀ᵐ (x : α) ∂Me... | [
288,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/Data/Int/CharZero.lean | Int.cast_inj | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : AddGroupWithOne α\ninst✝ : CharZero α\nm n : ℤ\n⊢ ↑m = ↑n ↔ m = n",
"tactic": "rw [← sub_eq_zero, ← cast_sub, cast_eq_zero, sub_eq_zero]"
}
] | [
38,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Data/Nat/Basic.lean | Nat.mod_mod_of_dvd | [
{
"state_after": "m✝ n✝ k✝ n m k : ℕ\nh : m ∣ k\n⊢ n % k % m = (n % k + k * (n / k)) % m",
"state_before": "m✝ n✝ k✝ n m k : ℕ\nh : m ∣ k\n⊢ n % k % m = n % m",
"tactic": "conv =>\nrhs\nrw [← mod_add_div n k]"
},
{
"state_after": "case intro\nm✝ n✝ k n m t : ℕ\n⊢ n % (m * t) % m = (n % (m * t) +... | [
747,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
742,
1
] |
Mathlib/Topology/Sheaves/Presheaf.lean | TopCat.Presheaf.Pushforward.id_hom_app | [
{
"state_after": "case h\nC : Type u\ninst✝ : Category C\nX : TopCat\nℱ : Presheaf C X\nU : Opens ↑X\n⊢ (id ℱ).hom.app U.op = ℱ.map (eqToHom (_ : (Functor.op (Opens.map (𝟙 X))).obj U.op = U.op))",
"state_before": "C : Type u\ninst✝ : Category C\nX : TopCat\nℱ : Presheaf C X\nU : (Opens ↑X)ᵒᵖ\n⊢ (id ℱ).hom.... | [
232,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Algebra/Module/ULift.lean | ULift.smul_def | [] | [
39,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
38,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.prodSumDistrib_symm_apply_right | [] | [
961,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
959,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.pushforward_comp | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nX Y Z : C\nf✝ : Y ⟶ X\nS R✝ : Sieve X\nf : Y ⟶ X\ng : Z ⟶ Y\nR : Sieve Z\nW : C\nh : W ⟶ X\nx✝ : (pushforward (g ≫ f) R).arrows h\nf₁ : W ⟶ Z\nhq : f₁ ≫ g ≫ f = h\nhf₁ : R.arrows f₁\n⊢... | [
508,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
504,
1
] |
Mathlib/MeasureTheory/Integral/SetIntegral.lean | MeasureTheory.set_integral_mono_on | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.283976\nE : Type ?u.283979\nF : Type ?u.283982\ninst✝ : MeasurableSpace α\nμ : Measure α\nf g : α → ℝ\ns t : Set α\nhf : IntegrableOn f s\nhg : IntegrableOn g s\nhs : MeasurableSet s\nh : ∀ (x : α), x ∈ s → f x ≤ g x\n⊢ (fun a => f a) ≤... | [
696,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
693,
1
] |
Mathlib/GroupTheory/Submonoid/Membership.lean | prod_mem | [] | [
104,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.C_add | [] | [
225,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Algebra/IndicatorFunction.lean | Set.indicator_mul_left | [
{
"state_after": "α : Type u_1\nβ : Type ?u.120510\nι : Type ?u.120513\nM : Type u_2\nN : Type ?u.120519\ninst✝ : MulZeroClass M\ns✝ t : Set α\nf✝ g✝ : α → M\na : α\ns : Set α\nf g : α → M\n⊢ (if a ∈ s then f a * g a else 0) = (if a ∈ s then f a else 0) * g a",
"state_before": "α : Type u_1\nβ : Type ?u.120... | [
692,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
687,
1
] |
Mathlib/Data/Multiset/LocallyFinite.lean | Multiset.Ico_add_Ico_eq_Ico | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : LinearOrder α\ninst✝ : LocallyFiniteOrder α\na✝ b✝ c✝ d a b c : α\nhab : a ≤ b\nhbc : b ≤ c\n⊢ Ico a b + Ico b c = Ico a c",
"tactic": "rw [add_eq_union_iff_disjoint.2 (Ico_disjoint_Ico le_rfl), Ico, Ico, Ico, ← Finset.union_val,\n Fi... | [
256,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Init/Data/Bool/Lemmas.lean | Bool.of_decide_true | [] | [
133,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Data/List/Rotate.lean | List.rotate_nil | [
{
"state_after": "no goals",
"state_before": "α : Type u\nn : ℕ\n⊢ rotate [] n = []",
"tactic": "simp [rotate]"
}
] | [
42,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.IsRegularOfDegree.degree_eq | [] | [
1453,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1452,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.union_union_union_comm | [] | [
1773,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1772,
1
] |
Std/Data/List/Lemmas.lean | List.ext_get | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl₁ l₂ : List α\nhl : length l₁ = length l₂\nh :\n ∀ (n : Nat) (h₁ : n < length l₁) (h₂ : n < length l₂),\n get l₁ { val := n, isLt := h₁ } = get l₂ { val := n, isLt := h₂ }\nn : Nat\nh₁ : n < length l₁\n⊢ get? l₁ n = get? l₂ n",
"tactic": "... | [
664,
51
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
657,
1
] |
Mathlib/Tactic/NormNum/Prime.lean | Mathlib.Meta.NormNum.not_prime_mul_of_ble | [] | [
39,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Algebra/ModEq.lean | AddCommGroup.sub_modEq_iff_modEq_add | [] | [
277,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.mul_mem_cancel_right | [] | [
615,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
614,
11
] |
Mathlib/Order/LiminfLimsup.lean | Filter.frequently_lt_of_lt_limsup | [
{
"state_after": "α✝ : Type ?u.192359\nβ✝ : Type ?u.192362\nγ : Type ?u.192365\nι : Type ?u.192368\nα : Type u_1\nβ : Type u_2\ninst✝ : ConditionallyCompleteLinearOrder β\nf : Filter α\nu : α → β\nb : β\nhu : autoParam (IsCoboundedUnder (fun x x_1 => x ≤ x_1) f u) _auto✝\nh : ¬∃ᶠ (x : α) in f, b < u x\n⊢ limsup... | [
1160,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1154,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.join_ret | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns : WSeq α\n⊢ think s ~ʷ s",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : WSeq α\n⊢ join (ret s) ~ʷ s",
"tactic": "simp [ret]"
},
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : WSeq α\n⊢ ... | [
1686,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1686,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Icc_ssubset_Icc_left | [
{
"state_after": "ι : Type ?u.26888\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\nhI : a₂ ≤ b₂\nha : a₂ < a₁\nhb : b₁ ≤ b₂\n⊢ Set.Icc a₁ b₁ ⊂ Set.Icc a₂ b₂",
"state_before": "ι : Type ?u.26888\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁... | [
269,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/Topology/Order/Basic.lean | Ico_mem_nhdsWithin_Ioi | [] | [
417,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
416,
1
] |
Std/Data/String/Lemmas.lean | Substring.ValidFor.str | [] | [
804,
17
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
803,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.toReal_max | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.801082\nβ : Type ?u.801085\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nhr : a ≠ ⊤\nhp : b ≠ ⊤\nh : a ≤ b\n⊢ ENNReal.toReal (max a b) = max (ENNReal.toReal a) (ENNReal.toReal b)",
"tactic": "simp only [h, (ENNReal.toReal_le_toReal hr hp).2 h, max_eq_right]"
}... | [
2050,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2046,
1
] |
Mathlib/CategoryTheory/Closed/Monoidal.lean | CategoryTheory.MonoidalClosed.curry_natural_right | [] | [
186,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Logic/Equiv/Set.lean | Equiv.Set.image_symm_preimage | [
{
"state_after": "case h.mk.intro.intro\nα✝ : Sort u\nβ✝ : Sort v\nγ : Sort w\nα : Type u_1\nβ : Type u_2\nf : α → β\nhf : Injective f\nu s : Set α\na : α\nhas : a ∈ s\n⊢ { val := f a, property := (_ : ∃ a_1, a_1 ∈ s ∧ f a_1 = f a) } ∈ (fun x => ↑(↑(Set.image f s hf).symm x)) ⁻¹' u ↔\n { val := f a, property... | [
501,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
497,
1
] |
Mathlib/CategoryTheory/EqToHom.lean | CategoryTheory.Functor.map_comp_hEq' | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝² : Category C\nD : Type u₂\ninst✝¹ : Category D\nE : Type u₃\ninst✝ : Category E\nF G : C ⥤ D\nX Y Z : C\nf : X ⟶ Y\ng : Y ⟶ Z\nhobj : ∀ (X : C), F.obj X = G.obj X\nhmap : ∀ {X Y : C} (f : X ⟶ Y), HEq (F.map f) (G.map f)\n⊢ HEq (F.map (f ≫ g))... | [
240,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.toNNReal_mono | [] | [
2012,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2011,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.arrowCongr_symm_apply | [] | [
2337,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2333,
1
] |
Mathlib/Analysis/Calculus/Deriv/Comp.lean | HasStrictDerivAt.scomp | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝⁷ : NormedAddCommGroup F\ninst✝⁶ : NormedSpace 𝕜 F\nE : Type w\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL L₁ L₂ : F... | [
104,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Algebra/Free.lean | FreeMagma.mul_bind | [] | [
189,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | tendsto_measure_cthickening_of_isCompact | [] | [
1618,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1613,
1
] |
Mathlib/Logic/Embedding/Basic.lean | Equiv.embeddingCongr_symm | [] | [
444,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/RingTheory/Ideal/Basic.lean | Ideal.eq_bot_of_prime | [] | [
711,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
710,
1
] |
Mathlib/Computability/Reduce.lean | ManyOneDegree.le_trans | [
{
"state_after": "case h\nα : Type u\ninst✝⁵ : Primcodable α\ninst✝⁴ : Inhabited α\nβ : Type v\ninst✝³ : Primcodable β\ninst✝² : Inhabited β\nγ : Type w\ninst✝¹ : Primcodable γ\ninst✝ : Inhabited γ\nd₂ d₃ : ManyOneDegree\np✝ : Set ℕ\n⊢ of p✝ ≤ d₂ → d₂ ≤ d₃ → of p✝ ≤ d₃",
"state_before": "α : Type u\ninst✝⁵ ... | [
456,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
452,
9
] |
Mathlib/Algebra/Algebra/Tower.lean | AlgEquiv.restrictScalars_injective | [] | [
235,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.mem_edges_toSubgraph | [
{
"state_after": "no goals",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu v w : V\np : Walk G u v\ne : Sym2 V\n⊢ e ∈ Subgraph.edgeSet (Walk.toSubgraph p) ↔ e ∈ edges p",
"tactic": "induction p <;> simp [*]"
}
] | [
2244,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2243,
1
] |
Std/Data/String/Lemmas.lean | Substring.Valid.foldr | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nf : Char → α → α\ninit : α\nx✝ : Substring\nh✝ : Valid x✝\nw✝² w✝¹ w✝ : List Char\nh : ValidFor w✝² w✝¹ w✝ x✝\n⊢ Substring.foldr f init x✝ = List.foldr f init (toString x✝).data",
"tactic": "simp [h.foldr, h.toString]"
}
] | [
1057,
74
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1056,
1
] |
Mathlib/Topology/Algebra/Module/FiniteDimension.lean | unique_topology_of_t2 | [
{
"state_after": "case refine'_1\n𝕜 : Type u\nhnorm : NontriviallyNormedField 𝕜\nE : Type v\ninst✝¹⁴ : AddCommGroup E\ninst✝¹³ : Module 𝕜 E\ninst✝¹² : TopologicalSpace E\ninst✝¹¹ : TopologicalAddGroup E\ninst✝¹⁰ : ContinuousSMul 𝕜 E\nF : Type w\ninst✝⁹ : AddCommGroup F\ninst✝⁸ : Module 𝕜 F\ninst✝⁷ : Topolo... | [
129,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/LinearAlgebra/Orientation.lean | Basis.orientation_eq_or_eq_neg | [
{
"state_after": "case h\nR : Type u_2\ninst✝⁴ : LinearOrderedCommRing R\nM : Type u_3\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\nι : Type u_1\ninst✝¹ : Fintype ι\ninst✝ : DecidableEq ι\ne : Basis ι R M\nx : AlternatingMap R M R ι\nhx : x ≠ 0\n⊢ rayOfNeZero R x hx = Basis.orientation e ∨ rayOfNeZero R x hx ... | [
236,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | ENNReal.rpow_eq_top_iff | [
{
"state_after": "case none\ny : ℝ\n⊢ none ^ y = ⊤ ↔ none = 0 ∧ y < 0 ∨ none = ⊤ ∧ 0 < y\n\ncase some\ny : ℝ\nx : ℝ≥0\n⊢ Option.some x ^ y = ⊤ ↔ Option.some x = 0 ∧ y < 0 ∨ Option.some x = ⊤ ∧ 0 < y",
"state_before": "x : ℝ≥0∞\ny : ℝ\n⊢ x ^ y = ⊤ ↔ x = 0 ∧ y < 0 ∨ x = ⊤ ∧ 0 < y",
"tactic": "cases' x wit... | [
406,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/GroupTheory/Submonoid/Operations.lean | Submonoid.comap_top | [] | [
361,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
360,
1
] |
Mathlib/Computability/Primrec.lean | list_reverse' | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.194459\nβ : Type u_1\nσ : Type ?u.194465\ninst✝² : Primcodable α\ninst✝¹ : Primcodable β\ninst✝ : Primcodable σ\nH : Nat.Primrec fun n => encode (decode n)\nthis : Primcodable (List β) := prim H\nl : List β\n⊢ ∀ (r : List β), List.foldl (fun s b => b... | [
931,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
924,
9
] |
Mathlib/LinearAlgebra/TensorProduct.lean | TensorProduct.curry_injective | [] | [
590,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | Real.norm_eq_abs | [] | [
1708,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1707,
1
] |
Mathlib/Data/Fintype/Basic.lean | Finset.insert_compl_self | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.12912\nγ : Type ?u.12915\ninst✝¹ : Fintype α\ns t : Finset α\ninst✝ : DecidableEq α\na x : α\n⊢ insert x ({x}ᶜ) = univ",
"tactic": "rw [← compl_erase, erase_singleton, compl_empty]"
}
] | [
235,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/Order/Basic.lean | PartialOrder.toPreorder_injective | [
{
"state_after": "case mk\nι : Type ?u.12814\nα✝ : Type u\nβ : Type v\nγ : Type w\nπ : ι → Type ?u.12825\nr : α✝ → α✝ → Prop\nα : Type u_1\nB : PartialOrder α\ntoPreorder✝ : Preorder α\nle_antisymm✝ : ∀ (a b : α), a ≤ b → b ≤ a → a = b\nh : toPreorder = toPreorder\n⊢ mk le_antisymm✝ = B",
"state_before": "ι... | [
617,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
612,
1
] |
Mathlib/Order/Lattice.lean | Monotone.of_map_inf | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝¹ : SemilatticeInf α\ninst✝ : SemilatticeInf β\nf : α → β\nh : ∀ (x y : α), f (x ⊓ y) = f x ⊓ f y\nx y : α\nhxy : x ≤ y\n⊢ f x ⊓ f y = f x",
"tactic": "rw [← h, inf_eq_left.2 hxy]"
}
] | [
1109,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1107,
1
] |
Mathlib/Order/Bounded.lean | Set.Bounded.mono | [] | [
29,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
28,
1
] |
Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean | Path.Homotopy.continuous_reflTransSymmAux | [
{
"state_after": "case refine'_1\nX : Type u\nY : Type v\ninst✝¹ : TopologicalSpace X\ninst✝ : TopologicalSpace Y\nx₀ x₁ : X\n⊢ Continuous fun x => ↑x.snd\n\ncase refine'_2\nX : Type u\nY : Type v\ninst✝¹ : TopologicalSpace X\ninst✝ : TopologicalSpace Y\nx₀ x₁ : X\n⊢ Continuous fun x => 1 / 2\n\ncase refine'_3\... | [
57,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Prod.lean | HasFDerivWithinAt.prod | [] | [
79,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
8
] |
Mathlib/Algebra/Order/CompleteField.lean | LinearOrderedField.inducedMap_rat | [
{
"state_after": "case refine_1\nF : Type ?u.17063\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.17072\ninst✝³ : LinearOrderedField α\ninst✝² : ConditionallyCompleteLinearOrderedField β\ninst✝¹ : ConditionallyCompleteLinearOrderedField γ\ninst✝ : Archimedean α\nq : ℚ\nx : β\nh : x ∈ cutMap β ↑q\n⊢ x ≤ ↑q\n\ncase ref... | [
201,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | LinearMap.comp_eq_id_comm | [] | [
950,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
949,
1
] |
Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | Monotone.map_liminf_of_continuousAt | [] | [
409,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
407,
1
] |
Mathlib/Data/Finset/Sups.lean | Finset.image_sup_product | [] | [
196,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Algebra/BigOperators/Fin.lean | Fin.prod_congr' | [
{
"state_after": "α : Type ?u.64969\nβ : Type ?u.64972\nM : Type u_1\ninst✝ : CommMonoid M\na : ℕ\nf : Fin a → M\n⊢ ∏ i : Fin a, f (↑(cast (_ : a = a)) i) = ∏ i : Fin a, f i",
"state_before": "α : Type ?u.64969\nβ : Type ?u.64972\nM : Type u_1\ninst✝ : CommMonoid M\na b : ℕ\nf : Fin b → M\nh : a = b\n⊢ ∏ i ... | [
192,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.card_le_of_interleaved | [
{
"state_after": "case h\nF : Type ?u.388258\nα : Type u_1\nβ : Type ?u.388264\nγ : Type ?u.388267\nι : Type ?u.388270\nκ : Type ?u.388273\ninst✝ : LinearOrder α\ns✝ : Finset α\nH : Finset.Nonempty s✝\nx : α\ns t : Finset α\nh : ∀ (x : α), x ∈ s → ∀ (y : α), y ∈ s → x < y → (∀ (z : α), z ∈ s → ¬z ∈ Set.Ioo x y)... | [
1605,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1580,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | nnnorm_toAdd | [] | [
2245,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2244,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.val_add | [] | [
705,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
704,
1
] |
Mathlib/Analysis/Complex/UnitDisc/Basic.lean | Complex.UnitDisc.im_coe | [] | [
196,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Order/Bounds/Basic.lean | isGLB_le_isLUB | [] | [
1047,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1046,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | contDiffWithinAt_succ_iff_hasFDerivWithinAt | [
{
"state_after": "case mp\n𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nX : Type uX\ninst✝¹ : ... | [
595,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
550,
1
] |
Mathlib/Topology/Basic.lean | Ultrafilter.clusterPt_iff | [] | [
1141,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1140,
1
] |
Mathlib/CategoryTheory/EqToHom.lean | CategoryTheory.eqToIso.inv | [] | [
135,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Algebra/Order/Interval.lean | NonemptyInterval.pure_div_pure | [] | [
445,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
444,
1
] |
Mathlib/Algebra/GroupWithZero/Power.lean | zpow_sub_one₀ | [
{
"state_after": "no goals",
"state_before": "G₀ : Type u_1\ninst✝ : GroupWithZero G₀\na : G₀\nha : a ≠ 0\nn : ℤ\n⊢ a ^ (n - 1) = a ^ (n - 1) * a * a⁻¹",
"tactic": "rw [mul_assoc, mul_inv_cancel ha, mul_one]"
},
{
"state_after": "no goals",
"state_before": "G₀ : Type u_1\ninst✝ : GroupWithZe... | [
89,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Topology/UniformSpace/Separation.lean | separated_iff_t2 | [
{
"state_after": "case mp\nα : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\nh : SeparatedSpace α\n⊢ T2Space α\n\ncase mpr\nα : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\nh : T2Space α\n⊢ S... | [
212,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Topology/Algebra/Star.lean | tendsto_star | [] | [
50,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/Order/Directed.lean | directedOn_pair' | [
{
"state_after": "α : Type u\nβ : Type v\nι : Sort w\nr r' s : α → α → Prop\nh : Reflexive r\na b : α\nhab : r a b\n⊢ DirectedOn r {a, b}",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\nr r' s : α → α → Prop\nh : Reflexive r\na b : α\nhab : r a b\n⊢ DirectedOn r {b, a}",
"tactic": "rw [Set.pair_c... | [
253,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
250,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Icc_diff_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.34759\ninst✝ : PartialOrder α\na b c x : α\n⊢ x ∈ Icc a b \\ {b} ↔ x ∈ Ico a b",
"tactic": "simp [lt_iff_le_and_ne, and_assoc]"
}
] | [
781,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
780,
1
] |
Mathlib/AlgebraicTopology/AlternatingFaceMapComplex.lean | AlgebraicTopology.inclusionOfMooreComplexMap_f | [
{
"state_after": "C : Type ?u.247870\ninst✝³ : Category C\ninst✝² : Preadditive C\nA : Type u_2\ninst✝¹ : Category A\ninst✝ : Abelian A\nX : SimplicialObject A\nn : ℕ\n⊢ HomologicalComplex.Hom.f\n (id\n (ChainComplex.ofHom (fun n => underlying.obj (NormalizedMooreComplex.objX X n)) (NormalizedMooreC... | [
282,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisInsertion.l_biInf_u | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι✝ : Sort x\nκ : ι✝ → Sort ?u.41283\na a₁ a₂ : α\nb b₁ b₂ : β\nl : α → β\nu : β → α\ninst✝¹ : CompleteLattice α\ninst✝ : CompleteLattice β\ngi : GaloisInsertion l u\nι : Sort x\np : ι → Prop\nf : (i : ι) → p i → β\n⊢ l (⨅ (i :... | [
572,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
570,
1
] |
Mathlib/LinearAlgebra/FreeModule/Finite/Rank.lean | FiniteDimensional.finrank_pi | [
{
"state_after": "no goals",
"state_before": "R : Type u\nM : Type v\nN : Type w\ninst✝¹⁰ : Ring R\ninst✝⁹ : StrongRankCondition R\ninst✝⁸ : AddCommGroup M\ninst✝⁷ : Module R M\ninst✝⁶ : Module.Free R M\ninst✝⁵ : Module.Finite R M\ninst✝⁴ : AddCommGroup N\ninst✝³ : Module R N\ninst✝² : Module.Free R N\ninst... | [
104,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Data/Quot.lean | Quotient.out_injective | [] | [
401,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.zero_symm | [] | [
1813,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1812,
1
] |
Mathlib/Data/Finset/Card.lean | Finset.le_card_of_inj_on_range | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.26322\ns t : Finset α\nf✝ : α → β\nn : ℕ\nf : ℕ → α\nhf : ∀ (i : ℕ), i < n → f i ∈ s\nf_inj : ∀ (i : ℕ), i < n → ∀ (j : ℕ), j < n → f i = f j → i = j\n⊢ ∀ (a : ℕ), a ∈ range n → f a ∈ s",
"tactic": "simpa only [mem_range]"
},
{
... | [
353,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
349,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Equiv.lean | ContinuousLinearEquiv.comp_hasFDerivAt_iff | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_3\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_4\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type u_2\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace ... | [
144,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.mul_eq_right_iff_opow_omega_dvd | [
{
"state_after": "case inl\na b : Ordinal\nha : a = 0\n⊢ a * b = b ↔ a ^ ω ∣ b\n\ncase inr\na b : Ordinal\nha : 0 < a\n⊢ a * b = b ↔ a ^ ω ∣ b",
"state_before": "a b : Ordinal\n⊢ a * b = b ↔ a ^ ω ∣ b",
"tactic": "cases' eq_zero_or_pos a with ha ha"
},
{
"state_after": "case inr.refine'_1\na b :... | [
691,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
678,
1
] |
Mathlib/GroupTheory/Sylow.lean | card_sylow_eq_index_normalizer | [] | [
420,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/Order/Monotone/Basic.lean | StrictMono.cmp_map_eq | [] | [
946,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
945,
1
] |
Mathlib/Data/Set/Basic.lean | Set.pair_eq_pair_iff | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t₁ t₂ u : Set α\nx y z w : α\n⊢ ((x = z ∨ x = w) ∧ (y = z ∨ y = w)) ∧ (z = x ∨ z = y) ∧ (w = x ∨ w = y) ↔ x = z ∧ y = w ∨ x = w ∧ y = z",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t... | [
1396,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1390,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.not_prime_iff_minFac_lt | [] | [
391,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/RingTheory/Localization/AtPrime.lean | Localization.localRingHom_unique | [] | [
252,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/Order/Lattice.lean | Monotone.sup | [] | [
1074,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1072,
11
] |
Mathlib/CategoryTheory/Generator.lean | CategoryTheory.isCoseparator_prod_of_isCoseparator_left | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝³ : Category C\nD : Type u₂\ninst✝² : Category D\ninst✝¹ : HasZeroMorphisms C\nG H : C\ninst✝ : HasBinaryProduct G H\nhG : IsCoseparator G\n⊢ {G} ⊆ {G, H}",
"tactic": "simp"
}
] | [
604,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
602,
1
] |
Mathlib/Algebra/Ring/BooleanRing.lean | ofBoolAlg_symm_eq | [] | [
153,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Order/Lattice.lean | MonotoneOn.min | [] | [
1155,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1153,
11
] |
Mathlib/RingTheory/Valuation/Basic.lean | Valuation.map_mul | [] | [
168,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Topology/UniformSpace/Equiv.lean | UniformEquiv.uniformContinuous_symm | [] | [
149,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
11
] |
Mathlib/Data/Set/Intervals/Instances.lean | Set.Ioo.mem_iff_one_sub_mem | [] | [
380,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
379,
1
] |
Mathlib/Topology/SubsetProperties.lean | iUnion_compactCovering | [
{
"state_after": "α : Type u\nβ : Type v\nι : Type ?u.155649\nπ : ι → Type ?u.155654\ninst✝² : TopologicalSpace α\ninst✝¹ : TopologicalSpace β\ns t : Set α\ninst✝ : SigmaCompactSpace α\n⊢ (⋃ (x : ℕ), Exists.choose (_ : ∃ K, (∀ (n : ℕ), IsCompact (K n)) ∧ (⋃ (n : ℕ), K n) = univ) x) = univ",
"state_before": ... | [
1308,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1306,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Localization.Away.mk_eq_monoidOf_mk' | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type ?u.3319938\ninst✝¹ : CommMonoid N\nP : Type ?u.3319944\ninst✝ : CommMonoid P\nf : Submonoid.LocalizationMap S N\nx : M\n⊢ mk = Submonoid.LocalizationMap.mk' (monoidOf x)",
"tactic": "simp"
}
] | [
1768,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1768,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.map_le_iff_le_comap | [] | [
322,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
320,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.degree_eq_iff_natDegree_eq_of_pos | [
{
"state_after": "case mp\nR : Type u\nS : Type v\na b c d : R\nn✝ m : ℕ\ninst✝ : Semiring R\np✝ q r p : R[X]\nn : ℕ\nhn : 0 < n\n⊢ degree p = ↑n → natDegree p = n\n\ncase mpr\nR : Type u\nS : Type v\na b c d : R\nn✝ m : ℕ\ninst✝ : Semiring R\np✝ q r p : R[X]\nn : ℕ\nhn : 0 < n\n⊢ natDegree p = n → degree p = ↑... | [
152,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.toList_eq_nil | [] | [
3360,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3359,
1
] |
Mathlib/Order/OrdContinuous.lean | RightOrdContinuous.comp | [] | [
190,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean | FormalMultilinearSeries.apply_eq_zero_of_lt_order | [] | [
256,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/CategoryTheory/Limits/Preserves/Shapes/Zero.lean | CategoryTheory.Functor.map_eq_zero_iff | [
{
"state_after": "C : Type u₁\ninst✝⁵ : Category C\nD : Type u₂\ninst✝⁴ : Category D\ninst✝³ : HasZeroMorphisms C\ninst✝² : HasZeroMorphisms D\nF : C ⥤ D\ninst✝¹ : PreservesZeroMorphisms F\ninst✝ : Faithful F\nX Y : C\n⊢ F.map 0 = 0",
"state_before": "C : Type u₁\ninst✝⁵ : Category C\nD : Type u₂\ninst✝⁴ : ... | [
68,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.