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/Calculus/ContDiff.lean | norm_iteratedFDerivWithin_comp_le | [
{
"state_after": "𝕜 : Type u_1\ninst✝¹⁰ : NontriviallyNormedField 𝕜\nD✝ : Type uD\ninst✝⁹ : NormedAddCommGroup D✝\ninst✝⁸ : NormedSpace 𝕜 D✝\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : Nor... | [
2696,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2652,
1
] |
Mathlib/Analysis/InnerProductSpace/Projection.lean | eq_orthogonalProjection_of_mem_orthogonal' | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_2\nE : Type u_1\nF : Type ?u.799854\ninst✝⁵ : IsROrC 𝕜\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : NormedAddCommGroup F\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : InnerProductSpace ℝ F\nK : Submodule 𝕜 E\ninst✝ : CompleteSpace { x // x ∈ K }\nu v z : ... | [
816,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
814,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.coe_direction_eq_vsub_set_right | [
{
"state_after": "k : Type u_1\nV : Type u_2\nP : Type u_3\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\ns : AffineSubspace k P\np : P\nhp : p ∈ s\n⊢ ↑s -ᵥ ↑s = (fun x => x -ᵥ p) '' ↑s",
"state_before": "k : Type u_1\nV : Type u_2\nP : Type u_3\ninst✝³ : Ring k\nin... | [
302,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
295,
1
] |
Mathlib/Algebra/Associated.lean | irreducible_mul_isUnit | [] | [
279,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/GroupTheory/Submonoid/Operations.lean | Submonoid.prod_top | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\nN : Type u_2\nP : Type ?u.98294\ninst✝³ : MulOneClass M\ninst✝² : MulOneClass N\ninst✝¹ : MulOneClass P\nS : Submonoid M\nA : Type ?u.98315\ninst✝ : SetLike A M\nhA : SubmonoidClass A M\nS' : A\ns : Submonoid M\nx : M × N\n⊢ x ∈ prod s ⊤ ↔ x ∈ coma... | [
873,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
872,
1
] |
Mathlib/Data/Set/Image.lean | Set.image_univ_of_surjective | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.32858\nβ : Type u_2\nγ : Type ?u.32864\nι✝ : Sort ?u.32867\nι' : Sort ?u.32870\nf✝ : α → β\ns t : Set α\nι : Type u_1\nf : ι → β\nH : Surjective f\n⊢ ∀ (x : β), x ∈ f '' univ",
"tactic": "simpa [image]"
}
] | [
338,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
337,
1
] |
Mathlib/Analysis/NormedSpace/PiLp.lean | PiLp.lipschitzWith_equiv | [] | [
518,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
517,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Uniform.lean | Pmf.toMeasure_ofMultiset_apply | [] | [
214,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Order/Filter/SmallSets.lean | Filter.HasAntitoneBasis.tendsto_smallSets | [] | [
89,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.quot_mk_eq_mk | [] | [
157,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Logic/Basic.lean | eq_ite_iff | [] | [
1136,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1135,
1
] |
Mathlib/Data/Finset/Fold.lean | Finset.fold_singleton | [] | [
63,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | fderivWithin_congr_set | [] | [
811,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
810,
1
] |
Mathlib/Topology/Algebra/ConstMulAction.lean | IsClosed.smul | [] | [
268,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.cauchy₂ | [] | [
175,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Computability/Language.lean | Language.one_def | [] | [
74,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | dist_div_norm_sq_smul | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.2668535\nE : Type ?u.2668538\nF : Type u_1\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx y : F\nhx : x ≠ 0\nhy : y ≠ 0\nR :... | [
1193,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1177,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Products.lean | CategoryTheory.Limits.has_smallest_products_of_hasProducts | [] | [
299,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/Analysis/SpecialFunctions/Sqrt.lean | ContDiffAt.sqrt | [] | [
165,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/Analysis/Normed/Group/Pointwise.lean | mul_ball | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\ninst✝ : SeminormedCommGroup E\nε δ : ℝ\ns t : Set E\nx y : E\n⊢ s * ball x δ = x • thickening δ s",
"tactic": "rw [← smul_ball_one, mul_smul_comm, mul_ball_one]"
}
] | [
233,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Std/Data/List/Init/Lemmas.lean | List.map_map | [
{
"state_after": "no goals",
"state_before": "β : Type u_1\nγ : Type u_2\nα : Type u_3\ng : β → γ\nf : α → β\nl : List α\n⊢ map g (map f l) = map (g ∘ f) l",
"tactic": "induction l <;> simp_all"
}
] | [
96,
65
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
95,
9
] |
Mathlib/Data/MvPolynomial/Rename.lean | MvPolynomial.rename_X | [] | [
71,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/CategoryTheory/Limits/Final.lean | CategoryTheory.Functor.initial_of_adjunction | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nL : C ⥤ D\nR : D ⥤ C\nadj : L ⊣ R\nd : D\nu : CostructuredArrow L d := CostructuredArrow.mk (adj.counit.app d)\nf g : CostructuredArrow L d\n⊢ L.map (↑(Adjunction.homEquiv adj f.left d) f.hom) ≫ ... | [
152,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/MeasureTheory/Measure/GiryMonad.lean | MeasureTheory.Measure.join_map_dirac | [] | [
231,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Combinatorics/Pigeonhole.lean | Finset.exists_le_card_fiber_of_nsmul_le_card_of_maps_to | [
{
"state_after": "α : Type u\nβ : Type v\nM : Type w\ninst✝¹ : DecidableEq β\ns : Finset α\nt : Finset β\nf : α → β\nw : α → M\nb : M\nn : ℕ\ninst✝ : LinearOrderedCommSemiring M\nhf : ∀ (a : α), a ∈ s → f a ∈ t\nht : Finset.Nonempty t\nhb : card t • b ≤ ∑ a in s, 1\n⊢ ∃ y, y ∈ t ∧ b ≤ ∑ a in filter (fun x => f ... | [
280,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/Data/Setoid/Basic.lean | Quotient.eq_rel | [] | [
54,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.toPartENat_cast | [
{
"state_after": "no goals",
"state_before": "α β : Type u\nn : ℕ\n⊢ ↑toPartENat ↑n = ↑n",
"tactic": "rw [toPartENat_apply_of_lt_aleph0 (nat_lt_aleph0 n), toNat_cast]"
}
] | [
1866,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1865,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/InverseDeriv.lean | Real.hasDerivWithinAt_arcsin_Ici | [
{
"state_after": "case inl\nh : 1 ≠ -1\n⊢ HasDerivWithinAt arcsin (1 / sqrt (1 - 1 ^ 2)) (Ici 1) 1\n\ncase inr\nx : ℝ\nh : x ≠ -1\nh' : x ≠ 1\n⊢ HasDerivWithinAt arcsin (1 / sqrt (1 - x ^ 2)) (Ici x) x",
"state_before": "x : ℝ\nh : x ≠ -1\n⊢ HasDerivWithinAt arcsin (1 / sqrt (1 - x ^ 2)) (Ici x) x",
"ta... | [
74,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/LinearAlgebra/Lagrange.lean | Lagrange.eval_basis_of_ne | [
{
"state_after": "F : Type u_2\ninst✝¹ : Field F\nι : Type u_1\ninst✝ : DecidableEq ι\ns : Finset ι\nv : ι → F\ni j : ι\nhij : i ≠ j\nhj : j ∈ s\n⊢ ∃ a, a ∈ Finset.erase s i ∧ eval (v j) (basisDivisor (v i) (v a)) = 0",
"state_before": "F : Type u_2\ninst✝¹ : Field F\nι : Type u_1\ninst✝ : DecidableEq ι\ns ... | [
236,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.inter_singleton_of_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.188015\nγ : Type ?u.188018\ninst✝ : DecidableEq α\ns✝ s₁ s₂ t t₁ t₂ u v : Finset α\na✝ b a : α\ns : Finset α\nh : a ∈ s\n⊢ s ∩ {a} = {a}",
"tactic": "rw [inter_comm, singleton_inter_of_mem h]"
}
] | [
1687,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1686,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | HasDerivWithinAt.congr | [] | [
580,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
578,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.Semiconj.mapsTo_ptsOfPeriod | [] | [
206,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Std/Data/String/Lemmas.lean | String.Iterator.ValidFor.remainingToString | [
{
"state_after": "case refl\nl r : List Char\nh : ValidFor l r { s := { data := List.reverseAux l r }, i := { byteIdx := utf8Len l } }\n⊢ Iterator.remainingToString { s := { data := List.reverseAux l r }, i := { byteIdx := utf8Len l } } = { data := r }",
"state_before": "l r : List Char\nit : Iterator\nh : ... | [
603,
95
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
601,
1
] |
Mathlib/CategoryTheory/Limits/ColimitLimit.lean | CategoryTheory.Limits.ι_colimitLimitToLimitColimit_π | [
{
"state_after": "J K : Type v\ninst✝⁴ : SmallCategory J\ninst✝³ : SmallCategory K\nC : Type u\ninst✝² : Category C\nF : J × K ⥤ C\ninst✝¹ : HasLimitsOfShape J C\ninst✝ : HasColimitsOfShape K C\nj : J\nk : K\n⊢ colimit.ι (curry.obj (Prod.swap K J ⋙ F) ⋙ lim) k ≫\n limit.lift (curry.obj F ⋙ colim)\n ... | [
99,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/CategoryTheory/Limits/Preserves/Limits.lean | CategoryTheory.preserves_lift_mapCone | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝³ : Category C\nD : Type u₂\ninst✝² : Category D\nG : C ⥤ D\nJ : Type w\ninst✝¹ : Category J\nF : J ⥤ C\ninst✝ : PreservesLimit F G\nc₁ c₂ : Cone F\nt : IsLimit c₁\n⊢ ∀ (j : J), G.map (IsLimit.lift t c₂) ≫ (G.mapCone c₁).π.app j = (G.mapCone c₂... | [
51,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | Localization.add_mk_self | [
{
"state_after": "R : Type u_1\ninst✝³ : CommSemiring R\nM : Submonoid R\nS : Type ?u.2768138\ninst✝² : CommSemiring S\ninst✝¹ : Algebra R S\nP : Type ?u.2768305\ninst✝ : CommSemiring P\na : R\nb : { x // x ∈ M }\nc : R\n⊢ ↑(r' M) (↑b * c + ↑b * a, b * b) (a + c, b)",
"state_before": "R : Type u_1\ninst✝³ :... | [
893,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
889,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | zpow_bit0 | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nM : Type u\nN : Type v\nG : Type w\nH : Type x\nA : Type y\nB : Type z\nR : Type u₁\nS : Type u₂\ninst✝ : DivisionMonoid α\na : α\nn : ℕ\n⊢ a ^ bit0 ↑n = a ^ ↑n * a ^ ↑n",
"tactic": "simp only [zpow_ofNat, ← Int.ofNat_bit0, pow_bit0]"
},
{
... | [
173,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Data/Seq/Seq.lean | Stream'.Seq.tail_cons | [
{
"state_after": "case mk\nα : Type u\nβ : Type v\nγ : Type w\na : α\nf : Stream' (Option α)\nal : IsSeq f\n⊢ tail (cons a { val := f, property := al }) = { val := f, property := al }",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na : α\ns : Seq α\n⊢ tail (cons a s) = s",
"tactic": "cases' s wit... | [
274,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | abs_dist_sub_le_dist_mul_mul | [
{
"state_after": "no goals",
"state_before": "𝓕 : Type ?u.649048\n𝕜 : Type ?u.649051\nα : Type ?u.649054\nι : Type ?u.649057\nκ : Type ?u.649060\nE : Type u_1\nF : Type ?u.649066\nG : Type ?u.649069\ninst✝¹ : SeminormedCommGroup E\ninst✝ : SeminormedCommGroup F\na a₁✝ a₂✝ b b₁✝ b₂✝ : E\nr r₁ r₂ : ℝ\na₁ a₂... | [
1457,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1454,
1
] |
Mathlib/Algebra/Ring/Prod.lean | RingHom.snd_comp_prod | [] | [
237,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
236,
1
] |
Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean | Differentiable.exp | [] | [
309,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
308,
1
] |
Mathlib/Data/Set/Basic.lean | Set.compl_univ | [] | [
1674,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1673,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_eq_zero_iff_degree_le_zero | [
{
"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[X]\nι : Type ?u.701471\n⊢ natDegree p = 0 ↔ degree p ≤ 0",
"tactic": "rw [← nonpos_iff_eq_zero, natDegree_le_iff_degree_le,\n Nat.cast_withBot, WithBot.coe_zero]"
}
] | [
1075,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1072,
1
] |
Mathlib/Data/List/Basic.lean | List.nthLe_insertNth_add_succ | [
{
"state_after": "ι : Type ?u.128455\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\na : α\nl : List α\nx : α\nn k : ℕ\nhk' : n + k < length l\n⊢ n + k + 1 < length l + 1",
"state_before": "ι : Type ?u.128455\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\na : α\nl : List α... | [
1753,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1747,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.c_eq_three_roots | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.1067442\nS : Type ?u.1067445\nF : Type u_1\nK : Type u_2\nP : Cubic F\ninst✝¹ : Field F\ninst✝ : Field K\nφ : F →+* K\nx y z : K\nha : P.a ≠ 0\nh3 : roots (map φ P) = {x, y, z}\n⊢ ↑φ P.c = ↑φ P.a * (x * y + x * z + y * z)",
"tactic": "injection e... | [
549,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
547,
1
] |
Mathlib/Algebra/Order/ToIntervalMod.lean | toIocDiv_sub' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedAddCommGroup α\nhα : Archimedean α\np : α\nhp : 0 < p\na✝ b✝ c : α\nn : ℤ\na b : α\n⊢ toIocDiv hp (a - p) b = toIocDiv hp a b + 1",
"tactic": "simpa only [one_zsmul] using toIocDiv_sub_zsmul' hp a b 1"
}
] | [
355,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
354,
1
] |
Mathlib/Data/Pi/Interval.lean | Pi.card_Icc | [] | [
46,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.prod_eq_seq | [
{
"state_after": "case h.mk\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.274480\nι : Sort ?u.274483\nι' : Sort ?u.274486\nι₂ : Sort ?u.274489\nκ : ι → Sort ?u.274494\nκ₁ : ι → Sort ?u.274499\nκ₂ : ι → Sort ?u.274504\nκ' : ι' → Sort ?u.274509\ns : Set α\nt : Set β\na : α\nb : β\n⊢ (a, b) ∈ s ×ˢ t ↔ (a, b) ∈ seq (Pro... | [
2000,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1993,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.coe_smulRight | [] | [
303,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.le_floor_add_floor | [
{
"state_after": "F : Type ?u.132012\nα : Type u_1\nβ : Type ?u.132018\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na✝ a b : α\n⊢ ↑⌊a + b⌋ - 1 - a ≤ ↑⌊b⌋",
"state_before": "F : Type ?u.132012\nα : Type u_1\nβ : Type ?u.132018\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na✝ a b : ... | [
743,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
739,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.disjoint_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.42944\nγ : Type ?u.42947\nf : α → β\ns t u : Finset α\na b : α\n⊢ _root_.Disjoint s t ↔ ∀ ⦃a : α⦄, a ∈ t → ¬a ∈ s",
"tactic": "rw [_root_.disjoint_comm, disjoint_left]"
}
] | [
919,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
918,
1
] |
Mathlib/Data/List/Count.lean | List.countp_eq_zero | [
{
"state_after": "α : Type u_1\nl : List α\np q : α → Bool\n⊢ (∃ a, a ∈ l ∧ p a = true) ↔ ¬∀ (a : α), a ∈ l → ¬p a = true",
"state_before": "α : Type u_1\nl : List α\np q : α → Bool\n⊢ countp p l = 0 ↔ ∀ (a : α), a ∈ l → ¬p a = true",
"tactic": "rw [← not_iff_not, ← Ne.def, ← pos_iff_ne_zero, countp_pos... | [
108,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Cardinal.sup_lt_ord_lift_of_isRegular | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.158147\nr : α → α → Prop\nι : Type u\nf : ι → Ordinal\nc : Cardinal\nhc : IsRegular c\nhι : lift (#ι) < c\n⊢ lift (#ι) < Ordinal.cof (ord c)",
"tactic": "rwa [hc.cof_eq]"
}
] | [
1073,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1071,
1
] |
Mathlib/LinearAlgebra/Orientation.lean | Orientation.eq_or_eq_neg_of_isEmpty | [
{
"state_after": "case h\nR : Type u_1\ninst✝⁴ : LinearOrderedCommRing R\nM : Type u_3\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\nι : Type u_2\ninst✝¹ : Nontrivial R\ninst✝ : IsEmpty ι\nx : AlternatingMap R M R ι\nhx : x ≠ 0\n⊢ rayOfNeZero R x hx = positiveOrientation ∨ rayOfNeZero R x hx = -positiveOrienta... | [
209,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Data/Num/Lemmas.lean | ZNum.ofInt'_neg | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.959671\nn : ℕ\n⊢ ofInt' ↑(n + 1) = -ofInt' -[n+1]",
"tactic": "simp only [ofInt', Num.zneg_toZNumNeg]"
},
{
"state_after": "α : Type ?u.959671\n⊢ Num.toZNum 0 = -Num.toZNum 0",
"state_before": "α : Type ?u.959671\n⊢ Num.toZNum (Num.of... | [
1361,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1358,
1
] |
Mathlib/Order/UpperLower/Basic.lean | UpperSet.coe_sup | [] | [
534,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
533,
1
] |
Mathlib/RingTheory/OreLocalization/Basic.lean | OreLocalization.expand | [
{
"state_after": "case a\nR : Type u_1\ninst✝¹ : Monoid R\nS : Submonoid R\ninst✝ : OreSet S\nr : R\ns : { x // x ∈ S }\nt : R\nhst : ↑s * t ∈ S\n⊢ (r, s) ≈ (r * t, { val := ↑s * t, property := hst })",
"state_before": "R : Type u_1\ninst✝¹ : Monoid R\nS : Submonoid R\ninst✝ : OreSet S\nr : R\ns : { x // x ... | [
122,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
11
] |
Mathlib/Algebra/Star/SelfAdjoint.lean | IsSelfAdjoint.inv | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nA : Type ?u.44405\ninst✝¹ : DivisionSemiring R\ninst✝ : StarRing R\nx : R\nhx : IsSelfAdjoint x\n⊢ IsSelfAdjoint x⁻¹",
"tactic": "simp only [isSelfAdjoint_iff, star_inv', hx.star_eq]"
}
] | [
234,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | zpow_mul_comm | [] | [
256,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/CategoryTheory/Preadditive/Biproducts.lean | CategoryTheory.Limits.HasBiproduct.of_hasProduct | [
{
"state_after": "case intro\nC : Type u\ninst✝⁴ : Category C\ninst✝³ : Preadditive C\nJ✝ : Type\ninst✝² : Fintype J✝\nJ : Type\ninst✝¹ : Finite J\nf : J → C\ninst✝ : HasProduct f\nval✝ : Fintype J\n⊢ HasBiproduct f",
"state_before": "C : Type u\ninst✝⁴ : Category C\ninst✝³ : Preadditive C\nJ✝ : Type\ninst✝... | [
161,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.projKerOfRightInverse_comp_inv | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\ninst✝¹⁵ : Ring R\nR₂ : Type u_3\ninst✝¹⁴ : Ring R₂\nR₃ : Type ?u.939196\ninst✝¹³ : Ring R₃\nM : Type u_1\ninst✝¹² : TopologicalSpace M\ninst✝¹¹ : AddCommGroup M\nM₂ : Type u_4\ninst✝¹⁰ : TopologicalSpace M₂\ninst✝⁹ : AddCommGroup M₂\nM₃ : Type ?u.9... | [
1472,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1469,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | isOpenMap_mul_left | [] | [
81,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.IsPeriodicPt.gcd | [
{
"state_after": "α : Type u_1\nβ : Type ?u.3903\nf fa : α → α\nfb : β → β\nx y : α\nm n : ℕ\n⊢ IsPeriodicPt f m x → IsPeriodicPt f n x → IsPeriodicPt f (Nat.gcd m n) x",
"state_before": "α : Type u_1\nβ : Type ?u.3903\nf fa : α → α\nfb : β → β\nx y : α\nm n : ℕ\nhm : IsPeriodicPt f m x\nhn : IsPeriodicPt f... | [
175,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
11
] |
Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean | CategoryTheory.Limits.Multiequalizer.multifork_π_app_left | [] | [
780,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
778,
1
] |
Mathlib/Analysis/Normed/Group/HomCompletion.lean | NormedAddGroupHom.extension_unique | [
{
"state_after": "case H\nG : Type u_1\ninst✝³ : SeminormedAddCommGroup G\nH : Type u_2\ninst✝² : SeminormedAddCommGroup H\ninst✝¹ : SeparatedSpace H\ninst✝ : CompleteSpace H\nf : NormedAddGroupHom G H\ng : NormedAddGroupHom (Completion G) H\nhg : ∀ (v : G), ↑f v = ↑g (↑G v)\nv : Completion G\n⊢ ↑(extension f) ... | [
234,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Data/List/Destutter.lean | List.destutter_is_chain' | [] | [
155,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | uniformContinuous_nnnorm' | [] | [
1123,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1122,
1
] |
Mathlib/FieldTheory/IntermediateField.lean | IntermediateField.coe_nat_mem | [
{
"state_after": "no goals",
"state_before": "K : Type u_2\nL : Type u_1\nL' : Type ?u.75335\ninst✝⁴ : Field K\ninst✝³ : Field L\ninst✝² : Field L'\ninst✝¹ : Algebra K L\ninst✝ : Algebra K L'\nS : IntermediateField K L\nn : ℕ\n⊢ ↑n ∈ S",
"tactic": "simpa using coe_int_mem S n"
}
] | [
281,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | MeasureTheory.Memℒp.coeFn_toLp | [] | [
122,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Analysis/Complex/LocallyUniformLimit.lean | Complex.norm_cderiv_sub_lt | [] | [
96,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.IsSt.mul | [] | [
632,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
631,
1
] |
Mathlib/MeasureTheory/Covering/Differentiation.lean | VitaliFamily.withDensity_limRatioMeas_eq | [
{
"state_after": "case h\nα : Type u_1\ninst✝⁵ : MetricSpace α\nm0 : MeasurableSpace α\nμ : MeasureTheory.Measure α\nv : VitaliFamily μ\nE : Type ?u.5186182\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : SecondCountableTopology α\ninst✝² : BorelSpace α\ninst✝¹ : IsLocallyFiniteMeasure μ\nρ : MeasureTheory.Measure α\n... | [
689,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
668,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDense.lean | MeasureTheory.SimpleFunc.nearestPtInd_succ | [
{
"state_after": "α : Type u_1\nβ : Type ?u.11058\nι : Type ?u.11061\nE : Type ?u.11064\nF : Type ?u.11067\n𝕜 : Type ?u.11070\ninst✝² : MeasurableSpace α\ninst✝¹ : PseudoEMetricSpace α\ninst✝ : OpensMeasurableSpace α\ne : ℕ → α\nN : ℕ\nx : α\n⊢ (if x ∈ ⋂ (k : ℕ) (_ : k ≤ Nat.add N 0), {x | edist (e (Nat.add N ... | [
94,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Data/Set/Image.lean | Disjoint.of_preimage | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.120582\nf : α → β\ns✝ t✝ : Set α\nhf : Surjective f\ns t : Set β\nh : Disjoint (f ⁻¹' s) (f ⁻¹' t)\n⊢ Disjoint s t",
"tactic": "rw [disjoint_iff_inter_eq_empty, ← image_preimage_eq (_ ∩ _) hf, preimage_inter, h.inter_e... | [
1608,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1605,
1
] |
Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean | bot_eq_one' | [] | [
392,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Analysis/Normed/Group/Quotient.lean | QuotientAddGroup.norm_eq_infDist | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\nN : Type ?u.25731\ninst✝¹ : SeminormedAddCommGroup M\ninst✝ : SeminormedAddCommGroup N\nS : AddSubgroup M\nx : M ⧸ S\n⊢ ‖x‖ = infDist 0 {m | ↑m = x}",
"tactic": "simp only [AddSubgroup.quotient_norm_eq, infDist_eq_iInf, sInf_image', dist_zero_l... | [
117,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.findMax_dual | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nt : Ordnode α\n⊢ findMax (dual t) = findMin t",
"tactic": "rw [← findMin_dual, dual_dual]"
}
] | [
595,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
594,
1
] |
Mathlib/Topology/MetricSpace/Gluing.lean | Metric.isometry_inl | [] | [
283,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Std/Data/List/Lemmas.lean | List.self_mem_range_succ | [
{
"state_after": "no goals",
"state_before": "n : Nat\n⊢ n ∈ range (n + 1)",
"tactic": "simp"
}
] | [
1918,
69
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1918,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.some_zero | [
{
"state_after": "case h\nα : Type u_2\nβ : Type ?u.319084\nγ : Type ?u.319087\nι : Type ?u.319090\nM : Type u_1\nM' : Type ?u.319096\nN : Type ?u.319099\nP : Type ?u.319102\nG : Type ?u.319105\nH : Type ?u.319108\nR : Type ?u.319111\nS : Type ?u.319114\ninst✝ : Zero M\na✝ : α\n⊢ ↑(some 0) a✝ = ↑0 a✝",
"sta... | [
819,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
817,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | EMetric.controlled_of_uniformEmbedding | [] | [
313,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
310,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | MeasureTheory.snorm_indicator_const' | [
{
"state_after": "case pos\nα : Type u_1\nE : Type ?u.645570\nF : Type ?u.645573\nG : Type u_2\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\ns : Set α\nhs✝ : MeasurableSet s\nc✝ : E\nf : α → E\nhf : AEStro... | [
613,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
609,
1
] |
Mathlib/Data/Option/Basic.lean | Option.bind_eq_some' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.1609\nδ : Type ?u.1612\nx : Option α\nf : α → Option β\nb : β\n⊢ Option.bind x f = some b ↔ ∃ a, x = some a ∧ f a = some b",
"tactic": "cases x <;> simp"
}
] | [
91,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Data/List/Nodup.lean | List.Nodup.ne_singleton_iff | [
{
"state_after": "case nil\nα : Type u\nβ : Type v\nl✝ l₁ l₂ : List α\nr : α → α → Prop\na b : α\nl : List α\nh✝ : Nodup l\nx : α\nh : Nodup []\n⊢ [] ≠ [x] ↔ [] = [] ∨ ∃ y, y ∈ [] ∧ y ≠ x\n\ncase cons\nα : Type u\nβ : Type v\nl✝ l₁ l₂ : List α\nr : α → α → Prop\na b : α\nl : List α\nh✝ : Nodup l\nx hd : α\ntl :... | [
150,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Std/Data/Nat/Gcd.lean | Nat.gcd_ne_zero_right | [] | [
114,
83
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
114,
1
] |
Mathlib/RingTheory/Polynomial/Quotient.lean | MvPolynomial.quotient_map_C_eq_zero | [
{
"state_after": "R : Type u_1\nσ : Type u_2\ninst✝ : CommRing R\nr : R\nI : Ideal R\ni : R\nhi : i ∈ I\n⊢ ↑C i ∈ Ideal.map C I",
"state_before": "R : Type u_1\nσ : Type u_2\ninst✝ : CommRing R\nr : R\nI : Ideal R\ni : R\nhi : i ∈ I\n⊢ ↑(RingHom.comp (Ideal.Quotient.mk (Ideal.map C I)) C) i = 0",
"tacti... | [
201,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | HasDerivAt.deriv | [] | [
453,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
452,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Iic_union_Ici | [] | [
1220,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1219,
1
] |
Mathlib/Order/Filter/FilterProduct.lean | Filter.Germ.lt_def | [
{
"state_after": "case h.mk.h.mk.a\nα : Type u\nβ : Type v\nφ : Ultrafilter α\ninst✝ : Preorder β\nx✝¹ : Germ (↑φ) β\nf : α → β\nx✝ : Germ (↑φ) β\ng : α → β\n⊢ Quot.mk Setoid.r f < Quot.mk Setoid.r g ↔ LiftRel (fun x x_1 => x < x_1) (Quot.mk Setoid.r f) (Quot.mk Setoid.r g)",
"state_before": "α : Type u\nβ ... | [
83,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
81,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.degree_of_a_ne_zero | [] | [
305,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
304,
1
] |
Mathlib/Order/CompleteLattice.lean | iSup_congr_Prop | [
{
"state_after": "α : Type u_1\nβ : Type ?u.63159\nβ₂ : Type ?u.63162\nγ : Type ?u.63165\nι : Sort ?u.63168\nι' : Sort ?u.63171\nκ : ι → Sort ?u.63176\nκ' : ι' → Sort ?u.63181\ninst✝ : SupSet α\nf✝ g : ι → α\np : Prop\nf₁ f₂ : p → α\npq : p ↔ p\nf : ∀ (x : p), f₁ (_ : p) = f₂ x\n⊢ iSup f₁ = iSup f₂",
"state... | [
664,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
660,
1
] |
Mathlib/RingTheory/Algebraic.lean | Subalgebra.inv_mem_of_root_of_coeff_zero_ne_zero | [
{
"state_after": "R : Type ?u.788449\nS : Type ?u.788452\ninst✝⁵ : CommRing R\ninst✝⁴ : IsDomain R\ninst✝³ : CommRing S\nK : Type u_2\nL : Type u_1\ninst✝² : Field K\ninst✝¹ : Field L\ninst✝ : Algebra K L\nA : Subalgebra K L\nx : { x // x ∈ A }\np : K[X]\naeval_eq : ↑(aeval x) p = 0\ncoeff_zero_ne : coeff p 0 ≠... | [
372,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
362,
1
] |
Mathlib/CategoryTheory/Abelian/NonPreadditive.lean | CategoryTheory.NonPreadditiveAbelian.lift_σ | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : NonPreadditiveAbelian C\nX : C\n⊢ prod.lift (𝟙 X) 0 ≫ σ = 𝟙 X",
"tactic": "rw [← Category.assoc, IsIso.hom_inv_id]"
}
] | [
292,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
292,
1
] |
Mathlib/NumberTheory/LegendreSymbol/MulCharacter.lean | MulChar.one_mul | [
{
"state_after": "case h\nR : Type u\ninst✝¹ : CommMonoid R\nR' : Type v\ninst✝ : CommMonoidWithZero R'\nχ : MulChar R R'\na✝ : Rˣ\n⊢ ↑(1 * χ) ↑a✝ = ↑χ ↑a✝",
"state_before": "R : Type u\ninst✝¹ : CommMonoid R\nR' : Type v\ninst✝ : CommMonoidWithZero R'\nχ : MulChar R R'\n⊢ 1 * χ = χ",
"tactic": "ext"
... | [
318,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
316,
11
] |
Mathlib/MeasureTheory/Integral/CircleIntegral.lean | range_circleMap | [
{
"state_after": "E : Type ?u.12721\ninst✝ : NormedAddCommGroup E\nc : ℂ\nR : ℝ\n⊢ c +ᵥ sphere (R • 0) (‖R‖ * 1) = sphere c (Abs.abs R)",
"state_before": "E : Type ?u.12721\ninst✝ : NormedAddCommGroup E\nc : ℂ\nR : ℝ\n⊢ (c +ᵥ R • range fun θ => exp (↑θ * I)) = sphere c (Abs.abs R)",
"tactic": "rw [Compl... | [
152,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.mapsTo | [] | [
171,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
11
] |
Mathlib/Algebra/Field/Opposite.lean | MulOpposite.op_ratCast | [] | [
31,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
30,
1
] |
Mathlib/Order/OmegaCompletePartialOrder.lean | OmegaCompletePartialOrder.ContinuousHom.coe_inj | [] | [
717,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
716,
11
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.Red.sublist | [] | [
395,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
11
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.coe_mk' | [] | [
128,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.