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/Combinatorics/SetFamily/Shadow.lean | Finset.upShadow_monotone | [] | [
203,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.insert_val' | [
{
"state_after": "α : Type u_1\nβ : Type ?u.103025\nγ : Type ?u.103028\ninst✝ : DecidableEq α\ns✝ t u v : Finset α\na✝ b a : α\ns : Finset α\n⊢ (insert a s).val = ndinsert a s.val",
"state_before": "α : Type u_1\nβ : Type ?u.103025\nγ : Type ?u.103028\ninst✝ : DecidableEq α\ns✝ t u v : Finset α\na✝ b a : α\... | [
1052,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1051,
1
] |
Mathlib/CategoryTheory/Preadditive/Mat.lean | CategoryTheory.Mat.hom_ext | [] | [
582,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
581,
1
] |
Mathlib/Data/Real/Irrational.lean | irrational_inv_iff | [] | [
598,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
597,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.hasPullback_assoc | [] | [
2353,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2352,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.div_iUnion | [] | [
762,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
761,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.coe_div | [] | [
1113,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1111,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean | fderiv.log | [] | [
202,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Mathlib/Algebra/Group/Conj.lean | mem_conjugatesOf_self | [] | [
290,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
289,
1
] |
Mathlib/Data/Nat/Choose/Central.lean | Nat.centralBinom_ne_zero | [] | [
49,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/Analysis/ODE/PicardLindelof.lean | PicardLindelof.FunSpace.vComp_apply_coe | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℝ E\nv : PicardLindelof E\nf : FunSpace v\nt : ↑(Icc v.tMin v.tMax)\n⊢ vComp f ↑t = PicardLindelof.toFun v (↑t) (toFun f t)",
"tactic": "simp only [vComp, proj_coe]"
}
] | [
228,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/Order/Antichain.lean | IsWeakAntichain.eq | [] | [
373,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
372,
11
] |
Mathlib/NumberTheory/Fermat4.lean | Fermat42.neg_of_minimal | [
{
"state_after": "case intro.intro.intro\na b c : ℤ\nh2 : ∀ (a1 b1 c1 : ℤ), Fermat42 a1 b1 c1 → Int.natAbs c ≤ Int.natAbs c1\nha : a ≠ 0\nhb : b ≠ 0\nheq : a ^ 4 + b ^ 4 = c ^ 2\n⊢ Minimal a b (-c)",
"state_before": "a b c : ℤ\n⊢ Minimal a b c → Minimal a b (-c)",
"tactic": "rintro ⟨⟨ha, hb, heq⟩, h2⟩"
... | [
124,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.fract_sub_nat | [
{
"state_after": "F : Type ?u.149099\nα : Type u_1\nβ : Type ?u.149105\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na✝ a : α\nn : ℕ\n⊢ a - ↑n - ↑⌊a - ↑n⌋ = fract a",
"state_before": "F : Type ?u.149099\nα : Type u_1\nβ : Type ?u.149105\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\... | [
845,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
843,
1
] |
Mathlib/GroupTheory/Perm/Sign.lean | Equiv.Perm.mem_sumCongrHom_range_of_perm_mapsTo_inl | [
{
"state_after": "case intro\nα : Type u\nβ : Type v\nm : Type u_1\nn : Type u_2\ninst✝¹ : Finite m\ninst✝ : Finite n\nσ : Perm (m ⊕ n)\nh : Set.MapsTo (↑σ) (Set.range Sum.inl) (Set.range Sum.inl)\nval✝ : Fintype m\n⊢ σ ∈ MonoidHom.range (sumCongrHom m n)",
"state_before": "α : Type u\nβ : Type v\nm : Type ... | [
170,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Deprecated/Submonoid.lean | Monoid.closure.isSubmonoid | [] | [
305,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/Order/Max.lean | noTopOrder_iff_noMaxOrder | [] | [
168,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/Order/Filter/Pointwise.lean | Filter.tendsto_one | [] | [
142,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/Data/Nat/Bits.lean | Nat.bit1_eq_bit1 | [
{
"state_after": "n m : ℕ\n⊢ bit1 m = bit1 m",
"state_before": "n✝ m n : ℕ\nh : m = n\n⊢ bit1 m = bit1 n",
"tactic": "subst h"
},
{
"state_after": "no goals",
"state_before": "n m : ℕ\n⊢ bit1 m = bit1 m",
"tactic": "rfl"
}
] | [
79,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.add_re | [] | [
195,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.toLinearEquiv_symm | [] | [
763,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
762,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | one_le_inv | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.54083\nα : Type u_1\nβ : Type ?u.54089\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n : ℤ\nh₁ : 0 < a\nh₂ : a ≤ 1\n⊢ 1 ≤ a⁻¹",
"tactic": "rwa [le_inv (@zero_lt_one α _ _ _ _ _) h₁, inv_one]"
}
] | [
312,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/Topology/Algebra/Order/Archimedean.lean | AddSubgroup.dense_of_no_min | [
{
"state_after": "G : Type u_1\ninst✝³ : LinearOrderedAddCommGroup G\ninst✝² : TopologicalSpace G\ninst✝¹ : OrderTopology G\ninst✝ : Archimedean G\nS : AddSubgroup G\nhbot : S ≠ ⊥\nH : ¬∃ a, IsLeast {g | g ∈ S ∧ 0 < g} a\nε : G\nε0 : ε > 0\n⊢ ∃ g, g ∈ S ∧ g ∈ Ioo 0 ε",
"state_before": "G : Type u_1\ninst✝³ ... | [
65,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
61,
1
] |
Mathlib/Algebra/ModEq.lean | AddCommGroup.ModEq.add_left_cancel' | [] | [
247,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
11
] |
Mathlib/Topology/UniformSpace/Completion.lean | CauchyFilter.symm_gen | [
{
"state_after": "α : Type u\ninst✝² : UniformSpace α\nβ : Type v\nγ : Type w\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\nf : Set (α × α) → Set (CauchyFilter α × CauchyFilter α) := fun s => {p | s ∈ ↑p.snd ×ˢ ↑p.fst}\n⊢ map Prod.swap (Filter.lift' (𝓤 α) gen) ≤ Filter.lift' (𝓤 α) gen",
"state_before"... | [
105,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
9
] |
Mathlib/Topology/MetricSpace/Basic.lean | cauchySeq_bdd | [
{
"state_after": "case intro\nα : Type u\nβ : Type v\nX : Type ?u.226298\nι : Type ?u.226301\ninst✝² : PseudoMetricSpace α\ninst✝¹ : Nonempty β\ninst✝ : SemilatticeSup β\nu : ℕ → α\nhu : CauchySeq u\nN : ℕ\nhN : ∀ (n : ℕ), n ≥ N → dist (u n) (u N) < 1\n⊢ ∃ R, R > 0 ∧ ∀ (m n : ℕ), dist (u m) (u n) < R",
"sta... | [
1567,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1556,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Equiv.lean | HasFDerivAt.of_local_left_inverse | [
{
"state_after": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.410572\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nG' : Type ?u.410667\... | [
407,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.sdiff_disjoint | [] | [
2348,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2347,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.not_real_of_infinitesimal_ne_zero | [] | [
724,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
722,
1
] |
Mathlib/Topology/Algebra/ContinuousAffineMap.lean | ContinuousAffineMap.coe_const | [] | [
154,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Logic/Basic.lean | not_exists_not | [] | [
704,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
704,
1
] |
Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean | Finpartition.botIsUniform | [
{
"state_after": "α : Type u_2\n𝕜 : Type u_1\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : DecidableEq α\nA : Finset α\nP : Finpartition A\nG : SimpleGraph α\ninst✝ : DecidableRel G.Adj\nε : 𝕜\nhε : 0 < ε\n⊢ 0 ≤ ↑(card A * (card A - 1)) * ε",
"state_before": "α : Type u_2\n𝕜 : Type u_1\ninst✝² : LinearOrdere... | [
239,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
236,
1
] |
Mathlib/Init/Data/List/Basic.lean | List.headI_cons | [] | [
43,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
43,
9
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_ofReal_le_lintegral_nnnorm | [
{
"state_after": "α : Type u_1\nβ : Type ?u.295320\nγ : Type ?u.295323\nδ : Type ?u.295326\nm : MeasurableSpace α\nμ ν : Measure α\nf : α → ℝ\n⊢ (∫⁻ (x : α), ENNReal.ofReal (f x) ∂μ) ≤ ∫⁻ (x : α), ENNReal.ofReal ‖f x‖ ∂μ",
"state_before": "α : Type u_1\nβ : Type ?u.295320\nγ : Type ?u.295323\nδ : Type ?u.29... | [
343,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
src/lean/Init/Data/Nat/Linear.lean | Nat.Linear.Poly.denote_mul | [
{
"state_after": "ctx : Context\nk : Nat\np : Poly\n⊢ denote ctx (bif k == 0 then [] else bif k == 1 then p else mul.go k p) = k * denote ctx p",
"state_before": "ctx : Context\nk : Nat\np : Poly\n⊢ denote ctx (mul k p) = k * denote ctx p",
"tactic": "simp"
},
{
"state_after": "case inl\nctx : C... | [
341,
56
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
335,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | UniqueFactorizationMonoid.prime_pow_coprime_prod_of_coprime_insert | [
{
"state_after": "α : Type u_1\nR : Type ?u.1372972\ninst✝⁵ : CancelCommMonoidWithZero R\ninst✝⁴ : UniqueFactorizationMonoid R\ninst✝³ : CancelCommMonoidWithZero α\ninst✝² : UniqueFactorizationMonoid α\nβ : Type ?u.1372999\ninst✝¹ : CancelCommMonoidWithZero β\ninst✝ : DecidableEq α\ns : Finset α\ni : α → ℕ\np :... | [
1070,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1055,
1
] |
Mathlib/Data/Nat/Order/Lemmas.lean | Nat.set_eq_univ | [
{
"state_after": "a b m n k : ℕ\n⊢ 0 ∈ Set.univ ∧ ∀ (k : ℕ), k ∈ Set.univ → k + 1 ∈ Set.univ",
"state_before": "a b m n k : ℕ\nS : Set ℕ\n⊢ S = Set.univ → 0 ∈ S ∧ ∀ (k : ℕ), k ∈ S → k + 1 ∈ S",
"tactic": "rintro rfl"
},
{
"state_after": "no goals",
"state_before": "a b m n k : ℕ\n⊢ 0 ∈ Set.u... | [
51,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
50,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.linearMap_ext | [] | [
516,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
514,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.left_mem_Icc | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.3846\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\n⊢ a ∈ Icc a b ↔ a ≤ b",
"tactic": "simp only [mem_Icc, true_and_iff, le_rfl]"
}
] | [
124,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Data/Nat/Choose/Sum.lean | Finset.prod_pow_choose_succ | [
{
"state_after": "case A\nR✝ : Type ?u.210813\nM✝ : Type ?u.210816\nR : Type ?u.210819\ninst✝² : CommMonoid M✝\ninst✝¹ : NonAssocSemiring R\nM : Type u_1\ninst✝ : CommMonoid M\nf : ℕ → ℕ → M\nn : ℕ\n⊢ (∏ i in range (n + 1), f (i + 1) (n - i) ^ Nat.choose n (i + 1)) * f 0 (n + 1) =\n ∏ i in range (n + 1), f i... | [
196,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Data/Finset/Prod.lean | Finset.offDiag_empty | [] | [
360,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.nth_enum | [] | [
228,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/AlgebraicGeometry/StructureSheaf.lean | AlgebraicGeometry.StructureSheaf.stalkToFiberRingHom_localizationToStalk | [] | [
610,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
608,
1
] |
Mathlib/Topology/Algebra/Order/Floor.lean | tendsto_floor_right' | [] | [
120,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/GroupTheory/Subsemigroup/Basic.lean | Subsemigroup.coe_sInf | [] | [
244,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Topology/FiberBundle/Basic.lean | FiberBundle.trivialization_mem_atlas | [] | [
214,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Data/PFunctor/Univariate/M.lean | PFunctor.M.mk_inj | [
{
"state_after": "no goals",
"state_before": "F : PFunctor\nX : Type ?u.15917\nf : X → Obj F X\nx y : Obj F (M F)\nh : M.mk x = M.mk y\n⊢ x = y",
"tactic": "rw [← dest_mk x, h, dest_mk]"
}
] | [
368,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.sub_eq_of_add_eq | [] | [
1136,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1135,
1
] |
Mathlib/CategoryTheory/Monoidal/Mon_.lean | Mon_.one_mul_hom | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\ninst✝ : MonoidalCategory C\nM : Mon_ C\nZ : C\nf : Z ⟶ M.X\n⊢ (M.one ⊗ f) ≫ M.mul = (λ_ Z).hom ≫ f",
"tactic": "rw [← id_tensor_comp_tensor_id, Category.assoc, M.one_mul, leftUnitor_naturality]"
}
] | [
77,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.finite_approx_of_totallyBounded | [
{
"state_after": "α : Type u\nβ : Type v\nX : Type ?u.66642\nι : Type ?u.66645\ninst✝ : PseudoMetricSpace α\nx y z : α\nδ ε✝ ε₁ ε₂ : ℝ\ns✝ s : Set α\nhs : TotallyBounded s\nε : ℝ\nε_pos : ε > 0\n⊢ ∃ t, t ⊆ s ∧ Set.Finite t ∧ s ⊆ ⋃ (y : α) (_ : y ∈ t), ball y ε",
"state_before": "α : Type u\nβ : Type v\nX : ... | [
887,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
883,
1
] |
Mathlib/Algebra/Order/Floor.lean | Nat.ceil_nat | [] | [
118,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/MeasureTheory/Constructions/Prod/Integral.lean | MeasureTheory.AEStronglyMeasurable.snd | [] | [
195,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.lintegral_rpow_nnnorm_eq_rpow_snorm' | [
{
"state_after": "α : Type u_1\nE : Type ?u.529623\nF : Type u_2\nG : Type ?u.529629\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nf : α → F\nhq0_lt : 0 < q\n⊢ q ≠ 0",
"state_before": "α : Type u_1\nE ... | [
131,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Algebra/Associated.lean | Associated.mul_right | [] | [
529,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
528,
1
] |
Mathlib/Analysis/Convex/Cone/Dual.lean | innerDualCone_sUnion | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.17912\nE : Type ?u.17915\nF : Type ?u.17918\nG : Type ?u.17921\nH : Type u_1\ninst✝¹ : NormedAddCommGroup H\ninst✝ : InnerProductSpace ℝ H\ns t : Set H\nS : Set (Set H)\n⊢ innerDualCone (⋃₀ S) = sInf (innerDualCone '' S)",
"tactic": "simp_rw [sI... | [
117,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Std/Data/List/Lemmas.lean | List.mem_map | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nb : β\nf : α → β\n⊢ b ∈ map f [] ↔ ∃ a, a ∈ [] ∧ f a = b",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nb : β\nf : α → β\nhead✝ : α\nl : List α\n⊢ b ∈ map f (head✝ :: l)... | [
158,
59
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
156,
9
] |
Mathlib/Analysis/NormedSpace/ENorm.lean | ENorm.map_smul | [
{
"state_after": "𝕜 : Type u_1\nV : Type u_2\ninst✝² : NormedField 𝕜\ninst✝¹ : AddCommGroup V\ninst✝ : Module 𝕜 V\ne : ENorm 𝕜 V\nc : 𝕜\nx : V\n⊢ ↑‖c‖₊ * ↑e x ≤ ↑e (c • x)",
"state_before": "𝕜 : Type u_1\nV : Type u_2\ninst✝² : NormedField 𝕜\ninst✝¹ : AddCommGroup V\ninst✝ : Module 𝕜 V\ne : ENorm 𝕜... | [
95,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.7605\ns t : Set α\na✝ b x y : α\nf : α → β\na : α\n⊢ ncard {a} = 1",
"tactic": "simp [ncard_eq_toFinset_card]"
}
] | [
133,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
9
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean | Ideal.IsHomogeneous.iff_eq | [] | [
225,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | zsmul_eq_mul | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.276006\nM : Type u\nN : Type v\nG : Type w\nH : Type x\nA : Type y\nB : Type z\nR : Type u₁\nS : Type u₂\ninst✝ : Ring R\na : R\nn : ℕ\n⊢ ↑n • a = ↑↑n * a",
"tactic": "rw [coe_nat_zsmul, nsmul_eq_mul, Int.cast_ofNat]"
},
{
"state_after": ... | [
593,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
591,
1
] |
Mathlib/Order/Filter/Pointwise.lean | Filter.div_pure | [] | [
501,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
500,
1
] |
Mathlib/Topology/UniformSpace/UniformEmbedding.lean | uniformEmbedding_iff' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\nf : α → β\n⊢ UniformEmbedding f ↔ Injective f ∧ UniformContinuous f ∧ comap (Prod.map f f) (𝓤 β) ≤ 𝓤 α",
"tactic": "rw [uniformEmbedding_iff, and_... | [
140,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.liftRel_think_right | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nR : α → β → Prop\ns : WSeq α\nt : WSeq β\n⊢ Computation.LiftRel (LiftRelO R (LiftRel R)) (destruct s) (destruct (think t)) ↔\n Computation.LiftRel (LiftRelO R (LiftRel R)) (destruct s) (destruct t)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w... | [
1113,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1112,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.union_right_idem | [] | [
1727,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1726,
1
] |
Mathlib/Topology/Algebra/Order/Field.lean | tendsto_zpow_atTop_zero | [
{
"state_after": "case intro\n𝕜 : Type u_1\nα : Type ?u.32706\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : TopologicalSpace 𝕜\ninst✝ : OrderTopology 𝕜\nl : Filter α\nf g : α → 𝕜\nn : ℤ\nhn : n < 0\nN : ℕ\nh : ↑N = -n\n⊢ Tendsto (fun x => x ^ n) atTop (𝓝 0)",
"state_before": "𝕜 : Type u_1\nα : Type ?u.327... | [
168,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | EMetric.infEdist_pos_iff_not_mem_closure | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.17614\nα : Type u\nβ : Type v\ninst✝¹ : PseudoEMetricSpace α\ninst✝ : PseudoEMetricSpace β\nx✝ y : α\ns t : Set α\nΦ : α → β\nx : α\nE : Set α\n⊢ 0 < infEdist x E ↔ ¬x ∈ closure E",
"tactic": "rw [mem_closure_iff_infEdist_zero, pos_iff_ne_zero]"
... | [
169,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Topology/UniformSpace/Separation.lean | UniformSpace.uniformContinuous_quotient_mk' | [] | [
291,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
289,
1
] |
Mathlib/Init/Logic.lean | Ne.def | [] | [
56,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/MeasureTheory/MeasurableSpaceDef.lean | MeasurableSet.sInter | [
{
"state_after": "α : Type u_1\nβ : Type ?u.8090\nγ : Type ?u.8093\nδ : Type ?u.8096\nδ' : Type ?u.8099\nι : Sort ?u.8102\ns✝ t u : Set α\nm : MeasurableSpace α\ns : Set (Set α)\nhs : Set.Countable s\nh : ∀ (t : Set α), t ∈ s → MeasurableSet t\n⊢ MeasurableSet (⋂ (i : Set α) (_ : i ∈ s), i)",
"state_before"... | [
185,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/GroupTheory/Subsemigroup/Operations.lean | Subsemigroup.coe_prod | [] | [
648,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
646,
1
] |
Mathlib/MeasureTheory/PiSystem.lean | generatePiSystem_measurableSet | [
{
"state_after": "case base\nα : Type u_1\nM : MeasurableSpace α\nS : Set (Set α)\nh_meas_S : ∀ (s : Set α), s ∈ S → MeasurableSet s\nt s : Set α\nh_s : s ∈ S\n⊢ MeasurableSet s\n\ncase inter\nα : Type u_1\nM : MeasurableSpace α\nS : Set (Set α)\nh_meas_S : ∀ (s : Set α), s ∈ S → MeasurableSet s\nt s u : Set α\... | [
262,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
1
] |
Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean | one_lt_iff_ne_one | [] | [
246,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | normalize_dvd_iff | [] | [
204,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/CategoryTheory/CofilteredSystem.lean | CategoryTheory.Functor.toPreimages_nonempty_of_surjective | [
{
"state_after": "J : Type u\ninst✝¹ : Category J\nF : J ⥤ Type v\ni j✝ k : J\ns : Set (F.obj i)\ninst✝ : IsCofilteredOrEmpty J\nhFn : ∀ (j : J), _root_.Nonempty (F.obj j)\nFsur : ∀ ⦃i j : J⦄ (f : i ⟶ j), Function.Surjective (F.map f)\nhs : Set.Nonempty s\nj : J\n⊢ ∃ x, ∀ (i_1 : j ⟶ i), F.map i_1 x ∈ s",
"s... | [
334,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
326,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.iSup_neBot | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.66517\nι : Sort x\nf✝ g : Filter α\ns t : Set α\nf : ι → Filter α\n⊢ NeBot (⨆ (i : ι), f i) ↔ ∃ i, NeBot (f i)",
"tactic": "simp [neBot_iff]"
}
] | [
578,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
577,
1
] |
Mathlib/Order/Bounded.lean | Set.bounded_le_Ico | [] | [
234,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/Algebra/Hom/Iterate.lean | pow_iterate | [] | [
209,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Analysis/Calculus/Deriv/Slope.lean | hasDerivWithinAt_iff_tendsto_slope | [
{
"state_after": "𝕜 : Type u\ninst✝⁴ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nE : Type w\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL L₁ L₂ : Filter 𝕜\n⊢ HasDerivAtFilter f f'... | [
79,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Valid'.balanceR_aux | [
{
"state_after": "α : Type u_1\ninst✝ : Preorder α\nl : Ordnode α\nx : α\nr : Ordnode α\no₁ : WithBot α\no₂ : WithTop α\nhl : Valid' o₁ l ↑x\nhr : Valid' (↑x) r o₂\nH₁ : size r = 0 → size l ≤ 1\nH₂ : 1 ≤ size r → 1 ≤ size l → size l ≤ delta * size r\nH₃ : 2 * size r ≤ 9 * size l + 5 ∨ size r ≤ 3\n⊢ Valid' o₂ (O... | [
1379,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1373,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.extraction_forall_of_eventually' | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.60772\nι' : Type ?u.60775\nα : Type ?u.60778\nβ : Type ?u.60781\nγ : Type ?u.60784\nP : ℕ → ℕ → Prop\nh : ∀ (n : ℕ), ∃ N, ∀ (k : ℕ), k ≥ N → P n k\n⊢ ∀ (n : ℕ), ∀ᶠ (k : ℕ) in atTop, P n k",
"tactic": "simp [eventually_atTop, h]"
}
] | [
498,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
496,
1
] |
Mathlib/Data/Rat/NNRat.lean | NNRat.coe_ne_zero | [] | [
162,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.induction_on₂ | [] | [
197,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.mk_set_eq_nat_iff_finset | [
{
"state_after": "case mp\nα✝ β : Type u\nα : Type u_1\ns : Set α\nn : ℕ\n⊢ (#↑s) = ↑n → ∃ t, ↑t = s ∧ Finset.card t = n\n\ncase mpr\nα✝ β : Type u\nα : Type u_1\ns : Set α\nn : ℕ\n⊢ (∃ t, ↑t = s ∧ Finset.card t = n) → (#↑s) = ↑n",
"state_before": "α✝ β : Type u\nα : Type u_1\ns : Set α\nn : ℕ\n⊢ (#↑s) = ↑n... | [
2073,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2066,
1
] |
Mathlib/Data/Polynomial/Eval.lean | Polynomial.eval_X | [] | [
362,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Algebra/Star/Basic.lean | isUnit_star | [] | [
563,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
562,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | inner_sum_smul_sum_smul_of_sum_eq_zero | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.3253936\nE : Type ?u.3253939\nF : Type u_3\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nι₁ : Type u_1\ns₁ : Finset ι₁\nw₁ : ... | [
1744,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1734,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | UniformContinuous.prod_mk_right | [] | [
1635,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1633,
1
] |
Mathlib/Topology/Algebra/ConstMulAction.lean | isOpenMap_smul₀ | [] | [
330,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
329,
1
] |
Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.map_sub_nat | [] | [
388,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
1
] |
Mathlib/Data/Set/Sups.lean | Set.forall_infs_iff | [] | [
261,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometryEquiv.linearIsometryEquiv_mk' | [
{
"state_after": "case h\n𝕜 : Type u_1\nV : Type ?u.375824\nV₁ : Type u_2\nV₂ : Type u_3\nV₃ : Type ?u.375833\nV₄ : Type ?u.375836\nP₁ : Type u_5\nP : Type ?u.375842\nP₂ : Type u_4\nP₃ : Type ?u.375848\nP₄ : Type ?u.375851\ninst✝²⁰ : NormedField 𝕜\ninst✝¹⁹ : SeminormedAddCommGroup V\ninst✝¹⁸ : SeminormedAddCo... | [
394,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometryEquiv.map_vadd | [] | [
620,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
619,
1
] |
Mathlib/RingTheory/Localization/Integer.lean | IsLocalization.exists_integer_multiple' | [] | [
84,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/RingTheory/RootsOfUnity/Complex.lean | Complex.card_rootsOfUnity | [] | [
95,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.FiniteAtFilter.exists_mem_basis | [] | [
3406,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3404,
1
] |
Mathlib/Algebra/DualQuaternion.lean | Quaternion.snd_re_dualNumberEquiv_symm | [] | [
139,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Algebra/Module/Submodule/Lattice.lean | Submodule.add_mem_sup | [] | [
291,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Data/Set/Pairwise/Basic.lean | Set.InjOn.pairwise_image | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type ?u.17412\nγ : Type ?u.17415\nι : Type u_1\nι' : Type ?u.17421\nr p q : α → α → Prop\nf g : ι → α\ns✝ t u : Set α\na b : α\ns : Set ι\nh : InjOn f s\n⊢ Set.Pairwise (f '' s) r ↔ Set.Pairwise s (r on f)",
"tactic": "simp (config := { con... | [
217,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Data/Polynomial/Eval.lean | Polynomial.map_zero | [] | [
714,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
713,
11
] |
Mathlib/Data/Pi/Lex.lean | Pi.Lex.noMaxOrder' | [
{
"state_after": "ι : Type u_1\nβ : ι → Type u_2\nr : ι → ι → Prop\ns : {i : ι} → β i → β i → Prop\ninst✝² : Preorder ι\ninst✝¹ : (i : ι) → LT (β i)\ni : ι\ninst✝ : NoMaxOrder (β i)\na : Lex ((i : ι) → β i)\nb : β i\nhb : a i < b\n⊢ ∃ b, a < b",
"state_before": "ι : Type u_1\nβ : ι → Type u_2\nr : ι → ι → P... | [
213,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.