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/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.toContinuousLinearEquiv_inj | [] | [
705,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
703,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | Left.mul_le_one | [] | [
602,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
600,
1
] |
Mathlib/Data/Matrix/Kronecker.lean | Matrix.kroneckerMap_apply | [] | [
69,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
67,
1
] |
Mathlib/Order/Basic.lean | Subtype.coe_le_coe | [] | [
1145,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1144,
1
] |
Mathlib/Data/Real/NNReal.lean | NNReal.le_iInf_mul | [
{
"state_after": "ι : Sort u_1\nf : ι → ℝ≥0\ninst✝ : Nonempty ι\na : ℝ≥0\ng : ι → ℝ≥0\nh : ℝ≥0\nH : ∀ (i : ι), a ≤ g i * h\n⊢ a ≤ ⨅ (i : ι), g i * h",
"state_before": "ι : Sort u_1\nf : ι → ℝ≥0\ninst✝ : Nonempty ι\na : ℝ≥0\ng : ι → ℝ≥0\nh : ℝ≥0\nH : ∀ (i : ι), a ≤ g i * h\n⊢ a ≤ iInf g * h",
"tactic": "... | [
1003,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1001,
1
] |
Std/Data/List/Lemmas.lean | List.not_mem_range_self | [
{
"state_after": "no goals",
"state_before": "n : Nat\n⊢ ¬n ∈ range n",
"tactic": "simp"
}
] | [
1916,
62
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1916,
1
] |
Mathlib/Geometry/Manifold/LocalInvariantProperties.lean | StructureGroupoid.LocalInvariantProp.liftProp_of_locally_liftPropOn | [
{
"state_after": "H : Type u_2\nM : Type u_1\nH' : Type u_3\nM' : Type u_4\nX : Type ?u.39327\ninst✝⁶ : TopologicalSpace H\ninst✝⁵ : TopologicalSpace M\ninst✝⁴ : ChartedSpace H M\ninst✝³ : TopologicalSpace H'\ninst✝² : TopologicalSpace M'\ninst✝¹ : ChartedSpace H' M'\ninst✝ : TopologicalSpace X\nG : StructureGr... | [
399,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
395,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | deriv_sub_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 : Filter �... | [
347,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/Data/Int/GCD.lean | Int.lcm_def | [] | [
239,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/LinearAlgebra/Eigenspace/IsAlgClosed.lean | Module.End.exists_eigenvalue | [
{
"state_after": "K : Type v\nV : Type w\ninst✝⁵ : Field K\ninst✝⁴ : AddCommGroup V\ninst✝³ : Module K V\ninst✝² : IsAlgClosed K\ninst✝¹ : FiniteDimensional K V\ninst✝ : Nontrivial V\nf : End K V\n⊢ ∃ c, c ∈ spectrum K f",
"state_before": "K : Type v\nV : Type w\ninst✝⁵ : Field K\ninst✝⁴ : AddCommGroup V\ni... | [
47,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.constantCoeff_comp_algebraMap | [] | [
908,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
906,
1
] |
Mathlib/LinearAlgebra/BilinearMap.lean | LinearMap.flip_flip | [] | [
149,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Data/Polynomial/PartialFractions.lean | div_eq_quo_add_sum_rem_div | [
{
"state_after": "case empty\nR : Type\ninst✝⁴ : CommRing R\ninst✝³ : IsDomain R\nK : Type\ninst✝² : Field K\ninst✝¹ : Algebra R[X] K\ninst✝ : IsFractionRing R[X] K\nf✝ : R[X]\nι : Type u_1\ng : ι → R[X]\ns : Finset ι\nhg✝ : ∀ (i : ι), i ∈ s → Monic (g i)\nhcop✝ : Set.Pairwise ↑s fun i j => IsCoprime (g i) (g j... | [
138,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.roots_C | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\na b : R\nn : ℕ\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\np q : R[X]\nx : R\nH : x = 0\n⊢ roots (↑C x) = 0",
"tactic": "rw [H, C_0, roots_zero]"
},
{
"state_after": "no goals",
"state_before": "R : Type u\nS : T... | [
664,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
660,
1
] |
Mathlib/Analysis/Normed/Group/Seminorm.lean | GroupNorm.add_apply | [] | [
823,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
822,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | Left.one_lt_mul_of_le_of_lt | [] | [
724,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
721,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.mapsTo_iUnion₂_iUnion₂ | [] | [
1446,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1444,
1
] |
Mathlib/Data/List/Basic.lean | List.reduceOption_mem_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.369416\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nl : List (Option α)\nx : α\n⊢ x ∈ reduceOption l ↔ some x ∈ l",
"tactic": "simp only [reduceOption, id.def, mem_filterMap, exists_eq_right]"
}
] | [
3497,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3496,
1
] |
Mathlib/Topology/Category/TopCat/Opens.lean | TopologicalSpace.Opens.map_eq | [
{
"state_after": "X Y Z : TopCat\nf : X ⟶ Y\n⊢ map f = map f",
"state_before": "X Y Z : TopCat\nf g : X ⟶ Y\nh : f = g\n⊢ map f = map g",
"tactic": "subst h"
},
{
"state_after": "no goals",
"state_before": "X Y Z : TopCat\nf : X ⟶ Y\n⊢ map f = map f",
"tactic": "rfl"
}
] | [
270,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.snoc_add | [
{
"state_after": "no goals",
"state_before": "R : 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 : Fin (Nat.succ n)) → AddCommMonoid (M i)\ninst✝⁸ : (i : ι) → AddCommMonoid (M₁ i)\ninst✝⁷ : AddCommMonoi... | [
367,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/MeasureTheory/Covering/VitaliFamily.lean | VitaliFamily.FineSubfamilyOn.measurableSet_u | [] | [
165,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
11
] |
Mathlib/Analysis/Convex/Extreme.lean | Convex.mem_extremePoints_iff_mem_diff_convexHull_diff | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.51012\nι : Type ?u.51015\nπ : ι → Type ?u.51020\ninst✝⁴ : LinearOrderedRing 𝕜\ninst✝³ : AddCommGroup E\ninst✝² : Module 𝕜 E\ninst✝¹ : DenselyOrdered 𝕜\ninst✝ : NoZeroSMulDivisors 𝕜 E\nA B : Set E\nx : E\nhA : Convex �... | [
276,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/Data/Bool/Basic.lean | Bool.eq_true_of_ne_false | [
{
"state_after": "no goals",
"state_before": "⊢ ∀ {a : Bool}, a ≠ false → a = true",
"tactic": "decide"
}
] | [
145,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/GroupTheory/Submonoid/Membership.lean | multiset_prod_mem | [
{
"state_after": "case intro\nM✝ : Type ?u.14811\nA : Type ?u.14814\nB : Type u_2\ninst✝⁵ : Monoid M✝\ninst✝⁴ : SetLike B M✝\ninst✝³ : SubmonoidClass B M✝\nS : B\nM : Type u_1\ninst✝² : CommMonoid M\ninst✝¹ : SetLike B M\ninst✝ : SubmonoidClass B M\nm : Multiset { x // x ∈ S }\n⊢ Multiset.prod (Multiset.map Sub... | [
91,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Algebra/Lie/OfAssociative.lean | AlgHom.toLieHom_apply | [] | [
187,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | Polynomial.coeToPowerSeries.algHom_apply | [] | [
2667,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2665,
1
] |
Mathlib/Analysis/SpecialFunctions/Sqrt.lean | DifferentiableOn.sqrt | [] | [
144,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Topology/Maps.lean | OpenEmbedding.of_comp | [] | [
631,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
629,
1
] |
Mathlib/Algebra/Ring/CompTypeclasses.lean | RingHomInvPair.symm | [] | [
139,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Images.lean | CategoryTheory.Limits.image.compIso_inv_comp_image_ι | [
{
"state_after": "case w\nC : Type u\ninst✝³ : Category C\nX Y : C\nf : X ⟶ Y\nZ : C\ng : Y ⟶ Z\ninst✝² : HasEqualizers C\ninst✝¹ : HasImage f\ninst✝ : IsIso g\n⊢ factorThruImage (f ≫ g) ≫ (compIso f g).inv ≫ ι f = factorThruImage (f ≫ g) ≫ ι (f ≫ g) ≫ inv g",
"state_before": "C : Type u\ninst✝³ : Category ... | [
657,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
654,
1
] |
Mathlib/LinearAlgebra/LinearIndependent.lean | exists_of_linearIndependent_of_finite_span | [
{
"state_after": "ι : Type u'\nι' : Type ?u.1274584\nR : Type ?u.1274587\nK : Type u_1\nM : Type ?u.1274593\nM' : Type ?u.1274596\nM'' : Type ?u.1274599\nV : Type u\nV' : Type ?u.1274604\ninst✝⁴ : DivisionRing K\ninst✝³ : AddCommGroup V\ninst✝² : AddCommGroup V'\ninst✝¹ : Module K V\ninst✝ : Module K V'\nv : ι ... | [
1396,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1333,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.iInf_invariant | [
{
"state_after": "F : Type ?u.937493\nR : Type u_1\nR₁ : Type ?u.936901\nR₂ : Type ?u.936904\nR₃ : Type ?u.936907\nR₄ : Type ?u.936910\nS : Type ?u.936913\nK : Type ?u.936916\nK₂ : Type ?u.936919\nM : Type u_3\nM' : Type ?u.936925\nM₁ : Type ?u.936928\nM₂ : Type ?u.936931\nM₃ : Type ?u.936934\nM₄ : Type ?u.9369... | [
1037,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1030,
1
] |
Mathlib/MeasureTheory/Measure/Stieltjes.lean | Monotone.stieltjesFunction_eq | [] | [
297,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
295,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Cardinal.lt_univ | [
{
"state_after": "α : Type ?u.234970\nβ : Type ?u.234973\nγ : Type ?u.234976\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nc : Cardinal\nh : c < univ\nthis : ord c < ord univ\n⊢ ∃ c', c = lift c'",
"state_before": "α : Type ?u.234970\nβ : Type ?u.234973\nγ : Type ?u.234976\nr : α → α → Prop\ns : β ... | [
1529,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1522,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.mk_plift_true | [] | [
1945,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1944,
1
] |
src/lean/Init/Core.lean | dif_neg | [] | [
815,
23
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
812,
1
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.wOppSide_lineMap_right | [] | [
371,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
369,
1
] |
Mathlib/LinearAlgebra/Matrix/Transvection.lean | Matrix.updateRow_eq_transvection | [
{
"state_after": "case intro\nn : Type u_1\np : Type ?u.2735\nR : Type u₂\n𝕜 : Type ?u.2740\ninst✝⁴ : Field 𝕜\ninst✝³ : DecidableEq n\ninst✝² : DecidableEq p\ninst✝¹ : CommRing R\ni j : n\ninst✝ : Finite n\nc : R\nval✝ : Fintype n\n⊢ updateRow 1 i (OfNat.ofNat 1 i + c • OfNat.ofNat 1 j) = transvection i j c",... | [
112,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/Topology/Perfect.lean | preperfect_iff_nhds | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : TopologicalSpace α\nC : Set α\n⊢ Preperfect C ↔ ∀ (x : α), x ∈ C → ∀ (U : Set α), U ∈ 𝓝 x → ∃ y, y ∈ U ∩ C ∧ y ≠ x",
"tactic": "simp only [Preperfect, accPt_iff_nhds]"
}
] | [
90,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Init/CcLemmas.lean | or_eq_of_eq_false_left | [] | [
43,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.ofList_cons | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na : α\nl : List α\n⊢ Seq.map some ↑(a :: l) = Seq.cons (some a) (Seq.map some ↑l)",
"tactic": "simp"
}
] | [
1263,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1262,
1
] |
Mathlib/Data/Sum/Interval.lean | Sum.Ioo_inl_inr | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝³ : Preorder α\ninst✝² : Preorder β\ninst✝¹ : LocallyFiniteOrder α\ninst✝ : LocallyFiniteOrder β\na₁ a₂ : α\nb₁ b₂ : β\na b : α ⊕ β\n⊢ Ioo (inl a₁) (inr b₂) = ∅",
"tactic": "rfl"
}
] | [
174,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/CategoryTheory/Subterminal.lean | CategoryTheory.monoOver_terminal_to_subterminals_comp | [] | [
187,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Data/PNat/Xgcd.lean | PNat.XgcdType.flip_isReduced | [
{
"state_after": "u : XgcdType\n⊢ u.bp = u.ap ↔ u.ap = u.bp",
"state_before": "u : XgcdType\n⊢ IsReduced (flip u) ↔ IsReduced u",
"tactic": "dsimp [IsReduced, flip]"
},
{
"state_after": "no goals",
"state_before": "u : XgcdType\n⊢ u.bp = u.ap ↔ u.ap = u.bp",
"tactic": "constructor <;> in... | [
222,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Computability/Reduce.lean | disjoin_manyOneReducible | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\ninst✝² : Primcodable α\ninst✝¹ : Primcodable β\ninst✝ : Primcodable γ\np : α → Prop\nq : β → Prop\nr : γ → Prop\nf : α → γ\nc₁ : Computable f\nh₁ : ∀ (a : α), p a ↔ r (f a)\ng : β → γ\nc₂ : Computable g\nh₂ : ∀ (a : β), ... | [
316,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.mem_span_insert | [
{
"state_after": "R : Type u_2\nR₂ : Type ?u.162771\nK : Type ?u.162774\nM : Type u_1\nM₂ : Type ?u.162780\nV : Type ?u.162783\nS : Type ?u.162786\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\nx : M\np p' : Submodule R M\ninst✝² : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝¹ : AddCommMonoid M₂\nin... | [
482,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
477,
1
] |
Mathlib/Order/Monotone/Basic.lean | Int.rel_of_forall_rel_succ_of_lt | [
{
"state_after": "case intro\nι : Type ?u.42313\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.42322\nπ : ι → Type ?u.42327\nr✝ : α → α → Prop\ninst✝¹ : Preorder α\nr : β → β → Prop\ninst✝ : IsTrans β r\nf : ℤ → β\nh : ∀ (n : ℤ), r (f n) (f (n + 1))\na : ℤ\nn : ℕ\nhab : a < a + ↑(Nat.succ n)\n⊢ r (f a) (f (a ... | [
1047,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1039,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Succ.rec_iff | [
{
"state_after": "case intro\nα : Type u_1\ninst✝² : Preorder α\ninst✝¹ : SuccOrder α\ninst✝ : IsSuccArchimedean α\na✝ b : α\np : α → Prop\nhsucc : ∀ (a : α), p a ↔ p (succ a)\na : α\nn : ℕ\nh : a ≤ (succ^[n]) a\n⊢ p a ↔ p ((succ^[n]) a)",
"state_before": "α : Type u_1\ninst✝² : Preorder α\ninst✝¹ : SuccOrd... | [
1399,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1396,
1
] |
Std/Data/String/Lemmas.lean | Substring.Valid.front | [] | [
1017,
29
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1016,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.restrict_coe_apply | [] | [
233,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
231,
1
] |
Std/Data/List/Lemmas.lean | List.Sublist.trans | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl₁ l₂ l₃ : List α\nh₁ : l₁ <+ l₂\nh₂ : l₂ <+ l₃\n⊢ l₁ <+ l₃",
"tactic": "induction h₂ generalizing l₁ with\n| slnil => exact h₁\n| cons _ _ IH => exact (IH h₁).cons _\n| @cons₂ l₂ _ a _ IH =>\n generalize e : a :: l₂ = l₂'\n match e ▸ h₁ with... | [
335,
53
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
326,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.mul_mono | [] | [
764,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
763,
1
] |
Mathlib/RingTheory/Adjoin/FG.lean | Subalgebra.fg_of_fg_toSubmodule | [
{
"state_after": "R : Type u\nA : Type v\nB : Type w\ninst✝⁴ : CommSemiring R\ninst✝³ : Semiring A\ninst✝² : Algebra R A\ninst✝¹ : Semiring B\ninst✝ : Algebra R B\nS : Subalgebra R A\nx✝ : Submodule.FG (↑toSubmodule S)\nt : Finset A\nht : span R ↑t = ↑toSubmodule S\nx : A\nhx : x ∈ ↑toSubmodule S\n⊢ x ∈ ↑toSubm... | [
119,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/MeasureTheory/CardMeasurableSpace.lean | MeasurableSpace.generateMeasurable_eq_rec | [
{
"state_after": "case h\nα : Type u\ns : Set (Set α)\nt : Set α\n⊢ t ∈ {t | GenerateMeasurable s t} ↔ t ∈ ⋃ (i : (Quotient.out (ord (aleph 1))).α), generateMeasurableRec s i",
"state_before": "α : Type u\ns : Set (Set α)\n⊢ {t | GenerateMeasurable s t} = ⋃ (i : (Quotient.out (ord (aleph 1))).α), generateMe... | [
154,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/RingTheory/PowerBasis.lean | PowerBasis.minpolyGen_monic | [
{
"state_after": "R : Type ?u.111432\nS : Type u_2\nT : Type ?u.111438\ninst✝⁸ : CommRing R\ninst✝⁷ : Ring S\ninst✝⁶ : Algebra R S\nA : Type u_1\nB : Type ?u.111744\ninst✝⁵ : CommRing A\ninst✝⁴ : CommRing B\ninst✝³ : IsDomain B\ninst✝² : Algebra A B\nK : Type ?u.112166\ninst✝¹ : Field K\ninst✝ : Algebra A S\npb... | [
171,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.leadingCoeff_mul' | [
{
"state_after": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝ : Semiring R\np q : R[X]\nι : Type ?u.660965\nh : leadingCoeff p * leadingCoeff q ≠ 0\n⊢ coeff (p * q) (natDegree (p * q)) = coeff p (natDegree p) * coeff q (natDegree q)",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\nin... | [
958,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
954,
1
] |
Mathlib/Algebra/Order/Group/OrderIso.lean | inv_le' | [] | [
53,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/Order/Heyting/Basic.lean | fst_himp | [] | [
113,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/Analysis/SpecialFunctions/Arsinh.lean | HasStrictFDerivAt.arsinh | [] | [
245,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/RepresentationTheory/Basic.lean | Representation.ofMulAction_self_smul_eq_mul | [
{
"state_after": "k : Type u_1\nG : Type u_2\nV : Type ?u.568789\ninst✝³ : CommSemiring k\ninst✝² : Group G\ninst✝¹ : AddCommMonoid V\ninst✝ : Module k V\nρ : Representation k G V\nx : MonoidAlgebra k G\ny : asModule (ofMulAction k G G)\ng : G\n⊢ ↑(↑(asAlgebraHom (ofMulAction k G G)) (↑(of k G) g)) y = ↑(of k G... | [
324,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineEquiv.coe_coe | [] | [
129,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.order_mul_ge | [
{
"state_after": "case h\nR : Type u_1\ninst✝ : Semiring R\nφ✝ φ ψ : PowerSeries R\n⊢ ∀ (i : ℕ), ↑i < order φ + order ψ → ↑(coeff R i) (φ * ψ) = 0",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nφ✝ φ ψ : PowerSeries R\n⊢ order φ + order ψ ≤ order (φ * ψ)",
"tactic": "apply le_order"
},
{
"s... | [
2387,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2376,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.L1.SimpleFunc.setToL1S_sub | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nE : Type u_2\nF : Type u_3\nF' : Type ?u.675870\nG : Type ?u.675873\n𝕜 : Type ?u.675876\np : ℝ≥0∞\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace ℝ E\ninst✝⁶ : NormedAddCommGroup F\ninst✝⁵ : NormedSpace ℝ F\ninst✝⁴ : NormedAddCommGroup F'\nin... | [
779,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
776,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Split.lean | BoxIntegral.Prepartition.splitMany_le_split | [] | [
261,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.mul_val_succ | [] | [
247,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | AlgEquiv.ofLeftInverse_symm_apply | [] | [
718,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
716,
1
] |
Mathlib/Order/CompleteLattice.lean | sInf_le_sInf_of_subset_insert_top | [] | [
519,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
518,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.not_tendsto_const_atTop | [] | [
110,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.mem_sInf | [] | [
626,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
624,
1
] |
Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean | strictConcaveOn_log_Ioi | [
{
"state_after": "⊢ ∀ {x y z : ℝ}, x ∈ Ioi 0 → z ∈ Ioi 0 → x < y → y < z → (log z - log y) / (z - y) < (log y - log x) / (y - x)",
"state_before": "⊢ StrictConcaveOn ℝ (Ioi 0) log",
"tactic": "apply strictConcaveOn_of_slope_strict_anti_adjacent (convex_Ioi (0 : ℝ))"
},
{
"state_after": "x y z : ... | [
186,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
159,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean | CategoryTheory.Limits.isCokernelEpiComp_desc | [
{
"state_after": "C : Type u\ninst✝¹ : Category C\ninst✝ : HasZeroMorphisms C\nX Y : C\nf : X ⟶ Y\nc : CokernelCofork f\ni : IsColimit c\nW : C\ng : W ⟶ X\nhg : Epi g\nh : W ⟶ Y\nhh : h = g ≫ f\ns : CokernelCofork h\n⊢ h ≫ Cofork.π s = g ≫ 0 ≫ Cofork.π s",
"state_before": "C : Type u\ninst✝¹ : Category C\ni... | [
639,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
631,
1
] |
Mathlib/Data/Set/Basic.lean | Set.inter_symmDiff_distrib_left | [] | [
2115,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2114,
1
] |
Mathlib/Data/SetLike/Basic.lean | SetLike.coe_eq_coe | [] | [
169,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Order/Filter/Extr.lean | IsMaxFilter.comp_antitone | [] | [
333,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.loopless | [] | [
102,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
11
] |
Mathlib/Logic/Denumerable.lean | Nat.Subtype.lt_succ_self | [] | [
268,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/CategoryTheory/Abelian/RightDerived.lean | CategoryTheory.Abelian.Functor.rightDerivedZeroToSelfApp_comp_inv | [
{
"state_after": "C : Type u\ninst✝⁶ : Category C\nD : Type u\ninst✝⁵ : Category D\nF : C ⥤ D\nX✝ Y Z : C\nf : X✝ ⟶ Y\ng : Y ⟶ Z\ninst✝⁴ : Abelian C\ninst✝³ : Abelian D\ninst✝² : Functor.Additive F\ninst✝¹ : EnoughInjectives C\ninst✝ : PreservesFiniteLimits F\nX : C\nP : InjectiveResolution X\n⊢ ((rightDerivedO... | [
263,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Data/Rat/NNRat.lean | NNRat.mk_coe_nat | [] | [
219,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
src/lean/Init/Control/Lawful.lean | StateT.run_pure | [] | [
248,
104
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
248,
9
] |
Mathlib/Data/Complex/Exponential.lean | Complex.ofReal_tan_ofReal_re | [
{
"state_after": "no goals",
"state_before": "x✝ y : ℂ\nx : ℝ\n⊢ ↑(starRingEnd ℂ) (tan ↑x) = tan ↑x",
"tactic": "rw [← tan_conj, conj_ofReal]"
}
] | [
993,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
992,
1
] |
Mathlib/Data/Set/Basic.lean | Set.univ_inter | [] | [
1007,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1006,
1
] |
Mathlib/Order/Hom/Bounded.lean | TopHom.sup_apply | [] | [
364,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Topology/MetricSpace/Closeds.lean | EMetric.Closeds.edist_eq | [] | [
93,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | HasSum.summable | [] | [
84,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | ContDiffWithinAt.ccos | [] | [
366,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
364,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | mul_lt_mul_iff_right | [] | [
118,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/Polynomial/Splits.lean | Polynomial.splits_iff | [
{
"state_after": "no goals",
"state_before": "F : Type u\nK : Type v\nL : Type w\ninst✝² : Field K\ninst✝¹ : Field L\ninst✝ : Field F\ni : K →+* L\nf : K[X]\n⊢ Splits i f ↔ f = 0 ∨ ∀ {g : L[X]}, Irreducible g → g ∣ map i f → degree g = 1",
"tactic": "rw [Splits, map_eq_zero]"
}
] | [
239,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean | Asymptotics.IsBigOWith.rpow | [
{
"state_after": "case a\nα : Type u_1\nr c : ℝ\nl : Filter α\nf g : α → ℝ\nh : IsBigOWith c l f g\nhc : 0 ≤ c\nhr : 0 ≤ r\nhg : 0 ≤ᶠ[l] g\n⊢ ∀ᶠ (x : α) in l, ‖f x ^ r‖ ≤ c ^ r * ‖g x ^ r‖",
"state_before": "α : Type u_1\nr c : ℝ\nl : Filter α\nf g : α → ℝ\nh : IsBigOWith c l f g\nhc : 0 ≤ c\nhr : 0 ≤ r\nhg... | [
226,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/GroupTheory/GroupAction/SubMulAction.lean | SetLike.mk_smul_mk | [] | [
93,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Dynamics/FixedPoints/Basic.lean | Function.isFixedPt_id | [] | [
46,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Mathlib/Order/MinMax.lean | MonotoneOn.map_min | [] | [
245,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.exists_blsub_cof | [
{
"state_after": "case intro.intro.intro\nα : Type ?u.37034\nr : α → α → Prop\no : Ordinal\nι : Type u\nf : ι → Ordinal\nhf : lsub f = o\nhι : (#ι) = cof o\n⊢ ∃ f, blsub (ord (cof o)) f = o",
"state_before": "α : Type ?u.37034\nr : α → α → Prop\no : Ordinal\n⊢ ∃ f, blsub (ord (cof o)) f = o",
"tactic": ... | [
420,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/RingTheory/FinitePresentation.lean | Algebra.FinitePresentation.ker_fG_of_surjective | [
{
"state_after": "case intro.intro.intro\nR : Type w₁\nA : Type w₂\nB : Type w₃\ninst✝⁴ : CommRing R\ninst✝³ : CommRing A\ninst✝² : Algebra R A\ninst✝¹ : CommRing B\ninst✝ : Algebra R B\nf : A →ₐ[R] B\nhf : Surjective ↑f\nhRB : FinitePresentation R B\nn : ℕ\ng : MvPolynomial (Fin n) R →ₐ[R] A\nhg : Surjective ↑... | [
392,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
1
] |
Mathlib/Algebra/Algebra/Spectrum.lean | spectrum.vadd_eq | [] | [
306,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
305,
1
] |
Mathlib/MeasureTheory/Integral/IntegrableOn.lean | MeasureTheory.integrableOn_singleton_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.1501840\nE : Type u_2\nF : Type ?u.1501846\ninst✝² : MeasurableSpace α\ninst✝¹ : NormedAddCommGroup E\nf g : α → E\ns t : Set α\nμ ν : Measure α\nx : α\ninst✝ : MeasurableSingletonClass α\nthis : f =ᵐ[Measure.restrict μ {x}] fun x_1 => f x\n⊢ IntegrableOn f {x} ↔ f x ... | [
200,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_const' | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.13595937\n𝕜 : Type ?u.13595940\nE : Type u_1\nF : Type ?u.13595946\nA : Type ?u.13595949\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedSpace ℝ E\na b : ℝ\nf g : ℝ → E\nμ : MeasureTheory.Measure ℝ\nc : E\n⊢ (∫ (x : ℝ) in a..... | [
636,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
634,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.inter_mul_union_subset_union | [] | [
464,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/Order/Filter/Basic.lean | Function.Semiconj.filter_comap | [] | [
2128,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2126,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | Measurable.coe_nnreal_real | [] | [
1770,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1768,
1
] |
Mathlib/Order/Lattice.lean | toDual_max | [] | [
992,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
991,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.