file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Data/Polynomial/Laurent.lean | Polynomial.toLaurent_inj | [] | [
386,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Real.lean | Real.rpow_le_one | [
{
"state_after": "x✝ y z✝ x z : ℝ\nhx1 : 0 ≤ x\nhx2 : x ≤ 1\nhz : 0 ≤ z\n⊢ x ^ z ≤ 1 ^ z",
"state_before": "x✝ y z✝ x z : ℝ\nhx1 : 0 ≤ x\nhx2 : x ≤ 1\nhz : 0 ≤ z\n⊢ x ^ z ≤ 1",
"tactic": "rw [← one_rpow z]"
},
{
"state_after": "no goals",
"state_before": "x✝ y z✝ x z : ℝ\nhx1 : 0 ≤ x\nhx2 : ... | [
521,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
519,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_succ_row | [
{
"state_after": "m : Type ?u.2198697\nn✝ : Type ?u.2198700\ninst✝⁴ : DecidableEq n✝\ninst✝³ : Fintype n✝\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\nn : ℕ\nA : Matrix (Fin (Nat.succ n)) (Fin (Nat.succ n)) R\ni : Fin (Nat.succ n)\n⊢ det A =\n (-1) ^ ↑i * ∑ x : Fin (Nat.succ n... | [
772,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
756,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Basic.lean | Pmf.toOuterMeasure_apply_eq_of_inter_support_eq | [] | [
228,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Algebra/BigOperators/Order.lean | Finset.one_le_prod'' | [] | [
149,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.norm_eq_of_nonempty | [
{
"state_after": "case intro\nF : Type ?u.993399\nα : Type u\nβ : Type v\nγ : Type w\ninst✝¹ : TopologicalSpace α\ninst✝ : SeminormedAddCommGroup β\nf g : α →ᵇ β\nx : α\nC : ℝ\na : α\n⊢ ‖f‖ = sInf {C | ∀ (x : α), ‖↑f x‖ ≤ C}",
"state_before": "F : Type ?u.993399\nα : Type u\nβ : Type v\nγ : Type w\ninst✝¹ :... | [
811,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
805,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Algebra.toSubring_eq_top | [] | [
815,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.subset_def | [] | [
772,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
771,
1
] |
Mathlib/MeasureTheory/Function/SpecialFunctions/Basic.lean | Complex.measurable_cosh | [] | [
113,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/Data/Real/NNReal.lean | Real.toNNReal_one | [] | [
612,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
612,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithTop.coe_add_eq_top_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝ : Add α\na b c d : WithTop α\nx y✝ : α\ny : WithTop α\n⊢ ↑x + y = ⊤ ↔ y = ⊤",
"tactic": "induction y using WithTop.recTopCoe <;> simp [← coe_add]"
}
] | [
183,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Topology/Category/TopCat/Limits/Products.lean | TopCat.prodIsoProd_hom_snd | [
{
"state_after": "J : Type v\ninst✝ : SmallCategory J\nX Y : TopCat\n⊢ prodSnd = BinaryFan.snd (prodBinaryFan X Y)",
"state_before": "J : Type v\ninst✝ : SmallCategory J\nX Y : TopCat\n⊢ (prodIsoProd X Y).hom ≫ prodSnd = prod.snd",
"tactic": "simp [← Iso.eq_inv_comp, prodIsoProd]"
},
{
"state_af... | [
216,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/AlgebraicTopology/DoldKan/Degeneracies.lean | AlgebraicTopology.DoldKan.σ_comp_PInfty | [
{
"state_after": "C : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\nn : ℕ\ni : Fin (n + 1)\n⊢ n + 1 ≤ ↑i + (n + 1)",
"state_before": "C : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\nn : ℕ\ni : Fin (n + 1)\n⊢ SimplicialObject.σ X i ≫ Homologic... | [
124,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Topology/Connected.lean | QuotientMap.preimage_connectedComponent | [] | [
1092,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1087,
1
] |
Mathlib/Analysis/Convex/Topology.lean | Set.Finite.isClosed_convexHull | [] | [
299,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
297,
1
] |
Mathlib/RingTheory/Finiteness.lean | Submodule.fg_bot | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nM : Type u_2\ninst✝² : Semiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\n⊢ span R ↑∅ = ⊥",
"tactic": "rw [Finset.coe_empty, span_empty]"
}
] | [
147,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.ne_zero_of_degree_gt | [] | [
586,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
585,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Icc_subset_Iic_self | [] | [
478,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
478,
1
] |
Mathlib/RingTheory/Polynomial/Opposites.lean | Polynomial.opRingEquiv_op_C_mul_X_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nr : R\nn : ℕ\n⊢ ↑(opRingEquiv R) (op (↑C r * X ^ n)) = ↑C (op r) * X ^ n",
"tactic": "simp only [X_pow_mul, op_mul, op_pow, map_mul, map_pow, opRingEquiv_op_X, opRingEquiv_op_C]"
}
] | [
62,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Data/Prod/TProd.lean | List.TProd.elim_self | [
{
"state_after": "no goals",
"state_before": "ι : Type u\nα : ι → Type v\ni j : ι\nl : List ι\nf : (i : ι) → α i\ninst✝ : DecidableEq ι\nv : TProd α (i :: l)\n⊢ TProd.elim v (_ : i ∈ i :: l) = v.fst",
"tactic": "simp [TProd.elim]"
}
] | [
93,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | NNReal.rpow_add | [] | [
81,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/GroupTheory/QuotientGroup.lean | QuotientGroup.rangeKerLift_surjective | [
{
"state_after": "case mk.intro\nG : Type u\ninst✝¹ : Group G\nN : Subgroup G\nnN : Subgroup.Normal N\nH : Type v\ninst✝ : Group H\nφ : G →* H\ng : G\n⊢ ∃ a, ↑(rangeKerLift φ) a = { val := ↑φ g, property := (_ : ∃ y, ↑φ y = ↑φ g) }",
"state_before": "G : Type u\ninst✝¹ : Group G\nN : Subgroup G\nnN : Subgro... | [
393,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
1
] |
Mathlib/Order/Bounded.lean | Set.bounded_le_inter_lt | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nr : α → α → Prop\ns t : Set α\ninst✝ : LinearOrder α\na : α\n⊢ Bounded (fun x x_1 => x ≤ x_1) (s ∩ {b | a < b}) ↔ Bounded (fun x x_1 => x ≤ x_1) s",
"tactic": "simp_rw [← not_le, bounded_le_inter_not_le]"
}
] | [
332,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
330,
1
] |
Mathlib/Data/List/ToFinsupp.lean | List.toFinsupp_eq_sum_map_enum_single | [
{
"state_after": "M : Type ?u.27284\ninst✝² : Zero M\nl : List M\ninst✝¹ : DecidablePred fun x => getD l x 0 ≠ 0\nn : ℕ\nR : Type u_1\ninst✝ : AddMonoid R\n⊢ ∀ (l : List R) [inst : DecidablePred fun x => getD l x 0 ≠ 0],\n toFinsupp l = sum (map (fun nr => Finsupp.single nr.fst nr.snd) (enum l))",
"state... | [
159,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Logic/Function/Conjugate.lean | Function.Commute.semiconj | [] | [
102,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Data/Finset/NAry.lean | Finset.image₂_empty_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nα' : Type ?u.23812\nβ : Type u_3\nβ' : Type ?u.23818\nγ : Type u_1\nγ' : Type ?u.23824\nδ : Type ?u.23827\nδ' : Type ?u.23830\nε : Type ?u.23833\nε' : Type ?u.23836\nζ : Type ?u.23839\nζ' : Type ?u.23842\nν : Type ?u.23845\ninst✝⁷ : DecidableEq α'\... | [
140,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/MeasureTheory/Measure/Stieltjes.lean | MeasureTheory.tendsto_measure_Ici_atBot | [] | [
186,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Algebra/Parity.lean | Even.sub_odd | [
{
"state_after": "F : Type ?u.104684\nα : Type u_1\nβ : Type ?u.104690\nR : Type ?u.104693\ninst✝ : Ring α\na b : α\nn : ℕ\nha : Even a\nhb : Odd b\n⊢ Odd (a + -b)",
"state_before": "F : Type ?u.104684\nα : Type u_1\nβ : Type ?u.104690\nR : Type ?u.104693\ninst✝ : Ring α\na b : α\nn : ℕ\nha : Even a\nhb : O... | [
450,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
448,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.nontrivial_iff_exists_ne_one | [
{
"state_after": "G : Type u_1\nG' : Type ?u.170709\ninst✝² : Group G\ninst✝¹ : Group G'\nA : Type ?u.170718\ninst✝ : AddGroup A\nH✝ K H : Subgroup G\n⊢ (∃ y x, y ≠ ↑1) ↔ ∃ x, x ∈ H ∧ x ≠ 1",
"state_before": "G : Type u_1\nG' : Type ?u.170709\ninst✝² : Group G\ninst✝¹ : Group G'\nA : Type ?u.170718\ninst✝ :... | [
936,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
934,
1
] |
Mathlib/Topology/Instances/AddCircle.lean | AddCircle.continuousAt_equivIco | [
{
"state_after": "case H\n𝕜 : Type u_1\nB : Type ?u.98530\ninst✝³ : LinearOrderedAddCommGroup 𝕜\ninst✝² : TopologicalSpace 𝕜\ninst✝¹ : OrderTopology 𝕜\np : 𝕜\nhp : Fact (0 < p)\na : 𝕜\ninst✝ : Archimedean 𝕜\nx : AddCircle p\nz✝ : 𝕜\nhx : ↑z✝ ≠ ↑a\n⊢ ContinuousAt ↑(equivIco p a) ↑z✝",
"state_before":... | [
284,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | RingHom.coe_rangeRestrict | [] | [
1203,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1202,
1
] |
Mathlib/Order/Monotone/Basic.lean | antitoneOn_iff_forall_lt | [] | [
452,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
449,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.uIcc_of_ge | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.173551\nα : Type u_1\ninst✝¹ : Lattice α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\nh : b ≤ a\n⊢ [[a, b]] = Icc b a",
"tactic": "rw [uIcc, inf_eq_right.2 h, sup_eq_left.2 h]"
}
] | [
887,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
886,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | eval_soln | [] | [
423,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
422,
9
] |
Mathlib/Order/Cover.lean | AntisymmRel.trans_wcovby | [] | [
84,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Algebra/GroupWithZero/Basic.lean | inv_ne_zero | [
{
"state_after": "α : Type ?u.15737\nM₀ : Type ?u.15740\nG₀ : Type u_1\nM₀' : Type ?u.15746\nG₀' : Type ?u.15749\nF : Type ?u.15752\nF' : Type ?u.15755\ninst✝ : GroupWithZero G₀\na b c g h✝ x : G₀\nh : a ≠ 0\na_eq_0 : a⁻¹ = 0\nthis : a * a⁻¹ = 1\n⊢ False",
"state_before": "α : Type ?u.15737\nM₀ : Type ?u.15... | [
256,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/Order/Zorn.lean | zorn_nonempty_partialOrder₀ | [] | [
184,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/CategoryTheory/Generator.lean | CategoryTheory.Subobject.eq_of_isDetecting | [] | [
344,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_of_subsingleton | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝¹ : Semiring R\np q r : R[X]\ninst✝ : Subsingleton R\n⊢ natDegree p = 0",
"tactic": "rw [Subsingleton.elim p 0, natDegree_zero]"
}
] | [
126,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Tactic/NormNum/NatFib.lean | Mathlib.Meta.NormNum.isNat_fib | [] | [
102,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Std/Data/Nat/Lemmas.lean | Nat.succ_add_eq_succ_add | [
{
"state_after": "no goals",
"state_before": "n m : Nat\n⊢ succ n + m = n + succ m",
"tactic": "simp [succ_add, add_succ]"
}
] | [
319,
28
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
318,
1
] |
Mathlib/Data/Finset/Sort.lean | Finset.coe_orderIsoOfFin_apply | [] | [
165,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/Topology/Order/Basic.lean | pi_Iic_mem_nhds | [] | [
1461,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1460,
1
] |
Mathlib/Computability/Primrec.lean | Primrec₂.pair | [] | [
426,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
11
] |
Mathlib/Data/Real/EReal.lean | EReal.coe_ennreal_eq_one | [
{
"state_after": "no goals",
"state_before": "x : ℝ≥0∞\n⊢ ↑x = 1 ↔ x = 1",
"tactic": "rw [← coe_ennreal_eq_coe_ennreal_iff, coe_ennreal_one]"
}
] | [
526,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
525,
1
] |
Mathlib/GroupTheory/Subgroup/MulOpposite.lean | Subgroup.smul_opposite_mul | [] | [
65,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | DifferentiableOn.differentiableAt | [] | [
531,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
529,
1
] |
Mathlib/Topology/Order.lean | coinduced_sup | [] | [
454,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
453,
1
] |
Mathlib/Data/Set/Basic.lean | Set.not_monotoneOn_not_antitoneOn_iff_exists_le_le | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t₁ t₂ u : Set α\ninst✝¹ : LinearOrder α\ninst✝ : LinearOrder β\nf : α → β\n⊢ ¬MonotoneOn f s ∧ ¬AntitoneOn f s ↔ ∃ a x b x c x, a ≤ b ∧ b ≤ c ∧ (f a < f b ∧ f c < f b ∨ f b < f a ∧ f b < f c)",
... | [
2725,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2720,
1
] |
Mathlib/Data/List/Basic.lean | List.map_reverseAux | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.27240\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁✝ l₂✝ : List α\nf : α → β\nl₁ l₂ : List α\n⊢ map f (reverseAux l₁ l₂) = reverseAux (map f l₁) (map f l₂)",
"tactic": "simp only [reverseAux_eq, map_append, map_reverse]"
}
] | [
657,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
655,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.add_nat_inj | [] | [
872,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
871,
1
] |
Mathlib/Data/Sum/Interval.lean | Sum.Ioc_inl_inl | [] | [
150,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.span_monotone | [] | [
76,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Analysis/Convex/Cone/Basic.lean | ConvexCone.add_mem | [] | [
125,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Data/Rat/Cast.lean | MonoidWithZeroHom.ext_rat_on_pnat | [
{
"state_after": "no goals",
"state_before": "F : Type u_2\nι : Type ?u.88378\nα : Type ?u.88381\nβ : Type ?u.88384\nM₀ : Type u_1\ninst✝¹ : MonoidWithZero M₀\ninst✝ : MonoidWithZeroHomClass F ℚ M₀\nf g : F\nsame_on_neg_one : ↑f (-1) = ↑g (-1)\nsame_on_pnat : ∀ (n : ℕ), 0 < n → ↑f ↑n = ↑g ↑n\n⊢ ↑(comp ↑f ↑(... | [
477,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
470,
1
] |
Mathlib/RingTheory/Artinian.lean | IsArtinian.set_has_minimal | [] | [
195,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | Filter.Tendsto.isBoundedUnder_ge | [] | [
94,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/RingTheory/Polynomial/Bernstein.lean | bernsteinPolynomial.derivative_succ_aux | [
{
"state_after": "R : Type u_1\ninst✝ : CommRing R\nn ν : ℕ\n⊢ ↑Polynomial.derivative (↑(choose (n + 1) (ν + 1)) * X ^ (ν + 1) * (1 - X) ^ (n + 1 - (ν + 1))) =\n (↑n + 1) * (bernsteinPolynomial R n ν - bernsteinPolynomial R n (ν + 1))",
"state_before": "R : Type u_1\ninst✝ : CommRing R\nn ν : ℕ\n⊢ ↑Polyn... | [
137,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/MeasureTheory/Integral/CircleIntegral.lean | circleMap_not_mem_ball | [
{
"state_after": "no goals",
"state_before": "E : Type ?u.11344\ninst✝ : NormedAddCommGroup E\nc : ℂ\nR θ : ℝ\n⊢ ¬circleMap c R θ ∈ ball c R",
"tactic": "simp [dist_eq, le_abs_self]"
}
] | [
135,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.pushforward_le_bind_of_mem | [
{
"state_after": "case intro.intro\nC : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nX Y Z✝ : C\nf✝ : Y ⟶ X\nS✝ R✝ : Sieve X\nS : Presieve X\nR : ⦃Y : C⦄ → ⦃f : Y ⟶ X⦄ → S f → Sieve Y\nf : Y ⟶ X\nh : S f\nZ : C\ng : Z ⟶ Y\nhg : (R h).arrows g\n⊢ (bind S R).arrows (g ≫ f)",
"stat... | [
539,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
536,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.memℒp_zero_iff_aestronglyMeasurable | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nE : Type u_1\nF : Type ?u.910332\nG : Type ?u.910335\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nf : α → E\n⊢ Memℒp f 0 ↔ AEStronglyMeasura... | [
183,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_X_sub_C | [] | [
1473,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1472,
1
] |
Mathlib/CategoryTheory/Preadditive/Basic.lean | CategoryTheory.Preadditive.cokernelCoforkOfCofork_ofπ | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX Y : C\nf g : X ⟶ Y\nP : C\nπ : Y ⟶ P\nw : f ≫ π = g ≫ π\n⊢ (f - g) ≫ π = 0",
"tactic": "simp [w]"
}
] | [
392,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
1
] |
Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean | constFormalMultilinearSeries_apply | [] | [
346,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.SimpleFunc.integral_congr | [] | [
403,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
401,
1
] |
Mathlib/Data/Fintype/BigOperators.lean | Finset.prod_fin_eq_prod_range | [
{
"state_after": "α : Type ?u.56017\nβ : Type u_1\nγ : Type ?u.56023\ninst✝ : CommMonoid β\nn : ℕ\nc : Fin n → β\n⊢ ∀ (x : Fin n), x ∈ univ → c x = if h : ↑x < n then c { val := ↑x, isLt := h } else 1",
"state_before": "α : Type ?u.56017\nβ : Type u_1\nγ : Type ?u.56023\ninst✝ : CommMonoid β\nn : ℕ\nc : Fin... | [
244,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
240,
1
] |
Mathlib/LinearAlgebra/Matrix/BilinearForm.lean | BilinForm.toMatrix_mul | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.1773392\nM✝ : Type ?u.1773395\ninst✝²⁰ : Semiring R\ninst✝¹⁹ : AddCommMonoid M✝\ninst✝¹⁸ : Module R M✝\nR₁ : Type ?u.1773431\nM₁ : Type ?u.1773434\ninst✝¹⁷ : Ring R₁\ninst✝¹⁶ : AddCommGroup M₁\ninst✝¹⁵ : Module R₁ M₁\nR₂ : Type u_1\nM₂ : Type u_2\nin... | [
417,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | Equiv.tsum_eq_tsum_of_support | [] | [
574,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
572,
1
] |
src/lean/Init/SimpLemmas.lean | true_implies | [] | [
99,
96
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
99,
9
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.top_div_of_ne_top | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.274575\nβ : Type ?u.274578\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nh : a ≠ ⊤\n⊢ ⊤ / a = ⊤",
"tactic": "simp [top_div, h]"
}
] | [
1545,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1545,
1
] |
Mathlib/Order/Partition/Finpartition.lean | Finpartition.biUnion_parts | [] | [
474,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/CategoryTheory/Subobject/Lattice.lean | CategoryTheory.Subobject.le_inf | [
{
"state_after": "case intro.intro\nC : Type u₁\ninst✝² : Category C\nX Y Z : C\nD : Type u₂\ninst✝¹ : Category D\ninst✝ : HasPullbacks C\nA : C\nh✝ f✝ g✝ : Subobject A\nf g h : MonoOver A\nk : f ⟶ g\nl : f ⟶ h\n⊢ Quotient.mk'' f ≤ (inf.obj (Quotient.mk'' g)).obj (Quotient.mk'' h)",
"state_before": "C : Typ... | [
399,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
395,
1
] |
Mathlib/Order/Cover.lean | wcovby_iff_eq_or_covby | [] | [
386,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/Algebra/CharZero/Lemmas.lean | neg_eq_self_iff | [] | [
105,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.sUnion_mem_empty_univ | [
{
"state_after": "α : Type u_1\nβ : Type ?u.121205\nγ : Type ?u.121208\nι : Sort ?u.121211\nι' : Sort ?u.121214\nι₂ : Sort ?u.121217\nκ : ι → Sort ?u.121222\nκ₁ : ι → Sort ?u.121227\nκ₂ : ι → Sort ?u.121232\nκ' : ι' → Sort ?u.121237\nS : Set (Set α)\nh : S ⊆ {∅, univ}\n⊢ (∃ x x_1, ¬x = ∅) → ⋃₀ S = univ",
"s... | [
1114,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1109,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.mapDomain_comp | [
{
"state_after": "case refine'_1\nα : Type u_3\nβ : Type u_4\nγ : Type u_1\nι : Type ?u.162151\nM : Type u_2\nM' : Type ?u.162157\nN : Type ?u.162160\nP : Type ?u.162163\nG : Type ?u.162166\nH : Type ?u.162169\nR : Type ?u.162172\nS : Type ?u.162175\ninst✝ : AddCommMonoid M\nv v₁ v₂ : α →₀ M\nf : α → β\ng : β →... | [
480,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
472,
1
] |
Mathlib/Data/List/Basic.lean | List.getLast_congr | [
{
"state_after": "ι : Type ?u.31925\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂✝ l₂ : List α\nh₂ h₁ : l₂ ≠ []\n⊢ getLast l₂ h₁ = getLast l₂ h₂",
"state_before": "ι : Type ?u.31925\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁✝ l₂✝ l₁ l₂ : List α\nh₁ : l₁ ≠ []\nh₂ : l₂ ≠ []\nh₃ : l₁ = l₂\n⊢ ... | [
745,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
744,
1
] |
Mathlib/CategoryTheory/Abelian/NonPreadditive.lean | CategoryTheory.NonPreadditiveAbelian.add_comm | [
{
"state_after": "C : Type u\ninst✝¹ : Category C\ninst✝ : NonPreadditiveAbelian C\nX Y : C\na b : X ⟶ Y\n⊢ a - -b = b + a",
"state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : NonPreadditiveAbelian C\nX Y : C\na b : X ⟶ Y\n⊢ a + b = b + a",
"tactic": "rw [add_def]"
},
{
"state_after": "C ... | [
397,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Data/IsROrC/Lemmas.lean | IsROrC.conjCle_norm | [] | [
87,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Real.tan_add_pi | [] | [
1011,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1010,
1
] |
Mathlib/Algebra/Lie/Abelian.lean | LieAlgebra.self_module_ker_eq_center | [
{
"state_after": "case h\nR : Type u\nL : Type v\nM : Type w\nN : Type w₁\ninst✝¹⁰ : CommRing R\ninst✝⁹ : LieRing L\ninst✝⁸ : LieAlgebra R L\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\ninst✝⁵ : LieRingModule L M\ninst✝⁴ : LieModule R L M\ninst✝³ : AddCommGroup N\ninst✝² : Module R N\ninst✝¹ : LieRingModule L... | [
273,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Mathlib/Topology/UniformSpace/Completion.lean | CauchyFilter.separated_pureCauchy_injective | [
{
"state_after": "α : Type u_1\ninst✝ : UniformSpace α\ns✝ : SeparatedSpace α\na b : α\nh :\n (fun a => Quotient.mk (UniformSpace.separationSetoid (CauchyFilter α)) (pureCauchy a)) a =\n (fun a => Quotient.mk (UniformSpace.separationSetoid (CauchyFilter α)) (pureCauchy a)) b\ns : Set (α × α)\nhs : s ∈ 𝓤 α\... | [
331,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/GroupTheory/SpecificGroups/Alternating.lean | Equiv.Perm.mem_alternatingGroup | [] | [
74,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/Algebra/Associated.lean | associated_mul_unit_left_iff | [] | [
498,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
496,
1
] |
Mathlib/Order/Basic.lean | lt_of_lt_of_le' | [] | [
87,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.power_eq_two_power | [] | [
949,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
947,
1
] |
Mathlib/MeasureTheory/Constructions/Prod/Basic.lean | MeasureTheory.Measure.measure_prod_null | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nα' : Type ?u.4447223\nβ : Type u_1\nβ' : Type ?u.4447229\nγ : Type ?u.4447232\nE : Type ?u.4447235\ninst✝⁶ : MeasurableSpace α\ninst✝⁵ : MeasurableSpace α'\ninst✝⁴ : MeasurableSpace β\ninst✝³ : MeasurableSpace β'\ninst✝² : MeasurableSpace γ\nμ μ' :... | [
426,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
424,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.coe_toRingHom | [] | [
690,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
689,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | EMetric.diam_singleton | [] | [
916,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
915,
1
] |
Mathlib/Algebra/Lie/OfAssociative.lean | AlgEquiv.toLieEquiv_symm_apply | [] | [
368,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.derivFamily_limit | [] | [
178,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | cauchySeq_iff_tendsto | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝² : UniformSpace α\ninst✝¹ : Nonempty β\ninst✝ : SemilatticeSup β\nu : β → α\n⊢ Tendsto (fun p => (u p.fst, u p.snd)) (atTop ×ˢ atTop) (𝓤 α) ↔ Tendsto (Prod.map u u) atTop (𝓤 α)",
"tactic": "simp only [prod_atTop_atTop_eq, Prod... | [
199,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | not_isOfFinOrder_of_injective_pow | [
{
"state_after": "G : Type u\nA : Type v\nx✝ y : G\na b : A\nn m : ℕ\ninst✝¹ : Monoid G\ninst✝ : AddMonoid A\nx : G\nh : Injective fun n => x ^ n\n⊢ ∀ (x_1 : ℕ), 0 < x_1 → ¬x ^ x_1 = 1",
"state_before": "G : Type u\nA : Type v\nx✝ y : G\na b : A\nn m : ℕ\ninst✝¹ : Monoid G\ninst✝ : AddMonoid A\nx : G\nh : I... | [
90,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/Algebra/Homology/ImageToKernel.lean | imageToKernel_zero_right | [
{
"state_after": "case h\nι : Type ?u.9377\nV : Type u\ninst✝² : Category V\ninst✝¹ : HasZeroMorphisms V\nA B C : V\nf : A ⟶ B\ng : B ⟶ C\ninst✝ : HasImages V\nw : f ≫ 0 = 0\n⊢ imageToKernel f 0 w ≫ Subobject.arrow (kernelSubobject 0) =\n (Subobject.arrow (imageSubobject f) ≫ inv (Subobject.arrow (kernelSubo... | [
95,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.mul_iUnion | [] | [
496,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
495,
1
] |
Mathlib/CategoryTheory/Groupoid/FreeGroupoid.lean | CategoryTheory.Groupoid.Free.lift_spec | [
{
"state_after": "V : Type u\ninst✝¹ : Quiver V\nV' : Type u'\ninst✝ : Groupoid V'\nφ✝ φ : V ⥤q V'\n⊢ Quiver.Symmetrify.of ⋙q (Paths.of ⋙q (Quotient.functor redStep ⋙ lift φ).toPrefunctor) = φ",
"state_before": "V : Type u\ninst✝¹ : Quiver V\nV' : Type u'\ninst✝ : Groupoid V'\nφ✝ φ : V ⥤q V'\n⊢ of V ⋙q (lif... | [
173,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/CategoryTheory/Subobject/Comma.lean | CategoryTheory.StructuredArrow.projectSubobject_mk | [] | [
63,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
61,
1
] |
Mathlib/Dynamics/OmegaLimit.lean | omegaLimit_def | [] | [
74,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/CategoryTheory/Closed/Monoidal.lean | CategoryTheory.MonoidalClosed.pre_id | [
{
"state_after": "C : Type u\ninst✝⁴ : Category C\ninst✝³ : MonoidalCategory C\nA✝ B X X' Y Y' Z : C\ninst✝² : Closed A✝\ninst✝¹ : Closed B\nA : C\ninst✝ : Closed A\n⊢ ↑(transferNatTransSelf (ihom.adjunction A) (ihom.adjunction A)) (𝟙 ((tensoringLeft C).obj A)) = 𝟙 (ihom A)",
"state_before": "C : Type u\n... | [
278,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
1
] |
Mathlib/Analysis/Complex/ReImTopology.lean | Complex.closure_preimage_re | [] | [
81,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.