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/SetIntegral.lean | MeasureTheory.integral_Iic_eq_integral_Iio' | [] | [
637,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
635,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | HasDerivWithinAt.neg | [] | [
209,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
8
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.radical_eq_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u\nι : Type ?u.315914\ninst✝ : CommSemiring R\nI J K L : Ideal R\n⊢ radical I = I ↔ IsRadical I",
"tactic": "rw [le_antisymm_iff, and_iff_left le_radical, IsRadical]"
}
] | [
865,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
864,
1
] |
Mathlib/Tactic/CancelDenoms.lean | CancelDenoms.add_subst | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : Ring α\nn e1 e2 t1 t2 : α\nh1 : n * e1 = t1\nh2 : n * e2 = t2\n⊢ n * (e1 + e2) = t1 + t2",
"tactic": "simp [left_distrib, *]"
}
] | [
54,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.tendsto_abs_atTop_atTop | [] | [
934,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
933,
1
] |
Mathlib/Data/Rat/BigOperators.lean | Rat.cast_multiset_prod | [] | [
55,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.factorization_lt | [
{
"state_after": "case pos\nn p : ℕ\nhn : n ≠ 0\npp : Prime p\n⊢ ↑(factorization n) p < n\n\ncase neg\nn p : ℕ\nhn : n ≠ 0\npp : ¬Prime p\n⊢ ↑(factorization n) p < n",
"state_before": "n p : ℕ\nhn : n ≠ 0\n⊢ ↑(factorization n) p < n",
"tactic": "by_cases pp : p.Prime"
},
{
"state_after": "case p... | [
437,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
430,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.map_iInf_le | [] | [
1224,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1222,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | Algebra.algebra_ext | [
{
"state_after": "R✝ : Type u\nS : Type v\nA✝ : Type w\nB : Type ?u.159950\ninst✝⁷ : CommSemiring R✝\ninst✝⁶ : CommSemiring S\ninst✝⁵ : Semiring A✝\ninst✝⁴ : Algebra R✝ A✝\ninst✝³ : Semiring B\ninst✝² : Algebra R✝ B\nR : Type u_1\ninst✝¹ : CommSemiring R\nA : Type u_2\ninst✝ : Semiring A\nP Q : Algebra R A\nh :... | [
334,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.injective_iff_hasLeftInverse | [] | [
475,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
474,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | Submodule.finrank_lt_finrank_of_lt | [] | [
1124,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1121,
1
] |
Mathlib/Analysis/SpecialFunctions/Sqrt.lean | Differentiable.sqrt | [] | [
148,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | smul_ball'' | [
{
"state_after": "case h\n𝓕 : Type ?u.1010449\n𝕜 : Type ?u.1010452\nα : Type ?u.1010455\nι : Type ?u.1010458\nκ : Type ?u.1010461\nE : Type u_1\nF : Type ?u.1010467\nG : Type ?u.1010470\ninst✝¹ : SeminormedCommGroup E\ninst✝ : SeminormedCommGroup F\na a₁ a₂ b b₁ b₂ : E\nr r₁ r₂ : ℝ\nx✝ : E\n⊢ x✝ ∈ a • ball b ... | [
1607,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1604,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | Class.coe_mem | [] | [
1623,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1622,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPushout.of_bot | [] | [
740,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
736,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.disjoint_of_erase_left | [
{
"state_after": "α : Type u_1\nβ : Type ?u.250835\nγ : Type ?u.250838\ninst✝ : DecidableEq α\ns t u v : Finset α\na b : α\nha : ¬a ∈ t\nhst : _root_.Disjoint (erase s a) t\n⊢ ¬a ∈ erase s a ∧ _root_.Disjoint (erase s a) t",
"state_before": "α : Type u_1\nβ : Type ?u.250835\nγ : Type ?u.250838\ninst✝ : Deci... | [
2236,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2234,
1
] |
Mathlib/LinearAlgebra/Eigenspace/Basic.lean | Module.End.hasEigenvalue_iff_mem_spectrum | [
{
"state_after": "no goals",
"state_before": "K R : Type v\nV M : Type w\ninst✝⁶ : CommRing R\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : Module R M\ninst✝³ : Field K\ninst✝² : AddCommGroup V\ninst✝¹ : Module K V\ninst✝ : FiniteDimensional K V\nf : End K V\nμ : K\nh : μ ∈ spectrum K f\n⊢ HasEigenvalue f μ",
"tac... | [
125,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/Topology/Algebra/Module/Multilinear.lean | ContinuousMultilinearMap.prod_apply | [] | [
248,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/Algebra/Order/Rearrangement.lean | Monovary.sum_smul_comp_perm_eq_sum_smul_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nα : Type u_2\nβ : Type u_3\ninst✝⁴ : LinearOrderedRing α\ninst✝³ : LinearOrderedAddCommGroup β\ninst✝² : Module α β\ninst✝¹ : OrderedSMul α β\ns : Finset ι\nσ : Perm ι\nf : ι → α\ng : ι → β\ninst✝ : Fintype ι\nhfg : Monovary f g\n⊢ ∑ i : ι, f i • g... | [
257,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/Data/Set/Pairwise/Basic.lean | pairwise_disjoint_on_bool | [] | [
50,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/LinearAlgebra/Dual.lean | Basis.toDual_apply_left | [
{
"state_after": "no goals",
"state_before": "R : Type u\nM : Type v\nK : Type u₁\nV : Type u₂\nι : Type w\ninst✝³ : CommSemiring R\ninst✝² : AddCommMonoid M\ninst✝¹ : Module R M\ninst✝ : DecidableEq ι\nb : Basis ι R M\nm : M\ni : ι\n⊢ ↑(↑(toDual b) m) (↑b i) = ↑(↑b.repr m) i",
"tactic": "rw [← b.toDual... | [
324,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/LinearAlgebra/Finrank.lean | finrank_eq_one | [
{
"state_after": "K : Type u\nV : Type v\ninst✝⁴ : Ring K\ninst✝³ : AddCommGroup V\ninst✝² : Module K V\ninst✝¹ : NoZeroSMulDivisors K V\ninst✝ : StrongRankCondition K\nv : V\nn : v ≠ 0\nh : ∀ (w : V), ∃ c, c • v = w\nthis : Nontrivial K\n⊢ finrank K V = 1",
"state_before": "K : Type u\nV : Type v\ninst✝⁴ :... | [
503,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
500,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.Rel.trans | [
{
"state_after": "case empty\nα : Type u_1\nβ : Type ?u.476292\nγ : Type ?u.476295\nδ : Type ?u.476298\nr✝ : α → β → Prop\np : γ → δ → Prop\nr : α → α → Prop\ninst✝ : IsTrans α r\ns✝ t u✝ : Multiset α\nr1✝ : Rel r s✝ t\nr2✝ : Rel r t u✝\ns u : Multiset α\nr1 : Rel r s 0\nr2 : Rel r 0 u\n⊢ Rel r s u\n\ncase cons... | [
2833,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2827,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.norm_single | [
{
"state_after": "α : Type u_2\nE : α → Type u_1\np q : ℝ≥0∞\ninst✝⁴ : (i : α) → NormedAddCommGroup (E i)\n𝕜 : Type ?u.912341\ninst✝³ : NormedRing 𝕜\ninst✝² : (i : α) → Module 𝕜 (E i)\ninst✝¹ : ∀ (i : α), BoundedSMul 𝕜 (E i)\ninst✝ : DecidableEq α\nhp : 0 < ENNReal.toReal p\nf : (i : α) → E i\ni : α\n⊢ (fun... | [
1052,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1049,
11
] |
Mathlib/Data/Fintype/Fin.lean | Fin.map_valEmbedding_univ | [
{
"state_after": "case a\nα : Type ?u.10\nβ : Type ?u.13\nn a✝ : ℕ\n⊢ a✝ ∈ map valEmbedding univ ↔ a✝ ∈ Iio n",
"state_before": "α : Type ?u.10\nβ : Type ?u.13\nn : ℕ\n⊢ map valEmbedding univ = Iio n",
"tactic": "ext"
},
{
"state_after": "no goals",
"state_before": "case a\nα : Type ?u.10\nβ... | [
30,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
28,
1
] |
Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | QuadraticForm.polar_add_left_iff | [
{
"state_after": "S : Type ?u.8733\nR : Type u_1\nR₁ : Type ?u.8739\nM : Type u_2\ninst✝² : Ring R\ninst✝¹ : CommRing R₁\ninst✝ : AddCommGroup M\nf : M → R\nx x' y : M\n⊢ polar f (x + x') y = polar f x y + polar f x' y ↔\n f (x + x' + y) + f x + f x' + f y = f (x + x') + f (x' + y) + f (y + x)",
"state_b... | [
119,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_split_single | [] | [
1438,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1437,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Log.lean | ContinuousWithinAt.clog | [] | [
266,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.aeval_eq_zero_of_mem_rootSet | [] | [
967,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
965,
1
] |
Mathlib/Data/Rel.lean | Rel.comp_left_id | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.11645\nr✝ r : Rel α β\n⊢ (fun x z => ∃ y, x = y ∧ r y z) = r",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.11645\nr✝ r : Rel α β\n⊢ Eq • r = r",
"tactic": "unfold comp"
},
{
"state_after": "case a.h.a\nα : Type u_1\nβ : Type ... | [
117,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | uniformContinuous_comap' | [] | [
1322,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1320,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | Submodule.finrank_le_one_iff_isPrincipal | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV : Type v\ninst✝³ : DivisionRing K\ninst✝² : AddCommGroup V\ninst✝¹ : Module K V\nW : Submodule K V\ninst✝ : FiniteDimensional K { x // x ∈ W }\n⊢ finrank K { x // x ∈ W } ≤ 1 ↔ IsPrincipal W",
"tactic": "rw [← W.rank_le_one_iff_isPrincipal, ← f... | [
1310,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1308,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.isCountablyGenerated_seq | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.110071\nι : Type ?u.110074\nι' : Sort ?u.110077\ninst✝ : Countable β\nx : β → Set α\n⊢ (⨅ (i : β), 𝓟 (x i)) = generate (range x)",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.110071\nι : Type ?u.110074\nι' : Sort ?u.110077\ninst✝ : Coun... | [
1151,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1148,
1
] |
Mathlib/CategoryTheory/ConcreteCategory/Bundled.lean | CategoryTheory.Bundled.coe_mk | [] | [
60,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Mul.lean | HasFDerivWithinAt.smul_const | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝¹² : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝¹¹ : NormedAddCommGroup E\ninst✝¹⁰ : NormedSpace 𝕜 E\nF : Type u_4\ninst✝⁹ : NormedAddCommGroup F\ninst✝⁸ : NormedSpace 𝕜 F\nG : Type ?u.579358\ninst✝⁷ : NormedAddCommGroup G\ninst✝⁶ : Nor... | [
236,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Std/Data/List/Lemmas.lean | List.diff_eq_foldl | [] | [
1520,
65
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1518,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.bijOn_iUnion | [] | [
1625,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1623,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.list_sum_mem | [] | [
295,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
11
] |
Std/Data/List/Lemmas.lean | List.dropLast_single | [] | [
486,
59
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
486,
9
] |
Mathlib/Order/Compare.lean | cmp_swap | [
{
"state_after": "α : Type u_1\nβ : Type ?u.12785\ninst✝¹ : Preorder α\ninst✝ : DecidableRel fun x x_1 => x < x_1\na b : α\n⊢ swap (if (fun x x_1 => x < x_1) a b then lt else if (fun x x_1 => x < x_1) b a then gt else eq) =\n if (fun x x_1 => x < x_1) b a then lt else if (fun x x_1 => x < x_1) a b then gt el... | [
183,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/GroupTheory/Subgroup/Pointwise.lean | Subgroup.iSup_induction' | [
{
"state_after": "α : Type ?u.12999\nG : Type u_2\nA : Type ?u.13005\nS✝ : Type ?u.13008\ninst✝¹ : Group G\ninst✝ : AddGroup A\ns : Set G\nι : Sort u_1\nS : ι → Subgroup G\nC : (x : G) → (x ∈ ⨆ (i : ι), S i) → Prop\nhp : ∀ (i : ι) (x : G) (hx : x ∈ S i), C x (_ : x ∈ ⨆ (i : ι), S i)\nh1 : C 1 (_ : 1 ∈ ⨆ (i : ι)... | [
138,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | modelWithCornersSelf_localEquiv | [] | [
378,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
377,
1
] |
Mathlib/Data/List/Basic.lean | List.foldrRecOn_nil | [] | [
2576,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2574,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.val_one_eq_one_mod | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ val 1 = 1 % n",
"tactic": "rw [← Nat.cast_one, val_nat_cast]"
}
] | [
589,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
588,
1
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.ofReal_mul_im | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\nE : Type ?u.2038230\ninst✝ : IsROrC K\nr : ℝ\nz : K\n⊢ ↑im (↑r * z) = r * ↑im z",
"tactic": "simp only [add_zero, ofReal_im, zero_mul, ofReal_re, mul_im]"
}
] | [
280,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/MeasureTheory/Function/UniformIntegrable.lean | MeasureTheory.unifIntegrable_fin | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nι : Type ?u.187575\nm : MeasurableSpace α\nμ : Measure α\ninst✝ : NormedAddCommGroup β\np : ℝ≥0∞\nf : α → β\nhp_one : 1 ≤ p\nhp_top : p ≠ ⊤\nn : ℕ\n⊢ ∀ {f : Fin n → α → β}, (∀ (i : Fin n), Memℒp (f i) p) → UnifIntegrable f p μ",
"state_before": "α : Type u_2\nβ ... | [
449,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
426,
1
] |
Mathlib/Topology/StoneCech.lean | convergent_eqv_pure | [
{
"state_after": "α : Type u\ninst✝ : TopologicalSpace α\nu : Ultrafilter α\nx : α\nux : ↑u ≤ 𝓝 x\nγ : Type u\ntγ : TopologicalSpace γ\nh₁ : T2Space γ\nh₂ : CompactSpace γ\nf : α → γ\nhf : Continuous f\n⊢ Ultrafilter.extend f u = Ultrafilter.extend f (pure x)",
"state_before": "α : Type u\ninst✝ : Topologi... | [
302,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.comap_inf | [] | [
1676,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1674,
1
] |
Mathlib/Order/Monotone/Basic.lean | Nat.rel_of_forall_rel_succ_of_le | [] | [
987,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
985,
1
] |
Mathlib/Algebra/Opposites.lean | AddOpposite.op_eq_one_iff | [] | [
383,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
382,
1
] |
Mathlib/Data/Fintype/Basic.lean | Fin.univ_succAbove | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.106203\nβ : Type ?u.106206\nγ : Type ?u.106209\nn : ℕ\np : Fin (n + 1)\n⊢ ¬p ∈ map (succAbove p).toEmbedding univ",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before": "α : Type ?u.106203\nβ : Type ?u.106206\nγ : Type ?u.... | [
850,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
848,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.mul_le_right_iff_opow_omega_dvd | [
{
"state_after": "a b : Ordinal\nha : 0 < a\n⊢ a * b ≤ b ↔ a * b = b",
"state_before": "a b : Ordinal\nha : 0 < a\n⊢ a * b ≤ b ↔ a ^ ω ∣ b",
"tactic": "rw [← mul_eq_right_iff_opow_omega_dvd]"
},
{
"state_after": "no goals",
"state_before": "a b : Ordinal\nha : 0 < a\n⊢ a * b ≤ b ↔ a * b = b"... | [
697,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
694,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | Localization.neg_mk | [
{
"state_after": "R : Type u_1\ninst✝³ : CommRing R\nM : Submonoid R\nS : Type ?u.2960505\ninst✝² : CommRing S\ninst✝¹ : Algebra R S\nP : Type ?u.2960742\ninst✝ : CommRing P\na : R\nb : { x // x ∈ M }\n⊢ Localization.neg (mk a b) = mk (-a) b",
"state_before": "R : Type u_1\ninst✝³ : CommRing R\nM : Submonoi... | [
1116,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1113,
1
] |
Mathlib/RingTheory/Ideal/Quotient.lean | Ideal.Quotient.factor_mk | [] | [
298,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
297,
1
] |
Std/Data/Int/Lemmas.lean | Int.add_pos_of_nonneg_of_pos | [] | [
829,
52
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
828,
11
] |
Mathlib/ModelTheory/ElementaryMaps.lean | FirstOrder.Language.ElementaryEmbedding.comp_assoc | [] | [
244,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Comp.lean | fderivWithin_fderivWithin | [
{
"state_after": "𝕜 : Type u_3\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_1\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_2\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type u_4\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nG' : Type ?u.85620\ninst✝¹... | [
154,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | EMetric.diam_pair | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.296438\ninst✝ : PseudoEMetricSpace α\nx y z : α\nε ε₁ ε₂ : ℝ≥0∞\ns t : Set α\n⊢ diam {x, y} = edist x y",
"tactic": "simp only [iSup_singleton, diam_insert, diam_singleton, ENNReal.max_zero_right]"
}
] | [
930,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
929,
1
] |
Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean | ModuleCat.monoidalClosed_pre_app | [] | [
107,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | contDiffOn_top_iff_fderivWithin | [
{
"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✝¹ : ... | [
1171,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1159,
1
] |
Mathlib/MeasureTheory/Constructions/Polish.lean | MeasureTheory.AnalyticSet.image_of_continuousOn | [
{
"state_after": "case intro.intro.intro.intro.intro\nα : Type u_2\ninst✝¹ : TopologicalSpace α\nι : Type ?u.3371\nβ : Type u_1\ninst✝ : TopologicalSpace β\ns : Set α\nhs : AnalyticSet s\nf : α → β\nhf : ContinuousOn f s\nγ : Type\nγtop : TopologicalSpace γ\nγpolish : PolishSpace γ\ng : γ → α\ng_cont : Continuo... | [
138,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Order/Bounds/Basic.lean | BddBelow.dual | [] | [
151,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Analysis/SpecialFunctions/Polynomials.lean | Polynomial.eventually_no_roots | [] | [
38,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.eval₂_assoc | [
{
"state_after": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np✝ q✝ : MvPolynomial σ R\nf : R →+* S₁\ng : σ → S₁\nq : S₂ → MvPolynomial σ R\np : MvPolynomial S₂ R\n⊢ eval₂ f (fun t => eval₂ f g (q ... | [
1113,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1110,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.biUnion_and' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.89841\nγ : Type ?u.89844\nι : Sort u_2\nι' : Sort u_3\nι₂ : Sort ?u.89853\nκ : ι → Sort ?u.89858\nκ₁ : ι → Sort ?u.89863\nκ₂ : ι → Sort ?u.89868\nκ' : ι' → Sort ?u.89873\np : ι' → Prop\nq : ι → ι' → Prop\ns : (x : ι) → (y : ι') → p y ∧ ... | [
817,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
814,
1
] |
Mathlib/Analysis/Calculus/Dslope.lean | ContinuousWithinAt.of_dslope | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\ninst✝² : NontriviallyNormedField 𝕜\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nf : 𝕜 → E\na b : 𝕜\ns : Set 𝕜\nh : ContinuousWithinAt (dslope f a) s b\nthis : ContinuousWithinAt (fun x => (x - a) • dslope f a x + f a) s b\n⊢ ContinuousWithinAt f s ... | [
98,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.coprime_ord_compl | [] | [
538,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
537,
1
] |
Mathlib/RingTheory/Ideal/Basic.lean | Ideal.span_singleton_eq_bot | [] | [
195,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | differentiableWithinAt_inter' | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_2\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_1\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.307858\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed... | [
591,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.zero_toNNReal | [] | [
236,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
236,
9
] |
Mathlib/Analysis/Normed/Group/Basic.lean | continuous_norm' | [
{
"state_after": "no goals",
"state_before": "𝓕 : Type ?u.460050\n𝕜 : Type ?u.460053\nα : Type ?u.460056\nι : Type ?u.460059\nκ : Type ?u.460062\nE : Type u_1\nF : Type ?u.460068\nG : Type ?u.460071\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na a₁ a₂ b b₁... | [
1093,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1092,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.Theory.realize_sentence_of_mem | [] | [
822,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
821,
1
] |
Mathlib/GroupTheory/Perm/Basic.lean | Equiv.Perm.sigmaCongrRightHom_injective | [
{
"state_after": "α✝ : Type u\nβ✝ : Type v\nα : Type u_1\nβ : α → Type u_2\nx y : (a : α) → Perm (β a)\nh : ↑(sigmaCongrRightHom β) x = ↑(sigmaCongrRightHom β) y\n⊢ x = y",
"state_before": "α✝ : Type u\nβ✝ : Type v\nα : Type u_1\nβ : α → Type u_2\n⊢ Function.Injective ↑(sigmaCongrRightHom β)",
"tactic":... | [
274,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.one_eq_mk | [] | [
529,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
528,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean | measurableSet_region_between_cc | [
{
"state_after": "α : Type u_1\ninst✝ : MeasurableSpace α\nμ : MeasureTheory.Measure α\nf g : α → ℝ\ns : Set α\nhf : Measurable f\nhg : Measurable g\nhs : MeasurableSet s\n⊢ MeasurableSet ({a | a.fst ∈ s} ∩ {a | a.snd ∈ {a_1 | f a.fst ≤ a_1} ∩ {a_1 | a_1 ≤ g a.fst}})",
"state_before": "α : Type u_1\ninst✝ :... | [
526,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
518,
1
] |
Mathlib/Data/Finset/Powerset.lean | Finset.not_mem_of_mem_powerset_of_not_mem | [
{
"state_after": "α : Type u_1\ns✝ t✝ s t : Finset α\na : α\nht : t ∈ powerset s\nh : ¬a ∈ s\n⊢ a ∈ t → a ∈ s",
"state_before": "α : Type u_1\ns✝ t✝ s t : Finset α\na : α\nht : t ∈ powerset s\nh : ¬a ∈ s\n⊢ ¬a ∈ t",
"tactic": "apply mt _ h"
},
{
"state_after": "no goals",
"state_before": "α ... | [
98,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.pi_univ_uIcc | [] | [
289,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
288,
1
] |
Mathlib/Data/Finite/Card.lean | Finite.card_subtype_lt | [
{
"state_after": "α : Type u_1\nβ : Type ?u.6560\nγ : Type ?u.6563\ninst✝ : Finite α\np : α → Prop\nx : α\nhx : ¬p x\nthis : Fintype α\n⊢ Nat.card { x // p x } < Nat.card α",
"state_before": "α : Type u_1\nβ : Type ?u.6560\nγ : Type ?u.6563\ninst✝ : Finite α\np : α → Prop\nx : α\nhx : ¬p x\n⊢ Nat.card { x /... | [
191,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/RingTheory/HahnSeries.lean | HahnSeries.coeff_inj | [] | [
86,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.disjoint_sUnion_right | [] | [
2108,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2106,
1
] |
Mathlib/Analysis/Convex/Between.lean | Wbtw.left_mem_image_Ici_of_right_ne | [] | [
744,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
742,
1
] |
Mathlib/Data/List/Perm.lean | List.subperm_ext_iff | [
{
"state_after": "α : Type uu\nβ : Type vv\nl₁✝ l₂✝ : List α\ninst✝ : DecidableEq α\nl₁ l₂ : List α\nh : ∀ (x : α), x ∈ l₁ → count x l₁ ≤ count x l₂\n⊢ l₁ <+~ l₂",
"state_before": "α : Type uu\nβ : Type vv\nl₁✝ l₂✝ : List α\ninst✝ : DecidableEq α\nl₁ l₂ : List α\n⊢ l₁ <+~ l₂ ↔ ∀ (x : α), x ∈ l₁ → count x l₁... | [
923,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
918,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ico_subset_Ico_left | [] | [
183,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Data/Polynomial/Inductions.lean | Polynomial.degree_divX_lt | [
{
"state_after": "R : Type u\nS : Type v\nT : Type w\nA : Type z\na b : R\nn : ℕ\ninst✝ : Semiring R\np q : R[X]\nhp0 : p ≠ 0\nthis : Nontrivial R\n⊢ degree (divX p) < degree p",
"state_before": "R : Type u\nS : Type v\nT : Type w\nA : Type z\na b : R\nn : ℕ\ninst✝ : Semiring R\np q : R[X]\nhp0 : p ≠ 0\n⊢ d... | [
97,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/Data/PNat/Basic.lean | PNat.dvd_one_iff | [] | [
443,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.sdiff_subset | [] | [
2199,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2198,
1
] |
Std/Data/List/Lemmas.lean | List.forall_mem_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\np : α → Prop\na : α\n⊢ (∀ (x : α), x ∈ [a] → p x) ↔ p a",
"tactic": "simp only [mem_singleton, forall_eq]"
}
] | [
221,
39
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
220,
1
] |
Mathlib/Data/Nat/Parity.lean | Nat.even_iff | [
{
"state_after": "no goals",
"state_before": "m✝ n : ℕ\nx✝ : Even n\nm : ℕ\nhm : n = m + m\n⊢ n % 2 = 0",
"tactic": "simp [← two_mul, hm]"
},
{
"state_after": "no goals",
"state_before": "m n : ℕ\nh : n % 2 = 0\n⊢ n % 2 + 2 * (n / 2) = n / 2 + n / 2",
"tactic": "simp [← two_mul, h]"
}
... | [
42,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
40,
1
] |
Std/Data/List/Lemmas.lean | List.isInfix.filter | [
{
"state_after": "case intro.intro\nα : Type u_1\np : α → Bool\nl₁ xs ys : List α\n⊢ List.filter p l₁ <:+: List.filter p (xs ++ l₁ ++ ys)",
"state_before": "α : Type u_1\np : α → Bool\nl₁ l₂ : List α\nh : l₁ <:+: l₂\n⊢ List.filter p l₁ <:+: List.filter p l₂",
"tactic": "obtain ⟨xs, ys, rfl⟩ := h"
},
... | [
1749,
58
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1746,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion_nonempty_index | [] | [
731,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
729,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | Set.finrank_mono | [] | [
1160,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1158,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.cast_int_cast | [] | [
360,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.comp_assoc | [] | [
835,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
831,
1
] |
Mathlib/Algebra/GroupPower/Order.lean | pow_le_pow' | [
{
"state_after": "no goals",
"state_before": "β : Type ?u.15072\nA : Type ?u.15075\nG : Type ?u.15078\nM : Type u_1\nR : Type ?u.15084\ninst✝² : Monoid M\ninst✝¹ : Preorder M\ninst✝ : CovariantClass M M (fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\nx a : M\nn m : ℕ\nha : 1 ≤ a\nh : n ≤ m\nk : ℕ\nhk : n + k =... | [
72,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Std/Data/Int/Lemmas.lean | Int.add_sub_assoc | [
{
"state_after": "no goals",
"state_before": "a b c : Int\n⊢ a + b - c = a + (b - c)",
"tactic": "rw [Int.sub_eq_add_neg, Int.add_assoc, ← Int.sub_eq_add_neg]"
}
] | [
492,
63
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
491,
11
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.comap_iInf | [] | [
1024,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1022,
1
] |
Mathlib/Algebra/Order/Interval.lean | NonemptyInterval.toProd_pow | [] | [
255,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean | Matrix.eval_det | [
{
"state_after": "R : Type u\ninst✝³ : CommRing R\nn G : Type v\ninst✝² : DecidableEq n\ninst✝¹ : Fintype n\nα β : Type v\ninst✝ : DecidableEq α\nM✝ : Matrix n n R\nM : Matrix n n R[X]\nr : R\n⊢ det (↑(RingHom.mapMatrix (eval₂RingHom (RingHom.id R) r)) M) = det (eval (↑(scalar n) r) (↑matPolyEquiv M))",
"st... | [
192,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
1
] |
Mathlib/Topology/StoneCech.lean | denseRange_stoneCechUnit | [] | [
259,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
258,
1
] |
Mathlib/Algebra/Lie/Subalgebra.lean | LieHom.mem_range_self | [] | [
322,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
321,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.