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/GroupTheory/Subgroup/Basic.lean | Subgroup.pow_mem | [] | [
627,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
626,
11
] |
Mathlib/Order/UpperLower/Basic.lean | UpperSet.mem_sup_iff | [] | [
582,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
581,
1
] |
Mathlib/GroupTheory/SchurZassenhaus.lean | Subgroup.SchurZassenhausInduction.step3 | [
{
"state_after": "G : Type u\ninst✝³ : Group G\ninst✝² : Fintype G\nN : Subgroup G\ninst✝¹ : Normal N\nh1 : Nat.coprime (Fintype.card { x // x ∈ N }) (index N)\nh2 :\n ∀ (G' : Type u) [inst : Group G'] [inst_1 : Fintype G'],\n Fintype.card G' < Fintype.card G →\n ∀ {N' : Subgroup G'} [inst_2 : Normal N... | [
238,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
9
] |
Mathlib/Data/Set/Finite.lean | Set.iSup_iInf_of_monotone | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u\nβ : Type v\nι✝ : Sort w\nγ : Type x\nι : Type u_1\nι' : Type u_2\nα : Type u_3\ninst✝⁴ : Finite ι\ninst✝³ : Preorder ι'\ninst✝² : Nonempty ι'\ninst✝¹ : IsDirected ι' fun x x_1 => x ≤ x_1\ninst✝ : Order.Frame α\nf : ι → ι' → α\nhf : ∀ (i : ι), Monoto... | [
1501,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1498,
1
] |
Mathlib/Analysis/NormedSpace/Pointwise.lean | infEdist_cthickening | [
{
"state_after": "case inl\n𝕜 : Type ?u.228492\nE : Type u_1\ninst✝³ : NormedField 𝕜\ninst✝² : SeminormedAddCommGroup E\ninst✝¹ : NormedSpace 𝕜 E\ninst✝ : NormedSpace ℝ E\nx✝ y z : E\nδ✝ ε δ : ℝ\ns : Set E\nx : E\nhδ : δ ≤ 0\n⊢ infEdist x (cthickening δ s) = infEdist x s - ENNReal.ofReal δ\n\ncase inr\n𝕜 : ... | [
303,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Analysis/Calculus/Deriv/Prod.lean | HasDerivWithinAt.prod | [] | [
66,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
8
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.map_le_iff_le_comap | [] | [
1334,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1333,
1
] |
Mathlib/CategoryTheory/Subobject/Basic.lean | CategoryTheory.Subobject.ofMkLEMk_comp | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝³ : Category C\nX Y Z : C\nD : Type u₂\ninst✝² : Category D\nB A₁ A₂ : C\nf : A₁ ⟶ B\ng : A₂ ⟶ B\ninst✝¹ : Mono f\ninst✝ : Mono g\nh : mk f ≤ mk g\n⊢ ofMkLEMk f g h ≫ g = f",
"tactic": "simp [ofMkLEMk]"
}
] | [
385,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
384,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | inv_mul_lt_iff | [
{
"state_after": "ι : Type ?u.35615\nα : Type u_1\nβ : Type ?u.35621\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n : ℤ\nh : 0 < b\n⊢ a / b < c ↔ a < b * c",
"state_before": "ι : Type ?u.35615\nα : Type u_1\nβ : Type ?u.35621\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n : ℤ\nh : 0 < b\n⊢ b⁻¹... | [
198,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Algebra/Support.lean | Function.mulSupport_add_one | [] | [
425,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Order/BooleanAlgebra.lean | hnot_eq_compl | [] | [
607,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
606,
1
] |
Mathlib/NumberTheory/Bernoulli.lean | bernoulli'_zero | [
{
"state_after": "A : Type ?u.180461\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\n⊢ 1 - ∑ k in range 0, ↑(Nat.choose 0 k) / (↑0 - ↑k + 1) * bernoulli' k = 1",
"state_before": "A : Type ?u.180461\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\n⊢ bernoulli' 0 = 1",
"tactic": "rw [bernoulli'_def]"
},
{
"s... | [
108,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | TendstoUniformlyOnFilter.comp | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Type x\ninst✝ : UniformSpace β\nF : ι → α → β\nf : α → β\ns s' : Set α\nx : α\np : Filter ι\np' : Filter α\ng✝ : ι → α\nh : Tendsto (fun q => (f q.snd, F q.fst q.snd)) (p ×ˢ p') (𝓤 β)\ng : γ → α\n⊢ Tendsto (fun q => ((f ∘ g) q.snd, (F q.fst ∘ g) q.snd))... | [
238,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/Algebra/GroupWithZero/Basic.lean | div_self_mul_self | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.25853\nM₀ : Type ?u.25856\nG₀ : Type u_1\nM₀' : Type ?u.25862\nG₀' : Type ?u.25865\nF : Type ?u.25868\nF' : Type ?u.25871\ninst✝ : GroupWithZero G₀\na✝ b c a : G₀\n⊢ a / a * a = a",
"tactic": "rw [div_eq_mul_inv, mul_inv_mul_self a]"
}
] | [
381,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
381,
1
] |
Mathlib/Data/Nat/Bits.lean | Nat.bodd_eq_bits_head | [
{
"state_after": "case z\nn : ℕ\n⊢ bodd 0 = List.headI (bits 0)\n\ncase f\nn✝ : ℕ\nb : Bool\nn : ℕ\nh : n = 0 → b = true\na✝ : bodd n = List.headI (bits n)\n⊢ bodd (bit b n) = List.headI (bits (bit b n))",
"state_before": "n✝ n : ℕ\n⊢ bodd n = List.headI (bits n)",
"tactic": "induction' n using Nat.bina... | [
244,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Fuzzy.swap_iff | [] | [
913,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
912,
1
] |
Mathlib/NumberTheory/Padics/PadicVal.lean | padicValRat.of_int | [
{
"state_after": "no goals",
"state_before": "p : ℕ\nz : ℤ\n⊢ padicValRat p ↑z = ↑(padicValInt p z)",
"tactic": "simp [padicValRat]"
}
] | [
178,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.sup_equiv_sup | [
{
"state_after": "α : Type u_1\ninst✝ : LinearOrderedField α\na₁ b₁ a₂ b₂ : CauSeq α abs\nha : a₁ ≈ a₂\nhb : b₁ ≈ b₂\nε : α\nε0 : ε > 0\n⊢ ∃ i, ∀ (j : ℕ), j ≥ i → abs (↑(a₁ ⊔ b₁ - a₂ ⊔ b₂) j) < ε",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedField α\na₁ b₁ a₂ b₂ : CauSeq α abs\nha : a₁ ≈ a₂\nhb : b₁... | [
872,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
864,
1
] |
Mathlib/Data/List/Func.lean | List.Func.sub_nil | [
{
"state_after": "α✝ : Type u\nβ : Type v\nγ : Type w\nα : Type u_1\ninst✝ : AddGroup α\nas : List α\n⊢ map (fun a => Sub.sub a default) as = as",
"state_before": "α✝ : Type u\nβ : Type v\nγ : Type w\nα : Type u_1\ninst✝ : AddGroup α\nas : List α\n⊢ sub as [] = as",
"tactic": "rw [sub, @pointwise_nil _ ... | [
395,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Algebra/Group/Ext.lean | CancelMonoid.ext | [] | [
102,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.trNat_natEnd | [] | [
1467,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1466,
1
] |
Mathlib/Computability/EpsilonNFA.lean | εNFA.toNFA_evalFrom_match | [] | [
159,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.coe_castPred_lt_iff | [
{
"state_after": "case inl\nn m : ℕ\n⊢ ↑(castPred (last (n + 1))) < ↑(last (n + 1)) ↔ last (n + 1) = last (n + 1)\n\ncase inr\nn m : ℕ\ni : Fin (n + 2)\nH : i < last (n + 1)\n⊢ ↑(castPred i) < ↑i ↔ i = last (n + 1)",
"state_before": "n m : ℕ\ni : Fin (n + 2)\n⊢ ↑(castPred i) < ↑i ↔ i = last (n + 1)",
"t... | [
2475,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2470,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.top_div | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.273458\nβ : Type ?u.273461\na b c d : ℝ≥0∞\nr p q : ℝ≥0\n⊢ ⊤ / a = if a = ⊤ then 0 else ⊤",
"tactic": "simp [div_eq_mul_inv, top_mul']"
}
] | [
1542,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1542,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.isUnit_singleton | [] | [
1135,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1134,
1
] |
Mathlib/CategoryTheory/Extensive.lean | CategoryTheory.FinitaryExtensive.mono_inr_of_isColimit | [] | [
246,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.castSucc_lt_last | [] | [
1271,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1270,
1
] |
Mathlib/MeasureTheory/Measure/Haar/OfBasis.lean | Basis.addHaar_self | [
{
"state_after": "ι : Type u_1\nι' : Type ?u.277564\nE : Type u_2\nF : Type ?u.277570\ninst✝⁷ : Fintype ι\ninst✝⁶ : Fintype ι'\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : NormedSpace ℝ E\ninst✝² : NormedSpace ℝ F\ninst✝¹ : MeasurableSpace E\ninst✝ : BorelSpace E\nb : Basis ι ℝ E\n⊢ ↑... | [
246,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Std/Data/Option/Lemmas.lean | Option.map_eq_none' | [
{
"state_after": "no goals",
"state_before": "α✝¹ : Type u_1\nx : Option α✝¹\nα✝ : Type u_2\nf : α✝¹ → α✝\n⊢ Option.map f x = none ↔ x = none",
"tactic": "cases x <;> simp only [map_none', map_some', eq_self_iff_true]"
}
] | [
132,
65
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
131,
9
] |
Mathlib/Topology/Bases.lean | TopologicalSpace.countable_countableBasis | [] | [
626,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
625,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.eq_of_bisim | [] | [
322,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
321,
1
] |
Mathlib/Data/ULift.lean | PLift.up_inj | [] | [
58,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nβ₂ : Type ?u.140189\nγ : Type ?u.140192\nι : Sort ?u.140195\nι' : Sort ?u.140198\nκ : ι → Sort ?u.140203\nκ' : ι' → Sort ?u.140208\ninst✝ : CompleteLattice α\nf✝ g s t : ι → α\na b✝ : α\nf : β → α\nb : β\n⊢ (⨅ (x : β) (_ : x ∈ {b}), f... | [
1462,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1462,
1
] |
Mathlib/Data/Polynomial/Div.lean | Polynomial.degree_divByMonic_lt | [
{
"state_after": "R : Type u\nS : Type v\nT : Type w\nA : Type z\na b : R\nn : ℕ\ninst✝ : CommRing R\np✝ q✝ p q : R[X]\nhq : Monic q\nhp0 : p ≠ 0\nh0q : 0 < degree q\nhpq : degree p < degree q\nthis : Nontrivial R\n⊢ degree (p /ₘ q) < degree p",
"state_before": "R : Type u\nS : Type v\nT : Type w\nA : Type ... | [
312,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Combinatorics/SimpleGraph/Density.lean | SimpleGraph.interedges_mono | [] | [
344,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/Analysis/Seminorm.lean | ball_normSeminorm | [
{
"state_after": "case h.h.h\nR : Type ?u.1449022\nR' : Type ?u.1449025\n𝕜 : Type u_2\n𝕜₂ : Type ?u.1449031\n𝕜₃ : Type ?u.1449034\n𝕝 : Type ?u.1449037\nE : Type u_1\nE₂ : Type ?u.1449043\nE₃ : Type ?u.1449046\nF : Type ?u.1449049\nG : Type ?u.1449052\nι : Type ?u.1449055\ninst✝² : NormedField 𝕜\ninst✝¹ : S... | [
1207,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1205,
1
] |
Mathlib/Topology/Algebra/ConstMulAction.lean | set_smul_mem_nhds_zero_iff | [
{
"state_after": "M : Type ?u.171187\nα : Type u_1\nβ : Type ?u.171193\nΓ : Type ?u.171196\ninst✝⁷ : Group Γ\nT : Type ?u.171202\ninst✝⁶ : TopologicalSpace T\ninst✝⁵ : MulAction Γ T\nG₀ : Type u_2\ninst✝⁴ : GroupWithZero G₀\ninst✝³ : AddMonoid α\ninst✝² : DistribMulAction G₀ α\ninst✝¹ : TopologicalSpace α\ninst... | [
574,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
571,
1
] |
Mathlib/GroupTheory/Transfer.lean | MonoidHom.not_dvd_card_ker_transferSylow | [] | [
271,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/Algebra/Order/Floor.lean | Nat.lt_floor_add_one | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.23549\nα : Type u_1\nβ : Type ?u.23555\ninst✝¹ : LinearOrderedSemiring α\ninst✝ : FloorSemiring α\na✝ : α\nn : ℕ\na : α\n⊢ a < ↑⌊a⌋₊ + 1",
"tactic": "simpa using lt_succ_floor a"
}
] | [
164,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Data/Multiset/Sort.lean | Multiset.mem_sort | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nr : α → α → Prop\ninst✝³ : DecidableRel r\ninst✝² : IsTrans α r\ninst✝¹ : IsAntisymm α r\ninst✝ : IsTotal α r\ns : Multiset α\na : α\n⊢ a ∈ sort r s ↔ a ∈ s",
"tactic": "rw [← mem_coe, sort_eq]"
}
] | [
53,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | Orthonormal.tsum_inner_products_le | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.3500272\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nι : Type u_3\nx : E\nv : ι → E\nhv : Orthonormal 𝕜 v\n⊢ 0 ≤ ‖x‖ ^ 2",
... | [
1905,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1902,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Fin.dist_insertNth_insertNth | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u\nβ : Type v\nX : Type ?u.421600\nι : Type ?u.421603\ninst✝³ : PseudoMetricSpace α✝\nπ : β → Type ?u.421611\ninst✝² : Fintype β\ninst✝¹ : (b : β) → PseudoMetricSpace (π b)\nn : ℕ\nα : Fin (n + 1) → Type u_1\ninst✝ : (i : Fin (n + 1)) → PseudoMetricSpa... | [
2088,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2085,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.toReal_coe | [] | [
282,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean | GromovHausdorff.HD_continuous | [] | [
413,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
412,
9
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.sum_range_tsub | [
{
"state_after": "case base\nι : Type ?u.627204\nβ : Type u\nα : Type v\nγ : Type w\ns s₁ s₂ : Finset α\na : α\nf✝ g : α → β\ninst✝⁴ : CommMonoid β\ninst✝³ : CanonicallyOrderedAddMonoid α\ninst✝² : Sub α\ninst✝¹ : OrderedSub α\ninst✝ : ContravariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1\nf : ℕ → ... | [
1436,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1427,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean | HomogeneousLocalization.eq_num_div_den | [
{
"state_after": "ι : Type u_1\nR : Type u_2\nA : Type u_3\ninst✝⁵ : AddCommMonoid ι\ninst✝⁴ : DecidableEq ι\ninst✝³ : CommRing R\ninst✝² : CommRing A\ninst✝¹ : Algebra R A\n𝒜 : ι → Submodule R A\ninst✝ : GradedAlgebra 𝒜\nx : Submonoid A\nf : HomogeneousLocalization 𝒜 x\nthis : Quotient.mk'' (Quotient.out' f... | [
532,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
526,
1
] |
Mathlib/RingTheory/Subring/Pointwise.lean | Subring.pointwise_smul_toAddSubgroup | [] | [
68,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.mem_sInf | [] | [
437,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/Analysis/Seminorm.lean | Seminorm.coe_lt_coe | [] | [
269,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.SOppSide.trans_wOppSide | [] | [
616,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
614,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithTop.one_le_coe | [] | [
65,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/GroupTheory/SemidirectProduct.lean | SemidirectProduct.rightHom_inr | [
{
"state_after": "no goals",
"state_before": "N : Type u_2\nG : Type u_1\nH : Type ?u.117474\ninst✝² : Group N\ninst✝¹ : Group G\ninst✝ : Group H\nφ : G →* MulAut N\ng : G\n⊢ ↑rightHom (↑inr g) = g",
"tactic": "simp [rightHom]"
}
] | [
202,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Logic/Nonempty.lean | nonempty_psum | [] | [
96,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.lt_iff_exists_rat_btwn | [
{
"state_after": "case intro.intro\nα : Type ?u.125408\nβ : Type ?u.125411\nb c d : ℝ≥0∞\nr p✝ q p : ℝ≥0\nright✝ h : ↑p < b\n⊢ ∃ q, 0 ≤ q ∧ ↑p < ↑(Real.toNNReal ↑q) ∧ ↑(Real.toNNReal ↑q) < b",
"state_before": "α : Type ?u.125408\nβ : Type ?u.125411\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nh : a < b\n⊢ ∃ q, 0 ≤ q ∧ a <... | [
815,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
807,
1
] |
src/lean/Init/Prelude.lean | congrArg | [] | [
350,
10
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
349,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.frequently_iSup | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.174182\nι : Sort x\np : α → Prop\nfs : β → Filter α\n⊢ (∃ᶠ (x : α) in ⨆ (b : β), fs b, p x) ↔ ∃ b, ∃ᶠ (x : α) in fs b, p x",
"tactic": "simp only [Filter.Frequently, eventually_iSup, not_forall]"
}
] | [
1412,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1410,
1
] |
Mathlib/CategoryTheory/Types.lean | CategoryTheory.FunctorToTypes.hom_inv_id_app_apply | [] | [
181,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Logic/Basic.lean | eqRec_heq' | [
{
"state_after": "α : Sort u_1\na' : α\nmotive : (a : α) → a' = a → Sort u\np : motive a' (_ : a' = a')\n⊢ HEq ((_ : a' = a') ▸ p) p",
"state_before": "α : Sort u_1\na' : α\nmotive : (a : α) → a' = a → Sort u\np : motive a' (_ : a' = a')\na : α\nt : a' = a\n⊢ HEq (t ▸ p) p",
"tactic": "subst t"
},
{... | [
563,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
560,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.filter_eq_empty_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.323706\nγ : Type ?u.323709\np q : α → Prop\ninst✝¹ : DecidablePred p\ninst✝ : DecidablePred q\ns : Finset α\n⊢ filter p s = ∅ → ∀ (x : α), x ∈ s → ¬p x",
"state_before": "α : Type u_1\nβ : Type ?u.323706\nγ : Type ?u.323709\np q : α → Prop\ninst✝¹ : DecidablePred ... | [
2711,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2707,
1
] |
Mathlib/Algebra/Module/Submodule/Pointwise.lean | Submodule.neg_iSup | [] | [
143,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Topology/Semicontinuous.lean | continuousWithinAt_iff_lower_upperSemicontinuousWithinAt | [
{
"state_after": "α : Type u_1\ninst✝⁴ : TopologicalSpace α\nβ : Type ?u.220201\ninst✝³ : Preorder β\nf✝ g : α → β\nx : α\ns t : Set α\ny z : β\nγ : Type u_2\ninst✝² : LinearOrder γ\ninst✝¹ : TopologicalSpace γ\ninst✝ : OrderTopology γ\nf : α → γ\n⊢ LowerSemicontinuousWithinAt f s x ∧ UpperSemicontinuousWithinA... | [
1101,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1073,
1
] |
Mathlib/Topology/Category/Compactum.lean | Compactum.str_hom_commute | [
{
"state_after": "X Y : Compactum\nf : X ⟶ Y\nxs : Ultrafilter X.A\n⊢ (X.a ≫ f.f) xs = str Y (Ultrafilter.map f.f xs)",
"state_before": "X Y : Compactum\nf : X ⟶ Y\nxs : Ultrafilter X.A\n⊢ Monad.Algebra.Hom.f f (str X xs) = str Y (Ultrafilter.map f.f xs)",
"tactic": "change (X.a ≫ f.f) _ = _"
},
{
... | [
157,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Algebra/Order/Hom/Ring.lean | OrderRingHom.cancel_left | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.49422\nα : Type u_3\nβ : Type u_1\nγ : Type u_2\nδ : Type ?u.49434\ninst✝⁷ : NonAssocSemiring α\ninst✝⁶ : Preorder α\ninst✝⁵ : NonAssocSemiring β\ninst✝⁴ : Preorder β\ninst✝³ : NonAssocSemiring γ\ninst✝² : Preorder γ\ninst✝¹ : NonAssocSemiring δ\nins... | [
338,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
336,
1
] |
Mathlib/Topology/NoetherianSpace.lean | TopologicalSpace.NoetherianSpace.exists_finset_irreducible | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.17376\ninst✝² : TopologicalSpace α\ninst✝¹ : TopologicalSpace β\ninst✝ : NoetherianSpace α\ns : Closeds α\n⊢ ∃ S, (∀ (k : { x // x ∈ S }), IsIrreducible ↑↑k) ∧ s = Finset.sup S id",
"tactic": "simpa [Set.exists_finite_iff_finset, Fi... | [
210,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/Data/Set/Intervals/Monotone.lean | strictAntiOn_Iic_of_succ_lt | [] | [
261,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.refl_apply | [] | [
377,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
377,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | one_le_div' | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝² : Group α\ninst✝¹ : LE α\ninst✝ : CovariantClass α α (swap fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\na b c d : α\n⊢ 1 ≤ a / b ↔ b ≤ a",
"tactic": "rw [← mul_le_mul_iff_right b, one_mul, div_eq_mul_inv, inv_mul_cancel_right]"
}
] | [
728,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
727,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | IsClosed.measurableSet | [] | [
326,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/Algebra/Module/Torsion.lean | Submodule.pow_pOrder_smul | [] | [
781,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
779,
1
] |
Mathlib/Data/Polynomial/Taylor.lean | Polynomial.taylor_eval | [
{
"state_after": "no goals",
"state_before": "R✝ : Type ?u.222958\ninst✝¹ : Semiring R✝\nr✝ : R✝\nf✝ : R✝[X]\nR : Type u_1\ninst✝ : CommSemiring R\nr : R\nf : R[X]\ns : R\n⊢ eval s (↑(taylor r) f) = eval (s + r) f",
"tactic": "simp only [taylor_apply, eval_comp, eval_C, eval_X, eval_add]"
}
] | [
126,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Analysis/Complex/Basic.lean | IsROrC.im_to_complex | [] | [
466,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
465,
1
] |
Mathlib/Data/Polynomial/FieldDivision.lean | Polynomial.mod_X_sub_C_eq_C_eval | [] | [
211,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Analysis/Convex/Strict.lean | Convex.strictConvex_of_open | [] | [
116,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
11
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.measure_biUnion_eq_iSup | [
{
"state_after": "α : Type u_1\nβ : Type ?u.52533\nγ : Type ?u.52536\nδ : Type ?u.52539\nι : Type u_2\nR : Type ?u.52545\nR' : Type ?u.52548\nm : MeasurableSpace α\nμ μ₁ μ₂ : Measure α\ns✝ s₁ s₂ t✝ : Set α\ns : ι → Set α\nt : Set ι\nht : Set.Countable t\nhd : DirectedOn ((fun x x_1 => x ⊆ x_1) on s) t\nthis : E... | [
490,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
487,
1
] |
Mathlib/RingTheory/DedekindDomain/PID.lean | IsPrincipalIdealRing.of_finite_primes | [
{
"state_after": "case inl\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : IsDomain R\ninst✝ : IsDedekindDomain R\nh : Set.Finite {I | IsPrime I}\n⊢ Submodule.IsPrincipal ⊥\n\ncase inr\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : IsDomain R\ninst✝ : IsDedekindDomain R\nh : Set.Finite {I | IsPrime I}\nI : Ideal R\n... | [
193,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.C_mul_monomial | [
{
"state_after": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np q : MvPolynomial σ R\n⊢ AddMonoidAlgebra.single 0 a * AddMonoidAlgebra.single s a' = AddMonoidAlgebra.single s (a * a')",
"state_... | [
220,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | RingEquiv.sofLeftInverse'_apply | [] | [
997,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
995,
1
] |
Mathlib/Order/Filter/Extr.lean | IsMaxOn.comp_antitone | [] | [
363,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Algebra/Algebra/Spectrum.lean | spectrum.units_smul_resolvent_self | [
{
"state_after": "no goals",
"state_before": "R : Type u\nA : Type v\ninst✝² : CommSemiring R\ninst✝¹ : Ring A\ninst✝ : Algebra R A\nr : Rˣ\na : A\n⊢ r • resolvent a ↑r = resolvent (r⁻¹ • a) 1",
"tactic": "simpa only [Units.smul_def, Algebra.id.smul_eq_mul, Units.inv_mul] using\n @units_smul_resolvent ... | [
172,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/Order/SymmDiff.lean | hnot_symmDiff_self | [
{
"state_after": "ι : Type ?u.55295\nα : Type u_1\nβ : Type ?u.55301\nπ : ι → Type ?u.55306\ninst✝ : CoheytingAlgebra α\na : α\n⊢ ⊤ ≤ ￢a ⊔ a",
"state_before": "ι : Type ?u.55295\nα : Type u_1\nβ : Type ?u.55301\nπ : ι → Type ?u.55306\ninst✝ : CoheytingAlgebra α\na : α\n⊢ (￢a) ∆ a = ⊤",
"tactic": "rw [eq... | [
351,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
349,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.eq_top_iff_forall_lt | [
{
"state_after": "case mp\nx : EReal\n⊢ x = ⊤ → ∀ (y : ℝ), ↑y < x\n\ncase mpr\nx : EReal\n⊢ (∀ (y : ℝ), ↑y < x) → x = ⊤",
"state_before": "x : EReal\n⊢ x = ⊤ ↔ ∀ (y : ℝ), ↑y < x",
"tactic": "constructor"
},
{
"state_after": "case mp\n\n⊢ ∀ (y : ℝ), ↑y < ⊤",
"state_before": "case mp\nx : ERea... | [
436,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
430,
1
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.isCauSeq_re | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\nE : Type ?u.7199108\ninst✝ : IsROrC K\nf : CauSeq K norm\nε : ℝ\nε0 : ε > 0\ni : ℕ\nH : ∀ (j : ℕ), j ≥ i → ‖↑f j - ↑f i‖ < ε\nj : ℕ\nij : j ≥ i\n⊢ abs ((fun n => ↑re (↑f n)) j - (fun n => ↑re (↑f n)) i) ≤ ‖↑f j - ↑f i‖",
"tactic": "simpa only [... | [
777,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
775,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | Continuous.measurable | [] | [
819,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
818,
1
] |
Mathlib/Topology/SubsetProperties.lean | subset_closure_inter_of_isPreirreducible_of_isOpen | [
{
"state_after": "α : Type u\nβ : Type v\nι : Type ?u.204087\nπ : ι → Type ?u.204092\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpace β\ns t S U : Set α\nhS : IsPreirreducible S\nhU : IsOpen U\nh : Set.Nonempty (S ∩ U)\nh' : ¬S ⊆ closure (S ∩ U)\n⊢ False",
"state_before": "α : Type u\nβ : Type v\nι : ... | [
1956,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1951,
1
] |
Mathlib/Analysis/InnerProductSpace/PiL2.lean | DirectSum.IsInternal.collectedOrthonormalBasis_mem | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nι' : Type ?u.1598118\n𝕜 : Type u_3\ninst✝¹¹ : IsROrC 𝕜\nE : Type u_2\ninst✝¹⁰ : NormedAddCommGroup E\ninst✝⁹ : InnerProductSpace 𝕜 E\nE' : Type ?u.1598147\ninst✝⁸ : NormedAddCommGroup E'\ninst✝⁷ : InnerProductSpace 𝕜 E'\nF : Type ?u.1598165\nin... | [
763,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
758,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.isCycle_iff_sameCycle | [
{
"state_after": "ι : Type ?u.347151\nα : Type u_1\nβ : Type ?u.347157\nf g : Perm α\nx y✝ : α\nhx : ↑f x ≠ x\nhf : IsCycle f\ny : α\nx✝ : SameCycle f x y\nhy : ↑f y = y\ni : ℤ\nhi : x = y\n⊢ ↑f x = x",
"state_before": "ι : Type ?u.347151\nα : Type u_1\nβ : Type ?u.347157\nf g : Perm α\nx y✝ : α\nhx : ↑f x ... | [
347,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/Topology/VectorBundle/Basic.lean | VectorBundleCore.localTrivAt_apply | [] | [
754,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
753,
1
] |
Mathlib/Computability/Primrec.lean | Nat.Primrec'.to_prim | [
{
"state_after": "case zero\nn : ℕ\nf : Vector ℕ n → ℕ\n⊢ Primrec fun x => 0\n\ncase succ\nn : ℕ\nf : Vector ℕ n → ℕ\n⊢ Primrec fun v => Nat.succ (head v)\n\ncase get\nn : ℕ\nf : Vector ℕ n → ℕ\nn✝ : ℕ\ni✝ : Fin n✝\n⊢ Primrec fun v => Vector.get v i✝\n\ncase comp\nn : ℕ\nf : Vector ℕ n → ℕ\nm✝ n✝ : ℕ\nf✝ : Vect... | [
1394,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1382,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.coe_dfinsupp_sum | [] | [
1152,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1151,
1
] |
Mathlib/Data/List/Basic.lean | List.singleton_eq | [] | [
251,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
250,
1
] |
Mathlib/RingTheory/FreeCommRing.lean | FreeCommRing.map_subtype_val_restriction | [
{
"state_after": "case refine'_1\nα : Type u\nβ : Type v\nf : α → β\nx : FreeCommRing α\ns : Set α\ninst✝ : DecidablePred fun x => x ∈ s\nhxs : IsSupported x s\n⊢ ↑(map Subtype.val) (↑(restriction s) 1) = 1\n\ncase refine'_2\nα : Type u\nβ : Type v\nf : α → β\nx : FreeCommRing α\ns : Set α\ninst✝ : DecidablePre... | [
282,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
272,
1
] |
Mathlib/Algebra/Order/Nonneg/Floor.lean | Nonneg.nat_ceil_coe | [] | [
55,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Order/RelClasses.lean | Subsingleton.isWellOrder | [] | [
484,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
479,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.degree_of_d_ne_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nS : Type ?u.584827\nF : Type ?u.584830\nK : Type ?u.584833\nP Q : Cubic R\na b c d a' b' c' d' : R\ninst✝ : Semiring R\nha : P.a = 0\nhb : P.b = 0\nhc : P.c = 0\nhd : P.d ≠ 0\n⊢ degree (toPoly P) = 0",
"tactic": "rw [of_c_eq_zero ha hb hc, degr... | [
360,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
358,
1
] |
Mathlib/Algebra/Hom/Ring.lean | RingHom.toAddMonoidHom_eq_coe | [] | [
493,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
492,
1
] |
Mathlib/Analysis/Complex/Isometry.lean | rotation_injective | [] | [
90,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Std/Data/List/Lemmas.lean | List.Subset.trans | [] | [
236,
23
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
235,
1
] |
Mathlib/Analysis/Calculus/Deriv/Prod.lean | hasStrictDerivAt_pi | [] | [
91,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/MeasureTheory/Covering/BesicovitchVectorSpace.lean | Besicovitch.goodδ_lt_one | [] | [
292,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Topology/DenseEmbedding.lean | DenseInducing.separableSpace | [] | [
110,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
11
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.