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/Join.lean | convexJoin_left_comm | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.68928\n𝕜 : Type u_2\nE : Type u_1\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : Module 𝕜 E\ns✝ t✝ u✝ : Set E\nx y : E\ns t u : Set E\n⊢ convexJoin 𝕜 s (convexJoin 𝕜 t u) = convexJoin 𝕜 t (convexJoin 𝕜 s u)",
"tactic": "s... | [
166,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Order/OrdContinuous.lean | LeftOrdContinuous.comp | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ninst✝ : Preorder γ\ng : β → γ\nf : α → β\nhg : LeftOrdContinuous g\nhf : LeftOrdContinuous f\ns : Set α\nx : α\nh : IsLUB s x\n⊢ IsLUB (g ∘ f '' s) ((g ∘ f) x)",
"tacti... | [
80,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/LinearAlgebra/Lagrange.lean | Lagrange.eval_interpolate_at_node | [
{
"state_after": "F : Type u_2\ninst✝¹ : Field F\nι : Type u_1\ninst✝ : DecidableEq ι\ns t : Finset ι\ni j : ι\nv r r' : ι → F\nhvs : Set.InjOn v ↑s\nhi : i ∈ s\n⊢ eval (v i) (↑C (r i) * Lagrange.basis s v i) + ∑ x in Finset.erase s i, eval (v i) (↑C (r x) * Lagrange.basis s v x) =\n r i",
"state_before"... | [
328,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.setToFun_smul_left | [
{
"state_after": "case pos\nα : Type u_1\nE : Type u_2\nF : Type u_3\nF' : Type ?u.1360856\nG : Type ?u.1360859\n𝕜 : Type ?u.1360862\np : ℝ≥0∞\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace ℝ E\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace ℝ F\ninst✝³ : NormedAddCommGroup F'\ninst✝² : NormedSpace ... | [
1339,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1335,
1
] |
Mathlib/Topology/LocallyFinite.lean | LocallyFinite.continuous | [] | [
121,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
11
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.sup_typein_limit | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.343526\nβ : Type ?u.343529\nγ : Type ?u.343532\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\no : Ordinal\nho : ∀ (a : Ordinal), a < o → succ a < o\n⊢ ∀ (a : Ordinal), a < o → succ a < o",
"tactic": "assumption"
}
] | [
1730,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1727,
1
] |
Mathlib/Topology/ContinuousOn.lean | continuousOn_const | [] | [
978,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
977,
1
] |
Mathlib/Topology/ContinuousOn.lean | mem_nhdsWithin_iff_exists_mem_nhds_inter | [] | [
101,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/Data/Polynomial/FieldDivision.lean | Polynomial.root_gcd_iff_root_left_right | [] | [
351,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
349,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | hasSum_iff_tendsto_nat_of_nonneg | [
{
"state_after": "case intro\nα : Type ?u.341642\nβ : Type ?u.341645\nγ : Type ?u.341648\nr : ℝ\nf : ℕ → ℝ≥0\n⊢ HasSum (fun i => ↑(f i)) r ↔ Tendsto (fun n => ∑ i in Finset.range n, (fun i => ↑(f i)) i) atTop (𝓝 r)",
"state_before": "α : Type ?u.341642\nβ : Type ?u.341645\nγ : Type ?u.341648\nf : ℕ → ℝ\nhf... | [
1314,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1310,
1
] |
Mathlib/Analysis/Complex/CauchyIntegral.lean | DifferentiableOn.circleIntegral_sub_inv_smul | [] | [
540,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
537,
1
] |
Mathlib/Algebra/Quaternion.lean | QuaternionAlgebra.zero_imJ | [] | [
176,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
9
] |
Mathlib/Data/Complex/Module.lean | Complex.coe_smul | [] | [
221,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Data/Finset/Image.lean | Function.Commute.finset_image | [] | [
437,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
1
] |
Mathlib/Algebra/FreeMonoid/Basic.lean | FreeMonoid.ofList_singleton | [] | [
140,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.get_mem | [] | [
465,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
464,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.support_C_mul_X_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u\na b : R\nm n✝ : ℕ\ninst✝ : Semiring R\np q : R[X]\nn : ℕ\nc : R\nh : c ≠ 0\n⊢ support (↑C c * X ^ n) = {n}",
"tactic": "rw [C_mul_X_pow_eq_monomial, support_monomial n h]"
}
] | [
854,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
852,
1
] |
Mathlib/Tactic/NormNum/Basic.lean | Mathlib.Meta.NormNum.eq_of_false | [] | [
762,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
762,
1
] |
Mathlib/Algebra/Module/Projective.lean | Module.projective_def' | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝⁶ : Semiring R\nP : Type u_2\ninst✝⁵ : AddCommMonoid P\ninst✝⁴ : Module R P\nM : Type ?u.2418\ninst✝³ : AddCommMonoid M\ninst✝² : Module R M\nN : Type ?u.2448\ninst✝¹ : AddCommMonoid N\ninst✝ : Module R N\n⊢ Projective R P ↔ ∃ s, comp (Finsupp... | [
96,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/GroupTheory/Complement.lean | Subgroup.isComplement_top_right | [
{
"state_after": "case refine'_1\nG : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\nh : IsComplement S ⊤\n⊢ Set.Nonempty S\n\ncase refine'_2\nG : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\nh : IsComplement S ⊤\na : G\nha : a ∈ S\nb : G\nhb : b ∈ S\n⊢ a = b\n\ncase refine'_3\nG : Type ... | [
170,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/RepresentationTheory/Basic.lean | Representation.tprod_apply | [] | [
372,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
371,
1
] |
Mathlib/Data/Nat/Fib.lean | Nat.fib_bit1_succ | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ fib (bit1 n + 1) = fib (n + 1) * (2 * fib n + fib (n + 1))",
"tactic": "rw [Nat.bit1_eq_succ_bit0, bit0_eq_two_mul, fib_two_mul_add_two]"
}
] | [
199,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Restrict.lean | AffineMap.restrict.injective | [
{
"state_after": "k : Type u_1\nV₁ : Type u_2\nP₁ : Type u_3\nV₂ : Type u_4\nP₂ : Type u_5\ninst✝⁸ : Ring k\ninst✝⁷ : AddCommGroup V₁\ninst✝⁶ : AddCommGroup V₂\ninst✝⁵ : Module k V₁\ninst✝⁴ : Module k V₂\ninst✝³ : AddTorsor V₁ P₁\ninst✝² : AddTorsor V₂ P₂\nφ : P₁ →ᵃ[k] P₂\nhφ : Function.Injective ↑φ\nE : Affine... | [
81,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Logic/Function/Conjugate.lean | Function.Semiconj₂.comp | [
{
"state_after": "no goals",
"state_before": "α : Type u_3\nβ : Type u_1\nγ : Type u_2\nf : α → β\nga : α → α → α\ngb : β → β → β\nf' : β → γ\ngc : γ → γ → γ\nhf' : Semiconj₂ f' gb gc\nhf : Semiconj₂ f ga gb\nx y : α\n⊢ (f' ∘ f) (ga x y) = gc ((f' ∘ f) x) ((f' ∘ f) y)",
"tactic": "simp only [hf'.eq, hf.... | [
161,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
160,
1
] |
Mathlib/Topology/Semicontinuous.lean | continuous_iff_lower_upperSemicontinuous | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝⁴ : TopologicalSpace α\nβ : Type ?u.229144\ninst✝³ : Preorder β\nf✝ g : α → β\nx : α\ns t : Set α\ny z : β\nγ : Type u_2\ninst✝² : LinearOrder γ\ninst✝¹ : TopologicalSpace γ\ninst✝ : OrderTopology γ\nf : α → γ\n⊢ Continuous f ↔ LowerSemicontin... | [
1120,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1117,
1
] |
Mathlib/Order/Bounds/OrderIso.lean | OrderIso.isLUB_preimage | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\ninst✝¹ : Preorder α\ninst✝ : Preorder β\nf : α ≃o β\ns : Set β\nx : α\n⊢ IsLUB (↑f ⁻¹' s) x ↔ IsLUB s (↑f x)",
"tactic": "rw [← f.symm_symm, ← image_eq_preimage, isLUB_image]"
}
] | [
56,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean | Real.Angle.sign_zero | [
{
"state_after": "no goals",
"state_before": "⊢ sign 0 = 0",
"tactic": "rw [sign, sin_zero, _root_.sign_zero]"
}
] | [
858,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
857,
1
] |
Mathlib/GroupTheory/Congruence.lean | Con.le_def | [] | [
425,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
424,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Iio_ssubset_Iic_self | [] | [
550,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
549,
1
] |
Mathlib/Algebra/Module/LocalizedModule.lean | IsLocalizedModule.mk'_sub | [
{
"state_after": "no goals",
"state_before": "R : Type u_3\ninst✝¹² : CommRing R\nS : Submonoid R\nM✝ : Type ?u.865453\nM'✝ : Type ?u.865456\nM'' : Type ?u.865459\ninst✝¹¹ : AddCommMonoid M✝\ninst✝¹⁰ : AddCommMonoid M'✝\ninst✝⁹ : AddCommMonoid M''\ninst✝⁸ : Module R M✝\ninst✝⁷ : Module R M'✝\ninst✝⁶ : Modul... | [
992,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
989,
1
] |
Mathlib/Data/List/Nodup.lean | List.Nodup.take_eq_filter_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nl l₁ l₂ : List α\nr : α → α → Prop\na b : α\ninst✝ : DecidableEq α\nn : ℕ\nx✝ : Nodup []\n⊢ take n [] = List.filter (fun x => decide (x ∈ take n [])) []",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before": "α... | [
463,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
453,
1
] |
Mathlib/Topology/ContinuousFunction/Basic.lean | map_continuousAt | [] | [
64,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Analysis/Convex/Between.lean | affineSegment_image | [
{
"state_after": "R : Type u_1\nV : Type u_2\nV' : Type u_4\nP : Type u_3\nP' : Type u_5\ninst✝⁶ : OrderedRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\nf : P →ᵃ[R] P'\nx y : P\n⊢ (fun x_1 => ↑f (↑(lineMap x ... | [
87,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/Algebra/Ring/Divisibility.lean | two_dvd_bit0 | [] | [
39,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
38,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | Ideal.Quotient.mk_algebraMap | [] | [
225,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.le_coe_toReal | [
{
"state_after": "case pos\nx : EReal\nh : x ≠ ⊤\nh' : x = ⊥\n⊢ x ≤ ↑(toReal x)\n\ncase neg\nx : EReal\nh : x ≠ ⊤\nh' : ¬x = ⊥\n⊢ x ≤ ↑(toReal x)",
"state_before": "x : EReal\nh : x ≠ ⊤\n⊢ x ≤ ↑(toReal x)",
"tactic": "by_cases h' : x = ⊥"
},
{
"state_after": "no goals",
"state_before": "case... | [
421,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.repeat_eq_repeatTR | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nf : α → α\nn✝ : Nat\ninit : α\nn : Nat\n⊢ repeatTR.loop f 0 (repeat f n init) = repeat f (0 + n) init",
"tactic": "simp [repeatTR.loop]"
},
{
"state_after": "α : Type u_1\nf : α → α\nn✝ : Nat\ninit : α\nm n : Nat\n⊢ repeatTR.loop f m (f... | [
765,
16
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
760,
10
] |
Mathlib/Topology/Connected.lean | connectedComponents_preimage_singleton | [
{
"state_after": "case h\nα : Type u\nβ : Type v\nι : Type ?u.142810\nπ : ι → Type ?u.142815\ninst✝² : TopologicalSpace α\ns t u v : Set α\ninst✝¹ : TopologicalSpace β\ninst✝ : TotallyDisconnectedSpace β\nf : α → β\nx y : α\n⊢ y ∈ ConnectedComponents.mk ⁻¹' {ConnectedComponents.mk x} ↔ y ∈ connectedComponent x"... | [
1533,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1530,
1
] |
Mathlib/Data/List/Basic.lean | List.getLast?_append | [
{
"state_after": "case nil\nι : Type ?u.41156\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁✝ l₂ l₁ : List α\nx : α\nh : x ∈ getLast? []\n⊢ x ∈ getLast? (l₁ ++ [])\n\ncase cons\nι : Type ?u.41156\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁✝ l₂ l₁ : List α\nx head✝ : α\ntail✝ : List α\nh : x ∈ getLa... | [
855,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
850,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | deriv_norm_pos | [] | [
121,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
9
] |
Mathlib/CategoryTheory/Sites/Subsheaf.lean | CategoryTheory.GrothendieckTopology.Subpresheaf.isSheaf_iff | [
{
"state_after": "C : Type u\ninst✝ : Category C\nJ : GrothendieckTopology C\nF F' F'' : Cᵒᵖ ⥤ Type w\nG G' : Subpresheaf F\nh : Presieve.IsSheaf J F\n⊢ G = sheafify J G ↔ ∀ (U : Cᵒᵖ) (s : F.obj U), sieveOfSection G s ∈ sieves J U.unop → s ∈ obj G U",
"state_before": "C : Type u\ninst✝ : Category C\nJ : Gro... | [
270,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Pretrivialization.symm_proj_apply | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.16241\nB : Type u_1\nF : Type u_2\nE : B → Type u_3\nZ : Type ?u.16255\ninst✝² : TopologicalSpace B\ninst✝¹ : TopologicalSpace F\nproj : Z → B\ne✝ : Pretrivialization F proj\nx : Z\ne' : Pretrivialization F TotalSpace.proj\nx' : TotalSpace E\nb : B\n... | [
281,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
src/lean/Init/Data/List/Basic.lean | List.reverse_cons | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\na : α\nas : List α\n⊢ reverseAux as (a :: nil) = reverseAux as nil ++ a :: nil",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na : α\nas : List α\n⊢ reverse (a :: as) = reverse as ++ a :: nil",
"tactic": "simp [reverse, reverseAux]"
},
{
... | [
176,
30
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
174,
9
] |
Mathlib/RingTheory/AlgebraTower.lean | linearIndependent_smul | [
{
"state_after": "R : Type u\nS : Type v\nA : Type w\nB : Type u₁\ninst✝⁶ : CommSemiring R\ninst✝⁵ : Semiring S\ninst✝⁴ : AddCommMonoid A\ninst✝³ : Algebra R S\ninst✝² : Module S A\ninst✝¹ : Module R A\ninst✝ : IsScalarTower R S A\nι : Type v₁\nb : ι → S\nι' : Type w₁\nc : ι' → A\nhb : ∀ (s : Finset ι) (g : ι →... | [
132,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.trim_sum_ge | [
{
"state_after": "α : Type u_2\ninst✝ : MeasurableSpace α\nm✝ : OuterMeasure α\nι : Type u_1\nm : ι → OuterMeasure α\ns : Set α\n⊢ ∀ (i : Set α),\n s ⊆ i →\n MeasurableSet i →\n (∑' (i : ι), ⨅ (t : Set α) (_ : s ⊆ t) (_ : MeasurableSet t), ↑(m i) t) ≤ ∑' (i_3 : ι), ↑(m i_3) i",
"state_before"... | [
1687,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1683,
1
] |
Mathlib/CategoryTheory/Monoidal/Linear.lean | CategoryTheory.monoidalLinearOfFaithful | [
{
"state_after": "R : Type u_3\ninst✝¹⁴ : Semiring R\nC : Type u_5\ninst✝¹³ : Category C\ninst✝¹² : Preadditive C\ninst✝¹¹ : Linear R C\ninst✝¹⁰ : MonoidalCategory C\ninst✝⁹ : MonoidalPreadditive C\ninst✝⁸ : MonoidalLinear R C\nD : Type u_1\ninst✝⁷ : Category D\ninst✝⁶ : Preadditive D\ninst✝⁵ : Linear R D\ninst... | [
75,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | EuclideanGeometry.angle_vsub_const | [] | [
94,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Topology/UniformSpace/Equicontinuity.lean | UniformInducing.equicontinuous_iff | [
{
"state_after": "ι : Type u_3\nκ : Type ?u.130426\nX : Type u_4\nY : Type ?u.130432\nZ : Type ?u.130435\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.130444\n𝓕 : Type ?u.130447\ninst✝⁵ : TopologicalSpace X\ninst✝⁴ : TopologicalSpace Y\ninst✝³ : TopologicalSpace Z\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\n... | [
355,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
350,
1
] |
Mathlib/Init/Logic.lean | and_assoc' | [] | [
131,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
25
] |
Mathlib/LinearAlgebra/AffineSpace/Midpoint.lean | AffineMap.map_midpoint | [] | [
56,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Lf.not_equiv | [] | [
788,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
788,
1
] |
Mathlib/Order/Antichain.lean | IsAntichain.preimage_iso_iff | [] | [
185,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/NumberTheory/Padics/PadicNumbers.lean | PadicSeq.eq_zero_iff_equiv_zero | [] | [
302,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Algebra/Category/ModuleCat/Kernels.lean | ModuleCat.cokernel_π_cokernelIsoRangeQuotient_hom | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝ : Ring R\nG H : ModuleCat R\nf : G ⟶ H\n⊢ cokernel.π f ≫ (cokernelIsoRangeQuotient f).hom = Submodule.mkQ (LinearMap.range f)",
"tactic": "convert colimit.isoColimitCocone_ι_hom (F := parallelPair f 0) _ _"
}
] | [
131,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Algebra/CovariantAndContravariant.lean | contravariant_lt_of_contravariant_le | [
{
"state_after": "M : Type u_2\nN : Type u_1\nμ : M → N → N\nr : N → N → Prop\ninst✝ : PartialOrder N\nh : Contravariant M N μ fun x x_1 => x ≤ x_1\na : M\nb c : N\nbc : (fun x x_1 => x < x_1) (μ a b) (μ a c)\n⊢ b ≠ c",
"state_before": "M : Type u_2\nN : Type u_1\nμ : M → N → N\nr : N → N → Prop\ninst✝ : Pa... | [
297,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/RingTheory/WittVector/Defs.lean | WittVector.wittZero_eq_zero | [
{
"state_after": "case a\np : ℕ\nR : Type ?u.41310\nhp : Fact (Nat.Prime p)\ninst✝ : CommRing R\nn : ℕ\n⊢ ↑(map (Int.castRingHom ℚ)) (wittZero p n) = ↑(map (Int.castRingHom ℚ)) 0",
"state_before": "p : ℕ\nR : Type ?u.41310\nhp : Fact (Nat.Prime p)\ninst✝ : CommRing R\nn : ℕ\n⊢ wittZero p n = 0",
"tactic... | [
236,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/Data/List/Card.lean | List.equiv_iff_subset_and_subset | [] | [
24,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
21,
1
] |
Mathlib/Data/FunLike/Basic.lean | FunLike.ext | [] | [
180,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/LinearAlgebra/Matrix/IsDiag.lean | Matrix.IsDiag.fromBlocks | [
{
"state_after": "case inl.inl\nα : Type u_1\nβ : Type ?u.22045\nR : Type ?u.22048\nn : Type u_3\nm : Type u_2\ninst✝ : Zero α\nA : Matrix m m α\nD : Matrix n n α\nha : IsDiag A\nhd : IsDiag D\ni j : m\nhij : Sum.inl i ≠ Sum.inl j\n⊢ Matrix.fromBlocks A 0 0 D (Sum.inl i) (Sum.inl j) = 0\n\ncase inl.inr\nα : Typ... | [
168,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.toLin'_apply | [] | [
416,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/Analysis/Convex/Strict.lean | strictConvex_iff_ordConnected | [] | [
446,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.coe_rat_cast | [] | [
1376,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1375,
1
] |
Mathlib/Order/Basic.lean | Ne.lt_of_le' | [] | [
108,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Topology/Instances/NNReal.lean | NNReal.comap_coe_atTop | [] | [
117,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.corec_eq | [
{
"state_after": "α : Type u\nβ : Type v\nδ : Type w\nf : α → β\ng : α → α\na : α\n⊢ f a :: map f (iterate g (g a)) = f a :: corec f g (g a)",
"state_before": "α : Type u\nβ : Type v\nδ : Type w\nf : α → β\ng : α → α\na : α\n⊢ corec f g a = f a :: corec f g (g a)",
"tactic": "rw [corec_def, map_eq, head... | [
379,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/RingTheory/Ideal/Quotient.lean | Ideal.exists_sub_mem | [
{
"state_after": "case intro\nR : Type u\ninst✝¹ : CommRing R\nI : Ideal R\na b : R\nS ι : Type v\ninst✝ : Finite ι\nf : ι → Ideal R\nhf : ∀ (i j : ι), i ≠ j → f i ⊔ f j = ⊤\ng : ι → R\nval✝ : Fintype ι\n⊢ ∃ r, ∀ (i : ι), r - g i ∈ f i",
"state_before": "R : Type u\ninst✝¹ : CommRing R\nI : Ideal R\na b : R... | [
469,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
449,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.prime_def_lt'' | [
{
"state_after": "p : ℕ\nh : 2 ≤ p ∧ ∀ (m : ℕ), m ∣ p → m = 1 ∨ m = p\n⊢ Prime p",
"state_before": "p : ℕ\n⊢ Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), m ∣ p → m = 1 ∨ m = p",
"tactic": "refine' ⟨fun h => ⟨h.two_le, h.eq_one_or_self_of_dvd⟩, fun h => _⟩"
},
{
"state_after": "p : ℕ\nh : 2 ≤ p ∧ ∀ (m : ℕ), m ∣ ... | [
111,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Data/List/Infix.lean | List.prefix_take_le_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.24410\nl l₁ l₂ l₃ : List α\na b : α\nm n : ℕ\nL : List (List (Option α))\nhm : m < length L\n⊢ take m L = take (min m (length L)) (take n L) ↔ m ≤ n",
"state_before": "α : Type u_1\nβ : Type ?u.24410\nl l₁ l₂ l₃ : List α\na b : α\nm n : ℕ\nL : List (List (Option α... | [
271,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
Mathlib/Order/Monotone/Basic.lean | Monotone.comp_antitone | [] | [
641,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
640,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.right_distrib | [
{
"state_after": "n m k : Nat\n⊢ k * n + k * m = n * k + m * k",
"state_before": "n m k : Nat\n⊢ (n + m) * k = n * k + m * k",
"tactic": "rw [Nat.mul_comm, Nat.left_distrib]"
},
{
"state_after": "no goals",
"state_before": "n m k : Nat\n⊢ k * n + k * m = n * k + m * k",
"tactic": "simp [... | [
190,
59
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
189,
11
] |
Mathlib/Data/List/Basic.lean | List.getD_append_right | [
{
"state_after": "case inl\nι : Type ?u.503527\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ l✝ : List α\nx : α\nxs : List α\nd✝ : α\nn✝ : ℕ\nl l' : List α\nd : α\nn : ℕ\nh : length l ≤ n\nh' : n < length (l ++ l')\n⊢ getD (l ++ l') n d = getD l' (n - length l) d\n\ncase inr\nι : Type ?u.503527\nα : Ty... | [
4441,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4433,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.eq_of_length_eq_zero | [] | [
426,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
1
] |
Mathlib/CategoryTheory/Abelian/Basic.lean | CategoryTheory.Abelian.OfCoimageImageComparisonIsIso.imageMonoFactorisation_e' | [
{
"state_after": "case h\nC : Type u\ninst✝³ : Category C\ninst✝² : Preadditive C\ninst✝¹ : HasKernels C\ninst✝ : HasCokernels C\nX Y : C\nf : X ⟶ Y\n⊢ (imageMonoFactorisation f).e ≫ equalizer.ι (cokernel.π f) 0 =\n (cokernel.π (kernel.ι f) ≫ coimageImageComparison f) ≫ equalizer.ι (cokernel.π f) 0",
"st... | [
155,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | div_eq_div_iff | [] | [
190,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/CategoryTheory/Iso.lean | CategoryTheory.Functor.mapIso_trans | [
{
"state_after": "case w\nC : Type u\ninst✝¹ : Category C\nX✝ Y✝ Z✝ : C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nX Y Z : C\ni : X ≅ Y\nj : Y ≅ Z\n⊢ (F.mapIso (i ≪≫ j)).hom = (F.mapIso i ≪≫ F.mapIso j).hom",
"state_before": "C : Type u\ninst✝¹ : Category C\nX✝ Y✝ Z✝ : C\nD : Type u₂\ninst✝ : Category D\n... | [
609,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
607,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | lcm_comm | [] | [
746,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
743,
1
] |
Mathlib/LinearAlgebra/Matrix/Transvection.lean | Matrix.TransvectionStruct.sumInl_toMatrix_prod_mul | [
{
"state_after": "case nil\nn : Type u_1\np : Type u_2\nR : Type u₂\n𝕜 : Type ?u.60874\ninst✝⁵ : Field 𝕜\ninst✝⁴ : DecidableEq n\ninst✝³ : DecidableEq p\ninst✝² : CommRing R\ni j : n\ninst✝¹ : Fintype n\ninst✝ : Fintype p\nM : Matrix n n R\nN : Matrix p p R\n⊢ List.prod (List.map (toMatrix ∘ sumInl p) []) ⬝ f... | [
273,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/Data/Nat/Choose/Basic.lean | Nat.multichoose_succ_succ | [
{
"state_after": "no goals",
"state_before": "n k : ℕ\n⊢ multichoose (n + 1) (k + 1) = multichoose n (k + 1) + multichoose (n + 1) k",
"tactic": "simp [multichoose]"
}
] | [
373,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
371,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.isBigO_principal | [
{
"state_after": "α : Type u_1\nβ : Type ?u.290106\nE : Type u_2\nF : Type u_3\nG : Type ?u.290115\nE' : Type ?u.290118\nF' : Type ?u.290121\nG' : Type ?u.290124\nE'' : Type ?u.290127\nF'' : Type ?u.290130\nG'' : Type ?u.290133\nR : Type ?u.290136\nR' : Type ?u.290139\n𝕜 : Type ?u.290142\n𝕜' : Type ?u.290145\... | [
1300,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1299,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | mulPosMono_iff_mulPosReflectLT | [] | [
324,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/Algebra/Category/GroupCat/Injective.lean | AddCommGroupCat.injective_as_module_of_injective_as_Ab | [
{
"state_after": "A : Type u\ninst✝¹ : AddCommGroup A\ninst✝ : Injective (Bundled.mk A)\nX Y : ModuleCat ℤ\ng : X ⟶ ModuleCat.mk A\nf : X ⟶ Y\nm : Mono f\nG : Bundled.mk ↑X ⟶ Bundled.mk A := LinearMap.toAddMonoidHom g\n⊢ ∃ h, f ≫ h = g",
"state_before": "A : Type u\ninst✝¹ : AddCommGroup A\ninst✝ : Injectiv... | [
109,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Topology/Instances/AddCircle.lean | AddCircle.continuous_mk' | [] | [
204,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
11
] |
Mathlib/Data/Finset/Image.lean | Finset.map_union | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.37468\nf✝ : α ↪ β\ns : Finset α\ninst✝¹ : DecidableEq α\ninst✝ : DecidableEq β\nf : α ↪ β\ns₁ s₂ : Finset α\n⊢ ↑(map f (s₁ ∪ s₂)) = ↑(map f s₁ ∪ map f s₂)",
"tactic": "simp only [coe_map, coe_union, Set.image_union]"
... | [
214,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Topology/ContinuousOn.lean | Embedding.map_nhdsWithin_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.360626\nδ : Type ?u.360629\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\nf : α → β\nhf : _root_.Embedding f\ns : Set α\nx : α\n⊢ map f (𝓝[s] x) = 𝓝[f ... | [
1088,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1085,
1
] |
Mathlib/Analysis/Calculus/Deriv/Polynomial.lean | Polynomial.hasDerivAt_aeval | [] | [
90,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
11
] |
Mathlib/CategoryTheory/Subobject/Basic.lean | CategoryTheory.Subobject.mk_le_mk_of_comm | [] | [
258,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
256,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.div_iUnion₂ | [] | [
780,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
778,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.submatrix_updateRow_equiv | [
{
"state_after": "no goals",
"state_before": "l : Type u_1\nm : Type u_2\nn : Type u_3\no : Type u_4\nm' : o → Type ?u.1237018\nn' : o → Type ?u.1237023\nR : Type ?u.1237026\nS : Type ?u.1237029\nα : Type v\nβ : Type w\nγ : Type ?u.1237036\nM : Matrix m n α\ni✝ : m\nj : n\nb : n → α\nc : m → α\ninst✝¹ : Dec... | [
2884,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2881,
1
] |
Mathlib/Algebra/Algebra/Operations.lean | Submodule.le_self_mul_one_div | [
{
"state_after": "ι : Sort uι\nR : Type u\ninst✝² : CommSemiring R\nA : Type v\ninst✝¹ : CommSemiring A\ninst✝ : Algebra R A\nM N : Submodule R A\nm n : A\nI : Submodule R A\nhI : I ≤ 1\n⊢ I * 1 ≤ I * (1 / I)",
"state_before": "ι : Sort uι\nR : Type u\ninst✝² : CommSemiring R\nA : Type v\ninst✝¹ : CommSemir... | [
717,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
715,
1
] |
Mathlib/Order/Bounds/Basic.lean | IsLUB.unique | [] | [
1089,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1088,
1
] |
Mathlib/Order/Heyting/Hom.lean | HeytingHom.coe_comp | [] | [
334,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
333,
1
] |
Mathlib/Data/List/Cycle.lean | Cycle.reverse_nil | [] | [
568,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | MeasurableSet.measurableSet_blimsup | [
{
"state_after": "α : Type u_1\nβ : Type ?u.909833\nγ : Type ?u.909836\nδ : Type ?u.909839\nδ' : Type ?u.909842\nι : Sort uι\ns✝ t u : Set α\ninst✝ : MeasurableSpace α\ns : ℕ → Set α\np : ℕ → Prop\nh : ∀ (n : ℕ), p n → MeasurableSet (s n)\n⊢ MeasurableSet (⋂ (i : ℕ), ⋃ (j : ℕ) (_ : p j ∧ i ≤ j), s j)",
"sta... | [
1894,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1891,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.le_of_mem | [] | [
95,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Order/PrimeIdeal.lean | Order.Ideal.PrimePair.F_union_I | [] | [
87,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Analysis/SpecificLimits/Basic.lean | NNReal.hasSum_geometric | [
{
"state_after": "α : Type ?u.248624\nβ : Type ?u.248627\nι : Type ?u.248630\nr : ℝ≥0\nhr : r < 1\n⊢ HasSum (fun a => ↑(r ^ a)) ↑(1 - r)⁻¹",
"state_before": "α : Type ?u.248624\nβ : Type ?u.248627\nι : Type ?u.248630\nr : ℝ≥0\nhr : r < 1\n⊢ HasSum (fun n => r ^ n) (1 - r)⁻¹",
"tactic": "apply NNReal.has... | [
266,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
262,
1
] |
Mathlib/Combinatorics/Quiver/SingleObj.lean | Quiver.SingleObj.pathEquivList_cons | [] | [
164,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/GroupTheory/Subsemigroup/Operations.lean | Subsemigroup.map_comap_eq_of_surjective | [] | [
459,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
458,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | comap_dist_right_atTop_le_cocompact | [
{
"state_after": "α : Type u\nβ : Type v\nX : Type ?u.546057\nι : Type ?u.546060\ninst✝ : PseudoMetricSpace α\nx : α\ns : Set α\nhs : IsCompact s\n⊢ ∃ t, t ∈ atTop ∧ (fun y => dist y x) ⁻¹' t ⊆ sᶜ",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.546057\nι : Type ?u.546060\ninst✝ : PseudoMetricSpace α\... | [
2796,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2792,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.pow_apply_eq_pow_mod_orderOf_cycleOf_apply | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.2444696\nα : Type u_1\nβ : Type ?u.2444702\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf✝ g : Perm α\nx✝ y : α\nf : Perm α\nn : ℕ\nx : α\n⊢ ↑(f ^ n) x = ↑(f ^ (n % orderOf (cycleOf f x))) x",
"tactic": "rw [← cycleOf_pow_apply_self f, ← cycleOf_p... | [
1111,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1109,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.