file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Data/Real/ENNReal.lean | ENNReal.csupr_ne_top | [] | [
438,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
437,
1
] |
Mathlib/Data/List/Basic.lean | List.enumFrom_cons | [] | [
3878,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3876,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | tsub_eq_of_eq_add_rev | [] | [
354,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
353,
1
] |
Mathlib/MeasureTheory/PiSystem.lean | subset_piiUnionInter | [
{
"state_after": "α : Type u_1\nι : Type u_2\nπ : ι → Set (Set α)\nS : Set ι\ni : ι\nhis : i ∈ S\nh_ss : {i} ⊆ S\n⊢ π i ⊆ piiUnionInter π S",
"state_before": "α : Type u_1\nι : Type u_2\nπ : ι → Set (Set α)\nS : Set ι\ni : ι\nhis : i ∈ S\n⊢ π i ⊆ piiUnionInter π S",
"tactic": "have h_ss : {i} ⊆ S := by\... | [
492,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
484,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.mem_closure | [] | [
564,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
562,
1
] |
Mathlib/Analysis/Calculus/Deriv/Mul.lean | derivWithin_div_const | [
{
"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... | [
330,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.gc_map_comap | [] | [
832,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
831,
1
] |
Mathlib/Algebra/Free.lean | FreeMagma.toFreeSemigroup_of | [] | [
722,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
722,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | IsLocalization.mk'_spec' | [] | [
267,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/CategoryTheory/Functor/Category.lean | CategoryTheory.NatTrans.hcomp_id_app | [
{
"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 H✝ I : C ⥤ D\nH : D ⥤ E\nα : F ⟶ G\nX : C\n⊢ (α ◫ 𝟙 H).app X = H.map (α.app X)",
"tactic": "simp"
}
] | [
121,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Std/Data/Nat/Lemmas.lean | Nat.eq_one_of_dvd_one | [
{
"state_after": "no goals",
"state_before": "n : Nat\nH : n ∣ 1\n⊢ 0 < 1",
"tactic": "decide"
},
{
"state_after": "no goals",
"state_before": "n : Nat\nH : n ∣ 1\n⊢ 0 < 1",
"tactic": "decide"
}
] | [
716,
78
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
715,
1
] |
Mathlib/Order/PartialSups.lean | Monotone.partialSups_eq | [
{
"state_after": "case h\nα : Type u_1\ninst✝ : SemilatticeSup α\nf : ℕ → α\nhf : Monotone f\nn : ℕ\n⊢ ↑(partialSups f) n = f n",
"state_before": "α : Type u_1\ninst✝ : SemilatticeSup α\nf : ℕ → α\nhf : Monotone f\n⊢ ↑(partialSups f) = f",
"tactic": "ext n"
},
{
"state_after": "case h.zero\nα : ... | [
99,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Data/Set/NAry.lean | Set.image2_inter_subset_left | [
{
"state_after": "case intro.intro.intro.intro.intro\nα : Type u_2\nα' : Type ?u.21899\nβ : Type u_3\nβ' : Type ?u.21905\nγ : Type u_1\nγ' : Type ?u.21911\nδ : Type ?u.21914\nδ' : Type ?u.21917\nε : Type ?u.21920\nε' : Type ?u.21923\nζ : Type ?u.21926\nζ' : Type ?u.21929\nν : Type ?u.21932\nf f' : α → β → γ\ng ... | [
182,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Std/Data/Int/DivMod.lean | Int.div_mul_cancel_of_mod_eq_zero | [
{
"state_after": "no goals",
"state_before": "a b : Int\nH : mod a b = 0\n⊢ div a b * b = a",
"tactic": "rw [Int.mul_comm, mul_div_cancel_of_mod_eq_zero H]"
}
] | [
583,
53
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
582,
1
] |
Mathlib/Analysis/Convex/Basic.lean | convex_pi | [] | [
121,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/Order/Bounds/Basic.lean | exists_lub_Iio | [
{
"state_after": "case pos\nα : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ns t : Set α\na b : α\ninst✝ : LinearOrder γ\ni : γ\nh_exists_lt : ∃ j, j ∈ upperBounds (Iio i) ∧ j < i\n⊢ ∃ j, IsLUB (Iio i) j\n\ncase neg\nα : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝²... | [
584,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
575,
1
] |
Mathlib/CategoryTheory/Preadditive/Biproducts.lean | CategoryTheory.Limits.hasBiproduct_of_total | [] | [
131,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Algebra/GroupPower/Order.lean | sq_abs | [
{
"state_after": "no goals",
"state_before": "β : Type ?u.255421\nA : Type ?u.255424\nG : Type ?u.255427\nM : Type ?u.255430\nR : Type u_1\ninst✝ : LinearOrderedRing R\nx✝ y x : R\n⊢ abs x ^ 2 = x ^ 2",
"tactic": "simpa only [sq] using abs_mul_abs_self x"
}
] | [
685,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
685,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Independent.lean | AffineEquiv.affineIndependent_iff | [] | [
401,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | HasDerivAtFilter.sum | [
{
"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 : Filter �... | [
167,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Analysis/Convex/Integral.lean | ae_eq_const_or_norm_set_integral_lt_of_norm_le_const | [
{
"state_after": "α : Type u_2\nE : Type u_1\nF : Type ?u.2692874\nm0 : MeasurableSpace α\ninst✝⁶ : NormedAddCommGroup E\ninst✝⁵ : NormedSpace ℝ E\ninst✝⁴ : CompleteSpace E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : CompleteSpace F\nμ : MeasureTheory.Measure α\ns : Set E\nt : Set α\nf : ... | [
368,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.infty_coeFn_int_cast | [] | [
916,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
915,
1
] |
Mathlib/Analysis/SpecialFunctions/Integrals.lean | integral_inv_of_pos | [] | [
435,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
434,
1
] |
Mathlib/Algebra/Order/Rearrangement.lean | AntivaryOn.sum_mul_lt_sum_comp_perm_mul_iff | [] | [
448,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioc_union_Ioi' | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.86199\ninst✝ : LinearOrder α\na a₁ a₂ b b₁ b₂ c d : α\nh₁ : c ≤ b\nx : α\n⊢ x ∈ Ioc a b ∪ Ioi c ↔ x ∈ Ioi (min a c)",
"state_before": "α : Type u_1\nβ : Type ?u.86199\ninst✝ : LinearOrder α\na a₁ a₂ b b₁ b₂ c d : α\nh₁ : c ≤ b\n⊢ Ioc a b ∪ Ioi c = Ioi (min... | [
1305,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1299,
1
] |
Mathlib/Data/Sigma/Basic.lean | PSigma.ext | [
{
"state_after": "case mk\nα : Sort u_1\nβ : α → Sort u_2\nx₁ : PSigma β\nfst✝ : α\nsnd✝ : β fst✝\nh₀ : { fst := fst✝, snd := snd✝ }.fst = x₁.fst\nh₁ : HEq { fst := fst✝, snd := snd✝ }.snd x₁.snd\n⊢ { fst := fst✝, snd := snd✝ } = x₁",
"state_before": "α : Sort u_1\nβ : α → Sort u_2\nx₀ x₁ : PSigma β\nh₀ : x... | [
236,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | Associates.count_of_coprime | [
{
"state_after": "α : Type u_1\ninst✝¹ : CancelCommMonoidWithZero α\ndec_irr : (p : Associates α) → Decidable (Irreducible p)\ninst✝ : UniqueFactorizationMonoid α\ndec : DecidableEq α\ndec' : DecidableEq (Associates α)\na : Associates α\nha : a ≠ 0\nb : Associates α\nhb : b ≠ 0\nhab : ∀ (d : Associates α), d ∣ ... | [
1748,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1741,
1
] |
Mathlib/Algebra/Support.lean | Function.mulSupport_eq_empty_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.5450\nA : Type ?u.5453\nB : Type ?u.5456\nM : Type u_2\nN : Type ?u.5462\nP : Type ?u.5465\nR : Type ?u.5468\nS : Type ?u.5471\nG : Type ?u.5474\nM₀ : Type ?u.5477\nG₀ : Type ?u.5480\nι : Sort ?u.5483\ninst✝² : One M\ninst✝¹ : One N\ninst✝ : One P\nf : α → M\n⊢ (∀ (x ... | [
112,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/LinearAlgebra/FreeModule/PID.lean | eq_bot_of_generator_maximal_submoduleImage_eq_zero | [
{
"state_after": "R : Type u\nM : Type v\ninst✝³ : Ring R\ninst✝² : AddCommGroup M\ninst✝¹ : Module R M\nι : Type u_1\nb✝ : Basis ι R M\nN O : Submodule R M\nb : Basis ι R { x // x ∈ O }\nhNO : N ≤ O\nϕ : { x // x ∈ O } →ₗ[R] R\nhϕ : ∀ (ψ : { x // x ∈ O } →ₗ[R] R), ¬LinearMap.submoduleImage ϕ N < LinearMap.subm... | [
89,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.degree_eq_natDegree | [
{
"state_after": "R : Type u\nS : Type v\na b c d : R\nn✝ m : ℕ\ninst✝ : Semiring R\np q r : R[X]\nhp : p ≠ 0\nn : ℕ\nhn : ¬¬n ∈ degree p\n⊢ degree p = ↑(natDegree p)",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝ : Semiring R\np q r : R[X]\nhp : p ≠ 0\n⊢ degree p = ↑(natDegree p)",
... | [
132,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Data/Finset/Sups.lean | Finset.biUnion_image_inf_left | [] | [
361,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
360,
1
] |
Mathlib/Data/Semiquot.lean | Semiquot.pure_inj | [] | [
173,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | vectorSpan_insert_eq_vectorSpan | [
{
"state_after": "no goals",
"state_before": "k : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\nι : Type ?u.494322\np : P\nps : Set P\nh : p ∈ affineSpan k ps\n⊢ vectorSpan k (insert p ps) = vectorSpan k ps",
"tactic": "simp... | [
1402,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1400,
1
] |
Mathlib/Order/SymmDiff.lean | Codisjoint.bihimp_inf_bihimp_le_right | [] | [
811,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
810,
1
] |
Mathlib/NumberTheory/Liouville/LiouvilleWith.lean | LiouvilleWith.rat_sub_iff | [
{
"state_after": "no goals",
"state_before": "p q x y : ℝ\nr : ℚ\nm : ℤ\nn : ℕ\n⊢ LiouvilleWith p (↑r - x) ↔ LiouvilleWith p x",
"tactic": "simp [sub_eq_add_neg]"
}
] | [
291,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Algebra/FreeAlgebra.lean | FreeAlgebra.ι_ne_zero | [] | [
466,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
465,
1
] |
Mathlib/Algebra/Order/Field/Power.lean | zpow_injective | [
{
"state_after": "case inl\nα : Type u_1\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n : ℤ\nh₀ : 0 < a\nh₁ : a ≠ 1\nH : a < 1\n⊢ Injective ((fun x x_1 => x ^ x_1) a)\n\ncase inr\nα : Type u_1\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n : ℤ\nh₀ : 0 < a\nh₁ : a ≠ 1\nH : 1 < a\n⊢ Injective ((fun ... | [
98,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/CategoryTheory/Limits/HasLimits.lean | CategoryTheory.Limits.limit.w | [] | [
174,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Data/Complex/Exponential.lean | Real.tan_mul_cos | [
{
"state_after": "no goals",
"state_before": "x✝ y x : ℝ\nhx : cos x ≠ 0\n⊢ tan x * cos x = sin x",
"tactic": "rw [tan_eq_sin_div_cos, div_mul_cancel _ hx]"
}
] | [
1230,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1229,
1
] |
Mathlib/Data/Tree.lean | Tree.height_le_numNodes | [] | [
134,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.measure_union | [] | [
129,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/CategoryTheory/Subobject/Limits.lean | CategoryTheory.Limits.imageSubobjectIso_comp_image_map | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝⁴ : Category C\nX✝ Y✝ Z✝ : C\nf✝ : X✝ ⟶ Y✝\ninst✝³ : HasImage f✝\nW X Y Z : C\nf : W ⟶ X\ninst✝² : HasImage f\ng : Y ⟶ Z\ninst✝¹ : HasImage g\nsq : Arrow.mk f ⟶ Arrow.mk g\ninst✝ : HasImageMap sq\n⊢ (imageSubobjectIso (Arrow.mk f).hom).hom ≫ ima... | [
486,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
481,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | LinearMap.compMultilinearMap_domDomCongr | [
{
"state_after": "case H\nR : Type u\nι : Type u'\nn : ℕ\nM : Fin (Nat.succ n) → Type v\nM₁ : ι → Type v₁\nM₂ : Type v₂\nM₃ : Type v₃\nM' : Type v'\ninst✝⁸ : Semiring R\ninst✝⁷ : (i : ι) → AddCommMonoid (M₁ i)\ninst✝⁶ : AddCommMonoid M₂\ninst✝⁵ : AddCommMonoid M₃\ninst✝⁴ : AddCommMonoid M'\ninst✝³ : (i : ι) → M... | [
822,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
818,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.monotone_intro | [] | [
81,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/Init/Algebra/Classes.lean | eq_of_eqv_lt | [] | [
418,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
416,
1
] |
Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean | MeasureTheory.ExistsSeqTendstoAe.exists_nat_measure_lt_two_inv | [
{
"state_after": "α : Type u_1\nι : Type ?u.11195\nE : Type u_2\nm : MeasurableSpace α\nμ : Measure α\ninst✝ : MetricSpace E\nf : ℕ → α → E\ng : α → E\nn : ℕ\nhfg : Tendsto (fun i => ↑↑μ {x | 2⁻¹ ^ n ≤ dist (f i x) (g x)}) atTop (𝓝 0)\n⊢ ∃ N, ∀ (m_1 : ℕ), m_1 ≥ N → ↑↑μ {x | 2⁻¹ ^ n ≤ dist (f m_1 x) (g x)} ≤ 2⁻... | [
154,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean | Complex.neg_pi_lt_arg | [] | [
156,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.card_neighborSet_eq_degree | [] | [
1383,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1382,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.smul_finset_inter_subset | [] | [
1669,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1668,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.zero_mul | [
{
"state_after": "no goals",
"state_before": "n m : ℕ\ninst✝ : NeZero n\nk : Fin n\n⊢ 0 * k = 0",
"tactic": "simp [eq_iff_veq, mul_def]"
}
] | [
2540,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2539,
11
] |
src/lean/Init/SizeOf.lean | Lean.Name.num.sizeOf_spec | [] | [
107,
6
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
106,
9
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.iInf_apply | [
{
"state_after": "α : Type u_2\nι : Sort u_1\ninst✝ : Nonempty ι\nm : ι → OuterMeasure α\ns : Set α\n⊢ (⨅ (t : ℕ → Set α) (_ : s ⊆ iUnion t), ∑' (n : ℕ), ⨅ (μ : OuterMeasure α) (_ : μ ∈ range m), ↑μ (t n)) =\n ⨅ (t : ℕ → Set α) (_ : s ⊆ iUnion t), ∑' (n : ℕ), ⨅ (i : ι), ↑(m i) (t n)",
"state_before": "α ... | [
1193,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1190,
1
] |
Mathlib/Data/Set/Sups.lean | Set.infs_sups_subset_right | [] | [
390,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Data/Polynomial/Reverse.lean | Polynomial.revAtFun_eq | [] | [
71,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiff.sum | [
{
"state_after": "𝕜 : Type u_2\ninst✝¹⁰ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝⁹ : NormedAddCommGroup D\ninst✝⁸ : NormedSpace 𝕜 D\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : Normed... | [
1368,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1366,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.monomial_mul_X | [
{
"state_after": "no goals",
"state_before": "R : Type u\na b : R\nm n✝ : ℕ\ninst✝ : Semiring R\np q : R[X]\nn : ℕ\nr : R\n⊢ ↑(monomial n) r * X = ↑(monomial (n + 1)) r",
"tactic": "erw [monomial_mul_monomial, mul_one]"
}
] | [
624,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
623,
1
] |
Mathlib/Data/Bitvec/Lemmas.lean | Bitvec.ofNat_succ | [] | [
70,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/Data/Bool/Set.lean | Bool.univ_eq | [] | [
27,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
26,
1
] |
Mathlib/CategoryTheory/Monad/Basic.lean | CategoryTheory.Monad.right_unit | [] | [
157,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Analysis/Convex/Slope.lean | StrictConvexOn.secant_strict_mono_aux2 | [
{
"state_after": "𝕜 : Type u_1\ninst✝ : LinearOrderedField 𝕜\ns : Set 𝕜\nf : 𝕜 → 𝕜\nhf : StrictConvexOn 𝕜 s f\nx y z : 𝕜\nhx : x ∈ s\nhz : z ∈ s\nhxy : x < y\nhyz : y < z\nhxy' : 0 < y - x\n⊢ (f y - f x) / (y - x) < (f z - f x) / (z - x)",
"state_before": "𝕜 : Type u_1\ninst✝ : LinearOrderedField 𝕜... | [
316,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/Data/Matrix/Kronecker.lean | Matrix.inv_kronecker | [
{
"state_after": "case pos\nR : Type u_3\nα : Type ?u.173346\nα' : Type ?u.173349\nβ : Type ?u.173352\nβ' : Type ?u.173355\nγ : Type ?u.173358\nγ' : Type ?u.173361\nl : Type ?u.173364\nm : Type u_1\nn : Type u_2\np : Type ?u.173373\nq : Type ?u.173376\nr : Type ?u.173379\nl' : Type ?u.173382\nm' : Type ?u.17338... | [
415,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.toFinset_subset_toFinset | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns t : Set α\na : α\nhs : Set.Finite s\nht : Set.Finite t\n⊢ Finite.toFinset hs ⊆ Finite.toFinset ht ↔ s ⊆ t",
"tactic": "simp only [← Finset.coe_subset, Finite.coe_toFinset]"
}
] | [
209,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
11
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.ker_eq_bot_of_inverse | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nR₁ : Type ?u.1227019\nR₂ : Type u_1\nR₃ : Type ?u.1227025\nR₄ : Type ?u.1227028\nS : Type ?u.1227031\nK : Type ?u.1227034\nK₂ : Type ?u.1227037\nM : Type u_3\nM' : Type ?u.1227043\nM₁ : Type ?u.1227046\nM₂ : Type u_4\nM₃ : Type ?u.1227052\nM₄ : Typ... | [
1364,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1362,
1
] |
Mathlib/Algebra/Order/ToIntervalMod.lean | toIcoDiv_zsmul_sub_toIcoMod | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedAddCommGroup α\nhα : Archimedean α\np : α\nhp : 0 < p\na✝ b✝ c : α\nn : ℤ\na b : α\n⊢ toIcoDiv hp a b • p + toIcoMod hp a b = b",
"tactic": "rw [add_comm, toIcoMod_add_toIcoDiv_zsmul]"
}
] | [
166,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Data/Finsupp/BigOperators.lean | List.mem_foldr_sup_support_iff | [
{
"state_after": "ι : Type u_2\nM : Type u_1\ninst✝¹ : DecidableEq ι\ninst✝ : Zero M\nl : List (ι →₀ M)\nx : ι\n⊢ x ∈ foldr ((fun x x_1 => x ∪ x_1) ∘ Finsupp.support) ∅ l ↔ ∃ f, f ∈ l ∧ ↑f x ≠ 0",
"state_before": "ι : Type u_2\nM : Type u_1\ninst✝¹ : DecidableEq ι\ninst✝ : Zero M\nl : List (ι →₀ M)\nx : ι\n... | [
68,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/Deprecated/Subring.lean | Ring.image_closure | [
{
"state_after": "R : Type u\ninst✝² : Ring R\ncR : Type u\ninst✝¹ : CommRing cR\ns✝ : Set R\nS : Type u_1\ninst✝ : Ring S\nf : R →+* S\ns : Set R\n⊢ ↑f '' closure s ≤ closure (↑f '' s)",
"state_before": "R : Type u\ninst✝² : Ring R\ncR : Type u\ninst✝¹ : CommRing cR\ns✝ : Set R\nS : Type u_1\ninst✝ : Ring ... | [
225,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
Mathlib/Algebra/Quaternion.lean | QuaternionAlgebra.sub_re | [] | [
270,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
9
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.iterate_le_nfp | [
{
"state_after": "f✝ : Ordinal → Ordinal\nf : Ordinal → Ordinal\na : Ordinal\nn : ℕ\n⊢ (f^[n]) a ≤ (fun a => sup fun n => (f^[n]) a) a",
"state_before": "f✝ : Ordinal → Ordinal\nf : Ordinal → Ordinal\na : Ordinal\nn : ℕ\n⊢ (f^[n]) a ≤ nfp f a",
"tactic": "rw [← sup_iterate_eq_nfp]"
},
{
"state_a... | [
440,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
438,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_finset_sum | [] | [
675,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
673,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | exists_multiset_prod_cons_le_and_prod_not_le | [
{
"state_after": "case intro\nR : Type ?u.147404\nA : Type u_1\nK : Type ?u.147410\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing A\ninst✝⁴ : Field K\ninst✝³ : IsDomain A\ninst✝² : Algebra A K\ninst✝¹ : IsFractionRing A K\ninst✝ : IsDedekindDomain A\nhNF : ¬IsField A\nI M : Ideal A\nhI0 : I ≠ ⊥\nhIM : I ≤ M\nhM : Idea... | [
394,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/Control/Applicative.lean | Applicative.pure_seq_eq_map' | [
{
"state_after": "case h\nF : Type u → Type v\ninst✝¹ : Applicative F\ninst✝ : LawfulApplicative F\nα β γ σ : Type u\nf : α → β\nx✝ : F α\n⊢ (fun x x_1 => Seq.seq x fun x => x_1) (pure f) x✝ = (fun x x_1 => x <$> x_1) f x✝",
"state_before": "F : Type u → Type v\ninst✝¹ : Applicative F\ninst✝ : LawfulApplica... | [
41,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
40,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.image_mulSingle_Icc_left | [] | [
228,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Topology/MetricSpace/MetricSeparated.lean | IsMetricSeparated.union_left_iff | [] | [
95,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Algebra/Homology/HomologicalComplex.lean | HomologicalComplex.xPrevIso_comp_dTo | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nV : Type u\ninst✝¹ : Category V\ninst✝ : HasZeroMorphisms V\nc : ComplexShape ι\nC : HomologicalComplex V c\ni j : ι\nr : ComplexShape.Rel c i j\n⊢ (xPrevIso C r).inv ≫ dTo C j = d C i j",
"tactic": "simp [C.dTo_eq r]"
}
] | [
432,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
431,
1
] |
Mathlib/Topology/Order.lean | isOpen_induced_eq | [] | [
867,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
865,
1
] |
Mathlib/Algebra/Module/Torsion.lean | Ideal.quotTorsionOfEquivSpanSingleton_apply_mk | [] | [
147,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Topology/Inseparable.lean | subtype_inseparable_iff | [] | [
320,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.infinitePos_iff_infinite_of_nonneg | [] | [
508,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
507,
1
] |
Mathlib/LinearAlgebra/Projection.lean | LinearMap.ofIsCompl_add | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\ninst✝⁹ : Ring R\nE : Type u_1\ninst✝⁸ : AddCommGroup E\ninst✝⁷ : Module R E\nF : Type u_3\ninst✝⁶ : AddCommGroup F\ninst✝⁵ : Module R F\nG : Type ?u.281059\ninst✝⁴ : AddCommGroup G\ninst✝³ : Module R G\np q : Submodule R E\nS : Type ?u.282022\ninst... | [
265,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Data/List/Dedup.lean | List.dedup_eq_self | [] | [
80,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/Data/PNat/Basic.lean | PNat.coe_bit0 | [] | [
267,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | EMetric.hausdorffEdist_image | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.44562\nα : Type u\nβ : Type v\ninst✝¹ : PseudoEMetricSpace α\ninst✝ : PseudoEMetricSpace β\nx y : α\ns t u : Set α\nΦ : α → β\nh : Isometry Φ\n⊢ hausdorffEdist (Φ '' s) (Φ '' t) = hausdorffEdist s t",
"tactic": "simp only [hausdorffEdist_def, iSu... | [
342,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.sizeUpTo_succ | [
{
"state_after": "n : ℕ\nc : Composition n\ni : ℕ\nh : i < length c\n⊢ sum (take (i + 1) c.blocks) = sum (take i c.blocks) + nthLe c.blocks i h",
"state_before": "n : ℕ\nc : Composition n\ni : ℕ\nh : i < length c\n⊢ sizeUpTo c (i + 1) = sizeUpTo c i + nthLe c.blocks i h",
"tactic": "simp only [sizeUpTo]... | [
240,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
src/lean/Init/Data/Nat/Bitwise.lean | Nat.bitwise_rec_lemma | [] | [
14,
68
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
13,
1
] |
Mathlib/RepresentationTheory/Action.lean | Action.functorCategoryMonoidalEquivalence.functor_map | [] | [
697,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
695,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.principal_eq_iff_eq | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.78074\nι : Sort x\nf g : Filter α\ns✝ t✝ s t : Set α\n⊢ s ⊆ t ∧ t ⊆ s ↔ s ≤ t ∧ t ≤ s",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.78074\nι : Sort x\nf g : Filter α\ns✝ t✝ s t : Set α\n⊢ 𝓟 s = 𝓟 t ↔ s = t",
"tactic... | [
662,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
661,
9
] |
Mathlib/CategoryTheory/Limits/Preserves/Shapes/Biproducts.lean | CategoryTheory.Limits.biproduct.map_lift_mapBiprod | [
{
"state_after": "case w\nC : Type u₁\ninst✝⁶ : Category C\nD : Type u₂\ninst✝⁵ : Category D\ninst✝⁴ : HasZeroMorphisms C\ninst✝³ : HasZeroMorphisms D\nF : C ⥤ D\ninst✝² : PreservesZeroMorphisms F\nJ : Type w₁\nf : J → C\ninst✝¹ : HasBiproduct f\ninst✝ : PreservesBiproduct f F\nW : C\ng : (j : J) → W ⟶ f j\n⊢ ∀... | [
427,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean | BoxIntegral.Box.mem_splitCenterBox | [
{
"state_after": "ι : Type u_1\nI J : Box ι\ns : Set ι\ny : ι → ℝ\n⊢ (∀ (i : ι),\n y i ∈\n Set.Ioc (Set.piecewise s (fun i => (lower I i + upper I i) / 2) I.lower i)\n (Set.piecewise s I.upper (fun i => (lower I i + upper I i) / 2) i)) ↔\n ∀ (x : ι), y x ∈ Set.Ioc (lower I x) (upper I x)... | [
65,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/Data/PFun.lean | PFun.coe_val | [] | [
148,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/RingTheory/Localization/FractionRing.lean | IsFractionRing.mul_inv_cancel | [
{
"state_after": "R : Type ?u.66348\ninst✝¹⁰ : CommRing R\nM : Submonoid R\nS : Type ?u.66540\ninst✝⁹ : CommRing S\ninst✝⁸ : Algebra R S\nP : Type ?u.66777\ninst✝⁷ : CommRing P\nA : Type u_2\ninst✝⁶ : CommRing A\ninst✝⁵ : IsDomain A\nK : Type u_1\ninst✝⁴ : CommRing K\ninst✝³ : Algebra R K\ninst✝² : IsFractionRi... | [
135,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
11
] |
Mathlib/Data/Set/Lattice.lean | Set.biUnion_union | [] | [
982,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
980,
1
] |
Mathlib/CategoryTheory/Limits/IsLimit.lean | CategoryTheory.Limits.IsLimit.uniq_cone_morphism | [
{
"state_after": "J : Type u₁\ninst✝² : Category J\nK : Type u₂\ninst✝¹ : Category K\nC : Type u₃\ninst✝ : Category C\nF : J ⥤ C\ns t : Cone F\nh : IsLimit t\nf f' g : s ⟶ t\n⊢ g = liftConeMorphism h s",
"state_before": "J : Type u₁\ninst✝² : Category J\nK : Type u₂\ninst✝¹ : Category K\nC : Type u₃\ninst✝ ... | [
108,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
1
] |
Mathlib/Probability/ConditionalProbability.lean | ProbabilityTheory.cond_inter_self | [
{
"state_after": "no goals",
"state_before": "Ω : Type u_1\nm : MeasurableSpace Ω\nμ : MeasureTheory.Measure Ω\ns t✝ : Set Ω\nhms : MeasurableSet s\nt : Set Ω\n⊢ ↑↑(μ[|s]) (s ∩ t) = ↑↑(μ[|s]) t",
"tactic": "rw [cond_apply _ hms, ← Set.inter_assoc, Set.inter_self, ← cond_apply _ hms]"
}
] | [
110,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.preimage_closure | [] | [
636,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
635,
1
] |
Mathlib/Analysis/NormedSpace/Banach.lean | LinearEquiv.coeFn_toContinuousLinearEquivOfContinuous | [] | [
348,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/MeasureTheory/Measure/AEMeasurable.lean | AEMeasurable.iUnion | [] | [
136,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
11
] |
Mathlib/Algebra/Order/LatticeGroup.lean | LatticeOrderedCommGroup.inv_le_neg | [] | [
252,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
251,
1
] |
Mathlib/Algebra/GradedMulAction.lean | SetLike.Homogeneous.graded_smul | [] | [
160,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.neighborSet_subgraphOfAdj | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.224643\nV : Type u\nW : Type v\nG : SimpleGraph V\nG' : SimpleGraph W\ninst✝ : DecidableEq V\nu v w : V\nhvw : Adj G v w\n⊢ Subgraph.neighborSet (subgraphOfAdj G hvw) u = (if u = v then {w} else ∅) ∪ if u = w then {v} else ∅",
"tactic": "split_if... | [
965,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
963,
1
] |
Mathlib/Algebra/Group/Opposite.lean | AddOpposite.op_pow | [] | [
311,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
310,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.