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/Combinatorics/Composition.lean | List.nthLe_splitWrtComposition | [] | [
750,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
747,
1
] |
Mathlib/Topology/ContinuousFunction/Basic.lean | ContinuousMap.ext | [] | [
116,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Analysis/NormedSpace/Units.lean | Units.isOpenMap_val | [] | [
244,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Topology/StoneCech.lean | ultrafilter_comap_pure_nhds | [
{
"state_after": "α : Type u\nb : Ultrafilter α\n⊢ comap pure (⨅ (s : Set (Ultrafilter α)) (_ : s ∈ {s | b ∈ s ∧ s ∈ ultrafilterBasis α}), 𝓟 s) ≤ ↑b",
"state_before": "α : Type u\nb : Ultrafilter α\n⊢ comap pure (𝓝 b) ≤ ↑b",
"tactic": "rw [TopologicalSpace.nhds_generateFrom]"
},
{
"state_after... | [
114,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Data/Nat/Cast/Basic.lean | NeZero.nat_of_neZero | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.62486\nβ : Type ?u.62489\nR✝ : Type ?u.62492\nS✝ : Type ?u.62495\nF✝ : Type ?u.62498\ninst✝⁴ : NonAssocSemiring R✝\ninst✝³ : NonAssocSemiring S✝\nR : Type u_1\nS : Type u_2\ninst✝² : Semiring R\ninst✝¹ : Semiring S\nF : Type u_3\ninst✝ : RingHomClass... | [
284,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Analysis/Calculus/FDerivMeasurable.lean | measurable_deriv | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝¹¹ : NontriviallyNormedField 𝕜\nE : Type ?u.401298\ninst✝¹⁰ : NormedAddCommGroup E\ninst✝⁹ : NormedSpace 𝕜 E\nF : Type u_2\ninst✝⁸ : NormedAddCommGroup F\ninst✝⁷ : NormedSpace 𝕜 F\nf✝ : E → F\nK : Set (E →L[𝕜] F)\ninst✝⁶ : MeasurableSpace... | [
434,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
432,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | uniformContinuous_of_const | [
{
"state_after": "no goals",
"state_before": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort ?u.112580\ninst✝¹ : UniformSpace α\ninst✝ : UniformSpace β\nc : α → β\nh : ∀ (a b : α), c a = c b\nthis : (fun x => (c x.fst, c x.snd)) ⁻¹' idRel = univ\n⊢ 𝓤 α ≤ comap (fun x => (c x.fst, c x.snd)) (�... | [
1124,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1120,
1
] |
Mathlib/Algebra/DualNumber.lean | DualNumber.fst_eps | [] | [
69,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/AlgebraicTopology/SimplicialObject.lean | CategoryTheory.SimplicialObject.δ_comp_δ | [
{
"state_after": "C : Type u\ninst✝ : Category C\nX : SimplicialObject C\nn : ℕ\ni j : Fin (n + 2)\nH : i ≤ j\n⊢ X.map (SimplexCategory.δ (Fin.succ j)).op ≫ X.map (SimplexCategory.δ i).op =\n X.map (SimplexCategory.δ (↑Fin.castSucc i)).op ≫ X.map (SimplexCategory.δ j).op",
"state_before": "C : Type u\nin... | [
114,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/RingTheory/TensorProduct.lean | Algebra.TensorProduct.adjoin_tmul_eq_top | [] | [
815,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
814,
1
] |
Mathlib/Data/Sum/Order.lean | OrderIso.sumAssoc_apply_inr | [] | [
584,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
583,
1
] |
Mathlib/GroupTheory/Nilpotent.lean | least_ascending_central_series_length_eq_nilpotencyClass | [
{
"state_after": "case refine_1\nG : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Normal H\nhG : Group.IsNilpotent G\n⊢ ∀ (n : ℕ), upperCentralSeries G n = ⊤ → ∃ H, IsAscendingCentralSeries H ∧ H n = ⊤\n\ncase refine_2\nG : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Normal H\nhG : Group.IsNilpot... | [
396,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
388,
1
] |
Mathlib/Logic/Equiv/Fintype.lean | Equiv.extendSubtype_apply_of_not_mem | [
{
"state_after": "α : Type u_1\nβ : Type ?u.158045\ninst✝³ : Fintype α\ninst✝² : DecidableEq β\ne✝ : Perm α\nf : α ↪ β\np q : α → Prop\ninst✝¹ : DecidablePred p\ninst✝ : DecidablePred q\ne : { x // p x } ≃ { x // q x }\nx : α\nhx : ¬p x\n⊢ ↑(subtypeCongr e (toCompl e)) x = ↑(↑(toCompl e) { val := x, property :=... | [
137,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
Mathlib/Topology/MetricSpace/Infsep.lean | Set.Finite.infsep_exists_of_nontrivial | [] | [
534,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
531,
1
] |
Mathlib/Data/Finset/NAry.lean | Finset.image₂_congr' | [] | [
234,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.pred_eq_iff_eq_succ | [
{
"state_after": "no goals",
"state_before": "n✝ m n : ℕ\ni : Fin (n + 1)\nhi : i ≠ 0\nj : Fin n\nh : pred i hi = j\n⊢ i = succ j",
"tactic": "simp only [← h, Fin.succ_pred]"
},
{
"state_after": "no goals",
"state_before": "n✝ m n : ℕ\ni : Fin (n + 1)\nhi : i ≠ 0\nj : Fin n\nh : i = succ j\n... | [
1517,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1515,
1
] |
Mathlib/Data/List/Basic.lean | List.reverse_cons' | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.26301\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\na : α\nl : List α\n⊢ reverse (a :: l) = concat (reverse l) a",
"tactic": "simp only [reverse_cons, concat_eq_append]"
}
] | [
596,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.algebraMap_apply | [] | [
2096,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2095,
1
] |
Mathlib/Order/Hom/Lattice.lean | InfTopHom.id_apply | [] | [
944,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
943,
1
] |
Mathlib/Analysis/InnerProductSpace/EuclideanDist.lean | Euclidean.ball_mem_nhds | [] | [
126,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/MeasureTheory/Function/SpecialFunctions/Basic.lean | Complex.measurable_ofReal | [] | [
88,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Topology/Basic.lean | closure_empty_iff | [] | [
495,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
494,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.IsCycle.rotate | [
{
"state_after": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\ninst✝ : DecidableEq V\nu v : V\nc : Walk G v v\nhc : IsCycle c\nh : u ∈ support c\n⊢ List.Nodup (List.tail (support (rotate c h)))",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\... | [
1248,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1244,
11
] |
Mathlib/Combinatorics/Quiver/Cast.lean | Quiver.Path.cast_rfl_rfl | [] | [
98,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Mathlib/Tactic/Ring/Basic.lean | Mathlib.Tactic.Ring.pow_congr | [
{
"state_after": "u : Lean.Level\nR : Type u_1\nα : Q(Type u)\nsα : Q(CommSemiring «$α»)\ninst✝ : CommSemiring R\na' : R\nb' : ℕ\n⊢ a' ^ b' = a' ^ b'",
"state_before": "u : Lean.Level\nR : Type u_1\nα : Q(Type u)\nsα : Q(CommSemiring «$α»)\ninst✝ : CommSemiring R\na a' : R\nb b' : ℕ\nc : R\nx✝² : a = a'\nx✝... | [
971,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
970,
1
] |
Std/Data/String/Lemmas.lean | String.takeWhileAux_of_valid | [
{
"state_after": "p : Char → Bool\nl r : List Char\n⊢ (if h : { byteIdx := utf8Len l } < { byteIdx := utf8Len l + utf8Len [] } then\n if p (get { data := l ++ [] ++ r } { byteIdx := utf8Len l }) = true then\n let_fun this :=\n (_ :\n { byteIdx := utf8Len l + utf8Len [] }.byteIdx ... | [
757,
91
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
748,
1
] |
Std/Data/Nat/Gcd.lean | Nat.coprime.coprime_mul_left | [] | [
307,
44
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
306,
1
] |
Mathlib/Order/OmegaCompletePartialOrder.lean | OmegaCompletePartialOrder.Continuous'.to_monotone | [] | [
261,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | AddMonoidHom.coe_dfinsupp_sumAddHom | [] | [
2330,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2327,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.add_right_cancel | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.77971\nβ : Type ?u.77974\nγ : Type ?u.77977\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\na b : Ordinal\nn : ℕ\n⊢ a + ↑n = b + ↑n ↔ a = b",
"tactic": "simp only [le_antisymm_iff, add_le_add_iff_right]"
}
] | [
145,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Analysis/Calculus/Deriv/Inv.lean | hasFDerivWithinAt_inv | [] | [
120,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/GroupTheory/Perm/Fin.lean | finRotate_succ_eq_decomposeFin | [
{
"state_after": "case H.h\nn : ℕ\ni : Fin (Nat.succ n)\n⊢ ↑(↑(finRotate (Nat.succ n)) i) = ↑(↑(↑decomposeFin.symm (1, finRotate n)) i)",
"state_before": "n : ℕ\n⊢ finRotate (Nat.succ n) = ↑decomposeFin.symm (1, finRotate n)",
"tactic": "ext i"
},
{
"state_after": "case H.h.zero\ni : Fin (Nat.su... | [
103,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Order/FixedPoints.lean | OrderHom.gfp_induction | [] | [
149,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/LinearAlgebra/Matrix/IsDiag.lean | Matrix.IsDiag.smul | [
{
"state_after": "α : Type u_2\nβ : Type ?u.8104\nR : Type u_1\nn : Type u_3\nm : Type ?u.8113\ninst✝² : Monoid R\ninst✝¹ : AddMonoid α\ninst✝ : DistribMulAction R α\nk : R\nA : Matrix n n α\nha : IsDiag A\ni j : n\nh : i ≠ j\n⊢ (k • A) i j = 0",
"state_before": "α : Type u_2\nβ : Type ?u.8104\nR : Type u_1... | [
110,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometry.linear_eq_linearIsometry | [
{
"state_after": "case h\n𝕜 : Type u_3\nV : Type u_1\nV₁ : Type ?u.16180\nV₂ : Type u_2\nV₃ : Type ?u.16186\nV₄ : Type ?u.16189\nP₁ : Type ?u.16192\nP : Type u_4\nP₂ : Type u_5\nP₃ : Type ?u.16201\nP₄ : Type ?u.16204\ninst✝²⁰ : NormedField 𝕜\ninst✝¹⁹ : SeminormedAddCommGroup V\ninst✝¹⁸ : SeminormedAddCommGrou... | [
74,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Order/Heyting/Hom.lean | BiheytingHom.comp_assoc | [] | [
592,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
590,
1
] |
src/lean/Init/Data/Nat/Linear.lean | Nat.Linear.Expr.denote_toPoly | [
{
"state_after": "no goals",
"state_before": "ctx : Context\ne : Expr\n⊢ Poly.denote ctx (toPoly e) = denote ctx e",
"tactic": "induction e with\n| num k => by_cases h : k == 0 <;> simp [toPoly, h, Var.denote]; simp [eq_of_beq h]\n| var i => simp [toPoly]\n| add a b iha ihb => simp [toPoly, iha, ihb]\n|... | [
531,
48
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
525,
1
] |
Mathlib/Algebra/CharZero/Quotient.lean | QuotientAddGroup.zmultiples_zsmul_eq_zsmul_iff | [
{
"state_after": "case h\nR : Type u_1\ninst✝¹ : DivisionRing R\ninst✝ : CharZero R\np : R\nθ : R ⧸ AddSubgroup.zmultiples p\nz : ℤ\nhz : z ≠ 0\na✝ : R\n⊢ z • Quotient.mk'' a✝ = z • θ ↔ ∃ k, Quotient.mk'' a✝ = θ + ↑(↑k • (p / ↑z))",
"state_before": "R : Type u_1\ninst✝¹ : DivisionRing R\ninst✝ : CharZero R\... | [
68,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.ret_supports | [
{
"state_after": "S : Finset Λ'\nk : Cont'\nH₁ : contSupp k ⊆ S\nW : ∀ {q : Λ'}, q ∈ trStmts₁ q\n⊢ TM2.SupportsStmt S (tr (Λ'.ret k))",
"state_before": "S : Finset Λ'\nk : Cont'\nH₁ : contSupp k ⊆ S\n⊢ TM2.SupportsStmt S (tr (Λ'.ret k))",
"tactic": "have W := fun {q} => trStmts₁_self q"
},
{
"st... | [
1950,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1938,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.piecewise_insert_self | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.294118\nγ : Type ?u.294121\nδ : α → Sort u_2\ns : Finset α\nf g : (i : α) → δ i\ninst✝¹ : DecidableEq α\nj : α\ninst✝ : (i : α) → Decidable (i ∈ insert j s)\n⊢ piecewise (insert j s) f g j = f j",
"tactic": "simp [piecewise]"
}
] | [
2445,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2444,
1
] |
Mathlib/Analysis/NormedSpace/AddTorsor.lean | dist_left_lineMap | [] | [
108,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Data/Finsupp/Defs.lean | Finsupp.single_add_erase | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.305712\nγ : Type ?u.305715\nι : Type ?u.305718\nM : Type u_2\nM' : Type ?u.305724\nN : Type ?u.305727\nP : Type ?u.305730\nG : Type ?u.305733\nH : Type ?u.305736\nR : Type ?u.305739\nS : Type ?u.305742\ninst✝ : AddZeroClass M\na : α\nf ... | [
1060,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1059,
1
] |
Mathlib/Data/List/Func.lean | List.Func.get_sub | [
{
"state_after": "case h1\nα✝ : Type u\nβ : Type v\nγ : Type w\nα : Type u\ninst✝ : AddGroup α\nk : ℕ\nxs ys : List α\n⊢ Sub.sub default default = default",
"state_before": "α✝ : Type u\nβ : Type v\nγ : Type w\nα : Type u\ninst✝ : AddGroup α\nk : ℕ\nxs ys : List α\n⊢ get k (sub xs ys) = get k xs - get k ys"... | [
374,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
371,
1
] |
Mathlib/Topology/Basic.lean | continuous_const | [] | [
1687,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1686,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.seq_destruct_think | [] | [
654,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
653,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | Orthonormal.inner_right_fintype | [] | [
809,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
807,
1
] |
Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean | Matrix.IsAdjMatrix.apply_diag_ne | [
{
"state_after": "no goals",
"state_before": "V : Type u_2\nα : Type u_1\nβ : Type ?u.360\nA : Matrix V V α\ninst✝¹ : MulZeroOneClass α\ninst✝ : Nontrivial α\nh : IsAdjMatrix A\ni : V\n⊢ ¬A i i = 1",
"tactic": "simp [h.apply_diag i]"
}
] | [
68,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
67,
1
] |
Mathlib/Order/Heyting/Basic.lean | PUnit.inf_eq | [] | [
1350,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1349,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.erase_biUnion | [
{
"state_after": "case a\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.522272\ninst✝ : DecidableEq β\ns✝ s₁ s₂ : Finset α\nt t₁ t₂ f : α → Finset β\ns : Finset α\nb a : β\n⊢ a ∈ erase (Finset.biUnion s f) b ↔ a ∈ Finset.biUnion s fun x => erase (f x) b",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.5... | [
3657,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3653,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.succAbove_last | [
{
"state_after": "case h.h\nn m : ℕ\nx✝ : Fin n\n⊢ ↑(↑(succAbove (last n)) x✝) = ↑(↑castSucc x✝)",
"state_before": "n m : ℕ\n⊢ succAbove (last n) = castSucc",
"tactic": "ext"
},
{
"state_after": "no goals",
"state_before": "case h.h\nn m : ℕ\nx✝ : Fin n\n⊢ ↑(↑(succAbove (last n)) x✝) = ↑(↑ca... | [
2062,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2060,
1
] |
Mathlib/Algebra/BigOperators/Order.lean | Finset.prod_lt_prod' | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nα : Type ?u.125163\nβ : Type ?u.125166\nM : Type u_2\nN : Type ?u.125172\nG : Type ?u.125175\nk : Type ?u.125178\nR : Type ?u.125181\ninst✝ : OrderedCancelCommMonoid M\nf g : ι → M\ns t : Finset ι\nHle : ∀ (i : ι), i ∈ s → f i ≤ g i\nHlt : ∃ i, i ∈... | [
445,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
440,
1
] |
Mathlib/Order/LocallyFinite.lean | Iio_toDual | [] | [
906,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
905,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.nhdsWithin_Iio_neBot | [] | [
231,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Topology/Category/TopCat/Limits/Products.lean | TopCat.sigmaIsoSigma_inv_apply | [
{
"state_after": "J : Type v\ninst✝ : SmallCategory J\nι : Type v\nα : ι → TopCatMax\ni : ι\nx : ↑(α i)\n⊢ (forget TopCat).map ((sigmaIsoSigma α).hom ≫ (sigmaIsoSigma α).inv) ((forget TopCat).map (Sigma.ι α i) x) =\n (forget TopCat).map (Sigma.ι α i) x",
"state_before": "J : Type v\ninst✝ : SmallCategory... | [
140,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsBigOWith.pow' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.481261\nE : Type ?u.481264\nF : Type ?u.481267\nG : Type ?u.481270\nE' : Type ?u.481273\nF' : Type ?u.481276\nG' : Type ?u.481279\nE'' : Type ?u.481282\nF'' : Type ?u.481285\nG'' : Type ?u.481288\nR : Type u_2\nR' : Type ?u.481294\n𝕜 :... | [
1617,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1612,
1
] |
Mathlib/Algebra/Category/ModuleCat/Biproducts.lean | ModuleCat.biprodIsoProd_inv_comp_fst | [] | [
86,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.compl_inf | [] | [
660,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
659,
11
] |
Mathlib/Order/Filter/Basic.lean | Filter.comap_neBot | [] | [
2343,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2342,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Equiv.lean | LinearIsometryEquiv.comp_hasFDerivAt_iff' | [] | [
341,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.foldr_add | [] | [
1400,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1399,
1
] |
Mathlib/Data/Fintype/Card.lean | Fintype.card_subtype_eq' | [] | [
340,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/FieldTheory/Separable.lean | Polynomial.eq_X_sub_C_of_separable_of_root_eq | [
{
"state_after": "F : Type u\ninst✝¹ : Field F\nK : Type v\ninst✝ : Field K\ni : F →+* K\nx : F\nh : F[X]\nh_sep : Separable h\nh_root : eval x h = 0\nh_splits : Splits i h\nh_roots : ∀ (y : K), y ∈ roots (map i h) → y = ↑i x\nh_ne_zero : h ≠ 0\n⊢ h = ↑C (leadingCoeff h) * (X - ↑C x)",
"state_before": "F : ... | [
448,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
432,
1
] |
Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean | ModularGroup.T_pow_mul_apply_one | [
{
"state_after": "no goals",
"state_before": "n : ℤ\ng : SL(2, ℤ)\n⊢ ↑(T ^ n * g) 1 = ↑g 1",
"tactic": "simp [coe_T_zpow, Matrix.mul, Matrix.dotProduct, Fin.sum_univ_succ]"
}
] | [
380,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
379,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.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\ns : Finset α\n⊢ s ⊆ Finite.toFinset ht ↔ ↑s ⊆ t",
"tactic": "rw [← Finset.coe_subset, Finite.coe_toFinset]"
}
] | [
199,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Bounded.mono_right | [] | [
941,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
937,
1
] |
Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean | Subsingleton.conformalAt | [] | [
75,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.coe_mk | [] | [
172,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/Algebra/Invertible.lean | Ring.inverse_invertible | [] | [
368,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
1
] |
Mathlib/Data/Set/Function.lean | AntitoneOn.congr | [] | [
260,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.NullMeasurableSet.preimage | [] | [
2660,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2656,
1
] |
Mathlib/Algebra/Hom/Ring.lean | RingHom.coe_monoidHom_id | [] | [
686,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
685,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.isOpen_Ico_zero | [
{
"state_after": "α : Type ?u.22170\nβ : Type ?u.22173\nγ : Type ?u.22176\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\n⊢ IsOpen (Iio b)",
"state_before": "α : Type ?u.22170\nβ : Type ?u.22173\nγ : Type ?u.22176\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\n⊢ IsOpen (... | [
62,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/RingTheory/MatrixAlgebra.lean | MatrixEquivTensor.invFun_algebraMap | [
{
"state_after": "R : Type u\ninst✝⁴ : CommSemiring R\nA : Type v\ninst✝³ : Semiring A\ninst✝² : Algebra R A\nn : Type w\ninst✝¹ : DecidableEq n\ninst✝ : Fintype n\nM : Matrix n n R\n⊢ ∑ p : n × n, ↑(algebraMap R A) (M p.fst p.snd) ⊗ₜ[R] stdBasisMatrix p.fst p.snd 1 = 1 ⊗ₜ[R] M",
"state_before": "R : Type u... | [
118,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Data/Nat/Interval.lean | Nat.card_fintypeIcc | [
{
"state_after": "no goals",
"state_before": "a b c : ℕ\n⊢ Fintype.card ↑(Set.Icc a b) = b + 1 - a",
"tactic": "rw [Fintype.card_ofFinset, card_Icc]"
}
] | [
127,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | isPiSystem_isOpen | [] | [
105,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/MeasureTheory/Integral/CircleIntegral.lean | circleIntegral.integral_smul_const | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℂ E\ninst✝ : CompleteSpace E\nf : ℂ → ℂ\na : E\nc : ℂ\nR : ℝ\n⊢ (∮ (z : ℂ) in C(c, R), f z • a) = (∮ (z : ℂ) in C(c, R), f z) • a",
"tactic": "simp only [circleIntegral, intervalIntegral.integ... | [
453,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
451,
1
] |
Mathlib/Order/Lattice.lean | inf_le_left | [] | [
387,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
386,
1
] |
Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean | Matrix.charpoly_coeff_eq_prod_coeff_of_le | [
{
"state_after": "case h\nR : 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\nk : ℕ\nh : Fintype.card n - 1 ≤ k\n⊢ coeff (charpoly M) k - coeff (∏ i : n, (X - ↑C (M i i))) k = 0",
"state_before": "R : Type u\ninst✝... | [
91,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean | SubmodulesBasis.nonarchimedean | [
{
"state_after": "ι : Type u_1\nR : Type u_2\nA : Type ?u.38259\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing A\ninst✝⁴ : Algebra R A\nM : Type u_3\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\ninst✝¹ : TopologicalSpace R\ninst✝ : Nonempty ι\nB : ι → Submodule R M\nhB✝ hB : SubmodulesBasis B\nthis : TopologicalSpace... | [
352,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/Data/QPF/Univariate/Basic.lean | Qpf.recF_eq_of_Wequiv | [
{
"state_after": "F : Type u → Type u\ninst✝ : Functor F\nq : Qpf F\nα : Type u\nu : F α → α\nx y : PFunctor.W (P F)\nh : Wequiv x y\n⊢ recF u x = recF u y",
"state_before": "F : Type u → Type u\ninst✝ : Functor F\nq : Qpf F\nα : Type u\nu : F α → α\nx y : PFunctor.W (P F)\n⊢ Wequiv x y → recF u x = recF u ... | [
201,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.monomial_eq | [
{
"state_after": "no goals",
"state_before": "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\n⊢ ↑(monomial s) a = ↑C a * Finsupp.prod s fun n e => X n ^ e",
"tactic": "s... | [
391,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
1
] |
src/lean/Init/Data/AC.lean | Lean.Data.AC.Context.toList_nonEmpty | [
{
"state_after": "no goals",
"state_before": "e : Expr\n⊢ Expr.toList e ≠ []",
"tactic": "induction e with\n| var => simp [Expr.toList]\n| op l r ih₁ _ =>\n simp [Expr.toList]\n cases h : l.toList with\n | nil => contradiction\n | cons => simp [List.append]"
},
{
"state_after": "no goals",... | [
267,
33
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
260,
1
] |
Mathlib/Algebra/FreeAlgebra.lean | FreeAlgebra.hom_ext | [
{
"state_after": "R : Type u_1\ninst✝² : CommSemiring R\nX : Type u_2\nA : Type u_3\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\nf g : FreeAlgebra R X →ₐ[R] A\nw : ↑(lift R).symm f = ↑(lift R).symm g\n⊢ f = g",
"state_before": "R : Type u_1\ninst✝² : CommSemiring R\nX : Type u_2\nA : Type u_3\ninst✝¹ : Semiri... | [
380,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
377,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean | CategoryTheory.Limits.MulticospanIndex.multicospan_map_fst | [] | [
208,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/Data/List/Count.lean | List.count_nil | [] | [
174,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/Order/Basic.lean | le_of_le_of_eq' | [] | [
191,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Dynamics/Ergodic/Conservative.lean | MeasureTheory.Conservative.inter_frequently_image_mem_ae_eq | [] | [
145,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.zeroLocus_radical | [] | [
231,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Real.sin_pi | [
{
"state_after": "⊢ sin (π / 2) * 0 + 0 * sin (π / 2) = 0",
"state_before": "⊢ sin π = 0",
"tactic": "rw [← mul_div_cancel_left π (two_ne_zero' ℝ), two_mul, add_div, sin_add, cos_pi_div_two]"
},
{
"state_after": "no goals",
"state_before": "⊢ sin (π / 2) * 0 + 0 * sin (π / 2) = 0",
"tact... | [
213,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Diagonal.lean | CategoryTheory.Limits.diagonal_pullback_fst | [
{
"state_after": "no goals",
"state_before": "C : Type u_2\ninst✝⁵ : Category C\nX✝ Y✝ Z✝ : C\ninst✝⁴ : HasPullbacks C\nS T : C\nf✝ : X✝ ⟶ T\ng✝ : Y✝ ⟶ T\ni : T ⟶ S\ninst✝³ : HasPullback i i\ninst✝² : HasPullback f✝ g✝\ninst✝¹ : HasPullback (f✝ ≫ i) (g✝ ≫ i)\ninst✝ :\n HasPullback (diagonal i)\n (map (f... | [
363,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
1
] |
Mathlib/Data/List/Basic.lean | List.take_append | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.165438\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁✝ l₂✝ l₁ l₂ : List α\ni : ℕ\n⊢ take (length l₁ + i) (l₁ ++ l₂) = l₁ ++ take i l₂",
"tactic": "simp [take_append_eq_append_take, take_all_of_le le_self_add]"
}
] | [
1986,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1985,
1
] |
Mathlib/LinearAlgebra/Contraction.lean | comp_dualTensorHom | [
{
"state_after": "case h\nι : Type w\nR : Type u\nM : Type v₁\nN : Type v₂\nP : Type v₃\nQ : Type v₄\ninst✝¹⁰ : CommSemiring R\ninst✝⁹ : AddCommMonoid M\ninst✝⁸ : AddCommMonoid N\ninst✝⁷ : AddCommMonoid P\ninst✝⁶ : AddCommMonoid Q\ninst✝⁵ : Module R M\ninst✝⁴ : Module R N\ninst✝³ : Module R P\ninst✝² : Module R... | [
132,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.Tendsto.const_div | [
{
"state_after": "α : Type u_1\nβ : Type ?u.125858\nγ : Type ?u.125861\na✝ b✝ c d : ℝ≥0∞\nr p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\nf : Filter α\nm : α → ℝ≥0∞\na b : ℝ≥0∞\nhm : Tendsto m f (𝓝 b)\nhb : b ≠ ⊤ ∨ a ≠ ⊤\n⊢ b⁻¹ ≠ 0 ∨ a ≠ ⊤",
"state_before": "α : Type u_1\nβ : Type ?u.125858\nγ : Type ?u.1... | [
550,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
547,
11
] |
Mathlib/Algebra/Module/Submodule/Basic.lean | Submodule.add_mem | [] | [
234,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
11
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.mul_pos | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.215952\nβ : Type ?u.215955\nγ : Type ?u.215958\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\na b : Ordinal\nh₁ : 0 < a\nh₂ : 0 < b\n⊢ 0 < a * b",
"tactic": "simpa only [mul_zero] using mul_lt_mul_of_pos_left h₂ h₁"
}
] | [
833,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
832,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.Prime.coprime_pow_of_not_dvd | [] | [
671,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
670,
1
] |
Mathlib/Combinatorics/Colex.lean | Colex.lt_trichotomy | [
{
"state_after": "case pos\nα : Type u_1\ninst✝ : LinearOrder α\nA B : Colex α\nh₁ : A = B\n⊢ A < B ∨ A = B ∨ B < A\n\ncase neg\nα : Type u_1\ninst✝ : LinearOrder α\nA B : Colex α\nh₁ : ¬A = B\n⊢ A < B ∨ A = B ∨ B < A",
"state_before": "α : Type u_1\ninst✝ : LinearOrder α\nA B : Colex α\n⊢ A < B ∨ A = B ∨ B... | [
196,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.Reaches₀.single | [] | [
792,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
791,
1
] |
Mathlib/Algebra/Homology/Exact.lean | CategoryTheory.exact_comp_iso | [] | [
222,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Analysis/Analytic/Basic.lean | FormalMultilinearSeries.nnnorm_changeOriginSeries_le_tsum | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_3\nE : Type u_1\nF : Type u_2\nG : Type ?u.1254141\ninst✝⁶ : NontriviallyNormedField 𝕜\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : Normed... | [
1148,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1144,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.