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/SpecialFunctions/Exponential.lean | hasDerivAt_exp_smul_const_of_mem_ball | [] | [
358,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
1
] |
Mathlib/Topology/ContinuousOn.lean | ContinuousWithinAt.tendsto_nhdsWithin_image | [] | [
559,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
557,
1
] |
Mathlib/Data/PNat/Interval.lean | PNat.card_fintype_Ioo | [
{
"state_after": "no goals",
"state_before": "a b : ℕ+\n⊢ Fintype.card ↑(Set.Ioo a b) = ↑b - ↑a - 1",
"tactic": "rw [← card_Ioo, Fintype.card_ofFinset]"
}
] | [
112,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | IsDedekindDomain.inf_prime_pow_eq_prod | [
{
"state_after": "R : Type u_2\nA : Type ?u.1194471\nK : Type ?u.1194474\ninst✝⁵ : CommRing R\ninst✝⁴ : CommRing A\ninst✝³ : Field K\ninst✝² : IsDomain A\ninst✝¹ : IsDomain R\ninst✝ : IsDedekindDomain R\nι : Type u_1\ns : Finset ι\nf : ι → Ideal R\ne : ι → ℕ\nprime : ∀ (i : ι), i ∈ s → Prime (f i)\ncoprime : ∀ ... | [
1301,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1275,
1
] |
Mathlib/Dynamics/Ergodic/MeasurePreserving.lean | MeasureTheory.MeasurePreserving.sigmaFinite | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.271138\nδ : Type ?u.271141\ninst✝⁴ : MeasurableSpace α\ninst✝³ : MeasurableSpace β\ninst✝² : MeasurableSpace γ\ninst✝¹ : MeasurableSpace δ\nμa : Measure α\nμb : Measure β\nμc : Measure γ\nμd : Measure δ\nf : α → β\nhf : Me... | [
121,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
11
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.vecMul_add | [
{
"state_after": "case h\nl : Type ?u.857315\nm : Type u_1\nn : Type u_2\no : Type ?u.857324\nm' : o → Type ?u.857329\nn' : o → Type ?u.857334\nR : Type ?u.857337\nS : Type ?u.857340\nα : Type v\nβ : Type w\nγ : Type ?u.857347\ninst✝¹ : NonUnitalNonAssocSemiring α\ninst✝ : Fintype m\nA B : Matrix m n α\nx : m →... | [
1763,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1760,
1
] |
src/lean/Init/Data/List/Basic.lean | List.cons_getElem_succ | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na : α\nas : List α\ni : Nat\nh : i + 1 < length (a :: as)\n⊢ getElem (a :: as) (i + 1) h = getElem as i (_ : i < length as)",
"tactic": "rfl"
}
] | [
25,
6
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
24,
9
] |
Mathlib/Topology/UniformSpace/Basic.lean | interior_mem_uniformity | [
{
"state_after": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort ?u.91137\ninst✝ : UniformSpace α\ns : Set (α × α)\nhs : s ∈ 𝓤 α\n⊢ interior s ∈ Filter.lift' (𝓤 α) interior",
"state_before": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort ?u.91137\ninst✝ : UniformSpace α\ns : S... | [
1000,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
999,
1
] |
Mathlib/Order/BoundedOrder.lean | isMin_bot | [] | [
321,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
320,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.ne_one | [] | [
377,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
376,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Trivialization.coe_coe | [] | [
349,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/CategoryTheory/Category/Cat.lean | CategoryTheory.Cat.comp_obj | [] | [
101,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | measurable_findGreatest | [
{
"state_after": "α : Type u_1\nβ : Type ?u.52344\nγ : Type ?u.52347\nδ : Type ?u.52350\nδ' : Type ?u.52353\nι : Sort uι\ns t u : Set α\ninst✝¹ : MeasurableSpace α\np : α → ℕ → Prop\ninst✝ : (x : α) → DecidablePred (p x)\nN : ℕ\nhN : ∀ (k : ℕ), k ≤ N → MeasurableSet {x | p x k}\nk : ℕ\nhk : k ≤ N\n⊢ MeasurableS... | [
450,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | coe_int_mem | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\ninst✝¹ : Ring R\ninst✝ : SetLike S R\nhSR : SubringClass S R\ns : S\nn : ℤ\n⊢ ↑n ∈ s",
"tactic": "simp only [← zsmul_one, zsmul_mem, one_mem]"
}
] | [
92,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/LinearAlgebra/Determinant.lean | LinearMap.det_zero | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.899641\ninst✝¹² : CommRing R\nM✝ : Type ?u.899647\ninst✝¹¹ : AddCommGroup M✝\ninst✝¹⁰ : Module R M✝\nM' : Type ?u.900232\ninst✝⁹ : AddCommGroup M'\ninst✝⁸ : Module R M'\nι : Type ?u.900774\ninst✝⁷ : DecidableEq ι\ninst✝⁶ : Fintype ι\ne : Basis ι R M✝... | [
289,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
1
] |
Mathlib/NumberTheory/Liouville/LiouvilleWith.lean | LiouvilleWith.int_sub | [] | [
303,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Mathlib/Topology/Maps.lean | ClosedEmbedding.isClosedMap | [] | [
660,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
659,
1
] |
Mathlib/GroupTheory/Submonoid/Inverses.lean | Submonoid.mul_leftInvEquiv | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\ninst✝ : CommMonoid M\nS : Submonoid M\nhS : S ≤ IsUnit.submonoid M\nx : { x // x ∈ leftInv S }\n⊢ ↑x * ↑(↑(leftInvEquiv S hS) x) = 1",
"tactic": "simp only [leftInvEquiv_apply, fromCommLeftInv, mul_fromLeftInv]"
}
] | [
204,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.div_zero | [
{
"state_after": "case zero\n\n⊢ div zero 0 = 0\n\ncase pos\na✝ : PosNum\n⊢ div (pos a✝) 0 = 0",
"state_before": "n : Num\n⊢ div n 0 = 0",
"tactic": "cases n"
},
{
"state_after": "no goals",
"state_before": "case zero\n\n⊢ div zero 0 = 0",
"tactic": "rfl"
},
{
"state_after": "no ... | [
1647,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1643,
11
] |
Mathlib/Topology/Constructions.lean | isOpen_range_sigmaMk | [] | [
1470,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1469,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.nat_coe_zmod_eq_iff | [
{
"state_after": "case mp\np n : ℕ\nz : ZMod p\ninst✝ : NeZero p\n⊢ ↑n = z → ∃ k, n = val z + p * k\n\ncase mpr\np n : ℕ\nz : ZMod p\ninst✝ : NeZero p\n⊢ (∃ k, n = val z + p * k) → ↑n = z",
"state_before": "p n : ℕ\nz : ZMod p\ninst✝ : NeZero p\n⊢ ↑n = z ↔ ∃ k, n = val z + p * k",
"tactic": "constructor... | [
537,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
529,
1
] |
Mathlib/RingTheory/PowerBasis.lean | PowerBasis.minpolyGen_map | [
{
"state_after": "R : Type ?u.698148\nS : Type u_2\nT : Type ?u.698154\ninst✝¹¹ : CommRing R\ninst✝¹⁰ : Ring S\ninst✝⁹ : Algebra R S\nA : Type u_1\nB : Type ?u.698460\ninst✝⁸ : CommRing A\ninst✝⁷ : CommRing B\ninst✝⁶ : IsDomain B\ninst✝⁵ : Algebra A B\nK : Type ?u.698882\ninst✝⁴ : Field K\nS' : Type u_3\ninst✝³... | [
482,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Mathlib/Topology/LocallyConstant/Basic.lean | LocallyConstant.mulIndicator_apply_eq_if | [] | [
550,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
548,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/NormalMono/Equalizers.lean | CategoryTheory.NormalMonoCategory.epi_of_zero_cancel | [] | [
180,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | mul_lt_of_lt_one_of_lt | [] | [
804,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
798,
1
] |
Mathlib/LinearAlgebra/LinearPMap.lean | LinearPMap.smul_apply | [] | [
418,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
417,
1
] |
Std/Data/String/Lemmas.lean | String.Iterator.ValidFor.setCurr' | [
{
"state_after": "case refl\nl r : List Char\nc : Char\nh : ValidFor l r { s := { data := List.reverse l ++ r }, i := { byteIdx := utf8Len (List.reverse l) } }\n⊢ ValidFor l (List.modifyHead (fun x => c) r)\n (setCurr { s := { data := List.reverse l ++ r }, i := { byteIdx := utf8Len (List.reverse l) } } c)",... | [
582,
50
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
575,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.Red.cons_cons | [] | [
250,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/Topology/MetricSpace/Lipschitz.lean | LipschitzWith.id | [] | [
204,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
11
] |
Mathlib/Order/UpperLower/Basic.lean | Set.antitone_mem | [] | [
272,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean | int_prod_range_nonneg | [
{
"state_after": "case intro\nm : ℤ\nn : ℕ\n⊢ 0 ≤ ∏ k in Finset.range (n + n), (m - ↑k)",
"state_before": "m : ℤ\nn : ℕ\nhn : Even n\n⊢ 0 ≤ ∏ k in Finset.range n, (m - ↑k)",
"tactic": "rcases hn with ⟨n, rfl⟩"
},
{
"state_after": "case intro.zero\nm : ℤ\n⊢ 0 ≤ ∏ k in Finset.range (Nat.zero + Nat... | [
89,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/AlgebraicGeometry/StructureSheaf.lean | AlgebraicGeometry.StructureSheaf.openAlgebra_map | [] | [
963,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
961,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | MulLECancellable.mul_le_iff_le_one_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.88936\ninst✝² : LE α\ninst✝¹ : CommMonoid α\ninst✝ : CovariantClass α α (fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\na b : α\nha : MulLECancellable a\n⊢ b * a ≤ a ↔ b ≤ 1",
"tactic": "rw [mul_comm, ha.mul_le_iff_le_one_right]"
}
] | [
1672,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1670,
11
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.bit1_re | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\nE : Type ?u.1751927\ninst✝ : IsROrC K\nz : K\n⊢ ↑re (bit1 z) = bit1 (↑re z)",
"tactic": "simp only [bit1, map_add, bit0_re, one_re]"
}
] | [
184,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Data/List/Pairwise.lean | List.pwFilter_sublist | [
{
"state_after": "case pos\nα : Type u_1\nβ : Type ?u.50704\nR S T : α → α → Prop\na : α\nl✝ : List α\ninst✝ : DecidableRel R\nx : α\nl : List α\nh : ∀ (y : α), y ∈ pwFilter R l → R x y\n⊢ pwFilter R (x :: l) <+ x :: l\n\ncase neg\nα : Type u_1\nβ : Type ?u.50704\nR S T : α → α → Prop\na : α\nl✝ : List α\ninst✝... | [
398,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Algebra/Module/Zlattice.lean | Zspan.floor_eq_self_of_mem | [
{
"state_after": "E : Type u_1\nι : Type u_2\nK : Type u_3\ninst✝⁴ : NormedLinearOrderedField K\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace K E\nb : Basis ι K E\ninst✝¹ : FloorRing K\ninst✝ : Fintype ι\nm : E\nh : m ∈ span ℤ (Set.range ↑b)\n⊢ ∀ (i : ι), ↑(↑b.repr ↑(floor b m)) i = ↑(↑b.repr m) i",
... | [
99,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/CategoryTheory/Idempotents/Basic.lean | CategoryTheory.Idempotents.isIdempotentComplete_iff_hasEqualizer_of_id_and_idempotent | [
{
"state_after": "case mp\nC : Type u_1\ninst✝ : Category C\n⊢ IsIdempotentComplete C → ∀ (X : C) (p : X ⟶ X), p ≫ p = p → HasEqualizer (𝟙 X) p\n\ncase mpr\nC : Type u_1\ninst✝ : Category C\n⊢ (∀ (X : C) (p : X ⟶ X), p ≫ p = p → HasEqualizer (𝟙 X) p) → IsIdempotentComplete C",
"state_before": "C : Type u_... | [
95,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | finprod_mem_image' | [
{
"state_after": "case pos\nα : Type u_2\nβ : Type u_1\nι : Type ?u.350982\nG : Type ?u.350985\nM : Type u_3\nN : Type ?u.350991\ninst✝¹ : CommMonoid M\ninst✝ : CommMonoid N\nf g✝ : α → M\na b : α\ns✝ t : Set α\ns : Set β\ng : β → α\nhg : InjOn g (s ∩ mulSupport (f ∘ g))\nhs : Set.Finite (s ∩ mulSupport (f ∘ g)... | [
928,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
915,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/StrictInitial.lean | CategoryTheory.Limits.hasStrictInitialObjects_of_initial_is_strict | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : HasInitial C\nh : ∀ (A : C) (f : A ⟶ ⊥_ C), IsIso f\nI A : C\nf : A ⟶ I\nhI : IsInitial I\nthis : IsIso (f ≫ IsInitial.to hI (⊥_ C))\n⊢ f ≫ IsInitial.to hI (⊥_ C) ≫ inv (f ≫ IsInitial.to hI (⊥_ C)) = 𝟙 A",
"tactic": ... | [
168,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Analysis/Calculus/LHopital.lean | HasDerivAt.lhopital_zero_nhds_right | [
{
"state_after": "a b : ℝ\nhab : a < b\nl : Filter ℝ\nf f' g g' : ℝ → ℝ\nhff' : ∃ v, v ∈ 𝓝[Ioi a] a ∧ ∀ (y : ℝ), y ∈ v → HasDerivAt f (f' y) y\nhgg' : ∃ v, v ∈ 𝓝[Ioi a] a ∧ ∀ (y : ℝ), y ∈ v → HasDerivAt g (g' y) y\nhg' : ∃ v, v ∈ 𝓝[Ioi a] a ∧ ∀ (y : ℝ), y ∈ v → g' y ≠ 0\nhfa : Tendsto f (𝓝[Ioi a] a) (𝓝 0)\... | [
299,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
1
] |
Mathlib/Algebra/GroupPower/Order.lean | abs_lt_of_sq_lt_sq | [
{
"state_after": "no goals",
"state_before": "β : Type ?u.263157\nA : Type ?u.263160\nG : Type ?u.263163\nM : Type ?u.263166\nR : Type u_1\ninst✝ : LinearOrderedRing R\nx y : R\nh : x ^ 2 < y ^ 2\nhy : 0 ≤ y\n⊢ abs x < y",
"tactic": "rwa [← abs_of_nonneg hy, ← sq_lt_sq]"
}
] | [
710,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
709,
1
] |
Mathlib/Algebra/Order/WithZero.lean | one_le_mul₀ | [] | [
133,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.vecMulVec_empty | [] | [
337,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
336,
1
] |
Mathlib/CategoryTheory/Closed/Monoidal.lean | CategoryTheory.MonoidalClosed.uncurry_injective | [] | [
233,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/Data/List/Rotate.lean | List.length_rotate | [
{
"state_after": "no goals",
"state_before": "α : Type u\nl : List α\nn : ℕ\n⊢ length (rotate l n) = length l",
"tactic": "rw [rotate_eq_rotate', length_rotate']"
}
] | [
133,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Analysis/LocallyConvex/Bounded.lean | NormedSpace.isVonNBounded_closedBall | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\n𝕜' : Type ?u.241289\nE : Type u_2\nE' : Type ?u.241295\nF : Type ?u.241298\nι : Type ?u.241301\ninst✝² : NontriviallyNormedField 𝕜\ninst✝¹ : SeminormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nr : ℝ\n⊢ r < r + 1",
"tactic": "linarith"
}
] | [
284,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Computability/Reduce.lean | Computable.eqv | [] | [
225,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Analysis/Calculus/LocalExtr.lean | IsLocalMax.deriv_eq_zero | [] | [
248,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.integral_hasFDerivAt_of_tendsto_ae | [] | [
712,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
707,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.coe_inf | [] | [
513,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
512,
1
] |
Mathlib/Topology/ContinuousOn.lean | Set.MapsTo.closure_of_continuousOn | [] | [
744,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
742,
1
] |
Mathlib/LinearAlgebra/Ray.lean | ray_pos_smul | [] | [
282,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
280,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometry.congr_fun | [] | [
199,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
11
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | Polynomial.constantCoeff_coe | [] | [
2605,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2604,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.map_cons | [] | [
1177,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1176,
1
] |
Mathlib/Data/Vector.lean | Vector.toList_mk | [] | [
216,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Topology/Spectral/Hom.lean | IsSpectralMap.comp | [] | [
63,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | contDiffAt_snd | [] | [
822,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
821,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.card_Ioc_eq_card_Icc_sub_one | [] | [
649,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
648,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | measurable_edist_left | [] | [
1641,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1640,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.tendsto_pow_atTop | [] | [
892,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
891,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.nonempty_cons | [] | [
866,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
865,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.trNum_natEnd | [] | [
1463,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1462,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.filter_cons_of_neg | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.209744\nγ : Type ?u.209747\np : α → Prop\ninst✝ : DecidablePred p\na : α\ns : Multiset α\nl : List α\nh : ¬p a\n⊢ ¬decide (p a) = true",
"tactic": "simpa using h"
}
] | [
1974,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1973,
1
] |
Mathlib/Topology/Algebra/Star.lean | Filter.Tendsto.star | [] | [
55,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Order/UpperLower/Basic.lean | LowerSet.coe_inf | [] | [
688,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
687,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | dist_le_coe | [] | [
366,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.zpowers_eq | [
{
"state_after": "case a\nM : Type ?u.3298392\nN : Type ?u.3298395\nG : Type ?u.3298398\nR : Type u_1\nS : Type ?u.3298404\nF : Type ?u.3298407\ninst✝⁴ : CommMonoid M\ninst✝³ : CommMonoid N\ninst✝² : DivisionCommMonoid G\nk✝ l : ℕ\ninst✝¹ : CommRing R\nζ✝ : Rˣ\nh✝ : IsPrimitiveRoot ζ✝ k✝\ninst✝ : IsDomain R\nk ... | [
753,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
742,
1
] |
Mathlib/Data/Set/Intervals/Infinite.lean | Set.Ioi_infinite | [] | [
95,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Analysis/MeanInequalities.lean | NNReal.inner_le_Lp_mul_Lp_of_norm_eq_zero | [
{
"state_after": "ι : Type u\ns : Finset ι\nf g : ι → ℝ≥0\np q : ℝ\nhpq : Real.IsConjugateExponent p q\nhf : ∑ i in s, f i ^ p = 0\n⊢ ∀ (x : ι), x ∈ s → f x = 0 ∨ g x = 0",
"state_before": "ι : Type u\ns : Finset ι\nf g : ι → ℝ≥0\np q : ℝ\nhpq : Real.IsConjugateExponent p q\nhf : ∑ i in s, f i ^ p = 0\n⊢ ∑ ... | [
346,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
9
] |
Mathlib/CategoryTheory/Iso.lean | CategoryTheory.isIso_of_comp_hom_eq_id | [
{
"state_after": "C : Type u\ninst✝¹ : Category C\nX Y Z : C\ng : X ⟶ Y\ninst✝ : IsIso g\nf : Y ⟶ X\nh : f ≫ g = 𝟙 Y\n⊢ IsIso (inv g)",
"state_before": "C : Type u\ninst✝¹ : Category C\nX Y Z : C\ng : X ⟶ Y\ninst✝ : IsIso g\nf : Y ⟶ X\nh : f ≫ g = 𝟙 Y\n⊢ IsIso f",
"tactic": "rw [(comp_hom_eq_id _).mp ... | [
504,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
502,
1
] |
Mathlib/Logic/Function/Conjugate.lean | Function.Semiconj₂.comp_eq | [] | [
154,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
11
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | Filter.EventuallyEq.differentiableAt_iff | [] | [
854,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
852,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean | Complex.ext_abs_arg | [
{
"state_after": "no goals",
"state_before": "x y : ℂ\nh₁ : ↑abs x = ↑abs y\nh₂ : arg x = arg y\n⊢ x = y",
"tactic": "rw [← abs_mul_exp_arg_mul_I x, ← abs_mul_exp_arg_mul_I y, h₁, h₂]"
}
] | [
127,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.add_left_neg_equiv | [] | [
1686,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1685,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Cardinal.mk_subset_mk_lt_cof | [
{
"state_after": "case inl\nα✝ : Type ?u.117471\nr : α✝ → α✝ → Prop\nα : Type u_1\nh : ∀ (x : Cardinal), x < (#α) → 2 ^ x < (#α)\nha : (#α) = 0\n⊢ (#{ s // (#↑s) < Ordinal.cof (ord (#α)) }) = (#α)\n\ncase inr\nα✝ : Type ?u.117471\nr : α✝ → α✝ → Prop\nα : Type u_1\nh : ∀ (x : Cardinal), x < (#α) → 2 ^ x < (#α)\n... | [
946,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
928,
1
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.Subsingleton.aestronglyMeasurable' | [] | [
1171,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1169,
1
] |
Mathlib/Algebra/Hom/Group.lean | MulHom.comp_assoc | [] | [
1143,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1142,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.norm_mkPiAlgebraFin | [
{
"state_after": "case zero\n𝕜 : Type u\nι : Type v\nι' : Type v'\nE : ι → Type wE\nE₁ : ι → Type wE₁\nE' : ι' → Type wE'\nG : Type wG\nG' : Type wG'\ninst✝¹⁷ : Fintype ι\ninst✝¹⁶ : Fintype ι'\ninst✝¹⁵ : NontriviallyNormedField 𝕜\ninst✝¹⁴ : (i : ι) → NormedAddCommGroup (E i)\ninst✝¹³ : (i : ι) → NormedSpace �... | [
877,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
869,
1
] |
Mathlib/Algebra/Order/Floor.lean | round_eq | [
{
"state_after": "F : Type ?u.270515\nα : Type u_1\nβ : Type ?u.270521\ninst✝¹ : LinearOrderedField α\ninst✝ : FloorRing α\nx : α\n⊢ (if fract x < 1 / 2 then ⌊x⌋ else ⌈x⌉) = ⌊x + 1 / 2⌋",
"state_before": "F : Type ?u.270515\nα : Type u_1\nβ : Type ?u.270521\ninst✝¹ : LinearOrderedField α\ninst✝ : FloorRing ... | [
1449,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1430,
1
] |
Mathlib/Data/List/Pairwise.lean | List.forall_mem_pwFilter | [
{
"state_after": "case nil\nα : Type u_1\nβ : Type ?u.53307\nR S T : α → α → Prop\na✝ : α\nl : List α\ninst✝ : DecidableRel R\nneg_trans : ∀ {x y z : α}, R x z → R x y ∨ R y z\na : α\n⊢ (∀ (b : α), b ∈ pwFilter R [] → R a b) → ∀ (b : α), b ∈ [] → R a b\n\ncase cons\nα : Type u_1\nβ : Type ?u.53307\nR S T : α → ... | [
448,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
433,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | algebraMap_rat_rat | [] | [
756,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
756,
9
] |
Mathlib/GroupTheory/Index.lean | Subgroup.nat_card_dvd_of_injective | [
{
"state_after": "G✝ : Type ?u.97421\ninst✝² : Group G✝\nH✝ K L : Subgroup G✝\nG : Type u_1\nH : Type u_2\ninst✝¹ : Group G\ninst✝ : Group H\nf : G →* H\nhf : Function.Injective ↑f\n⊢ Nat.card { x // x ∈ MonoidHom.range f } ∣ Nat.card H",
"state_before": "G✝ : Type ?u.97421\ninst✝² : Group G✝\nH✝ K L : Subg... | [
302,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.Nontrivial.of_polynomial_ne | [] | [
778,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
777,
1
] |
Mathlib/CategoryTheory/Limits/HasLimits.lean | CategoryTheory.Limits.colimit.pre_pre | [
{
"state_after": "case w\nJ : Type u₁\ninst✝⁶ : Category J\nK : Type u₂\ninst✝⁵ : Category K\nC : Type u\ninst✝⁴ : Category C\nF : J ⥤ C\ninst✝³ : HasColimit F\nE : K ⥤ J\ninst✝² : HasColimit (E ⋙ F)\nL : Type u₃\ninst✝¹ : Category L\nD : L ⥤ K\ninst✝ h : HasColimit (D ⋙ E ⋙ F)\nj : L\n⊢ ι (D ⋙ E ⋙ F) j ≫ pre (... | [
996,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
990,
1
] |
Mathlib/Topology/ContinuousOn.lean | ContinuousWithinAt.mono_of_mem | [] | [
703,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
701,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.le_normalizer_map | [
{
"state_after": "G : Type u_1\nG' : Type ?u.395731\ninst✝³ : Group G\ninst✝² : Group G'\nA : Type ?u.395740\ninst✝¹ : AddGroup A\nH K : Subgroup G\nN : Type u_2\ninst✝ : Group N\nf : G →* N\nx✝ : N\n⊢ ∀ (x : G),\n (∀ (h : G), h ∈ H ↔ x * h * x⁻¹ ∈ H) →\n ↑f x = x✝ → ∀ (h : N), (∃ x, x ∈ H ∧ ↑f x = h) ↔... | [
2232,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2222,
1
] |
Mathlib/Tactic/NormNum/Prime.lean | Mathlib.Meta.NormNum.isNat_minFac_1 | [] | [
103,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.left_mem_Ico | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.4228\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\n⊢ a ∈ Ico a b ↔ a < b",
"tactic": "simp only [mem_Ico, true_and_iff, le_refl]"
}
] | [
129,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Logic/Equiv/Fin.lean | finCongr_apply_mk | [] | [
114,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
9
] |
Mathlib/Topology/GDelta.lean | IsClosed.isGδ | [
{
"state_after": "case intro.intro.mk\nα✝ : Type ?u.10695\nβ : Type ?u.10698\nγ : Type ?u.10701\nι : Type ?u.10704\ninst✝² : TopologicalSpace α✝\nα : Type u_1\ninst✝¹ : UniformSpace α\ninst✝ : IsCountablyGenerated (uniformity α)\ns : Set α\nhs : IsClosed s\nU : ℕ → Set (α × α)\nhUo : ∀ (i : ℕ), U i ∈ uniformity... | [
133,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/NumberTheory/Liouville/LiouvilleNumber.lean | LiouvilleNumber.aux_calc | [
{
"state_after": "no goals",
"state_before": "n : ℕ\nm : ℝ\nhm : 2 ≤ m\n⊢ 0 ≤ 1 / m ^ (n + 1)!",
"tactic": "positivity"
},
{
"state_after": "n : ℕ\nm : ℝ\nhm : 2 ≤ m\n⊢ 2 * m ^ (n ! * n) ≤ 1 * m ^ (n ! * (n + 1))\n\nn : ℕ\nm : ℝ\nhm : 2 ≤ m\n⊢ 0 < m ^ (n ! * (n + 1))\n\nn : ℕ\nm : ℝ\nhm : 2 ≤ m\... | [
162,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Topology/Basic.lean | IsClosed.inter | [
{
"state_after": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns s₁ s₂ t : Set α\np p₁ p₂ : α → Prop\ninst✝ : TopologicalSpace α\nh₁ : IsOpen (s₁ᶜ)\nh₂ : IsOpen (s₂ᶜ)\n⊢ IsOpen ((s₁ ∩ s₂)ᶜ)",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns s₁ s₂ t : Set α\np p₁ p₂ : α → Prop\ninst✝ : Topological... | [
246,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Std/Data/Nat/Lemmas.lean | Nat.one_pos | [] | [
376,
43
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
376,
1
] |
Mathlib/Order/JordanHolder.lean | CompositionSeries.mem_snoc | [
{
"state_after": "X : Type u\ninst✝¹ : Lattice X\ninst✝ : JordanHolderLattice X\ns : CompositionSeries X\nx y : X\nhsat : IsMaximal (top s) x\n⊢ y ∈ range (Fin.snoc s.series x) ↔ y ∈ range s.series ∨ y = x",
"state_before": "X : Type u\ninst✝¹ : Lattice X\ninst✝ : JordanHolderLattice X\ns : CompositionSerie... | [
595,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
580,
1
] |
Mathlib/Topology/Homotopy/Basic.lean | ContinuousMap.Homotopy.extend_apply_of_mem_I | [] | [
194,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Algebra/DirectSum/Decomposition.lean | DirectSum.decompose_add | [] | [
157,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Control/Functor.lean | Functor.Comp.functor_comp_id | [] | [
229,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.mem_Ioc | [] | [
146,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Control/Traversable/Basic.lean | ApplicativeTransformation.ext | [
{
"state_after": "case h\nF : Type u → Type v\ninst✝³ : Applicative F\ninst✝² : LawfulApplicative F\nG : Type u → Type w\ninst✝¹ : Applicative G\ninst✝ : LawfulApplicative G\nη η' : ApplicativeTransformation F G\nh : ∀ (α : Type u) (x : F α), (fun {α} => app η α) x = (fun {α} => app η' α) x\n⊢ (fun {α} => app η... | [
130,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.