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/Convex/Side.lean | AffineSubspace.sOppSide_comm | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nV : Type u_2\nV' : Type ?u.95363\nP : Type u_3\nP' : Type ?u.95369\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 :... | [
219,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.EventuallyEq.inter | [] | [
1568,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1566,
1
] |
Mathlib/Data/Dfinsupp/Interval.lean | Finset.mem_dfinsupp_iff | [
{
"state_after": "case refine'_1\nι : Type u_1\nα : ι → Type u_2\ninst✝² : DecidableEq ι\ninst✝¹ : (i : ι) → Zero (α i)\ns : Finset ι\nf : Π₀ (i : ι), α i\nt : (i : ι) → Finset (α i)\ninst✝ : (i : ι) → DecidableEq (α i)\n⊢ (∃ a,\n a ∈ pi s t ∧\n ↑{ toFun := fun f => Dfinsupp.mk s fun i => f ↑i (_ : ... | [
61,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | mem_uniform_prod | [
{
"state_after": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort ?u.155123\nt₁ : UniformSpace α\nt₂ : UniformSpace β\na : Set (α × α)\nb : Set (β × β)\nha : a ∈ 𝓤 α\nhb : b ∈ 𝓤 β\n⊢ {p | (p.fst.fst, p.snd.fst) ∈ a ∧ (p.fst.snd, p.snd.snd) ∈ b} ∈\n comap (fun p => (p.fst.fst, p.snd.fst)) (𝓤 α... | [
1597,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1594,
1
] |
Mathlib/Data/Finset/NAry.lean | Finset.card_image₂_le | [] | [
59,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/CategoryTheory/Equivalence.lean | CategoryTheory.Equivalence.Equivalence_mk'_unit | [] | [
132,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Data/Finset/NoncommProd.lean | Multiset.noncommProd_coe | [
{
"state_after": "F : Type ?u.7239\nι : Type ?u.7242\nα : Type u_1\nβ : Type ?u.7248\nγ : Type ?u.7251\nf : α → β → β\nop : α → α → α\ninst✝¹ : Monoid α\ninst✝ : Monoid β\nl : List α\ncomm : Set.Pairwise {x | x ∈ ↑l} Commute\n⊢ noncommFold (fun x x_1 => x * x_1) (↑l) comm 1 = List.prod l",
"state_before": "... | [
134,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/LinearAlgebra/QuadraticForm/Isometry.lean | QuadraticForm.Equivalent.refl | [] | [
109,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.L1.SimpleFunc.integrable | [
{
"state_after": "α : Type u_1\nβ : Type ?u.3383671\nι : Type ?u.3383674\nE : Type u_2\nF : Type ?u.3383680\n𝕜 : Type ?u.3383683\ninst✝¹ : MeasurableSpace α\ninst✝ : NormedAddCommGroup E\nf✝ : α → E\np : ℝ≥0∞\nμ : Measure α\nf : { x // x ∈ Lp.simpleFunc E 1 μ }\n⊢ Memℒp (↑(Lp.simpleFunc.toSimpleFunc f)) 1",
... | [
1087,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1085,
11
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.prod_mono | [] | [
1723,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1722,
1
] |
Mathlib/MeasureTheory/Function/EssSup.lean | OrderIso.essSup_apply | [
{
"state_after": "case refine'_1\nα : Type u_1\nβ : Type u_3\nm✝ : MeasurableSpace α\nμ✝ ν : MeasureTheory.Measure α\ninst✝¹ : CompleteLattice β\nm : MeasurableSpace α\nγ : Type u_2\ninst✝ : CompleteLattice γ\nf : α → β\nμ : MeasureTheory.Measure α\ng : β ≃o γ\n⊢ IsBoundedUnder (fun x x_1 => x ≤ x_1) (Measure.a... | [
189,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.mul_eq_max | [
{
"state_after": "no goals",
"state_before": "a b : Cardinal\nha : ℵ₀ ≤ a\nhb : ℵ₀ ≤ b\n⊢ a ≤ a * b",
"tactic": "simpa only [mul_one] using mul_le_mul_left' (one_le_aleph0.trans hb) a"
},
{
"state_after": "no goals",
"state_before": "a b : Cardinal\nha : ℵ₀ ≤ a\nhb : ℵ₀ ≤ b\n⊢ b ≤ a * b",
... | [
556,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
551,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.spanSingleton_mul_coeIdeal_eq_coeIdeal | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.1518060\ninst✝⁶ : CommRing R\nS : Submonoid R\nP : Type ?u.1518267\ninst✝⁵ : CommRing P\ninst✝⁴ : Algebra R P\nloc : IsLocalization S P\nR₁ : Type u_1\ninst✝³ : CommRing R₁\nK : Type u_2\ninst✝² : Field K\ninst✝¹ : Algebra R₁ K\ninst✝ : IsFractionRin... | [
1461,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1455,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | inner_self_eq_norm_sq | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.2297537\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx : E\n⊢ ↑re (inner x x) = ‖x‖ ^ 2",
"t... | [
1014,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1013,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.filter_filterMap | [] | [
2159,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2157,
1
] |
Std/Data/RBMap/Alter.lean | Std.RBNode.Balanced.zoom | [
{
"state_after": "case refl\nα✝ : Type u_1\ncut : α✝ → Ordering\nt : RBNode α✝\npath : Path α✝\nc₀ : RBColor\nn₀ : Nat\nc : RBColor\nn : Nat\nhp : Path.Balanced c₀ n₀ path black 0\n⊢ ∃ c n, Balanced nil c n ∧ Path.Balanced c₀ n₀ path c n",
"state_before": "α✝ : Type u_1\ncut : α✝ → Ordering\nt : RBNode α✝\n... | [
135,
55
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
123,
11
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.comap_codRestrict | [
{
"state_after": "case intro.mk.intro.refl\nR : Type u_1\nR₁ : Type ?u.1019468\nR₂ : Type u_3\nR₃ : Type ?u.1019474\nR₄ : Type ?u.1019477\nS : Type ?u.1019480\nK : Type ?u.1019483\nK₂ : Type ?u.1019486\nM : Type u_2\nM' : Type ?u.1019492\nM₁ : Type ?u.1019495\nM₂ : Type u_4\nM₃ : Type ?u.1019501\nM₄ : Type ?u.1... | [
1188,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1186,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.uniformContinuous_infNndist_pt | [] | [
674,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
673,
1
] |
Mathlib/Data/Prod/Basic.lean | Prod.swap_swap | [] | [
163,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/CategoryTheory/Limits/IsLimit.lean | CategoryTheory.Limits.IsColimit.coconePointUniqueUpToIso_hom_desc | [
{
"state_after": "no goals",
"state_before": "J : Type u₁\ninst✝² : Category J\nK : Type u₂\ninst✝¹ : Category K\nC : Type u₃\ninst✝ : Category C\nF : J ⥤ C\nr s t : Cocone F\nP : IsColimit s\nQ : IsColimit t\n⊢ ∀ (j : J), s.ι.app j ≫ (coconePointUniqueUpToIso P Q).hom ≫ desc Q r = r.ι.app j",
"tactic":... | [
677,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
675,
1
] |
Mathlib/RingTheory/Subring/Pointwise.lean | Subring.pointwise_smul_le_pointwise_smul_iff₀ | [] | [
169,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Data/Finset/Image.lean | Finset.disjoint_map | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.31419\nf✝ : α ↪ β\ns✝ s t : Finset α\nf : α ↪ β\n⊢ (∀ (a : β) (x : α), x ∈ s → ↑f x = a → ∀ (b : β) (x : α), x ∈ t → ↑f x = b → a ≠ b) ↔\n ∀ (a : α), a ∈ s → ∀ (b : α), b ∈ t → a ≠ b",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.31419... | [
198,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Order/Antichain.lean | isAntichain_and_least_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.11078\nr r₁ r₂ : α → α → Prop\nr' : β → β → Prop\nt : Set α\na b : α\ninst✝ : Preorder α\n⊢ IsAntichain (fun x x_1 => x ≤ x_1) {a} ∧ IsLeast {a} a",
"state_before": "α : Type u_1\nβ : Type ?u.11078\nr r₁ r₂ : α → α → Prop\nr' : β → β → Prop\ns t : Set α\na b : α\n... | [
227,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | FiniteDimensional.basisUnique.repr_eq_zero_iff | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV : Type v\ninst✝⁵ : DivisionRing K\ninst✝⁴ : AddCommGroup V\ninst✝³ : Module K V\nV₂ : Type v'\ninst✝² : AddCommGroup V₂\ninst✝¹ : Module K V₂\nι : Type u_1\ninst✝ : Unique ι\nh : finrank K V = 1\nv : V\ni : ι\nhv : v = 0\n⊢ ↑(↑(basisUnique ι h).rep... | [
274,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.add_imJ | [] | [
893,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
893,
9
] |
Mathlib/Data/W/Basic.lean | WType.toSigma_ofSigma | [] | [
70,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.mk_quot_le | [] | [
1966,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1965,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.coe_map | [] | [
1516,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1515,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.nat_le_order | [
{
"state_after": "R : Type u_1\ninst✝ : Semiring R\nφ✝ φ : PowerSeries R\nn : ℕ\nh : ∀ (i : ℕ), i < n → ↑(coeff R i) φ = 0\nH : ¬↑n ≤ order φ\n⊢ False",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nφ✝ φ : PowerSeries R\nn : ℕ\nh : ∀ (i : ℕ), i < n → ↑(coeff R i) φ = 0\n⊢ ↑n ≤ order φ",
"tactic": "... | [
2296,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2292,
1
] |
Mathlib/Logic/Equiv/List.lean | Denumerable.raise_lower | [
{
"state_after": "α : Type ?u.45406\nβ : Type ?u.45409\ninst✝¹ : Denumerable α\ninst✝ : Denumerable β\nm : ℕ\nl : List ℕ\nn : ℕ\nh : Sorted (fun x x_1 => x ≤ x_1) (n :: m :: l)\nthis : n ≤ m\n⊢ raise (lower (m :: l) n) n = m :: l",
"state_before": "α : Type ?u.45406\nβ : Type ?u.45409\ninst✝¹ : Denumerable ... | [
313,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.isImage_source_target_of_disjoint | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.31535\nδ : Type ?u.31538\ne : LocalEquiv α β\ne'✝ : LocalEquiv β γ\ne' : LocalEquiv α β\nhs : Disjoint e.source e'.source\nht : Disjoint e.target e'.target\n⊢ ↑e '' (e.source ∩ e'.source) = e.target ∩ e'.target",
"tact... | [
482,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
480,
1
] |
Mathlib/Order/Filter/Pointwise.lean | Filter.div_mem_div | [] | [
447,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
446,
1
] |
Mathlib/Topology/ContinuousFunction/Compact.lean | ContinuousMap.nnnorm_lt_iff_of_nonempty | [] | [
247,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/Algebra/Algebra/Unitization.lean | Unitization.algHom_ext | [
{
"state_after": "case H\nS : Type u_1\nR : Type u_3\nA : Type u_2\ninst✝¹² : CommSemiring S\ninst✝¹¹ : CommSemiring R\ninst✝¹⁰ : NonUnitalSemiring A\ninst✝⁹ : Module R A\ninst✝⁸ : SMulCommClass R A A\ninst✝⁷ : IsScalarTower R A A\nB : Type u_4\ninst✝⁶ : Semiring B\ninst✝⁵ : Algebra S B\ninst✝⁴ : Algebra S R\ni... | [
643,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
638,
1
] |
Mathlib/Logic/Equiv/Fin.lean | finSuccEquiv'_symm_coe_below | [] | [
184,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.infDist_le_infDist_add_dist | [
{
"state_after": "ι : Sort ?u.61351\nα : Type u\nβ : Type v\ninst✝¹ : PseudoMetricSpace α\ninst✝ : PseudoMetricSpace β\ns t u : Set α\nx y : α\nΦ : α → β\n⊢ ENNReal.toReal (infEdist x s) ≤ ENNReal.toReal (infEdist y s) + ENNReal.toReal (edist x y)",
"state_before": "ι : Sort ?u.61351\nα : Type u\nβ : Type v... | [
530,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
527,
1
] |
Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean | MeasureTheory.ae_le_of_forall_set_lintegral_le_of_sigmaFinite | [
{
"state_after": "α : Type u_1\nE : Type ?u.48454\nm m0 : MeasurableSpace α\nμ : Measure α\ns t : Set α\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace ℝ E\ninst✝¹ : CompleteSpace E\np : ℝ≥0∞\ninst✝ : SigmaFinite μ\nf g : α → ℝ≥0∞\nhf : Measurable f\nhg : Measurable g\nh : ∀ (s : Set α), MeasurableSet s → ... | [
225,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.coeff_monomial_mul' | [
{
"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\nm s : σ →₀ ℕ\nr : R\np : MvPolynomial σ R\n⊢ coeff m (p * ↑(monomial s) r) = if s ≤ m then coeff (m - s) p *... | [
790,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
786,
1
] |
Mathlib/Algebra/GradedMulAction.lean | SetLike.coe_GSmul | [] | [
142,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.swapCore_self | [
{
"state_after": "α : Sort u_1\ninst✝ : DecidableEq α\nr a : α\n⊢ (if r = a then a else if r = a then a else r) = r",
"state_before": "α : Sort u_1\ninst✝ : DecidableEq α\nr a : α\n⊢ swapCore a a r = r",
"tactic": "unfold swapCore"
},
{
"state_after": "no goals",
"state_before": "α : Sort u_... | [
1517,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1515,
1
] |
Mathlib/AlgebraicGeometry/RingedSpace.lean | AlgebraicGeometry.RingedSpace.mem_basicOpen | [
{
"state_after": "case mp\nX : RingedSpace\nU : Opens ↑↑X.toPresheafedSpace\nf : ↑(X.presheaf.obj U.op)\nx : { x // x ∈ U }\n⊢ ↑x ∈ basicOpen X f → IsUnit (↑(germ X.presheaf x) f)\n\ncase mpr\nX : RingedSpace\nU : Opens ↑↑X.toPresheafedSpace\nf : ↑(X.presheaf.obj U.op)\nx : { x // x ∈ U }\n⊢ IsUnit (↑(germ X.pr... | [
171,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Topology/LocallyConstant/Basic.lean | LocallyConstant.map_id | [] | [
414,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/RingTheory/LaurentSeries.lean | LaurentSeries.coeff_coe_powerSeries | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝ : Semiring R\nx : PowerSeries R\nn : ℕ\n⊢ HahnSeries.coeff (↑(ofPowerSeries ℤ R) x) ↑n = ↑(PowerSeries.coeff R n) x",
"tactic": "rw [ofPowerSeries_apply_coeff]"
}
] | [
59,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | IsCompact.measure_lt_top | [] | [
3940,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3938,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.smul_modByMonic | [
{
"state_after": "case pos\nR : Type u\nS : Type v\nT : Type w\na b : R\nn : ℕ\ninst✝¹ : CommRing R\np✝ q : R[X]\ninst✝ : Semiring S\nc : R\np : R[X]\nhq : Monic q\n⊢ c • p %ₘ q = c • (p %ₘ q)\n\ncase neg\nR : Type u\nS : Type v\nT : Type w\na b : R\nn : ℕ\ninst✝¹ : CommRing R\np✝ q : R[X]\ninst✝ : Semiring S\n... | [
98,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDense.lean | MeasureTheory.SimpleFunc.approxOn_zero | [] | [
139,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Order/Cover.lean | covby_congr_left | [] | [
318,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Std/Logic.lean | false_iff_true | [] | [
96,
85
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
96,
1
] |
Mathlib/Data/PNat/Prime.lean | PNat.gcd_eq_right_iff_dvd | [
{
"state_after": "m n : ℕ+\n⊢ m ∣ n ↔ gcd m n = m",
"state_before": "m n : ℕ+\n⊢ m ∣ n ↔ gcd n m = m",
"tactic": "rw [gcd_comm]"
},
{
"state_after": "no goals",
"state_before": "m n : ℕ+\n⊢ m ∣ n ↔ gcd m n = m",
"tactic": "apply gcd_eq_left_iff_dvd"
}
] | [
204,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Order/Interval.lean | NonemptyInterval.coe_eq_pure | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.43617\nγ : Type ?u.43620\nδ : Type ?u.43623\nι : Sort ?u.43626\nκ : ι → Sort ?u.43631\ninst✝ : Preorder α\ns : NonemptyInterval α\na : α\n⊢ ↑s = Interval.pure a ↔ s = pure a",
"tactic": "rw [← Interval.coe_inj, coe_pure_interval]"
... | [
645,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
644,
1
] |
Mathlib/Data/List/Basic.lean | List.sizeOf_lt_sizeOf_of_mem | [
{
"state_after": "case cons.head\nι : Type ?u.320638\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\ninst✝ : SizeOf α\nx : α\nl : List α\nhx : x ∈ l\nt : List α\nih : x ∈ t → sizeOf x < sizeOf t\n⊢ sizeOf x < 1 + sizeOf x + sizeOf t\n\ncase cons.tail\nι : Type ?u.320638\nα : Type u\nβ : Type v\... | [
3084,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3079,
1
] |
Mathlib/Data/Complex/Exponential.lean | Real.one_sub_lt_exp_minus_of_pos | [
{
"state_after": "case inl\ny : ℝ\nh : 0 < y\nh' : 1 ≤ y\n⊢ 1 - y < exp (-y)\n\ncase inr\ny : ℝ\nh : 0 < y\nh' : y < 1\n⊢ 1 - y < exp (-y)",
"state_before": "y : ℝ\nh : 0 < y\n⊢ 1 - y < exp (-y)",
"tactic": "cases' le_or_lt 1 y with h' h'"
},
{
"state_after": "case inr\ny : ℝ\nh : 0 < y\nh' : y ... | [
1967,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1962,
1
] |
Mathlib/Computability/Language.lean | Language.mem_pow | [
{
"state_after": "case zero\nα : Type u_1\nβ : Type ?u.95661\nγ : Type ?u.95664\nl✝ m : Language α\na b x✝¹ : List α\nl : Language α\nx✝ x : List α\n⊢ x ∈ l ^ Nat.zero ↔ ∃ S, x = join S ∧ length S = Nat.zero ∧ ∀ (y : List α), y ∈ S → y ∈ l\n\ncase succ\nα : Type u_1\nβ : Type ?u.95661\nγ : Type ?u.95664\nl✝ m :... | [
260,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Data/Set/Intervals/Instances.lean | Set.Ioo.one_sub_mem | [
{
"state_after": "α : Type ?u.62843\ninst✝¹ : StrictOrderedSemiring α\nβ : Type u_1\ninst✝ : OrderedRing β\nt : β\nht : 0 < t ∧ t < 1\n⊢ 0 < 1 - t ∧ 1 - t < 1",
"state_before": "α : Type ?u.62843\ninst✝¹ : StrictOrderedSemiring α\nβ : Type u_1\ninst✝ : OrderedRing β\nt : β\nht : t ∈ Ioo 0 1\n⊢ 1 - t ∈ Ioo 0... | [
376,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
373,
1
] |
Mathlib/Order/Bounds/Basic.lean | isGLB_lt_iff | [] | [
1119,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1118,
1
] |
Mathlib/Topology/Instances/Int.lean | Int.dist_eq | [] | [
31,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
31,
1
] |
Mathlib/Algebra/GeomSum.lean | geom_sum_succ' | [] | [
56,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.curryLeft_norm | [] | [
1436,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1434,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.compose | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\nκ : ι → Sort ?u.22803\na✝ a₁ a₂ : α\nb✝ b₁ b₂ : β\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ninst✝ : Preorder γ\nl1 : α → β\nu1 : β → α\nl2 : β → γ\nu2 : γ → β\ngc1 : GaloisConnection l1 u1\ngc2 : GaloisConnection l2 u2\na : α\nb : γ\n⊢ (l2 ∘ l1)... | [
335,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
333,
11
] |
Mathlib/Order/Basic.lean | le_of_forall_lt' | [] | [
545,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
544,
1
] |
Mathlib/MeasureTheory/Function/UniformIntegrable.lean | MeasureTheory.snorm_indicator_le_of_bound | [
{
"state_after": "case pos\nα : Type u_2\nβ : Type u_1\nι : Type ?u.121470\nm : MeasurableSpace α\nμ : Measure α\ninst✝ : NormedAddCommGroup β\np : ℝ≥0∞\nf : α → β\nhp_top : p ≠ ⊤\nε : ℝ\nhε : 0 < ε\nM : ℝ\nhf : ∀ (x : α), ‖f x‖ < M\nhM : M ≤ 0\n⊢ ∃ δ hδ, ∀ (s : Set α), MeasurableSet s → ↑↑μ s ≤ ENNReal.ofReal ... | [
340,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Topology/Sheaves/Presheaf.lean | TopCat.Presheaf.pushforward_map_app' | [] | [
377,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | DoubleQuot.quotQuotEquivComm_mk_mk | [] | [
654,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
652,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.iUnion_Icc_coe_nat | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.135385\nβ : Type ?u.135388\na b c d : ℝ≥0∞\nr p q : ℝ≥0\n⊢ (⋃ (n : ℕ), Icc a ↑n) = Ici a \\ {⊤}",
"tactic": "simp only [← Ici_inter_Iic, ← inter_iUnion, iUnion_Iic_coe_nat, diff_eq]"
}
] | [
884,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
883,
1
] |
Mathlib/Logic/Basic.lean | exists_apply_eq | [] | [
778,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
778,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.two_sinh | [] | [
593,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
592,
1
] |
Mathlib/Data/Set/Semiring.lean | SetSemiring.add_def | [] | [
120,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/MeasureTheory/Group/Measure.lean | MeasureTheory.isOpenPosMeasure_of_mulLeftInvariant_of_regular | [] | [
550,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
547,
1
] |
Mathlib/Topology/MetricSpace/Holder.lean | HolderOnWith.mono | [] | [
153,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
11
] |
Mathlib/GroupTheory/Subgroup/ZPowers.lean | MonoidHom.map_zpowers | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\ninst✝² : Group G\nA : Type ?u.30840\ninst✝¹ : AddGroup A\nN : Type u_2\ninst✝ : Group N\nf : G →* N\nx : G\n⊢ Subgroup.map f (Subgroup.zpowers x) = Subgroup.zpowers (↑f x)",
"tactic": "rw [Subgroup.zpowers_eq_closure, Subgroup.zpowers_eq_closur... | [
157,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | Matrix.toLinAlgEquiv'_toMatrixAlgEquiv' | [] | [
470,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
468,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.inf_adj | [] | [
355,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
354,
1
] |
Mathlib/Data/List/Zip.lean | List.unzip_zip_left | [
{
"state_after": "α : Type u\nβ : Type u_1\nγ : Type ?u.86201\nδ : Type ?u.86204\nε : Type ?u.86207\nl₁ : List α\nh : length l₁ ≤ length []\n⊢ (unzip (zip [] [])).fst = []",
"state_before": "α : Type u\nβ : Type u_1\nγ : Type ?u.86201\nδ : Type ?u.86204\nε : Type ?u.86207\nl₁ : List α\nh : length l₁ ≤ lengt... | [
238,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/Topology/Separation.lean | point_disjoint_finset_opens_of_t2 | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝³ : TopologicalSpace α\nγ : Type ?u.129204\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : T2Space α\nx : α\ns : Finset α\nh : ¬x ∈ s\n⊢ SeparatedNhds {x} ↑s",
"tactic": "exact_mod_cast finset_disjoint_finset_o... | [
1256,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1254,
1
] |
Mathlib/CategoryTheory/Endofunctor/Algebra.lean | CategoryTheory.Endofunctor.Algebra.id_f | [] | [
111,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.Disjoint.mem_imp | [] | [
510,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
509,
1
] |
Mathlib/CategoryTheory/Limits/FullSubcategory.lean | CategoryTheory.Limits.hasLimitsOfShape_of_closed_under_limits | [] | [
120,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/GroupTheory/Submonoid/Pointwise.lean | Submonoid.pointwise_smul_le_pointwise_smul_iff | [] | [
294,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/Topology/ContinuousOn.lean | continuousOn_fst | [] | [
1265,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1264,
1
] |
Mathlib/Data/Matrix/Kronecker.lean | Matrix.one_kroneckerTMul_one | [] | [
548,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
546,
1
] |
Mathlib/Data/Fin/VecNotation.lean | Matrix.cons_head_tail | [] | [
165,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.rev_inj | [] | [
472,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
471,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.vec_one_mul | [
{
"state_after": "case h\nl : Type ?u.899745\nm : Type u_1\nn : Type u_2\no : Type ?u.899754\nm' : o → Type ?u.899759\nn' : o → Type ?u.899764\nR : Type ?u.899767\nS : Type ?u.899770\nα : Type v\nβ : Type w\nγ : Type ?u.899777\ninst✝¹ : NonAssocSemiring α\ninst✝ : Fintype m\nA : Matrix m n α\nx✝ : n\n⊢ vecMul 1... | [
1873,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1872,
1
] |
Mathlib/Data/List/FinRange.lean | List.nodup_ofFn_ofInjective | [
{
"state_after": "α✝ : Type u\nα : Type u_1\nn : ℕ\nf : Fin n → α\nhf : Function.Injective f\n⊢ Nodup (pmap (fun i hi => f { val := i, isLt := hi }) (range n) (_ : ∀ (x : ℕ), x ∈ range n → x < n))",
"state_before": "α✝ : Type u\nα : Type u_1\nn : ℕ\nf : Fin n → α\nhf : Function.Injective f\n⊢ Nodup (ofFn f)... | [
60,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPowerSeries.monomial_mul_monomial | [
{
"state_after": "case h\nσ : Type u_1\nR : Type u_2\ninst✝ : Semiring R\nm n : σ →₀ ℕ\na b : R\nk : σ →₀ ℕ\n⊢ ↑(coeff R k) (↑(monomial R m) a * ↑(monomial R n) b) = ↑(coeff R k) (↑(monomial R (m + n)) (a * b))",
"state_before": "σ : Type u_1\nR : Type u_2\ninst✝ : Semiring R\nm n : σ →₀ ℕ\na b : R\n⊢ ↑(mon... | [
355,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
344,
1
] |
Mathlib/Data/List/Duplicate.lean | List.Duplicate.mono_sublist | [
{
"state_after": "case slnil\nα : Type u_1\nl : List α\nx : α\nl' : List α\nhx✝ : x ∈+ l\nhx : x ∈+ []\n⊢ x ∈+ []\n\ncase cons\nα : Type u_1\nl : List α\nx : α\nl' : List α\nhx✝ : x ∈+ l\nl₁ l₂ : List α\ny : α\na✝ : l₁ <+ l₂\nIH : x ∈+ l₁ → x ∈+ l₂\nhx : x ∈+ l₁\n⊢ x ∈+ y :: l₂\n\ncase cons₂\nα : Type u_1\nl : ... | [
117,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Algebra/Group/Basic.lean | inv_div' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.30365\nG : Type ?u.30368\ninst✝ : DivisionCommMonoid α\na b c d : α\n⊢ (a / b)⁻¹ = a⁻¹ / b⁻¹",
"tactic": "simp"
}
] | [
500,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
500,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.Substructure.closure_le | [] | [
287,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsLittleO.def' | [] | [
171,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Ordinal.type_out | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.23296\nβ : Type ?u.23299\nγ : Type ?u.23302\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\no : Ordinal\n⊢ type (Quotient.out o).r = o",
"tactic": "rw [Ordinal.type, WellOrder.eta, Quotient.out_eq]"
}
] | [
205,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.add_mem | [] | [
323,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
322,
11
] |
Mathlib/Data/Nat/Cast/Basic.lean | Nat.cast_min | [] | [
174,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Topology/Constructions.lean | embedding_sigmaMk | [] | [
1498,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1497,
1
] |
Mathlib/Data/List/Basic.lean | List.filter_true | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.380943\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\np : α → Bool\nl : List α\n⊢ filter (fun x => true) l = l",
"tactic": "induction l <;> simp [*, filter]"
}
] | [
3591,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3590,
1
] |
Mathlib/MeasureTheory/Group/MeasurableEquiv.lean | measurableEmbedding_const_smul | [] | [
61,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Analysis/SpecificLimits/Basic.lean | tendsto_atTop_of_geom_le | [] | [
159,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/MeasureTheory/Function/UniformIntegrable.lean | MeasureTheory.uniformIntegrable_of | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nι : Type u_3\nm : MeasurableSpace α\nμ : Measure α\ninst✝¹ : NormedAddCommGroup β\np : ℝ≥0∞\nf : ι → α → β\ninst✝ : IsFiniteMeasure μ\nhp : 1 ≤ p\nhp' : p ≠ ⊤\nhf : ∀ (i : ι), AEStronglyMeasurable (f i) μ\nh : ∀ (ε : ℝ), 0 < ε → ∃ C, ∀ (i : ι), snorm (Set.indicator ... | [
855,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
839,
1
] |
Mathlib/Combinatorics/Quiver/Basic.lean | Prefunctor.comp_id | [] | [
121,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/Data/List/Sublists.lean | List.sublists'_nil | [] | [
36,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
35,
1
] |
Mathlib/Data/MvPolynomial/Variables.lean | MvPolynomial.exists_rename_eq_of_vars_subset_range | [
{
"state_after": "R : Type u\nS : Type v\nσ : Type u_1\nτ : Type u_2\nr : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\np✝ q : MvPolynomial σ R\ninst✝ : CommSemiring S\np : MvPolynomial σ R\nf : τ → σ\nhfi : Injective f\nhf : ↑(vars p) ⊆ range f\n⊢ ↑(RingHom.comp ↑(rename f) ↑(aeval fun i => Option.el... | [
883,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
872,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.