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/SetTheory/Cardinal/Basic.lean | Cardinal.add_one_le_succ | [
{
"state_after": "α β : Type u\nc : Cardinal\nthis : Set.Nonempty {c' | c < c'}\n⊢ c + 1 ≤ succ c",
"state_before": "α β : Type u\nc : Cardinal\n⊢ c + 1 ≤ succ c",
"tactic": "have : Set.Nonempty { c' | c < c' } := exists_gt c"
},
{
"state_after": "α β : Type u\nc : Cardinal\nthis : Set.Nonempty ... | [
828,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
816,
1
] |
Mathlib/Order/Atoms.lean | IsAtom.lt_iff | [] | [
89,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/MeasureTheory/Integral/MeanInequalities.lean | ENNReal.lintegral_Lp_mul_le_Lq_mul_Lr | [
{
"state_after": "α✝ : Type ?u.1456644\ninst✝¹ : MeasurableSpace α✝\nμ✝ : MeasureTheory.Measure α✝\nα : Type u_1\ninst✝ : MeasurableSpace α\np q r : ℝ\nhp0_lt : 0 < p\nhpq : p < q\nhpqr : 1 / p = 1 / q + 1 / r\nμ : MeasureTheory.Measure α\nf g : α → ℝ≥0∞\nhf : AEMeasurable f\nhg : AEMeasurable g\nhp0_ne : p ≠ 0... | [
254,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.pow_of_coprime | [
{
"state_after": "case pos\nM : Type u_1\nN : Type ?u.1908173\nG : Type ?u.1908176\nR : Type ?u.1908179\nS : Type ?u.1908182\nF : Type ?u.1908185\ninst✝² : CommMonoid M\ninst✝¹ : CommMonoid N\ninst✝ : DivisionCommMonoid G\nk l : ℕ\nζ : M\nf : F\nh : IsPrimitiveRoot ζ k\ni : ℕ\nhi : Nat.coprime i k\nh0 : k = 0\n... | [
431,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.adj_getVert_succ | [
{
"state_after": "no goals",
"state_before": "case nil\nV : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu v u✝ : V\ni : ℕ\nhi : i < length nil\n⊢ Adj G (getVert nil i) (getVert nil (i + 1))",
"tactic": "cases hi"
},
{
"state_after": "case con... | [
242,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean | Real.volume_interval | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.242227\ninst✝ : Fintype ι\na b : ℝ\n⊢ ↑↑volume (uIcc a b) = ofReal (abs (b - a))",
"tactic": "rw [← Icc_min_max, volume_Icc, max_sub_min_eq_abs]"
}
] | [
144,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Topology/MetricSpace/Isometry.lean | Isometry.antilipschitz | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.1422\nα : Type u\nβ : Type v\nγ : Type w\ninst✝² : PseudoEMetricSpace α\ninst✝¹ : PseudoEMetricSpace β\ninst✝ : PseudoEMetricSpace γ\nf : α → β\nx✝ y✝ z : α\ns : Set α\nh : Isometry f\nx y : α\n⊢ edist x y ≤ ↑1 * edist (f x) (f y)",
"tactic": "si... | [
89,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Std/Data/Array/Init/Lemmas.lean | Array.foldr_push | [] | [
87,
73
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
86,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.nonempty_sUnion | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.122213\nγ : Type ?u.122216\nι : Sort ?u.122219\nι' : Sort ?u.122222\nι₂ : Sort ?u.122225\nκ : ι → Sort ?u.122230\nκ₁ : ι → Sort ?u.122235\nκ₂ : ι → Sort ?u.122240\nκ' : ι' → Sort ?u.122245\nS : Set (Set α)\n⊢ Set.Nonempty (⋃₀ S) ↔ ∃ s, ... | [
1118,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1117,
1
] |
Mathlib/Data/Polynomial/Derivative.lean | Polynomial.derivative_X_sub_C_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\nι : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : CommRing R\nc : R\nm : ℕ\n⊢ ↑derivative ((X - ↑C c) ^ m) = ↑C ↑m * (X - ↑C c) ^ (m - 1)",
"tactic": "rw [derivative_pow, derivative_X_sub_C, mul_one]"
}
] | [
665,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
663,
1
] |
Mathlib/Data/List/Count.lean | List.count_cons' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl✝ : List α\ninst✝ : DecidableEq α\na b : α\nl : List α\n⊢ count a (b :: l) = count a l + if a = b then 1 else 0",
"tactic": "conv =>\nsimp [count, countp_cons]\nlhs\nsimp only [eq_comm]"
}
] | [
181,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
177,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.map_update_update | [
{
"state_after": "no goals",
"state_before": "R : Type u_4\ninst✝¹⁵ : Semiring R\nM : Type u_3\ninst✝¹⁴ : AddCommMonoid M\ninst✝¹³ : Module R M\nN : Type u_2\ninst✝¹² : AddCommMonoid N\ninst✝¹¹ : Module R N\nP : Type ?u.414052\ninst✝¹⁰ : AddCommMonoid P\ninst✝⁹ : Module R P\nM' : Type ?u.414082\ninst✝⁸ : Ad... | [
686,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
683,
1
] |
Mathlib/Analysis/Fourier/FourierTransform.lean | VectorFourier.fourierIntegral_comp_add_right | [
{
"state_after": "case h\n𝕜 : Type u_2\ninst✝¹⁰ : CommRing 𝕜\nV : Type u_1\ninst✝⁹ : AddCommGroup V\ninst✝⁸ : Module 𝕜 V\ninst✝⁷ : MeasurableSpace V\nW : Type u_3\ninst✝⁶ : AddCommGroup W\ninst✝⁵ : Module 𝕜 W\nE : Type u_4\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : NormedSpace ℂ E\ninst✝² : CompleteSpace E\ni... | [
117,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
1
] |
Mathlib/Order/Basic.lean | LE.le.le_or_le | [] | [
294,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/RingTheory/Valuation/Basic.lean | Valuation.comap_comp | [] | [
264,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
262,
1
] |
Mathlib/LinearAlgebra/Pi.lean | Submodule.le_comap_single_pi | [
{
"state_after": "R : Type u\nK : Type u'\nM : Type v\nV : Type v'\nM₂ : Type w\nV₂ : Type w'\nM₃ : Type y\nV₃ : Type y'\nM₄ : Type z\nι : Type x\nι' : Type x'\ninst✝³ : Semiring R\nφ : ι → Type u_1\ninst✝² : (i : ι) → AddCommMonoid (φ i)\ninst✝¹ : (i : ι) → Module R (φ i)\nI : Set ι\np✝ q : (i : ι) → Submodule... | [
331,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | HasDerivWithinAt.sin | [] | [
838,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
836,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.exists_congr_left | [
{
"state_after": "no goals",
"state_before": "α✝ : Sort u\nβ✝ : Sort v\nγ : Sort w\nα : Sort u_1\nβ : Sort u_2\nf : α ≃ β\np : α → Prop\nx✝ : ∃ a, p a\na : α\nh : p a\n⊢ p (↑f.symm (↑f a))",
"tactic": "simpa using h"
}
] | [
921,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
919,
11
] |
Mathlib/Order/UpperLower/Basic.lean | IsLowerSet.inter | [] | [
118,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.coeIdeal_span_singleton | [
{
"state_after": "case a\nR : Type u_2\ninst✝⁶ : CommRing R\nS : Submonoid R\nP : Type u_1\ninst✝⁵ : CommRing P\ninst✝⁴ : Algebra R P\nloc : IsLocalization S P\nR₁ : Type ?u.1339818\ninst✝³ : CommRing R₁\nK : Type ?u.1339824\ninst✝² : Field K\ninst✝¹ : Algebra R₁ K\ninst✝ : IsFractionRing R₁ K\nx : R\ny : P\n⊢ ... | [
1392,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1381,
1
] |
Mathlib/LinearAlgebra/BilinearMap.lean | LinearMap.compr₂_apply | [] | [
384,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
383,
1
] |
Mathlib/Data/Nat/Log.lean | Nat.log_eq_one_iff | [] | [
170,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Algebra/Order/Hom/Monoid.lean | OrderMonoidHom.mul_apply | [] | [
524,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
523,
1
] |
Mathlib/Algebra/Algebra/Tower.lean | IsScalarTower.coe_toAlgHom' | [] | [
134,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/NumberTheory/Bernoulli.lean | bernoulliPowerSeries_mul_exp_sub_one | [
{
"state_after": "case h\nA : Type u_1\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\nn : ℕ\n⊢ ↑(coeff A n) (bernoulliPowerSeries A * (exp A - 1)) = ↑(coeff A n) X",
"state_before": "A : Type u_1\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\n⊢ bernoulliPowerSeries A * (exp A - 1) = X",
"tactic": "ext n"
},
... | [
305,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
280,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.map_eq_comap_of_inverse | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\nG' : Type ?u.599712\ninst✝³ : Group G\ninst✝² : Group G'\nA : Type ?u.599721\ninst✝¹ : AddGroup A\nN : Type u_2\ninst✝ : Group N\nf✝ f : G →* N\ng : N →* G\nhl : LeftInverse ↑g ↑f\nhr : Function.RightInverse ↑g ↑f\nH : Subgroup G\n⊢ ↑(map f H) = ↑(... | [
3122,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3120,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.count_singleton | [] | [
2318,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2317,
1
] |
Mathlib/RingTheory/WittVector/StructurePolynomial.lean | wittStructureRat_vars | [
{
"state_after": "p : ℕ\nR : Type ?u.2115631\nidx : Type u_1\ninst✝¹ : CommRing R\nhp : Fact (Nat.Prime p)\ninst✝ : Fintype idx\nΦ : MvPolynomial idx ℚ\nn : ℕ\n⊢ vars (↑(bind₁ fun k => ↑(bind₁ fun i => ↑(rename (Prod.mk i)) (W_ ℚ k)) Φ) (xInTermsOfW p ℚ n)) ⊆\n Finset.univ ×ˢ Finset.range (n + 1)",
"stat... | [
405,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
394,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | LinearMap.toMatrix_mulVec_repr | [
{
"state_after": "case h\nR : Type u_1\ninst✝⁹ : CommSemiring R\nl : Type ?u.2016127\nm : Type u_4\nn : Type u_5\ninst✝⁸ : Fintype n\ninst✝⁷ : Fintype m\ninst✝⁶ : DecidableEq n\nM₁ : Type u_2\nM₂ : Type u_3\ninst✝⁵ : AddCommMonoid M₁\ninst✝⁴ : AddCommMonoid M₂\ninst✝³ : Module R M₁\ninst✝² : Module R M₂\nv₁ : B... | [
670,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
664,
1
] |
Mathlib/Order/WithBot.lean | WithTop.ofDual_apply_top | [] | [
678,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
677,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.cauchySeq_iff' | [] | [
1508,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1506,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.SimpleFunc.nnnorm_approxOn_le | [
{
"state_after": "α : Type ?u.8872\nβ : Type u_2\nι : Type ?u.8878\nE : Type u_1\nF : Type ?u.8884\n𝕜 : Type ?u.8887\ninst✝⁵ : MeasurableSpace β\ninst✝⁴ : MeasurableSpace E\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedAddCommGroup F\nq : ℝ\np : ℝ≥0∞\ninst✝¹ : OpensMeasurableSpace E\nf : β → E\nhf : Measurabl... | [
79,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/Order/LocallyFinite.lean | Set.finite_Ioo | [] | [
661,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
660,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.preimage_eq_empty_iff | [] | [
134,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
Mathlib/Topology/GDelta.lean | isGδ_biInter | [
{
"state_after": "α : Type u_2\nβ : Type ?u.5171\nγ : Type ?u.5174\nι : Type u_1\ninst✝ : TopologicalSpace α\ns : Set ι\nhs : Set.Countable s\nt : (i : ι) → i ∈ s → Set α\nht : ∀ (i : ι) (hi : i ∈ s), IsGδ (t i hi)\n⊢ IsGδ (⋂ (x : ↑s), t ↑x (_ : ↑x ∈ s))",
"state_before": "α : Type u_2\nβ : Type ?u.5171\nγ ... | [
95,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.sSameSide_vadd_left_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nV : Type u_2\nV' : Type ?u.135022\nP : Type u_3\nP' : Type ?u.135028\ninst✝⁶ : StrictOrderedCommRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\ns... | [
295,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Std/Data/Array/Init/Lemmas.lean | Array.foldrM_eq_reverse_foldlM_data.aux | [
{
"state_after": "m : Type u_1 → Type u_2\nα : Type u_3\nβ : Type u_1\ninst✝ : Monad m\nf : α → β → m β\narr : Array α\ninit : β\ni : Nat\nh : i ≤ size arr\n⊢ List.foldlM (fun x y => f y x) init (List.reverse (List.take i arr.data)) =\n if (i == 0) = true then pure init\n else\n match i, h with\n ... | [
57,
76
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
51,
1
] |
Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.aecover_Ioo_of_Ioo | [] | [
200,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/Topology/Algebra/Polynomial.lean | Polynomial.tendsto_norm_atTop | [] | [
138,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Order/Basic.lean | Subtype.mk_le_mk | [] | [
1134,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1132,
1
] |
Mathlib/Topology/Algebra/UniformGroup.lean | UniformContinuous.mul | [
{
"state_after": "α : Type u_2\nβ : Type u_1\ninst✝³ : UniformSpace α\ninst✝² : Group α\ninst✝¹ : UniformGroup α\ninst✝ : UniformSpace β\nf g : β → α\nhf : UniformContinuous f\nhg : UniformContinuous g\nthis : UniformContinuous fun x => f x / (g x)⁻¹\n⊢ UniformContinuous fun x => f x * g x",
"state_before":... | [
107,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/SetTheory/Cardinal/Continuum.lean | Cardinal.continuum_toNat | [] | [
112,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometry.preimage_ball | [] | [
310,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.subtypeDomain_sum | [] | [
2127,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2124,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Mul.lean | DifferentiableAt.mul | [] | [
330,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/Combinatorics/SetFamily/Compression/UV.lean | UV.mem_of_mem_compression | [
{
"state_after": "α : Type u_1\ninst✝² : GeneralizedBooleanAlgebra α\ninst✝¹ : DecidableRel Disjoint\ninst✝ : DecidableRel fun x x_1 => x ≤ x_1\ns : Finset α\nu v a b : α\nha : a ∈ s ∧ compress u v a ∈ s ∨ ¬a ∈ s ∧ ∃ b, b ∈ s ∧ compress u v b = a\nhva : v ≤ a\nhvu : v = ⊥ → u = ⊥\n⊢ a ∈ s",
"state_before": ... | [
291,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Data/TwoPointing.lean | TwoPointing.snd_ne_fst | [] | [
52,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Mathlib/GroupTheory/Subgroup/Pointwise.lean | Subgroup.mem_pointwise_smul_iff_inv_smul_mem | [] | [
345,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.ne_iff_vne | [] | [
199,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Prod.lean | fderivWithin_snd | [] | [
326,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/RingTheory/Subsemiring/Pointwise.lean | Subsemiring.smul_sup | [] | [
86,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Analysis/Complex/Circle.lean | mem_circle_iff_normSq | [
{
"state_after": "no goals",
"state_before": "z : ℂ\n⊢ z ∈ circle ↔ ↑normSq z = 1",
"tactic": "simp [Complex.abs]"
}
] | [
65,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPowerSeries.coeff_mul | [] | [
216,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_zero_fun | [] | [
175,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/FieldTheory/RatFunc.lean | RatFunc.coe_zero | [] | [
1701,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1700,
1
] |
src/lean/Init/Data/List/Control.lean | List.forIn_nil | [] | [
154,
6
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
153,
9
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.union_div | [] | [
708,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
707,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.b_of_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nS : Type ?u.286658\nF : Type ?u.286661\nK : Type ?u.286664\nP Q : Cubic R\na b c d a' b' c' d' : R\ninst✝ : Semiring R\nh : toPoly P = toPoly Q\n⊢ P.b = Q.b",
"tactic": "rw [← coeff_eq_b, h, coeff_eq_b]"
}
] | [
127,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/LinearAlgebra/Matrix/Hermitian.lean | Matrix.isHermitian_transpose_iff | [
{
"state_after": "α : Type u_2\nβ : Type ?u.3927\nm : Type ?u.3930\nn : Type u_1\nA✝ : Matrix n n α\ninst✝¹ : Star α\ninst✝ : Star β\nA : Matrix n n α\nh : IsHermitian Aᵀ\n⊢ IsHermitian A",
"state_before": "α : Type u_2\nβ : Type ?u.3927\nm : Type ?u.3930\nn : Type u_1\nA✝ : Matrix n n α\ninst✝¹ : Star α\ni... | [
81,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Data/List/Perm.lean | List.Perm.foldr_eq | [
{
"state_after": "α : Type uu\nβ : Type vv\nl₁✝ l₂✝ : List α\nf : α → β → β\nl₁ l₂ : List α\nlcomm : LeftCommutative f\np : l₁ ~ l₂\nx : α\nt₁ t₂ : List α\n_p : t₁ ~ t₂\nr : ∀ (b : β), foldr f b t₁ = foldr f b t₂\nb : β\n⊢ f x (foldr f b t₁) = f x (foldr f b t₂)",
"state_before": "α : Type uu\nβ : Type vv\n... | [
529,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
525,
1
] |
Mathlib/Analysis/Calculus/BumpFunctionInner.lean | ContDiffBump.integral_normed | [
{
"state_after": "E : Type u_1\nX : Type ?u.1858193\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : NormedSpace ℝ E\ninst✝⁷ : NormedAddCommGroup X\ninst✝⁶ : NormedSpace ℝ X\ninst✝⁵ : HasContDiffBump E\nc : E\nf : ContDiffBump c\nx : E\nn : ℕ∞\ninst✝⁴ : MeasurableSpace E\nμ : MeasureTheory.Measure E\ninst✝³ : BorelSpac... | [
532,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
530,
1
] |
Mathlib/CategoryTheory/Types.lean | equivEquivIso_hom | [] | [
412,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
411,
1
] |
Std/Data/List/Basic.lean | List.inits_eq_initsTR | [
{
"state_after": "case h.h\nα : Type u_1\nl : List α\n⊢ inits l = initsTR l",
"state_before": "⊢ @inits = @initsTR",
"tactic": "funext α l"
},
{
"state_after": "case h.h\nα : Type u_1\nl : List α\n⊢ inits l = reverse (foldr (fun a arrs => Array.push (Array.map (fun t => a :: t) arrs) []) #[[]] l... | [
796,
68
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
795,
10
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.smul_finset_singleton | [] | [
1657,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1656,
1
] |
Mathlib/Order/Filter/Lift.lean | Filter.lift'_le | [] | [
279,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieIdeal.map_mono | [
{
"state_after": "R : Type u\nL : Type v\nL' : Type w₂\nM : Type w\nM' : Type w₁\ninst✝¹² : CommRing R\ninst✝¹¹ : LieRing L\ninst✝¹⁰ : LieAlgebra R L\ninst✝⁹ : LieRing L'\ninst✝⁸ : LieAlgebra R L'\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\ninst✝⁵ : LieRingModule L M\ninst✝⁴ : LieModule R L M\ninst✝³ : AddCo... | [
862,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
860,
1
] |
Mathlib/Order/Category/LatCat.lean | LatCat.coe_of | [] | [
54,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.val_lt_last | [] | [
553,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
552,
1
] |
Mathlib/Data/Nat/Factorial/Basic.lean | Nat.factorial_inj | [
{
"state_after": "m n : ℕ\nhn : 1 < n !\nh : n ! = m !\n⊢ n = m",
"state_before": "m n : ℕ\nhn : 1 < n !\n⊢ n ! = m ! ↔ n = m",
"tactic": "refine' ⟨fun h => _, congr_arg _⟩"
},
{
"state_after": "case inl\nm n : ℕ\nhn : 1 < n !\nh : n ! = m !\nhnm : n < m\n⊢ n = m\n\ncase inr.inl\nn : ℕ\nhn : 1 <... | [
142,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Data/Finset/Card.lean | Finset.card_le_of_subset | [] | [
64,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.biUnion_assoc | [
{
"state_after": "case h\nι : Type u_1\nI J✝ J₁ J₂ : Box ι\nπ π₁ π₂ : Prepartition I\nx : ι → ℝ\nπi✝ πi₁ πi₂ πi : (J : Box ι) → Prepartition J\nπi' : Box ι → (J : Box ι) → Prepartition J\nJ : Box ι\n⊢ (J ∈ biUnion π fun J => biUnion (πi J) (πi' J)) ↔ J ∈ biUnion (biUnion π πi) fun J => πi' (biUnionIndex π πi J)... | [
399,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
388,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | zsmul_one | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.84932\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✝ : AddGroupWithOne A\nn : ℤ\n⊢ n • 1 = ↑n",
"tactic": "cases n <;> simp"
}
] | [
131,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Topology/MetricSpace/MetricSeparated.lean | IsMetricSeparated.empty_right | [] | [
55,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Data/Num/Lemmas.lean | PosNum.bit0_of_bit0 | [
{
"state_after": "α : Type ?u.80889\np : PosNum\n⊢ bit0 (succ (bit0 p)) = bit0 (bit1 p)",
"state_before": "α : Type ?u.80889\np : PosNum\n⊢ bit0 (succ (_root_.bit0 p)) = bit0 (bit1 p)",
"tactic": "rw [bit0_of_bit0 p]"
},
{
"state_after": "no goals",
"state_before": "α : Type ?u.80889\np : Po... | [
118,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Topology/MetricSpace/Infsep.lean | Set.Finite.infsep_zero_iff_subsingleton | [] | [
555,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
553,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | tendsto_inv | [] | [
223,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.add_re | [] | [
122,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | IntervalIntegrable.comp_mul_left | [
{
"state_after": "case inl\nι : Type ?u.6953593\n𝕜 : Type ?u.6953596\nE : Type u_1\nF : Type ?u.6953602\nA : Type ?u.6953605\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedRing A\nf g : ℝ → E\na b : ℝ\nμ : MeasureTheory.Measure ℝ\nhf : IntervalIntegrable f volume a b\nc : ℝ\nhc : c = 0\n⊢ IntervalIntegrable (fu... | [
305,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/Tactic/CategoryTheory/Elementwise.lean | Tactic.Elementwise.hom_elementwise | [
{
"state_after": "no goals",
"state_before": "C : Type u_1\ninst✝¹ : Category C\ninst✝ : ConcreteCategory C\nX Y : C\nf g : X ⟶ Y\nh : f = g\nx : (forget C).obj X\n⊢ (forget C).map f x = (forget C).map g x",
"tactic": "rw [h]"
}
] | [
51,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
50,
1
] |
Mathlib/CategoryTheory/Monoidal/End.lean | CategoryTheory.ε_inv_hom_app | [] | [
115,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Algebra/Homology/HomotopyCategory.lean | HomotopyCategory.homologyFactors_hom_app | [] | [
162,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
160,
1
] |
Mathlib/Combinatorics/Quiver/SingleObj.lean | Quiver.SingleObj.pathEquivList_nil | [] | [
158,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.mk_out | [] | [
155,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Algebra/DirectSum/Internal.lean | DirectSum.coe_mul_of_apply_aux | [
{
"state_after": "ι : Type u_1\nσ : Type u_3\nS : Type ?u.170111\nR : Type u_2\ninst✝⁵ : DecidableEq ι\ninst✝⁴ : Semiring R\ninst✝³ : SetLike σ R\ninst✝² : AddSubmonoidClass σ R\nA : ι → σ\ninst✝¹ : AddMonoid ι\ninst✝ : SetLike.GradedMonoid A\nr : ⨁ (i : ι), { x // x ∈ A i }\ni : ι\nr' : { x // x ∈ A i }\nj n :... | [
209,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.Integrable.add_measure | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.839059\nδ : Type ?u.839062\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝² : MeasurableSpace δ\ninst✝¹ : NormedAddCommGroup β\ninst✝ : NormedAddCommGroup γ\nf : α → β\nhμ : Memℒp f 1\nhν : Memℒp f 1\n⊢ Memℒp f 1",
"state_before": "α : Type u_2\nβ : T... | [
532,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
527,
1
] |
Mathlib/Data/List/ToFinsupp.lean | List.toFinsupp_concat_eq_toFinsupp_add_single | [
{
"state_after": "no goals",
"state_before": "M : Type ?u.23867\ninst✝⁴ : Zero M\nl : List M\ninst✝³ : DecidablePred fun x => getD l x 0 ≠ 0\nn : ℕ\nR : Type u_1\ninst✝² : AddZeroClass R\nx : R\nxs : List R\ninst✝¹ : DecidablePred fun i => getD (xs ++ [x]) i 0 ≠ 0\ninst✝ : DecidablePred fun i => getD xs i 0... | [
146,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/FieldTheory/Adjoin.lean | IntermediateField.sInf_toSubalgebra | [
{
"state_after": "no goals",
"state_before": "F : Type u_2\ninst✝² : Field F\nE : Type u_1\ninst✝¹ : Field E\ninst✝ : Algebra F E\nS : Set (IntermediateField F E)\n⊢ ↑(sInf S).toSubalgebra = ↑(sInf (toSubalgebra '' S))",
"tactic": "simp [Set.sUnion_image]"
}
] | [
153,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.sub_apply | [] | [
1117,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1116,
1
] |
Mathlib/Order/Ideal.lean | Order.Ideal.sup_mem_iff | [] | [
353,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
352,
1
] |
Mathlib/MeasureTheory/Group/FundamentalDomain.lean | MeasureTheory.fundamentalFrontier_subset | [] | [
570,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
569,
1
] |
Mathlib/MeasureTheory/Measure/Stieltjes.lean | StieltjesFunction.mono | [] | [
226,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Topology/Homotopy/Path.lean | Path.Homotopy.eval_one | [
{
"state_after": "case a.h\nX : Type u\nY : Type v\ninst✝¹ : TopologicalSpace X\ninst✝ : TopologicalSpace Y\nx₀ x₁ x₂ x₃ : X\np₀ p₁ : Path x₀ x₁\nF : Homotopy p₀ p₁\nt : ↑I\n⊢ ↑(eval F 1) t = ↑p₁ t",
"state_before": "X : Type u\nY : Type v\ninst✝¹ : TopologicalSpace X\ninst✝ : TopologicalSpace Y\nx₀ x₁ x₂ x... | [
95,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/CategoryTheory/Closed/Cartesian.lean | CategoryTheory.prod_map_pre_app_comp_ev | [] | [
286,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.map_mapRange_eq_iff | [
{
"state_after": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np q : MvPolynomial σ R\nf✝ f : R →+* S₁\ng : S₁ → R\nhg : g 0 = 0\nφ : MvPolynomial σ S₁\n⊢ (∀ (m : σ →₀ ℕ), coeff m (↑(map f) (mapRang... | [
1384,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1378,
1
] |
Mathlib/LinearAlgebra/PiTensorProduct.lean | PiTensorProduct.smul_tprodCoeff' | [] | [
244,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | MeasurableSpace.map_comp | [] | [
96,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snormEssSup_zero | [
{
"state_after": "α : Type u_1\nE : Type ?u.920015\nF : Type u_2\nG : Type ?u.920021\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\n⊢ essSup (fun x => ⊥) μ = ⊥",
"state_before": "α : Type u_1\nE : Type ... | [
200,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.val_zero | [] | [
68,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.RingEquiv.bot_maximal_iff | [] | [
1763,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1760,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | UniqueFactorizationMonoid.prime_of_factor | [
{
"state_after": "α : Type u_1\ninst✝² : CancelCommMonoidWithZero α\ninst✝¹ : DecidableEq α\ninst✝ : UniqueFactorizationMonoid α\na x : α\nhx : x ∈ factors a\nane0 : a ≠ 0\n⊢ Prime x",
"state_before": "α : Type u_1\ninst✝² : CancelCommMonoidWithZero α\ninst✝¹ : DecidableEq α\ninst✝ : UniqueFactorizationMono... | [
466,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.