ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/NumberTheory/ModularForms/JacobiTheta/Bounds.lean
a : ℝ
ha : a ∈ Ico 0 1
p : ℝ
hp : 0 < p
hp' : (fun t => F_nat 0 a t - if a = 0 then 1 else 0) =O[atTop] fun t => rexp (-p * t)
q : ℝ
hq : 0 < q
ha' : ↑a = 0 ↔ a = 0
hq' : (fun t => F_nat 0 (1 - a) t) =O[atTop] fun t => rexp (-q * t)
this : (fun t => F_int 0 (↑a) t - if a = 0 then 1 else 0) =ᶠ[atTop] fun t => (F_nat 0 a t - if a = 0 then 1 else 0) + F_nat 0 (1 - a) t
\u22a2 (fun t => F_int 0 (↑a) t - if a = 0 then 1 else 0) =O[atTop] fun t => rexp (-min p q * t)
-- Mathlib/NumberTheory/ModularForms/JacobiTheta/Bounds.lean
a : ℝ
ha : a ∈ Ico 0 1
p : ℝ
hp : 0 < p
hp' : (fun t => F_nat 0 a t - if a = 0 then 1 else 0) =O[atTop] fun t => rexp (-p * t)
q : ℝ
hq : 0 < q
ha' : ↑a = 0 ↔ a = 0
hq' : (fun t => F_nat 0 (1 - a) t) =O[atTop] fun t => rexp (-q * t)
this : (fun t => F_int 0 (↑a) t - if a = 0 then 1 else 0) =ᶠ[atTop] fun t => (F_nat 0 a t - if a = 0 then 1 else 0) + F_nat 0 (1 - a) t
\u22a2 min p q ≤ p
-- Mathlib/NumberTheory/ModularForms/JacobiTheta/Bounds.lean
a : ℝ
ha : a ∈ Ico 0 1
p : ℝ
hp : 0 < p
hp' : (fun t => F_nat 0 a t - if a = 0 then 1 else 0) =O[atTop] fun t => rexp (-p * t)
q : ℝ
hq : 0 < q
ha' : ↑a = 0 ↔ a = 0
hq' : (fun t => F_nat 0 (1 - a) t) =O[atTop] fun t => rexp (-q * t)
this : (fun t => F_int 0 (↑a) t - if a = 0 then 1 else 0) =ᶠ[atTop] fun t => (F_nat 0 a t - if a = 0 then 1 else 0) + F_nat 0 (1 - a) t
\u22a2 min p q ≤ q
-- Mathlib/Logic/Encodable/Basic.lean
α : Type u_1
β : Type u_2
inst✝¹ : Encodable α
inst✝ : Inhabited α
r : β → β → Prop
f : α → β
hf : Directed r f
a : α
\u22a2 r (f a) (f (Directed.sequence f hf (encode a + 1)))
-- Mathlib/Logic/Encodable/Basic.lean
α : Type u_1
β : Type u_2
inst✝¹ : Encodable α
inst✝ : Inhabited α
r : β → β → Prop
f : α → β
hf : Directed r f
a : α
\u22a2 r (f a) (f (Classical.choose ⋯))
-- Mathlib/Analysis/SpecialFunctions/Log/Base.lean
b x y : ℝ
b_pos : 0 < b
b_lt_one : b < 1
hy : 0 < y
\u22a2 x ≤ logb b y ↔ y ≤ b ^ x
-- Mathlib/Algebra/Ring/Subring/Basic.lean
R : Type u
S✝ : Type v
T : Type w
inst✝² : Ring R
inst✝¹ : Ring S✝
inst✝ : Ring T
ι : Sort u_1
S : ι → Subring R
x : R
\u22a2 x ∈ ⨅ i, S i ↔ ∀ (i : ι), x ∈ S i
-- Mathlib/RingTheory/Idempotents.lean
R : Type u_1
S : Type u_2
inst✝² : Ring R
inst✝¹ : Ring S
f : R →+* S
I : Type u_3
e : I → R
he✝¹ : OrthogonalIdempotents e
inst✝ : Fintype I
he✝ : CompleteOrthogonalIdempotents e
he : OrthogonalIdempotents e
\u22a2 (1 - ∑ i : I, e i) * ∑ i : I, e i = 0
-- Mathlib/RingTheory/Idempotents.lean
R : Type u_1
S : Type u_2
inst✝² : Ring R
inst✝¹ : Ring S
f : R →+* S
I : Type u_3
e : I → R
he✝¹ : OrthogonalIdempotents e
inst✝ : Fintype I
he✝ : CompleteOrthogonalIdempotents e
he : OrthogonalIdempotents e
\u22a2 (∑ i : I, e i) * (1 - ∑ i : I, e i) = 0
-- Mathlib/RingTheory/Idempotents.lean
R : Type u_1
S : Type u_2
inst✝² : Ring R
inst✝¹ : Ring S
f : R →+* S
I : Type u_3
e : I → R
he✝¹ : OrthogonalIdempotents e
inst✝ : Fintype I
he✝ : CompleteOrthogonalIdempotents e
he : OrthogonalIdempotents e
\u22a2 ∑ i : Option I, i.elim (1 - ∑ i : I, e i) e = 1
-- Mathlib/RingTheory/Idempotents.lean
R : Type u_1
S : Type u_2
inst✝² : Ring R
inst✝¹ : Ring S
f : R →+* S
I : Type u_3
e : I → R
he✝¹ : OrthogonalIdempotents e
inst✝ : Fintype I
he✝ : CompleteOrthogonalIdempotents e
he : OrthogonalIdempotents e
\u22a2 none.elim (1 - ∑ i : I, e i) e + ∑ i : I, (some i).elim (1 - ∑ i : I, e i) e = 1
-- Mathlib/SetTheory/Cardinal/Cofinality.lean
α✝ : Type u_1
r : α✝ → α✝ → Prop
β α : Type u
s : Set β
f : ↑s → α
θ : Cardinal.{u}
hθ : θ ≤ #↑s
h₁ : ℵ₀ ≤ θ
h₂ : #α < θ.ord.cof
\u22a2 ∃ a t, ∃ (h : t ⊆ s), θ ≤ #↑t ∧ ∀ ⦃x : β⦄ (hx : x ∈ t), f ⟨x, ⋯⟩ = a
-- Mathlib/SetTheory/Cardinal/Cofinality.lean
α✝ : Type u_1
r : α✝ → α✝ → Prop
β α : Type u
s : Set β
f : ↑s → α
θ : Cardinal.{u}
hθ : θ ≤ #↑s
h₁ : ℵ₀ ≤ θ
h₂ : #α < θ.ord.cof
a : α
ha : θ ≤ #↑(f ⁻¹' {a})
\u22a2 ∃ a t, ∃ (h : t ⊆ s), θ ≤ #↑t ∧ ∀ ⦃x : β⦄ (hx : x ∈ t), f ⟨x, ⋯⟩ = a
-- Mathlib/NumberTheory/RamificationInertia.lean
R : Type u
inst✝² : CommRing R
S : Type v
inst✝¹ : CommRing S
f : R →+* S
p : Ideal R
P : Ideal S
inst✝ : IsDedekindDomain S
hp0 : map f p ≠ ⊥
hP : P.IsPrime
hP0 : P ≠ ⊥
\u22a2 ramificationIdx f p P = Multiset.count P (factors (map f p))
-- Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
α : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
m m0 : MeasurableSpace α
p✝ : ℝ≥0∞
q : ℝ
μ ν : Measure α
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedAddCommGroup G
p : ℝ≥0∞
c : F
hp_ne_zero : p ≠ 0
hp_ne_top : p ≠ ⊤
\u22a2 eLpNorm (fun x => c) p μ < ⊤ ↔ c = 0 ∨ μ Set.univ < ⊤
-- Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
α : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
m m0 : MeasurableSpace α
p✝ : ℝ≥0∞
q : ℝ
μ ν : Measure α
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedAddCommGroup G
p : ℝ≥0∞
c : F
hp_ne_zero : p ≠ 0
hp_ne_top : p ≠ ⊤
hp : 0 < p.toReal
\u22a2 eLpNorm (fun x => c) p μ < ⊤ ↔ c = 0 ∨ μ Set.univ < ⊤
-- Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
α : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
m m0 : MeasurableSpace α
p✝ : ℝ≥0∞
q : ℝ
μ ν : Measure α
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedAddCommGroup G
p : ℝ≥0∞
c : F
hp_ne_zero : p ≠ 0
hp_ne_top : p ≠ ⊤
hp : 0 < p.toReal
hμ : ¬μ = 0
hc : ¬c = 0
\u22a2 eLpNorm (fun x => c) p μ < ⊤ ↔ c = 0 ∨ μ Set.univ < ⊤
-- Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
α : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
m m0 : MeasurableSpace α
p✝ : ℝ≥0∞
q : ℝ
μ ν : Measure α
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedAddCommGroup G
p : ℝ≥0∞
c : F
hp_ne_zero : p ≠ 0
hp_ne_top : p ≠ ⊤
hp : 0 < p.toReal
hμ : ¬μ = 0
hc : ¬c = 0
\u22a2 ↑‖c‖₊ * μ Set.univ ^ (1 / p.toReal) < ⊤ ↔ c = 0 ∨ μ Set.univ < ⊤
-- Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
α : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
m m0 : MeasurableSpace α
p✝ : ℝ≥0∞
q : ℝ
μ ν : Measure α
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedAddCommGroup G
p : ℝ≥0∞
c : F
hp_ne_zero : p ≠ 0
hp_ne_top : p ≠ ⊤
hp : 0 < p.toReal
hμ : ¬μ = 0
hc : ¬c = 0
hμ_top : ¬μ Set.univ = ⊤
\u22a2 ↑‖c‖₊ * μ Set.univ ^ (1 / p.toReal) < ⊤ ↔ c = 0 ∨ μ Set.univ < ⊤
-- Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
α : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
m m0 : MeasurableSpace α
p✝ : ℝ≥0∞
q : ℝ
μ ν : Measure α
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedAddCommGroup G
p : ℝ≥0∞
c : F
hp_ne_zero : p ≠ 0
hp_ne_top : p ≠ ⊤
hp : 0 < p.toReal
hμ : ¬μ = 0
hc : ¬c = 0
hμ_top : ¬μ Set.univ = ⊤
\u22a2 ↑‖c‖₊ < ⊤ ∧ μ Set.univ ^ (1 / p.toReal) < ⊤ ∨ ↑‖c‖₊ = 0 ∨ μ Set.univ ^ (1 / p.toReal) = 0 ↔ c = 0 ∨ μ Set.univ < ⊤
-- Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
α : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
m m0 : MeasurableSpace α
p✝ : ℝ≥0∞
q : ℝ
μ ν : Measure α
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedAddCommGroup G
p : ℝ≥0∞
c : F
hp_ne_zero : p ≠ 0
hp_ne_top : p ≠ ⊤
hp : 0 < p.toReal
hμ : ¬μ = 0
hc : ¬c = 0
hμ_top : ¬μ Set.univ = ⊤
\u22a2 μ Set.univ ^ p.toReal⁻¹ < ⊤
-- Mathlib/Order/Iterate.lean
α : Type u_1
inst✝ : LinearOrder α
f g : α → α
h : Commute f g
hf : Monotone f
hg : StrictMono g
x : α
n : ℕ
hn : 0 < n
\u22a2 f^[n] x ≤ g^[n] x ↔ f x ≤ g x
-- Mathlib/Data/List/Range.lean
α : Type u
l : List α
\u22a2 l.enum.unzip = (range l.length, l)
-- Mathlib/Data/Nat/Bitwise.lean
n m m' : ℕ
h : m ^^^ n = m' ^^^ n
\u22a2 m = m'
-- Mathlib/Data/List/MinMax.lean
α : Type u_1
β : Type u_2
inst✝ : LinearOrder α
l : List α
a m : α
i : ℕ
w : i < l.length
h : optParam (0 < l.length) ⋯
\u22a2 l[i] ≤ maximum_of_length_pos h
-- Mathlib/Data/List/MinMax.lean
α : Type u_1
β : Type u_2
inst✝ : LinearOrder α
l : List α
a m : α
i : ℕ
w : i < l.length
h : optParam (0 < l.length) ⋯
\u22a2 l[i] ∈ l
-- Mathlib/Analysis/SpecialFunctions/Pow/Real.lean
x✝ y✝ z x y : ℝ
\u22a2 |x ^ y| ≤ |x| ^ y
-- Mathlib/Analysis/SpecialFunctions/Pow/Real.lean
x✝ y✝ z x y : ℝ
hx : 0 ≤ x
\u22a2 |x ^ y| ≤ |x| ^ y
-- Mathlib/Analysis/SpecialFunctions/Pow/Real.lean
x✝ y✝ z x y : ℝ
hx : x < 0
\u22a2 |x ^ y| ≤ |x| ^ y
-- Mathlib/Topology/Sets/Closeds.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝² : TopologicalSpace α
inst✝¹ : TopologicalSpace β
inst✝ : T1Space α
s : Closeds α
\u22a2 IsAtom s ↔ ∃ x, s = singleton x
-- Mathlib/Topology/Compactification/OnePoint.lean
X : Type u_1
inst✝ : TopologicalSpace X
s : Set (OnePoint X)
t : Set X
h : ∞ ∈ s
\u22a2 IsOpen s ↔ IsCompact (some ⁻¹' s)ᶜ ∧ IsOpen (some ⁻¹' s)
-- Mathlib/MeasureTheory/Constructions/Prod/Integral.lean
α : Type u_1
α' : Type u_2
β : Type u_3
β' : Type u_4
γ : Type u_5
E : Type u_6
inst✝⁶ : MeasurableSpace α
inst✝⁵ : MeasurableSpace α'
inst✝⁴ : MeasurableSpace β
inst✝³ : MeasurableSpace β'
inst✝² : MeasurableSpace γ
μ μ' : Measure α
ν ν' : Measure β
τ : Measure γ
inst✝¹ : NormedAddCommGroup E
inst✝ : SFinite ν
f : α × β → E
h1f : StronglyMeasurable f
\u22a2 HasFiniteIntegral f (μ.prod ν) ↔ (∀ᵐ (x : α) ∂μ, HasFiniteIntegral (fun y => f (x, y)) ν) ∧ HasFiniteIntegral (fun x => ∫ (y : β), ‖f (x, y)‖ ∂ν) μ
-- Mathlib/MeasureTheory/Constructions/Prod/Integral.lean
α : Type u_1
α' : Type u_2
β : Type u_3
β' : Type u_4
γ : Type u_5
E : Type u_6
inst✝⁶ : MeasurableSpace α
inst✝⁵ : MeasurableSpace α'
inst✝⁴ : MeasurableSpace β
inst✝³ : MeasurableSpace β'
inst✝² : MeasurableSpace γ
μ μ' : Measure α
ν ν' : Measure β
τ : Measure γ
inst✝¹ : NormedAddCommGroup E
inst✝ : SFinite ν
f : α × β → E
h1f : StronglyMeasurable f
\u22a2 ∫⁻ (x : α), ∫⁻ (y : β), ↑‖f (x, y)‖₊ ∂ν ∂μ < ⊤ ↔ (∀ᵐ (x : α) ∂μ, ∫⁻ (a : β), ↑‖f (x, a)‖₊ ∂ν < ⊤) ∧ ∫⁻ (a : α), ↑‖∫ (y : β), ‖f (a, y)‖ ∂ν‖₊ ∂μ < ⊤
-- Mathlib/MeasureTheory/Constructions/Prod/Integral.lean
α : Type u_1
α' : Type u_2
β : Type u_3
β' : Type u_4
γ : Type u_5
E : Type u_6
inst✝⁶ : MeasurableSpace α
inst✝⁵ : MeasurableSpace α'
inst✝⁴ : MeasurableSpace β
inst✝³ : MeasurableSpace β'
inst✝² : MeasurableSpace γ
μ μ' : Measure α
ν ν' : Measure β
τ : Measure γ
inst✝¹ : NormedAddCommGroup E
inst✝ : SFinite ν
f : α × β → E
h1f : StronglyMeasurable f
this : ∀ (x : α), ∀ᵐ (y : β) ∂ν, 0 ≤ ‖f (x, y)‖
\u22a2 ∫⁻ (x : α), ∫⁻ (y : β), ↑‖f (x, y)‖₊ ∂ν ∂μ < ⊤ ↔ (∀ᵐ (x : α) ∂μ, ∫⁻ (a : β), ↑‖f (x, a)‖₊ ∂ν < ⊤) ∧ ∫⁻ (a : α), ↑‖∫ (y : β), ‖f (a, y)‖ ∂ν‖₊ ∂μ < ⊤
-- Mathlib/MeasureTheory/Constructions/Prod/Integral.lean
α : Type u_1
α' : Type u_2
β : Type u_3
β' : Type u_4
γ : Type u_5
E : Type u_6
inst✝⁶ : MeasurableSpace α
inst✝⁵ : MeasurableSpace α'
inst✝⁴ : MeasurableSpace β
inst✝³ : MeasurableSpace β'
inst✝² : MeasurableSpace γ
μ μ' : Measure α
ν ν' : Measure β
τ : Measure γ
inst✝¹ : NormedAddCommGroup E
inst✝ : SFinite ν
f : α × β → E
h1f : StronglyMeasurable f
this : ∀ (x : α), ∀ᵐ (y : β) ∂ν, 0 ≤ ‖f (x, y)‖
\u22a2 ∫⁻ (x : α), ∫⁻ (y : β), ↑‖f (x, y)‖₊ ∂ν ∂μ < ⊤ ↔ (∀ᵐ (x : α) ∂μ, ∫⁻ (a : β), ↑‖f (x, a)‖₊ ∂ν < ⊤) ∧ ∫⁻ (a : α), ENNReal.ofReal (∫⁻ (a_1 : β), ↑‖f (a, a_1)‖₊ ∂ν).toReal ∂μ < ⊤
-- Mathlib/MeasureTheory/Constructions/Prod/Integral.lean
α : Type u_1
α' : Type u_2
β : Type u_3
β' : Type u_4
γ : Type u_5
E : Type u_6
inst✝⁶ : MeasurableSpace α
inst✝⁵ : MeasurableSpace α'
inst✝⁴ : MeasurableSpace β
inst✝³ : MeasurableSpace β'
inst✝² : MeasurableSpace γ
μ μ' : Measure α
ν ν' : Measure β
τ : Measure γ
inst✝¹ : NormedAddCommGroup E
inst✝ : SFinite ν
f : α × β → E
h1f : StronglyMeasurable f
this✝ : ∀ (x : α), ∀ᵐ (y : β) ∂ν, 0 ≤ ‖f (x, y)‖
this : ∀ {p q r : Prop}, (r → p) → ((r ↔ p ∧ q) ↔ p → (r ↔ q))
\u22a2 ∫⁻ (x : α), ∫⁻ (y : β), ↑‖f (x, y)‖₊ ∂ν ∂μ < ⊤ ↔ (∀ᵐ (x : α) ∂μ, ∫⁻ (a : β), ↑‖f (x, a)‖₊ ∂ν < ⊤) ∧ ∫⁻ (a : α), ENNReal.ofReal (∫⁻ (a_1 : β), ↑‖f (a, a_1)‖₊ ∂ν).toReal ∂μ < ⊤
-- Mathlib/Data/Sum/Order.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝¹ : LT α
inst✝ : LT β
x✝ : NoMinOrder (α ⊕ β)
a : α
\u22a2 ∃ b, b < a
-- Mathlib/Data/Sum/Order.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝¹ : LT α
inst✝ : LT β
x✝ : NoMinOrder (α ⊕ β)
a b : α
h : inl b < inl a
\u22a2 ∃ b, b < a
-- Mathlib/Data/Sum/Order.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝¹ : LT α
inst✝ : LT β
x✝ : NoMinOrder (α ⊕ β)
a : α
b : β
h : inr b < inl a
\u22a2 ∃ b, b < a
-- Mathlib/Data/Sum/Order.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝¹ : LT α
inst✝ : LT β
x✝ : NoMinOrder (α ⊕ β)
a : β
\u22a2 ∃ b, b < a
-- Mathlib/Data/Sum/Order.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝¹ : LT α
inst✝ : LT β
x✝ : NoMinOrder (α ⊕ β)
a : β
b : α
h : inl b < inr a
\u22a2 ∃ b, b < a
-- Mathlib/Data/Sum/Order.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝¹ : LT α
inst✝ : LT β
x✝ : NoMinOrder (α ⊕ β)
a b : β
h : inr b < inr a
\u22a2 ∃ b, b < a
-- Mathlib/CategoryTheory/Limits/HasLimits.lean
J : Type u₁
inst✝⁴ : Category.{v₁, u₁} J
K : Type u₂
inst✝³ : Category.{v₂, u₂} K
C : Type u
inst✝² : Category.{v, u} C
F✝ F G : J ⥤ C
inst✝¹ : HasLimit F
inst✝ : HasLimit G
c : Cone F
α : F ⟶ G
j✝ : J
\u22a2 (lift F c ≫ limMap α) ≫ π G j✝ = lift G ((Cones.postcompose α).obj c) ≫ π G j✝
-- Mathlib/CategoryTheory/Limits/HasLimits.lean
J : Type u₁
inst✝⁴ : Category.{v₁, u₁} J
K : Type u₂
inst✝³ : Category.{v₂, u₂} K
C : Type u
inst✝² : Category.{v, u} C
F✝ F G : J ⥤ C
inst✝¹ : HasLimit F
inst✝ : HasLimit G
c : Cone F
α : F ⟶ G
j✝ : J
\u22a2 c.π.app j✝ ≫ α.app j✝ = ((Cones.postcompose α).obj c).π.app j✝
-- Mathlib/Analysis/BoxIntegral/Basic.lean
ι : Type u
E : Type v
F : Type w
inst✝⁴ : NormedAddCommGroup E
inst✝³ : NormedSpace ℝ E
inst✝² : NormedAddCommGroup F
inst✝¹ : NormedSpace ℝ F
I J : Box ι
π : TaggedPrepartition I
inst✝ : Fintype ι
l : IntegrationParams
f g : (ι → ℝ) → E
vol : ι →ᵇᵃ[⊤] E →L[ℝ] F
y y' : F
h : ¬Integrable I l f vol
\u22a2 integral I l (-f) vol = -integral I l f vol
-- Mathlib/MeasureTheory/Covering/VitaliFamily.lean
α : Type u_1
inst✝ : MetricSpace α
m0 : MeasurableSpace α
μ : Measure α
v : VitaliFamily μ
ι : Sort u_2
p : ι → Prop
s : ι → Set α
x : α
h : (𝓝 x).HasBasis p s
\u22a2 (v.filterAt x).HasBasis p fun i => {t | t ∈ v.setsAt x ∧ t ⊆ s i}
-- Mathlib/CategoryTheory/Abelian/LeftDerived.lean
C : Type u
inst✝⁵ : Category.{v, u} C
D : Type u_1
inst✝⁴ : Category.{u_2, u_1} D
inst✝³ : Abelian C
inst✝² : HasProjectiveResolutions C
inst✝¹ : Abelian D
X : C
P : ProjectiveResolution X
F : C ⥤ D
inst✝ : F.Additive
\u22a2 (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as).homologyι 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = ((HomotopyCategory.homologyFunctor D (ComplexShape.down ℕ) 0).map (P.isoLeftDerivedToHomotopyCategoryObj F).hom ≫ (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex)) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex).homologyι 0 ≫ P.fromLeftDerivedZero' F
-- Mathlib/CategoryTheory/Abelian/LeftDerived.lean
C : Type u
inst✝⁵ : Category.{v, u} C
D : Type u_1
inst✝⁴ : Category.{u_2, u_1} D
inst✝³ : Abelian C
inst✝² : HasProjectiveResolutions C
inst✝¹ : Abelian D
X : C
P : ProjectiveResolution X
F : C ⥤ D
inst✝ : F.Additive
h₁ : HomologicalComplex.opcyclesMap ((F.mapHomologicalComplex (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))) 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = P.fromLeftDerivedZero' F ≫ F.map (𝟙 X)
\u22a2 (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as).homologyι 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = ((HomotopyCategory.homologyFunctor D (ComplexShape.down ℕ) 0).map (P.isoLeftDerivedToHomotopyCategoryObj F).hom ≫ (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex)) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex).homologyι 0 ≫ P.fromLeftDerivedZero' F
-- Mathlib/CategoryTheory/Abelian/LeftDerived.lean
C : Type u
inst✝⁵ : Category.{v, u} C
D : Type u_1
inst✝⁴ : Category.{u_2, u_1} D
inst✝³ : Abelian C
inst✝² : HasProjectiveResolutions C
inst✝¹ : Abelian D
X : C
P : ProjectiveResolution X
F : C ⥤ D
inst✝ : F.Additive
h₁ : HomologicalComplex.opcyclesMap ((F.mapHomologicalComplex (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))) 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = P.fromLeftDerivedZero' F ≫ F.map (𝟙 X)
h₂ : (P.isoLeftDerivedToHomotopyCategoryObj F).inv = (F.mapHomologicalComplex (ComplexShape.down ℕ) ⋙ HomotopyCategory.quotient D (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))
\u22a2 (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as).homologyι 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = ((HomotopyCategory.homologyFunctor D (ComplexShape.down ℕ) 0).map (P.isoLeftDerivedToHomotopyCategoryObj F).hom ≫ (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex)) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex).homologyι 0 ≫ P.fromLeftDerivedZero' F
-- Mathlib/CategoryTheory/Abelian/LeftDerived.lean
C : Type u
inst✝⁵ : Category.{v, u} C
D : Type u_1
inst✝⁴ : Category.{u_2, u_1} D
inst✝³ : Abelian C
inst✝² : HasProjectiveResolutions C
inst✝¹ : Abelian D
X : C
P : ProjectiveResolution X
F : C ⥤ D
inst✝ : F.Additive
h₂ : (P.isoLeftDerivedToHomotopyCategoryObj F).inv = (F.mapHomologicalComplex (ComplexShape.down ℕ) ⋙ HomotopyCategory.quotient D (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))
h₁ : HomologicalComplex.opcyclesMap ((F.mapHomologicalComplex (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))) 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = P.fromLeftDerivedZero' F
\u22a2 (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as).homologyι 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = ((HomotopyCategory.homologyFunctor D (ComplexShape.down ℕ) 0).map (P.isoLeftDerivedToHomotopyCategoryObj F).hom ≫ (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex)) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex).homologyι 0 ≫ P.fromLeftDerivedZero' F
-- Mathlib/CategoryTheory/Abelian/LeftDerived.lean
C : Type u
inst✝⁵ : Category.{v, u} C
D : Type u_1
inst✝⁴ : Category.{u_2, u_1} D
inst✝³ : Abelian C
inst✝² : HasProjectiveResolutions C
inst✝¹ : Abelian D
X : C
P : ProjectiveResolution X
F : C ⥤ D
inst✝ : F.Additive
h₂ : (P.isoLeftDerivedToHomotopyCategoryObj F).inv = (F.mapHomologicalComplex (ComplexShape.down ℕ) ⋙ HomotopyCategory.quotient D (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))
h₁ : HomologicalComplex.opcyclesMap ((F.mapHomologicalComplex (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))) 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = P.fromLeftDerivedZero' F
\u22a2 (HomotopyCategory.homologyFunctor D (ComplexShape.down ℕ) 0).map ((F.mapHomologicalComplex (ComplexShape.down ℕ) ⋙ HomotopyCategory.quotient D (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))) ≫ (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as) ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj ((projectiveResolutions C).obj X).as).homologyι 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F = (HomotopyCategory.homologyFunctorFactors D (ComplexShape.down ℕ) 0).hom.app ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj P.complex) ≫ HomologicalComplex.homologyMap ((F.mapHomologicalComplex (ComplexShape.down ℕ)).map (lift (𝟙 X) P (projectiveResolution X))) 0 ≫ ((F.mapHomologicalComplex (ComplexShape.down ℕ)).obj (projectiveResolution X).complex).homologyι 0 ≫ (projectiveResolution X).fromLeftDerivedZero' F
-- Mathlib/MeasureTheory/Measure/AEDisjoint.lean
ι : Type u_1
α : Type u_2
m : MeasurableSpace α
μ : Measure α
s t u v : Set α
\u22a2 AEDisjoint μ (s ∪ t) u ↔ AEDisjoint μ s u ∧ AEDisjoint μ t u
-- Mathlib/Algebra/GroupWithZero/Units/Basic.lean
α : Type u_1
M₀ : Type u_2
G₀ : Type u_3
M₀' : Type u_4
G₀' : Type u_5
F : Type u_6
F' : Type u_7
inst✝ : MonoidWithZero M₀
a✝ : Nontrivial M₀
\u22a2 inverse 0 = 0
-- Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
ι : Type u_1
Ω : Type u_2
inst✝¹ : MeasurableSpace Ω
inst✝ : PseudoEMetricSpace Ω
μ ν : Measure Ω
δ : ℝ≥0∞
h : ∀ (ε : ℝ≥0∞) (B : Set Ω), 0 < ε → ε < ⊤ → MeasurableSet B → μ B ≤ ν (thickening (δ + ε).toReal B) + δ + ε ∧ ν B ≤ μ (thickening (δ + ε).toReal B) + δ + ε
\u22a2 levyProkhorovEDist μ ν ≤ δ
-- Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
ι : Type u_1
Ω : Type u_2
inst✝¹ : MeasurableSpace Ω
inst✝ : PseudoEMetricSpace Ω
μ ν : Measure Ω
δ : ℝ≥0∞
h : ∀ (ε : ℝ≥0∞) (B : Set Ω), 0 < ε → ε < ⊤ → MeasurableSet B → μ B ≤ ν (thickening (δ + ε).toReal B) + δ + ε ∧ ν B ≤ μ (thickening (δ + ε).toReal B) + δ + ε
\u22a2 ∀ (ε : ℝ≥0), 0 < ε → δ < ⊤ → levyProkhorovEDist μ ν ≤ δ + ↑ε
-- Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
ι : Type u_1
Ω : Type u_2
inst✝¹ : MeasurableSpace Ω
inst✝ : PseudoEMetricSpace Ω
μ ν : Measure Ω
δ : ℝ≥0∞
h : ∀ (ε : ℝ≥0∞) (B : Set Ω), 0 < ε → ε < ⊤ → MeasurableSet B → μ B ≤ ν (thickening (δ + ε).toReal B) + δ + ε ∧ ν B ≤ μ (thickening (δ + ε).toReal B) + δ + ε
ε : ℝ≥0
hε : 0 < ε
a✝ : δ < ⊤
ε_top : ¬↑ε = ⊤
\u22a2 levyProkhorovEDist μ ν ≤ δ + ↑ε
-- Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
ι : Type u_1
Ω : Type u_2
inst✝¹ : MeasurableSpace Ω
inst✝ : PseudoEMetricSpace Ω
μ ν : Measure Ω
δ : ℝ≥0∞
h : ∀ (ε : ℝ≥0∞) (B : Set Ω), 0 < ε → ε < ⊤ → MeasurableSet B → μ B ≤ ν (thickening (δ + ε).toReal B) + δ + ε ∧ ν B ≤ μ (thickening (δ + ε).toReal B) + δ + ε
ε : ℝ≥0
hε : 0 < ε
a✝ : δ < ⊤
ε_top : ¬↑ε = ⊤
\u22a2 δ + ↑ε ∈ {ε | ∀ (B : Set Ω), MeasurableSet B → μ B ≤ ν (thickening ε.toReal B) + ε ∧ ν B ≤ μ (thickening ε.toReal B) + ε}
-- Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
ι : Type u_1
Ω : Type u_2
inst✝¹ : MeasurableSpace Ω
inst✝ : PseudoEMetricSpace Ω
μ ν : Measure Ω
δ : ℝ≥0∞
h : ∀ (ε : ℝ≥0∞) (B : Set Ω), 0 < ε → ε < ⊤ → MeasurableSet B → μ B ≤ ν (thickening (δ + ε).toReal B) + δ + ε ∧ ν B ≤ μ (thickening (δ + ε).toReal B) + δ + ε
ε : ℝ≥0
hε : 0 < ε
a✝ : δ < ⊤
ε_top : ¬↑ε = ⊤
B : Set Ω
B_mble : MeasurableSet B
\u22a2 μ B ≤ ν (thickening (δ + ↑ε).toReal B) + (δ + ↑ε) ∧ ν B ≤ μ (thickening (δ + ↑ε).toReal B) + (δ + ↑ε)
-- Mathlib/Data/Int/Defs.lean
a b c d m n✝ : ℤ
n : ℕ
\u22a2 2 * n = n + n
-- Mathlib/Data/Int/Defs.lean
a b c d m n✝ : ℤ
n : ℕ
\u22a2 ↑2 * -[n+1] = -[n+1] + -[n+1]
-- Mathlib/Data/Int/Defs.lean
a b c d m n✝ : ℤ
n : ℕ
\u22a2 -↑n.succ + -↑n.succ = -[n+1] + -[n+1]
-- Mathlib/Algebra/BigOperators/Group/Multiset.lean
F : Type u_1
ι : Type u_2
α : Type u_3
β : Type u_4
γ : Type u_5
inst✝¹ : CommMonoid α
inst✝ : CommMonoid β
s✝ t : Multiset α
a : α
m : Multiset ι
f g : ι → α
s : Multiset α
x y z : α
\u22a2 (fun x x_1 => x * x_1) x ((fun x x_1 => x * x_1) y z) = (fun x x_1 => x * x_1) y ((fun x x_1 => x * x_1) x z)
-- Mathlib/Combinatorics/SimpleGraph/Basic.lean
ι : Sort u_1
V : Type u
G : SimpleGraph V
a b c u v✝ w✝ : V
e : Sym2 V
s✝ s t : Set (Sym2 V)
h : s ⊆ t
v w : V
\u22a2 (fromEdgeSet s).Adj v w → (fromEdgeSet t).Adj v w
-- Mathlib/Combinatorics/SimpleGraph/Basic.lean
ι : Sort u_1
V : Type u
G : SimpleGraph V
a b c u v✝ w✝ : V
e : Sym2 V
s✝ s t : Set (Sym2 V)
h : s ⊆ t
v w : V
\u22a2 s(v, w) ∈ s → ¬v = w → s(v, w) ∈ t
-- Mathlib/Order/Filter/Basic.lean
α : Type u
β : Type v
γ : Type w
δ : Type u_1
ι : Sort x
l f✝ f₁ f₂ : Filter α
g g₁ g₂ : Filter β
m✝ : α → β
m' : β → γ
s✝ : Set α
t : Set β
f : Filter α
m : α → β
h : Injective m
s : Set α
hs : s ∈ f
\u22a2 m ⁻¹' (m '' s) ⊆ s