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/Algebra/Order/Hom/Basic.lean | le_map_div_mul_map_div | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.11845\nF : Type u_3\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.11857\nδ : Type ?u.11860\ninst✝³ : Group α\ninst✝² : CommSemigroup β\ninst✝¹ : LE β\ninst✝ : SubmultiplicativeHomClass F α β\nf : F\na b c : α\n⊢ ↑f (a / c) ≤ ↑f (a / b) * ↑f (b / c)",
... | [
147,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.ne_single_iff | [
{
"state_after": "n✝ : ℕ\nc✝ : Composition n✝\nn : ℕ\nhn : 0 < n\nc : Composition n\n⊢ ¬c ≠ single n hn ↔ ¬∀ (i : Fin (length c)), blocksFun c i < n",
"state_before": "n✝ : ℕ\nc✝ : Composition n✝\nn : ℕ\nhn : 0 < n\nc : Composition n\n⊢ c ≠ single n hn ↔ ∀ (i : Fin (length c)), blocksFun c i < n",
"tact... | [
631,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
612,
1
] |
Mathlib/Analysis/NormedSpace/Units.lean | NormedRing.inverse_add_norm_diff_first_order | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝¹ : NormedRing R\ninst✝ : CompleteSpace R\nx : Rˣ\n⊢ (fun t => inverse (↑x + t) - ↑x⁻¹) =O[𝓝 0] fun t => ‖t‖",
"tactic": "simpa using inverse_add_norm_diff_nth_order x 1"
}
] | [
205,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.Memℒp.congr_norm | [] | [
550,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
548,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.rat_cast_re | [
{
"state_after": "no goals",
"state_before": "q : ℚ\n⊢ ↑(↑q).re = ↑q",
"tactic": "rw [← ofReal_rat_cast, ofReal_re]"
}
] | [
867,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
866,
1
] |
Mathlib/MeasureTheory/Measure/Content.lean | MeasureTheory.Content.outerMeasure_exists_open | [
{
"state_after": "case intro.intro.intro\nG : Type w\ninst✝¹ : TopologicalSpace G\nμ : Content G\ninst✝ : T2Space G\nA : Set G\nhA : ↑(Content.outerMeasure μ) A ≠ ⊤\nε : ℝ≥0\nhε : ε ≠ 0\nU : Set G\nhU : IsOpen U\nh2U : A ⊆ U\nh3U :\n ↑(inducedOuterMeasure (fun s₁ hs₁ => innerContent μ { carrier := s₁, is_open'... | [
300,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
295,
1
] |
Mathlib/Data/Real/Irrational.lean | irrational_int_sub_iff | [] | [
568,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometryEquiv.coe_mk' | [] | [
387,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
386,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | LinearEquiv.ofInjectiveEndo_right_inv | [] | [
987,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
985,
1
] |
Mathlib/Order/Concept.lean | subset_extentClosure_intentClosure | [] | [
139,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Data/Nat/Choose/Factorization.lean | Nat.factorization_choose_le_one | [
{
"state_after": "p n k : ℕ\np_large : n < p ^ 2\n⊢ log p n ≤ 1",
"state_before": "p n k : ℕ\np_large : n < p ^ 2\n⊢ ↑(factorization (choose n k)) p ≤ 1",
"tactic": "apply factorization_choose_le_log.trans"
},
{
"state_after": "case inl\np k : ℕ\np_large : 0 < p ^ 2\n⊢ log p 0 ≤ 1\n\ncase inr\np... | [
63,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioo_union_Icc_eq_Ioc | [] | [
1551,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1548,
1
] |
Mathlib/Algebra/Quaternion.lean | Cardinal.pow_four | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nc₁ c₂ : R\ninst✝ : Infinite R\n⊢ 1 ≤ 4",
"tactic": "simp"
}
] | [
1425,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1424,
9
] |
Mathlib/Combinatorics/Young/YoungDiagram.lean | YoungDiagram.rowLen_ofRowLens | [
{
"state_after": "no goals",
"state_before": "w : List ℕ\nhw : List.Sorted (fun x x_1 => x ≥ x_1) w\ni : Fin (List.length w)\n⊢ rowLen (ofRowLens w hw) ↑i = List.get w i",
"tactic": "simp [rowLen, Nat.find_eq_iff, mem_ofRowLens]"
}
] | [
512,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
510,
1
] |
Mathlib/Algebra/Group/Opposite.lean | SemiconjBy.op | [] | [
234,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | Irreducible.normalizedFactors_pow | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝³ : CancelCommMonoidWithZero α\ninst✝² : DecidableEq α\ninst✝¹ : NormalizationMonoid α\ninst✝ : UniqueFactorizationMonoid α\np : α\nhp : Irreducible p\nk : ℕ\n⊢ normalizedFactors (p ^ k) = Multiset.replicate k (↑normalize p)",
"tactic": "r... | [
703,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
700,
1
] |
Std/Data/List/Lemmas.lean | List.mem_join | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na : α\n⊢ a ∈ join [] ↔ ∃ l, l ∈ [] ∧ a ∈ l",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\na : α\nb : List α\nl : List (List α)\n⊢ a ∈ join (b :: l) ↔ ∃ l_1, l_1 ∈ b :: l ∧ a ∈ l_1",
"tactic": "... | [
184,
58
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
182,
1
] |
Mathlib/Algebra/AddTorsor.lean | Equiv.coe_constVSub | [] | [
392,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.restrict_apply | [] | [
495,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
493,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.bsup_succ_of_mono | [] | [
1546,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1544,
1
] |
Mathlib/Order/RelClasses.lean | IsWellFounded.apply | [] | [
312,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.SSameSide.nonempty | [] | [
151,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.tr_succ | [] | [
1125,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1121,
1
] |
Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean | balancedCore_eq_iInter | [
{
"state_after": "𝕜 : Type u_2\nE : Type u_1\nι : Type ?u.67976\ninst✝² : NormedField 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : Module 𝕜 E\ns t : Set E\nhs : 0 ∈ s\n⊢ balancedCoreAux 𝕜 s ⊆ balancedCore 𝕜 s",
"state_before": "𝕜 : Type u_2\nE : Type u_1\nι : Type ?u.67976\ninst✝² : NormedField 𝕜\ninst✝¹ : Ad... | [
205,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Algebra/Lie/Subalgebra.lean | LieSubalgebra.mem_top | [] | [
465,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
464,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Localization.r_iff_exists | [
{
"state_after": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type ?u.45548\ninst✝¹ : CommMonoid N\nP : Type ?u.45554\ninst✝ : CommMonoid P\nx y : M × { x // x ∈ S }\n⊢ ↑(r' S) x y ↔ ∃ c, ↑c * (↑y.snd * x.fst) = ↑c * (↑x.snd * y.fst)",
"state_before": "M : Type u_1\ninst✝² : CommMonoid M\nS : ... | [
206,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
1
] |
Mathlib/Order/Compare.lean | cmpLE_eq_cmp | [
{
"state_after": "case neg\nα✝ : Type ?u.3620\nβ : Type ?u.3623\nα : Type u_1\ninst✝³ : Preorder α\ninst✝² : IsTotal α fun x x_1 => x ≤ x_1\ninst✝¹ : DecidableRel fun x x_1 => x ≤ x_1\ninst✝ : DecidableRel fun x x_1 => x < x_1\nx y : α\nxy : ¬x ≤ y\nyx : ¬y ≤ x\n⊢ False",
"state_before": "α✝ : Type ?u.3620\... | [
46,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
43,
1
] |
Mathlib/Data/Sym/Basic.lean | Sym.eq_replicate | [] | [
308,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.measurableSet_toMeasurable | [
{
"state_after": "α : Type u_1\nβ : Type ?u.143049\nγ : Type ?u.143052\nδ : Type ?u.143055\nι : Type ?u.143058\ninst✝ : MeasurableSpace α\nμ✝ μ₁ μ₂ : Measure α\ns✝ s₁ s₂ t : Set α\nμ : Measure α\ns : Set α\n⊢ MeasurableSet\n (if h : ∃ t x, MeasurableSet t ∧ t =ᵐ[μ] s then Exists.choose h\n else\n if ... | [
615,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
611,
1
] |
Mathlib/RingTheory/PrincipalIdealDomain.lean | PrincipalIdealRing.ringHom_mem_submonoid_of_factors_subset_of_units_subset | [] | [
306,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.setToFun_non_aEStronglyMeasurable | [] | [
1299,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1297,
1
] |
Mathlib/Data/PEquiv.lean | PEquiv.mem_iff_mem | [] | [
111,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieEquiv.coe_linearEquiv_injective | [
{
"state_after": "case mk.mk.mk.mk.mk.mk.mk.mk\nR : Type u\nL₁ : Type v\nL₂ : Type w\nL₃ : Type w₁\ninst✝⁶ : CommRing R\ninst✝⁵ : LieRing L₁\ninst✝⁴ : LieRing L₂\ninst✝³ : LieRing L₃\ninst✝² : LieAlgebra R L₁\ninst✝¹ : LieAlgebra R L₂\ninst✝ : LieAlgebra R L₃\nf_inv : L₂ → L₁\nf : L₁ → L₂\nmap_add'✝¹ : ∀ (x y :... | [
574,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
569,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | algebraMap.coe_inj | [] | [
215,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.Theory.isSatisfiable_union_distinctConstantsTheory_of_infinite | [
{
"state_after": "L : Language\nT✝ : Theory L\nα : Type w\nn : ℕ\nT' T : Theory L\ns : Set α\nM : Type w'\ninst✝² : Structure L M\ninst✝¹ : M ⊨ T\ninst✝ : Infinite M\n⊢ ∀ (i : Finset ↑s),\n IsSatisfiable\n (LHom.onTheory (lhomWithConstants L α) T ∪\n distinctConstantsTheory L ↑(Finset.map (Functi... | [
173,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
160,
1
] |
Mathlib/MeasureTheory/Group/Integration.lean | MeasureTheory.Integrable.comp_div_right | [
{
"state_after": "𝕜 : Type ?u.62351\nM : Type ?u.62354\nα : Type ?u.62357\nG : Type u_1\nE : Type ?u.62363\nF : Type u_2\ninst✝⁷ : MeasurableSpace G\ninst✝⁶ : NormedAddCommGroup E\ninst✝⁵ : NormedSpace ℝ E\ninst✝⁴ : CompleteSpace E\ninst✝³ : NormedAddCommGroup F\nμ : Measure G\nf✝ : G → E\ng✝ : G\ninst✝² : Gro... | [
167,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/MeasureTheory/Decomposition/Lebesgue.lean | MeasureTheory.SignedMeasure.haveLebesgueDecomposition_mk | [
{
"state_after": "case pos\nα : Type u_1\nβ : Type ?u.458599\nm : MeasurableSpace α\nμ✝ ν : Measure α\ns t : SignedMeasure α\nμ : Measure α\nf : α → ℝ\nhf : Measurable f\nhtμ : t ⟂ᵥ toENNRealVectorMeasure μ\nhadd : s = t + withDensityᵥ μ f\nhfi : Integrable f\n⊢ HaveLebesgueDecomposition s μ\n\ncase neg\nα : Ty... | [
1024,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1017,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.sets_iff_generate | [
{
"state_after": "case intro.intro.intro.intro\nC : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nX Y✝ Z✝ : C\nf✝ : Y✝ ⟶ X\nS✝ R✝ : Sieve X\nR : Presieve X\nS : Sieve X\nss : R ≤ S.arrows\nY Z : C\nf : Y ⟶ Z\ng : Z ⟶ X\nhg : R g\n⊢ S.arrows (f ≫ g)",
"state_before": "C : Type u₁\... | [
409,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
406,
1
] |
Mathlib/Algebra/Symmetrized.lean | SymAlg.sym_symm | [] | [
86,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/List/Basic.lean | List.nthLe_enumFrom | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.455366\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ l : List α\nn i : ℕ\nhi' : i < length (enumFrom n l)\n⊢ i < length l",
"tactic": "simpa [length_enumFrom] using hi'"
}
] | [
3954,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3951,
1
] |
Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean | GromovHausdorff.candidates_lipschitz_aux | [
{
"state_after": "case h\nX : Type u\nY : Type v\ninst✝⁵ : MetricSpace X\ninst✝⁴ : CompactSpace X\ninst✝³ : Nonempty X\ninst✝² : MetricSpace Y\ninst✝¹ : CompactSpace Y\ninst✝ : Nonempty Y\nf : GromovHausdorff.ProdSpaceFun X Y\nx y z t : X ⊕ Y\nfA : f ∈ candidates X Y\n⊢ f (x, y) ≤ f (x, t) + f (t, y)",
"sta... | [
198,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
9
] |
Mathlib/Logic/Function/Iterate.lean | Function.iterate_add | [
{
"state_after": "α : Type u\nβ : Type v\nf : α → α\nm n : ℕ\n⊢ (f^[m] ∘ f^[n]) ∘ f = f^[m] ∘ f^[n] ∘ f",
"state_before": "α : Type u\nβ : Type v\nf : α → α\nm n : ℕ\n⊢ f^[m + Nat.succ n] = f^[m] ∘ f^[Nat.succ n]",
"tactic": "rw [Nat.add_succ, iterate_succ, iterate_succ, iterate_add m n]"
},
{
"... | [
69,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
67,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean | Real.arcsin_nonpos | [] | [
209,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.ne_of_adj_of_not_adj | [] | [
219,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Geometry/Euclidean/Basic.lean | EuclideanGeometry.dist_left_midpoint_eq_dist_right_midpoint | [
{
"state_after": "no goals",
"state_before": "V : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\np1 p2 : P\n⊢ dist p1 (midpoint ℝ p1 p2) = dist p2 (midpoint ℝ p1 p2)",
"tactic": "rw [dist_left_midpoint (𝕜 := ℝ)... | [
79,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Topology/Algebra/Module/Star.lean | continuous_decomposeProdAdjoint_symm | [] | [
70,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.coe_vsub | [] | [
409,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
408,
1
] |
Mathlib/Analysis/Calculus/MeanValue.lean | norm_image_sub_le_of_norm_deriv_le_segment | [
{
"state_after": "E : Type u_1\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace ℝ E\nF : Type ?u.41030\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace ℝ F\nf : ℝ → E\na b C : ℝ\nhf : DifferentiableOn ℝ f (Icc a b)\nbound : ∀ (x : ℝ), x ∈ Ico a b → ‖derivWithin f (Icc a b) x‖ ≤ C\n⊢ ∀ (x : ℝ), x ∈ Icc a ... | [
375,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
371,
1
] |
Mathlib/Analysis/Convex/Function.lean | ConcaveOn.dual | [] | [
85,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/List/Indexes.lean | List.foldrIdxM_eq_foldrM_enum | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u\nβ✝ : Type v\nm : Type u → Type v\ninst✝¹ : Monad m\nα : Type u_1\nβ : Type u\nf : ℕ → α → β → m β\nb : β\nas : List α\ninst✝ : LawfulMonad m\n⊢ foldrIdxM f b as = foldrM (uncurry f) b (enum as)",
"tactic": "simp only [foldrIdxM, foldrM_eq_foldr,... | [
286,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/MeasureTheory/Measure/OpenPos.lean | Metric.measure_ball_pos | [] | [
188,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | LocalHomeomorph.isOpen_extend_preimage' | [] | [
879,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
877,
1
] |
Mathlib/MeasureTheory/Measure/VectorMeasure.lean | MeasureTheory.VectorMeasure.neg_apply | [] | [
354,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
354,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.ofSet_trans' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.73421\nδ : Type ?u.73424\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\ne : LocalHomeomorph α β\ne' : LocalHomeomorph β γ\ns : Set α\nhs : IsOpen s\n⊢ Lo... | [
882,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
881,
1
] |
Std/Data/List/Lemmas.lean | List.map_singleton | [] | [
154,
69
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
154,
1
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.image_const_sub_uIcc | [
{
"state_after": "α : Type u_1\ninst✝ : LinearOrderedAddCommGroup α\na b c d : α\nthis : ∀ (a_1 : Set α), ((fun x => a + x) ∘ fun x => -x) '' a_1 = (fun x => a + x) '' ((fun x => -x) '' a_1)\n⊢ (fun x => a - x) '' [[b, c]] = [[a - b, a - c]]",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedAddCommGroup... | [
466,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
464,
1
] |
Mathlib/Topology/ContinuousOn.lean | nhds_of_nhdsWithin_of_nhds | [
{
"state_after": "case intro.intro\nα : Type u_1\nβ : Type ?u.6425\nγ : Type ?u.6428\nδ : Type ?u.6431\ninst✝ : TopologicalSpace α\ns t : Set α\na : α\nh1 : s ∈ 𝓝 a\nh2 : t ∈ 𝓝[s] a\nw✝ : Set α\nHw : w✝ ∈ 𝓝 a\nhw : w✝ ∩ s ⊆ t\n⊢ t ∈ 𝓝 a",
"state_before": "α : Type u_1\nβ : Type ?u.6425\nγ : Type ?u.6428... | [
118,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.disc_ne_zero_iff_roots_ne | [
{
"state_after": "R : Type ?u.1293662\nS : Type ?u.1293665\nF : Type u_1\nK : Type u_2\nP : Cubic F\ninst✝¹ : Field F\ninst✝ : Field K\nφ : F →+* K\nx y z : K\nha : P.a ≠ 0\nh3 : roots (map φ P) = {x, y, z}\n⊢ ↑φ P.a * ↑φ P.a * (x - y) * (x - z) * (y - z) * (↑φ P.a * ↑φ P.a * (x - y) * (x - z) * (y - z)) ≠ 0 ↔\... | [
585,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
581,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieSubmodule.coe_toSubmodule_mk | [
{
"state_after": "case mk\nR : Type u\nL : Type v\nM : Type w\ninst✝⁶ : CommRing R\ninst✝⁵ : LieRing L\ninst✝⁴ : LieAlgebra R L\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\ninst✝¹ : LieRingModule L M\ninst✝ : LieModule R L M\nN N' : LieSubmodule R L M\ntoAddSubmonoid✝ : AddSubmonoid M\nsmul_mem'✝ : ∀ (c : R) ... | [
131,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/LinearAlgebra/TensorProduct.lean | TensorProduct.lift.equiv_symm_apply | [] | [
562,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
560,
1
] |
Mathlib/Algebra/Lie/Subalgebra.lean | LieEquiv.ofInjective_apply | [] | [
774,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/Analysis/InnerProductSpace/Orthogonal.lean | Submodule.IsOrtho.inner_eq | [] | [
271,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/LinearAlgebra/Prod.lean | LinearMap.graph_eq_ker_coprod | [
{
"state_after": "case h\nR : 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\nM₅ : Type ?u.599912\nM₆ : Type ?u.599915\ninst✝⁸ : Semiring R\ninst✝⁷ : AddCommMonoid M\ninst✝⁶ : AddCommMonoid M₂\ninst✝⁵ : AddCommGroup M₃\ninst✝⁴ : AddCom... | [
1018,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1015,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | continuousInv_iInf | [
{
"state_after": "α : Type u\nβ : Type v\nG : Type w\nH : Type x\nι' : Sort u_1\ninst✝ : Inv G\nts' : ι' → TopologicalSpace G\nh' : ∀ (i : ι'), ContinuousInv G\n⊢ ContinuousInv G",
"state_before": "α : Type u\nβ : Type v\nG : Type w\nH : Type x\nι' : Sort u_1\ninst✝ : Inv G\nts' : ι' → TopologicalSpace G\nh... | [
394,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.length_take | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nδ : Type w\nn : ℕ\ns : Stream' α\n⊢ List.length (take n s) = n",
"tactic": "induction n generalizing s <;> simp [*, take_succ]"
}
] | [
589,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
588,
1
] |
Mathlib/AlgebraicTopology/DoldKan/Compatibility.lean | AlgebraicTopology.DoldKan.Compatibility.equivalence₁CounitIso_eq | [
{
"state_after": "case w.w.h\nA : Type u_4\nA' : Type u_5\nB : Type ?u.10546\nB' : Type u_1\ninst✝³ : Category A\ninst✝² : Category A'\ninst✝¹ : Category B\ninst✝ : Category B'\neA : A ≌ A'\neB : B ≌ B'\ne' : A' ≌ B'\nF : A ⥤ B'\nhF : eA.functor ⋙ e'.functor ≅ F\nG : B ⥤ A\nhG : eB.functor ⋙ e'.inverse ≅ G ⋙ eA... | [
95,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Geometry/Manifold/ChartedSpace.lean | ChartedSpace.secondCountable_of_countable_cover | [
{
"state_after": "H : Type u\nH' : Type ?u.43633\nM : Type u_1\nM' : Type ?u.43639\nM'' : Type ?u.43642\ninst✝³ : TopologicalSpace H\ninst✝² : TopologicalSpace M\ninst✝¹ : ChartedSpace H M\ninst✝ : SecondCountableTopology H\ns : Set M\nhs : (⋃ (x : M) (_ : x ∈ s), (chartAt H x).toLocalEquiv.source) = univ\nhsc ... | [
589,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
582,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.antitone_seq_of_seq | [
{
"state_after": "α : Type u_1\nβ : Type ?u.93399\nγ : Type ?u.93402\nι : Type ?u.93405\nι' : Sort ?u.93408\ns : ℕ → Set α\n⊢ (Antitone fun n => ⋂ (m : ℕ) (_ : m ≤ n), s m) ∧\n (⨅ (i : ℕ), 𝓟 (s i)) = ⨅ (i : ℕ), 𝓟 ((fun n => ⋂ (m : ℕ) (_ : m ≤ n), s m) i)",
"state_before": "α : Type u_1\nβ : Type ?u.933... | [
1025,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1016,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.smul_top_eq_map | [
{
"state_after": "case refine'_1\nR✝ : Type u\nS✝ : Type v\nF : Type ?u.798095\ninst✝⁴ : Semiring R✝\ninst✝³ : Semiring S✝\nrc : RingHomClass F R✝ S✝\nf : F\nI✝ J : Ideal R✝\nK L : Ideal S✝\nG : Type ?u.798179\nrcg : RingHomClass G S✝ R✝\nι : Sort ?u.798213\nR : Type u_1\nS : Type u_2\ninst✝² : CommSemiring R\n... | [
1531,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1511,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.support_sdiff_support_subset_support_add | [
{
"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\ninst✝ : DecidableEq σ\np q : MvPolynomial σ R\nm : σ →₀ ℕ\nhm : m ∈ support p \\ support q\n⊢ m ∈ support (... | [
751,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
747,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.neg_im | [] | [
165,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/MeasureTheory/Measure/Haar/Basic.lean | MeasureTheory.Measure.haar.chaar_sup_le | [
{
"state_after": "G : Type u_1\ninst✝² : Group G\ninst✝¹ : TopologicalSpace G\ninst✝ : TopologicalGroup G\nK₀ : PositiveCompacts G\nK₁ K₂ : Compacts G\neval : (Compacts G → ℝ) → ℝ := fun f => f K₁ + f K₂ - f (K₁ ⊔ K₂)\n⊢ chaar K₀ (K₁ ⊔ K₂) ≤ chaar K₀ K₁ + chaar K₀ K₂",
"state_before": "G : Type u_1\ninst✝² ... | [
483,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/Data/Finsupp/NeLocus.lean | Finsupp.neLocus_self_sub_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nM : Type ?u.38497\nN : Type u_2\nP : Type ?u.38503\ninst✝² : DecidableEq α\ninst✝¹ : DecidableEq N\ninst✝ : AddGroup N\nf f₁ f₂ g g₁ g₂ : α →₀ N\n⊢ neLocus f (f - g) = g.support",
"tactic": "rw [sub_eq_add_neg, neLocus_self_add_right, support_n... | [
173,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Combinatorics/SimpleGraph/Coloring.lean | SimpleGraph.colorable_of_isEmpty | [] | [
148,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Algebra/Star/StarAlgHom.lean | NonUnitalStarAlgHom.prod_fst_snd | [] | [
544,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
543,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.exists_iff_exists_finsupp | [] | [
97,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | continuousAt_of_locally_uniform_approx_of_continuousAt | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Type x\ninst✝¹ : UniformSpace β\nF : ι → α → β\nf : α → β\ns s' : Set α\nx : α\np : Filter ι\np' : Filter α\ng : ι → α\ninst✝ : TopologicalSpace α\nL : ∀ (u : Set (β × β)), u ∈ 𝓤 β → ∃ t, t ∈ 𝓝 x ∧ ∃ F, ContinuousAt F x ∧ ∀ (y : α), y ∈ t → (f y, F y) ... | [
837,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
832,
1
] |
Mathlib/Computability/Primrec.lean | Nat.Primrec.mul | [
{
"state_after": "p : ℕ\n⊢ Nat.rec 0 (fun y IH => (unpair p).fst + IH) (unpair p).snd = (unpair p).fst * (unpair p).snd",
"state_before": "p : ℕ\n⊢ unpaired\n (fun z n =>\n Nat.rec 0\n (fun y IH =>\n unpaired (fun x x_1 => x + x_1)\n (Nat.pair (unpair (Nat.pair z... | [
145,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Order/SuccPred/LinearLocallyFinite.lean | le_of_toZ_le | [
{
"state_after": "case inl.inl\nι : Type u_1\ninst✝³ : LinearOrder ι\ninst✝² : SuccOrder ι\ninst✝¹ : IsSuccArchimedean ι\ninst✝ : PredOrder ι\ni0 i j : ι\nh_le : toZ i0 i ≤ toZ i0 j\nhi : i0 ≤ i\nhj : i0 ≤ j\n⊢ i ≤ j\n\ncase inl.inr\nι : Type u_1\ninst✝³ : LinearOrder ι\ninst✝² : SuccOrder ι\ninst✝¹ : IsSuccArc... | [
298,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/CategoryTheory/Closed/Monoidal.lean | CategoryTheory.MonoidalClosed.curry_eq | [] | [
225,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Control/Fold.lean | Traversable.foldlm.ofFreeMonoid_comp_of | [
{
"state_after": "case h\nα β γ : Type u\nt : Type u → Type u\ninst✝³ : Traversable t\ninst✝² : IsLawfulTraversable t\nm : Type u → Type u\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nf : α → β → m α\nx : β\n⊢ (↑(foldlM.ofFreeMonoid f) ∘ FreeMonoid.of) x = (foldlM.mk ∘ flip f) x",
"state_before": "α β γ : Type... | [
326,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/RingTheory/Localization/AtPrime.lean | IsLocalization.AtPrime.to_map_mem_maximal_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\ninst✝⁶ : CommSemiring R\nM : Submonoid R\nS : Type u_1\ninst✝⁵ : CommSemiring S\ninst✝⁴ : Algebra R S\nP : Type ?u.46855\ninst✝³ : CommSemiring P\nA : Type ?u.46861\ninst✝² : CommRing A\ninst✝¹ : IsDomain A\nI : Ideal R\nhI : Ideal.IsPrime I\ninst✝... | [
152,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.comapRight_apply' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nι : Type ?u.1452280\nmα : MeasurableSpace α\nmβ : MeasurableSpace β\nκ✝ : { x // x ∈ kernel α β }\nγ : Type u_3\nmγ : MeasurableSpace γ\nf : γ → β\nκ : { x // x ∈ kernel α β }\nhf : MeasurableEmbedding f\na : α\nt : Set γ\nht : Measur... | [
569,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
566,
1
] |
Mathlib/Data/Finset/NatAntidiagonal.lean | Finset.Nat.antidiagonal_zero | [] | [
50,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
50,
1
] |
Mathlib/Order/Filter/Prod.lean | Filter.prod_bot | [] | [
429,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
429,
9
] |
Mathlib/Data/Polynomial/Degree/Lemmas.lean | Polynomial.natDegree_pos_of_eval₂_root | [
{
"state_after": "R : Type u\nS : Type v\nι : Type w\na b : R\nm n : ℕ\ninst✝¹ : Semiring R\np✝ q r : R[X]\ninst✝ : Semiring S\np : R[X]\nhp : p ≠ 0\nf : R →+* S\nz : S\nhz : eval₂ f z p = 0\ninj : ∀ (x : R), ↑f x = 0 → x = 0\nhlt : 0 ≥ natDegree p\nA : p = ↑C (coeff p 0)\n⊢ False",
"state_before": "R : Typ... | [
274,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Order/UpperLower/Basic.lean | isUpperSet_compl | [
{
"state_after": "case h.e'_3\nα : Type u_1\nβ : Type ?u.1021\nγ : Type ?u.1024\nι : Sort ?u.1027\nκ : ι → Sort ?u.1032\ninst✝¹ : LE α\ninst✝ : LE β\ns t : Set α\nh : IsUpperSet (sᶜ)\n⊢ s = sᶜᶜ",
"state_before": "α : Type u_1\nβ : Type ?u.1021\nγ : Type ?u.1024\nι : Sort ?u.1027\nκ : ι → Sort ?u.1032\ninst✝... | [
95,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.sup_cons | [] | [
56,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Analysis/BoxIntegral/Box/Basic.lean | BoxIntegral.Box.Icc_eq_pi | [] | [
224,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Analysis/SpecialFunctions/Exp.lean | Real.comap_exp_nhds_zero | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.151690\nx y z : ℝ\nl : Filter α\n⊢ comap exp (𝓝[Set.range exp] 0) = atBot",
"tactic": "simp"
}
] | [
339,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Order/Basic.lean | eq_of_le_of_not_lt | [] | [
421,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Std/Data/List/Lemmas.lean | List.prefix_nil | [] | [
1642,
99
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1642,
9
] |
Mathlib/Data/Nat/Basic.lean | Nat.div_lt_iff_lt_mul' | [] | [
612,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
611,
1
] |
Mathlib/Data/TypeVec.lean | TypeVec.toSubtype_of_subtype_assoc | [
{
"state_after": "n : ℕ\nα : TypeVec n\nβ : TypeVec n\np : α ⟹ repeat n Prop\nf : β ⟹ Subtype_ p\n⊢ id ⊚ f = f",
"state_before": "n : ℕ\nα : TypeVec n\nβ : TypeVec n\np : α ⟹ repeat n Prop\nf : β ⟹ Subtype_ p\n⊢ toSubtype p ⊚ (ofSubtype fun i x => p i x) ⊚ f = f",
"tactic": "rw [← comp_assoc, toSubtype_... | [
814,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
810,
1
] |
Mathlib/Data/Polynomial/Lifts.lean | Polynomial.mapAlg_eq_map | [
{
"state_after": "R : Type u\ninst✝² : CommSemiring R\nS : Type v\ninst✝¹ : Semiring S\ninst✝ : Algebra R S\np : R[X]\n⊢ (sum p fun e a => ↑C (↑(algebraMap R S) a) * X ^ e) = sum p fun e a => (↑C ∘ ↑(algebraMap R S)) a * X ^ e",
"state_before": "R : Type u\ninst✝² : CommSemiring R\nS : Type v\ninst✝¹ : Semi... | [
279,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/Order/Circular.lean | Set.mem_cIcc | [] | [
350,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
349,
1
] |
Mathlib/CategoryTheory/Adjunction/Opposites.lean | CategoryTheory.Adjunction.leftAdjointUniq_inv_app | [] | [
180,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/Data/Int/Parity.lean | Int.even_coe_nat | [
{
"state_after": "no goals",
"state_before": "m n✝ : ℤ\nn : ℕ\n⊢ Even ↑n ↔ Even n",
"tactic": "rw_mod_cast [even_iff, Nat.even_iff]"
}
] | [
202,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Order/Heyting/Boundary.lean | Coheyting.boundary_bot | [] | [
62,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
61,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.ceil_sub_nat | [
{
"state_after": "case h.e'_2\nF : Type ?u.214801\nα : Type u_1\nβ : Type ?u.214807\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na✝ a : α\nn : ℕ\n⊢ ⌈a - ↑n⌉ = ⌈a - ↑↑n⌉",
"state_before": "F : Type ?u.214801\nα : Type u_1\nβ : Type ?u.214807\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz... | [
1166,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1164,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.