file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Data/List/NodupEquivFin.lean | List.Sorted.get_strictMono | [] | [
88,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | Associates.mem_factors'_iff_dvd | [
{
"state_after": "case mp\nα : Type u_1\ninst✝¹ : CancelCommMonoidWithZero α\ndec_irr : (p : Associates α) → Decidable (Irreducible p)\ninst✝ : UniqueFactorizationMonoid α\ndec : DecidableEq α\ndec' : DecidableEq (Associates α)\na p : α\nha0 : a ≠ 0\nhp : Irreducible p\n⊢ { val := Associates.mk p, property := (... | [
1618,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1612,
1
] |
Mathlib/Topology/Bornology/Hom.lean | LocallyBoundedMap.comp_id | [] | [
186,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
1
] |
Mathlib/Analysis/Calculus/Deriv/Polynomial.lean | Polynomial.derivWithin_aeval | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁶ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nE : Type w\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL L₁ L₂ : F... | [
154,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
11
] |
Mathlib/Data/Sum/Basic.lean | Sum.map_bijective | [] | [
620,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
618,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.map_nil | [] | [
1458,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1458,
1
] |
Mathlib/Order/UpperLower/Basic.lean | bddAbove_lowerClosure | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.165959\nγ : Type ?u.165962\nι : Sort ?u.165965\nκ : ι → Sort ?u.165970\ninst✝¹ : Preorder α\ninst✝ : Preorder β\ns t : Set α\nx : α\n⊢ BddAbove ↑(lowerClosure s) ↔ BddAbove s",
"tactic": "simp_rw [BddAbove, upperBounds_lowerClosure]... | [
1487,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1486,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.aleph0_add_aleph0 | [] | [
1633,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1632,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.lift_iSup_le | [
{
"state_after": "α β : Type u\nι : Type v\nf : ι → Cardinal\nt : Cardinal\nhf : BddAbove (range f)\nw : ∀ (i : ι), lift (f i) ≤ t\n⊢ (⨆ (i : ι), lift (f i)) ≤ t",
"state_before": "α β : Type u\nι : Type v\nf : ι → Cardinal\nt : Cardinal\nhf : BddAbove (range f)\nw : ∀ (i : ι), lift (f i) ≤ t\n⊢ lift (iSup ... | [
1197,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1194,
1
] |
Mathlib/Data/Polynomial/IntegralNormalization.lean | Polynomial.support_integralNormalization | [
{
"state_after": "case pos\nR : Type u\nS : Type v\na b : R\nm n : ℕ\nι : Type y\ninst✝¹ : Ring R\ninst✝ : IsDomain R\nf : R[X]\nhf : f = 0\n⊢ support (integralNormalization f) = support f\n\ncase neg\nR : Type u\nS : Type v\na b : R\nm n : ℕ\nι : Type y\ninst✝¹ : Ring R\ninst✝ : IsDomain R\nf : R[X]\nhf : ¬f =... | [
105,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Analysis/Convex/Basic.lean | convex_sInter | [] | [
102,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | InnerProductSpace.Core.ofReal_normSq_eq_inner_self | [
{
"state_after": "𝕜 : Type u_1\nE : Type ?u.365837\nF : Type u_2\ninst✝² : IsROrC 𝕜\ninst✝¹ : AddCommGroup F\ninst✝ : Module 𝕜 F\nc : Core 𝕜 F\nx : F\n⊢ ↑re ↑(normSq x) = ↑re (inner x x) ∧ ↑im ↑(normSq x) = ↑im (inner x x)",
"state_before": "𝕜 : Type u_1\nE : Type ?u.365837\nF : Type u_2\ninst✝² : IsRO... | [
231,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/MeasureTheory/Function/EssSup.lean | essInf_antitone_measure | [
{
"state_after": "case refine'_1\nα : Type u_1\nβ : Type u_2\nm : MeasurableSpace α\nμ ν : MeasureTheory.Measure α\ninst✝ : CompleteLattice β\nf : α → β\nhμν : μ ≪ ν\n⊢ IsBoundedUnder (fun x x_1 => x ≥ x_1) (Measure.ae ν) f\n\ncase refine'_2\nα : Type u_1\nβ : Type u_2\nm : MeasurableSpace α\nμ ν : MeasureTheor... | [
210,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
Mathlib/RingTheory/Polynomial/Dickson.lean | Polynomial.dickson_one_one_eq_chebyshev_T | [
{
"state_after": "R : Type u_1\nS : Type ?u.173812\ninst✝² : CommRing R\ninst✝¹ : CommRing S\nk : ℕ\na : R\ninst✝ : Invertible 2\n⊢ 3 - ↑1 = 2",
"state_before": "R : Type u_1\nS : Type ?u.173812\ninst✝² : CommRing R\ninst✝¹ : CommRing S\nk : ℕ\na : R\ninst✝ : Invertible 2\n⊢ dickson 1 1 0 = 2 * comp (Chebys... | [
167,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.ne_zero_of_natDegree_gt | [
{
"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.467364\nn : ℕ\nh : n < natDegree p\nH : p = 0\n⊢ False",
"tactic": "simp [H, Nat.not_lt_zero] at h"
}
] | [
596,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.exists_eq_u | [] | [
191,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.im_surjective | [] | [
71,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/FieldTheory/PerfectClosure.lean | eq_pthRoot_iff | [] | [
98,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.biUnion_le | [] | [
320,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
318,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieHom.ext_iff | [
{
"state_after": "R : Type u\nL₁ : Type v\nL₂ : Type w\nL₃ : Type w₁\ninst✝⁶ : CommRing R\ninst✝⁵ : LieRing L₁\ninst✝⁴ : LieAlgebra R L₁\ninst✝³ : LieRing L₂\ninst✝² : LieAlgebra R L₂\ninst✝¹ : LieRing L₃\ninst✝ : LieAlgebra R L₃\nf : L₁ →ₗ⁅R⁆ L₂\nx : L₁\n⊢ ↑f x = ↑f x",
"state_before": "R : Type u\nL₁ : Ty... | [
391,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
388,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.Equiv.equivalence | [] | [
1001,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1000,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.mem_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.25056\nγ : Type ?u.25059\na b : α\n⊢ b ∈ {a} ↔ b = a",
"tactic": "simp only [← cons_zero, mem_cons, iff_self_iff, or_false_iff, not_mem_zero]"
}
] | [
339,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/SetTheory/Ordinal/Exponential.lean | Ordinal.opow_le_opow_iff_right | [] | [
120,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/LinearAlgebra/Eigenspace/Basic.lean | Module.End.generalized_eigenvec_disjoint_range_ker | [
{
"state_after": "K R : Type v\nV M : Type w\ninst✝⁶ : CommRing R\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : Module R M\ninst✝³ : Field K\ninst✝² : AddCommGroup V\ninst✝¹ : Module K V\ninst✝ : FiniteDimensional K V\nf : End K V\nμ : K\nh :\n Submodule.comap ((f - ↑(algebraMap K (End K V)) μ) ^ finrank K V) (↑(generali... | [
424,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
409,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.blockDiagonal'_pow | [] | [
786,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
784,
1
] |
Mathlib/Algebra/IndicatorFunction.lean | Set.mulIndicator_le_self' | [] | [
833,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
832,
1
] |
Mathlib/Analysis/NormedSpace/Pointwise.lean | smul_closedUnitBall_of_nonneg | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.1761797\nE : Type u_1\ninst✝³ : NormedField 𝕜\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace 𝕜 E\ninst✝ : NormedSpace ℝ E\nr : ℝ\nhr : 0 ≤ r\n⊢ r • closedBall 0 1 = closedBall 0 r",
"tactic": "rw [smul_closedUnitBall, Real.norm_of_nonneg... | [
412,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
410,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | summable_neg_iff | [] | [
816,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
815,
1
] |
Mathlib/Data/Nat/Digits.lean | Nat.digits_eq_cons_digits_div | [
{
"state_after": "case zero\nn✝ n : ℕ\nw : n ≠ 0\nh : 1 < zero\n⊢ digits zero n = n % zero :: digits zero (n / zero)\n\ncase succ.zero\nn✝ n : ℕ\nw : n ≠ 0\nh : 1 < succ zero\n⊢ digits (succ zero) n = n % succ zero :: digits (succ zero) (n / succ zero)\n\ncase succ.succ\nn✝ n : ℕ\nw : n ≠ 0\nb : ℕ\nh : 1 < succ... | [
313,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/CategoryTheory/Subobject/Basic.lean | CategoryTheory.Subobject.ind₂ | [
{
"state_after": "case h\nC : Type u₁\ninst✝¹ : Category C\nX✝ Y Z : C\nD : Type u₂\ninst✝ : Category D\nX : C\np : Subobject X → Subobject X → Prop\nh : ∀ ⦃A B : C⦄ (f : A ⟶ X) (g : B ⟶ X) [inst : Mono f] [inst_1 : Mono g], p (mk f) (mk g)\nP Q : Subobject X\n⊢ ∀ (a₁ a₂ : MonoOver X), p (Quotient.mk'' a₁) (Quo... | [
135,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
11
] |
Std/Data/Int/DivMod.lean | Int.mod_eq_emod | [
{
"state_after": "no goals",
"state_before": "a b : Int\nha : 0 ≤ a\nhb : 0 ≤ b\n⊢ mod a b = a % b",
"tactic": "simp [emod_def, mod_def, div_eq_ediv ha hb]"
}
] | [
335,
46
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
334,
1
] |
Mathlib/Algebra/Algebra/Operations.lean | Submodule.pow_subset_pow | [] | [
412,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
411,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | contDiff_fst | [] | [
743,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
742,
1
] |
Mathlib/Topology/Partial.lean | rtendsto_nhds | [] | [
30,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
28,
1
] |
Mathlib/Algebra/Associated.lean | not_prime_one | [] | [
73,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.measure_toMeasurable_inter | [] | [
738,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
735,
1
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | exists_lt_of_lt_ciSup | [] | [
948,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
946,
1
] |
Mathlib/RingTheory/WittVector/WittPolynomial.lean | bind₁_wittPolynomial_xInTermsOfW | [
{
"state_after": "p : ℕ\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : DecidableEq R\ninst✝ : Invertible ↑p\nn : ℕ\n⊢ ∀ (n : ℕ), (∀ (m : ℕ), m < n → ↑(bind₁ (W_ R)) (xInTermsOfW p R m) = X m) → ↑(bind₁ (W_ R)) (xInTermsOfW p R n) = X n",
"state_before": "p : ℕ\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : Deci... | [
328,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Analysis/NormedSpace/Exponential.lean | exp_op | [
{
"state_after": "no goals",
"state_before": "𝕂 : Type u_2\n𝔸 : Type u_1\ninst✝⁵ : Field 𝕂\ninst✝⁴ : Ring 𝔸\ninst✝³ : Algebra 𝕂 𝔸\ninst✝² : TopologicalSpace 𝔸\ninst✝¹ : TopologicalRing 𝔸\ninst✝ : T2Space 𝔸\nx : 𝔸\n⊢ exp 𝕂 (MulOpposite.op x) = MulOpposite.op (exp 𝕂 x)",
"tactic": "simp_rw [ex... | [
130,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Algebra/BigOperators/Fin.lean | Fin.prod_univ_def | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.464\nβ : Type u_1\ninst✝ : CommMonoid β\nn : ℕ\nf : Fin n → β\n⊢ ∏ i : Fin n, f i = List.prod (List.map f (List.finRange n))",
"tactic": "simp [univ_def]"
}
] | [
51,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
50,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.L1.SimpleFunc.setToL1SCLM_mono_left | [] | [
976,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
972,
1
] |
Mathlib/Algebra/Hom/Group.lean | MulHom.congr_fun | [] | [
677,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
676,
1
] |
Mathlib/Data/List/Basic.lean | List.map_eq_map | [] | [
1824,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1823,
1
] |
Mathlib/Analysis/ODE/PicardLindelof.lean | PicardLindelof.tDist_nonneg | [] | [
129,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.castSucc_mk | [] | [
1213,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1212,
1
] |
Mathlib/Data/MvPolynomial/CommRing.lean | MvPolynomial.eval₂Hom_X | [
{
"state_after": "no goals",
"state_before": "R✝ : Type u\nS : Type v\nσ : Type ?u.162485\na a' a₁ a₂ : R✝\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommRing R✝\np q : MvPolynomial σ R✝\ninst✝ : CommRing S\nf✝ : R✝ →+* S\ng : σ → S\nR : Type u\nc : ℤ →+* S\nf : MvPolynomial R ℤ →+* S\nx : MvPolynomial R ℤ\n⊢ ev... | [
165,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Algebra/BigOperators/Pi.lean | RingHom.functions_ext | [] | [
123,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.add_le_right_iff_mul_omega_le | [
{
"state_after": "a b : Ordinal\n⊢ a + b ≤ b ↔ a + b = b",
"state_before": "a b : Ordinal\n⊢ a + b ≤ b ↔ a * ω ≤ b",
"tactic": "rw [← add_eq_right_iff_mul_omega_le]"
},
{
"state_after": "no goals",
"state_before": "a b : Ordinal\n⊢ a + b ≤ b ↔ a + b = b",
"tactic": "exact (add_isNormal a... | [
597,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean | Real.volume_Ioi | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.243161\ninst✝ : Fintype ι\na : ℝ\nn : ℕ\n⊢ ↑n = ↑↑volume (Ioo a (a + ↑n))",
"tactic": "simp"
}
] | [
153,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.map_zero | [] | [
951,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
950,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.bsup_le_blsub | [] | [
1826,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1824,
1
] |
Mathlib/MeasureTheory/Measure/VectorMeasure.lean | MeasureTheory.VectorMeasure.zero_le_restrict_subset | [] | [
1027,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1025,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.iSup_ne_top | [] | [
443,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
441,
1
] |
Mathlib/Order/UpperLower/Basic.lean | upperClosure_univ | [] | [
1414,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1413,
1
] |
Mathlib/Order/BoundedOrder.lean | eq_bot_iff | [] | [
373,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
372,
1
] |
Mathlib/Algebra/Order/Rearrangement.lean | AntivaryOn.sum_smul_le_sum_comp_perm_smul | [] | [
221,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Computability/Primrec.lean | Nat.Primrec'.nil | [] | [
1420,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1420,
11
] |
Mathlib/CategoryTheory/Sites/Sheafification.lean | CategoryTheory.GrothendieckTopology.isIso_toSheafify | [
{
"state_after": "C : Type u\ninst✝³ : Category C\nJ : GrothendieckTopology C\nD : Type w\ninst✝² : Category D\ninst✝¹ : ∀ (P : Cᵒᵖ ⥤ D) (X : C) (S : Cover J X), HasMultiequalizer (Cover.index S P)\ninst✝ : ∀ (X : C), HasColimitsOfShape (Cover J X)ᵒᵖ D\nP : Cᵒᵖ ⥤ D\nhP : Presheaf.IsSheaf J P\n⊢ IsIso (toPlus J ... | [
539,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
535,
1
] |
Mathlib/Order/WithBot.lean | WithBot.unbot'_eq_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.3913\nγ : Type ?u.3916\nδ : Type ?u.3919\na b d y : α\nx : WithBot α\n⊢ unbot' d x = y ↔ x = ↑y ∨ x = ⊥ ∧ y = d",
"tactic": "induction x using recBotCoe <;> simp [@eq_comm _ d]"
}
] | [
135,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Logic/Relation.lean | Relation.TransGen.trans_right | [
{
"state_after": "case single\nα : Type u_1\nβ : Type ?u.20625\nγ : Type ?u.20628\nδ : Type ?u.20631\nr : α → α → Prop\na b c d : α\nhab : ReflTransGen r a b\nb✝ : α\na✝ : r b b✝\n⊢ TransGen r a b✝\n\ncase tail\nα : Type u_1\nβ : Type ?u.20625\nγ : Type ?u.20628\nδ : Type ?u.20631\nr : α → α → Prop\na b c d : α... | [
415,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
412,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | pow_le_pow_of_le_one_aux | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.301195\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✝ : StrictOrderedSemiring R\na : R\nh : 0 ≤ a\nha : a ≤ 1\ni : ℕ\n⊢ a ^ (i + 0) ≤ a ^ i",
"tactic": "simp"
},
{
"state_after": "... | [
668,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
663,
1
] |
Mathlib/Analysis/NormedSpace/CompactOperator.lean | IsCompactOperator.image_ball_subset_compact | [] | [
147,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Algebra/GCDMonoid/Finset.lean | Finset.lcm_singleton | [] | [
90,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/CategoryTheory/Limits/Lattice.lean | CategoryTheory.Limits.CompleteLattice.prod_eq_inf | [
{
"state_after": "no goals",
"state_before": "α : Type u\nJ : Type w\ninst✝³ : SmallCategory J\ninst✝² : FinCategory J\ninst✝¹ : SemilatticeInf α\ninst✝ : OrderTop α\nx y : α\n⊢ limit (pair x y) = Finset.inf Finset.univ (pair x y).toPrefunctor.obj",
"tactic": "rw [finite_limit_eq_finset_univ_inf (pair.{... | [
131,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.reduce_invRev | [
{
"state_after": "case H\nα : Type u\nL L₁ L₂ L₃ L₄ : List (α × Bool)\ninst✝ : DecidableEq α\nw : List (α × Bool)\n⊢ Red (reduce (invRev w)) (invRev (reduce w))",
"state_before": "α : Type u\nL L₁ L₂ L₃ L₄ : List (α × Bool)\ninst✝ : DecidableEq α\nw : List (α × Bool)\n⊢ reduce (invRev w) = invRev (reduce w)... | [
1337,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1332,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.preimage_mul_left_one' | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.133358\nα : Type u_1\nβ : Type ?u.133364\nγ : Type ?u.133367\ninst✝ : Group α\ns t : Set α\na b : α\n⊢ (fun b => a⁻¹ * b) ⁻¹' 1 = {a}",
"tactic": "simp"
}
] | [
1245,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1245,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.disjiUnion_eq_biUnion | [] | [
3567,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3565,
1
] |
Mathlib/Data/PNat/Prime.lean | PNat.coprime_coe | [
{
"state_after": "m n : ℕ+\n⊢ Nat.gcd ↑m ↑n = 1 ↔ gcd m n = 1",
"state_before": "m n : ℕ+\n⊢ coprime ↑m ↑n ↔ Coprime m n",
"tactic": "unfold coprime Coprime"
},
{
"state_after": "m n : ℕ+\n⊢ Nat.gcd ↑m ↑n = 1 ↔ ↑(gcd m n) = ↑1",
"state_before": "m n : ℕ+\n⊢ Nat.gcd ↑m ↑n = 1 ↔ gcd m n = 1",
... | [
174,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Analysis/Convex/Segment.lean | mem_openSegment_iff_div | [
{
"state_after": "case mp\n𝕜 : Type u_2\nE : Type u_1\nF : Type ?u.200437\nG : Type ?u.200440\nι : Type ?u.200443\nπ : ι → Type ?u.200448\ninst✝² : LinearOrderedSemifield 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : Module 𝕜 E\nx y z : E\n⊢ x ∈ openSegment 𝕜 y z → ∃ a b, 0 < a ∧ 0 < b ∧ (a / (a + b)) • y + (b / (a +... | [
365,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
356,
1
] |
Mathlib/Data/MvPolynomial/PDeriv.lean | MvPolynomial.pderiv_C | [] | [
86,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.relabel_moveLeft | [
{
"state_after": "no goals",
"state_before": "x : PGame\nxl' xr' : Type u_1\nel : xl' ≃ LeftMoves x\ner : xr' ≃ RightMoves x\ni : LeftMoves x\n⊢ moveLeft (relabel el er) (↑el.symm i) = moveLeft x i",
"tactic": "simp"
}
] | [
1156,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1155,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.sup_mul_nat | [
{
"state_after": "case inl\n\n⊢ (sup fun n => 0 * ↑n) = 0 * ω\n\ncase inr\no : Ordinal\nho : 0 < o\n⊢ (sup fun n => o * ↑n) = o * ω",
"state_before": "o : Ordinal\n⊢ (sup fun n => o * ↑n) = o * ω",
"tactic": "rcases eq_zero_or_pos o with (rfl | ho)"
},
{
"state_after": "case inl\n\n⊢ (sup fun n ... | [
2522,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2518,
1
] |
Mathlib/Order/Hom/Basic.lean | OrderHom.id_comp | [
{
"state_after": "case h.h\nF : Type ?u.47604\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.47613\nδ : Type ?u.47616\ninst✝³ : Preorder α\ninst✝² : Preorder β\ninst✝¹ : Preorder γ\ninst✝ : Preorder δ\nf : α →o β\nx✝ : α\n⊢ ↑(comp id f) x✝ = ↑f x✝",
"state_before": "F : Type ?u.47604\nα : Type u_1\nβ : Type u_2\n... | [
381,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
379,
1
] |
Mathlib/Data/Set/Function.lean | Set.preimage_invFun_of_not_mem | [
{
"state_after": "case h\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.70004\nι : Sort ?u.70007\nπ : α → Type ?u.70012\ns✝ s₁ s₂ : Set α\nt : Set β\nf✝ : α → β\nn : Nonempty α\nf : α → β\nhf : Injective f\ns : Set α\nh : ¬Classical.choice n ∈ s\nx : β\n⊢ x ∈ Function.invFun f ⁻¹' s ↔ x ∈ f '' s",
"state_before":... | [
1307,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1301,
1
] |
Mathlib/Order/UpperLower/Basic.lean | UpperSet.symm_map | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.93130\nι : Sort ?u.93133\nκ : ι → Sort ?u.93138\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ninst✝ : Preorder γ\nf✝ : α ≃o β\ns✝ t : UpperSet α\na : α\nb : β\nf : α ≃o β\ns : UpperSet β\n⊢ ↑(↑(OrderIso.symm (map f)) s) = ↑(↑... | [
971,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
970,
1
] |
Mathlib/Order/Hom/Lattice.lean | InfHom.coe_const | [] | [
635,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
634,
1
] |
Mathlib/Algebra/Order/Monoid/Cancel/Defs.lean | OrderedCancelCommMonoid.lt_of_mul_lt_mul_left | [] | [
63,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Topology/Semicontinuous.lean | IsClosed.lowerSemicontinuous_indicator | [
{
"state_after": "α : Type u_1\ninst✝² : TopologicalSpace α\nβ : Type u_2\ninst✝¹ : Preorder β\nf g : α → β\nx✝ : α\ns t : Set α\ny z✝ : β\ninst✝ : Zero β\nhs : IsClosed s\nhy : y ≤ 0\nx : α\nz : β\nhz : z < indicator s (fun _x => y) x\n⊢ ∀ᶠ (x' : α) in 𝓝 x, z < indicator s (fun _x => y) x'",
"state_before... | [
234,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.closure_eq_of_le | [] | [
1129,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1128,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.strongDownwardInductionOn_eq | [
{
"state_after": "α : Type u_1\nβ : Type ?u.82569\nγ : Type ?u.82572\np : Multiset α → Sort u_2\ns : Multiset α\nn : ℕ\nH : (t₁ : Multiset α) → ({t₂ : Multiset α} → ↑card t₂ ≤ n → t₁ < t₂ → p t₂) → ↑card t₁ ≤ n → p t₁\n⊢ (fun a => strongDownwardInduction H s a) = H s fun {t} ht _h => strongDownwardInduction H t... | [
869,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
865,
1
] |
Mathlib/Topology/ContinuousFunction/Compact.lean | ContinuousMap.addEquivBoundedOfCompact_symm_apply | [] | [
91,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Data/Part.lean | Part.right_dom_of_inter_dom | [] | [
830,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
830,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.lt_iff_lt | [] | [
321,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
320,
1
] |
Mathlib/Analysis/InnerProductSpace/Projection.lean | eq_orthogonalProjection_of_eq_submodule | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.508885\ninst✝⁶ : IsROrC 𝕜\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : InnerProductSpace 𝕜 E\ninst✝² : InnerProductSpace ℝ F\nK : Submodule 𝕜 E\ninst✝¹ : CompleteSpace { x // x ∈ K }\nK' : Submodule 𝕜 E\ninst✝ : CompleteSp... | [
512,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
509,
1
] |
Mathlib/Data/Fintype/Basic.lean | Set.toFinset_inj | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.81885\nγ : Type ?u.81888\ns✝ t✝ s t : Set α\ninst✝¹ : Fintype ↑s\ninst✝ : Fintype ↑t\nh : toFinset s = toFinset t\n⊢ s = t",
"tactic": "rw [← s.coe_toFinset, h, t.coe_toFinset]"
},
{
"state_after": "no goals",
"state_bef... | [
648,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
647,
1
] |
Mathlib/Algebra/Field/Basic.lean | inv_neg | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.36358\nβ : Type ?u.36361\nK : Type u_1\ninst✝¹ : DivisionMonoid K\ninst✝ : HasDistribNeg K\na b : K\n⊢ (-a)⁻¹ = -a⁻¹",
"tactic": "rw [neg_inv]"
}
] | [
133,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | fderivWithin_sub_const | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.519519\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed... | [
591,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/Init/Logic.lean | if_ctx_simp_congr_prop | [] | [
394,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Order/RelClasses.lean | not_rel_of_subsingleton | [] | [
144,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/LinearAlgebra/Contraction.lean | map_dualTensorHom | [
{
"state_after": "case H.h.h\nι : Type w\nR : Type u\nM : Type v₁\nN : Type v₂\nP : Type v₃\nQ : Type v₄\ninst✝¹⁰ : CommSemiring R\ninst✝⁹ : AddCommMonoid M\ninst✝⁸ : AddCommMonoid N\ninst✝⁷ : AddCommMonoid P\ninst✝⁶ : AddCommMonoid Q\ninst✝⁵ : Module R M\ninst✝⁴ : Module R N\ninst✝³ : Module R P\ninst✝² : Modu... | [
122,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.erase_of_not_mem | [] | [
1030,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1029,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.map_top | [] | [
1608,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1607,
1
] |
Mathlib/NumberTheory/Padics/PadicNumbers.lean | padicNormE.add_eq_max_of_ne | [
{
"state_after": "p : ℕ\nhp : Fact (Nat.Prime p)\nq r : ℚ_[p]\nh : ¬↑(↑padicNormE q) = ↑(↑padicNormE r)\n⊢ ↑(↑padicNormE (q + r)) = max ↑(↑padicNormE q) ↑(↑padicNormE r)",
"state_before": "p : ℕ\nhp : Fact (Nat.Prime p)\nq r : ℚ_[p]\nh : ‖q‖ ≠ ‖r‖\n⊢ ‖q + r‖ = max ‖q‖ ‖r‖",
"tactic": "dsimp [norm] at h⊢... | [
830,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
827,
1
] |
Mathlib/MeasureTheory/Constructions/Polish.lean | MeasureTheory.measurableSet_range_of_continuous_injective | [
{
"state_after": "α : Type ?u.87426\ninst✝⁵ : TopologicalSpace α\nι : Type ?u.87432\nγ : Type u_2\ntγ : TopologicalSpace γ\ninst✝⁴ : PolishSpace γ\nβ : Type u_1\ninst✝³ : TopologicalSpace β\ninst✝² : T2Space β\ninst✝¹ : MeasurableSpace β\ninst✝ : BorelSpace β\nf : γ → β\nf_cont : Continuous f\nf_inj : Injective... | [
571,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
424,
1
] |
Std/Data/List/Basic.lean | List.sigma_eq_sigmaTR | [
{
"state_after": "case h.h.h.h\nα : Type u_2\nβ : α → Type u_1\nl₁ : List α\nl₂ : (a : α) → List (β a)\n⊢ List.sigma l₁ l₂ = sigmaTR l₁ l₂",
"state_before": "⊢ @List.sigma = @sigmaTR",
"tactic": "funext α β l₁ l₂"
},
{
"state_after": "case h.h.h.h\nα : Type u_2\nβ : α → Type u_1\nl₁ : List α\nl₂... | [
1005,
40
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1002,
10
] |
Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean | ProjectiveSpectrum.vanishingIdeal_closure | [
{
"state_after": "R : Type u_2\nA : Type u_1\ninst✝³ : CommSemiring R\ninst✝² : CommRing A\ninst✝¹ : Algebra R A\n𝒜 : ℕ → Submodule R A\ninst✝ : GradedAlgebra 𝒜\nt : Set (ProjectiveSpectrum 𝒜)\nthis :\n HomogeneousIdeal.toIdeal (vanishingIdeal (zeroLocus 𝒜 ↑(HomogeneousIdeal.toIdeal (vanishingIdeal t)))) =... | [
380,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
374,
1
] |
Mathlib/Logic/Embedding/Basic.lean | Function.Embedding.coe_sumMap | [] | [
297,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Analysis/SpecialFunctions/Sqrt.lean | Real.contDiffAt_sqrt | [] | [
68,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
67,
1
] |
Mathlib/Data/Polynomial/Expand.lean | Polynomial.expand_inj | [] | [
138,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.Lp.simpleFunc.boundedSMul | [] | [
525,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
524,
11
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.