ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/MeasureTheory/OuterMeasure/Induced.lean
α : Type u_1
P : Set α → Prop
m : (s : Set α) → P s → ℝ≥0∞
P0 : P ∅
m0 : m ∅ P0 = 0
PU : ∀ ⦃f : ℕ → Set α⦄, (∀ (i : ℕ), P (f i)) → P (⋃ i, f i)
mU : ∀ ⦃f : ℕ → Set α⦄ (hm : ∀ (i : ℕ), P (f i)), Pairwise (Disjoint on f) → m (⋃ i, f i) ⋯ = ∑' (i : ℕ), m (f i) ⋯
msU : ∀ ⦃f : ℕ → Set α⦄ (hm : ∀ (i : ℕ), P (f i)), m (⋃ i, f i) ⋯ ≤ ∑' (i : ℕ), m (f i) ⋯
m_mono : ∀ ⦃s₁ s₂ : Set α⦄ (hs₁ : P s₁) (hs₂ : P s₂), s₁ ⊆ s₂ → m s₁ hs₁ ≤ m s₂ hs₂
β : Type u_2
inst✝ : Countable β
f : β → Set α
hd : Pairwise (Disjoint on f)
hm : ∀ (i : β), P (f i)
val✝ : Encodable β
\u22a2 extend m (⋃ i, ⋃ b ∈ Encodable.decode₂ β i, f b) = ∑' (i : ℕ), extend m (⋃ b ∈ Encodable.decode₂ β i, f b)
-- Mathlib/MeasureTheory/OuterMeasure/Induced.lean
α : Type u_1
P : Set α → Prop
m : (s : Set α) → P s → ℝ≥0∞
P0 : P ∅
m0 : m ∅ P0 = 0
PU : ∀ ⦃f : ℕ → Set α⦄, (∀ (i : ℕ), P (f i)) → P (⋃ i, f i)
mU : ∀ ⦃f : ℕ → Set α⦄ (hm : ∀ (i : ℕ), P (f i)), Pairwise (Disjoint on f) → m (⋃ i, f i) ⋯ = ∑' (i : ℕ), m (f i) ⋯
msU : ∀ ⦃f : ℕ → Set α⦄ (hm : ∀ (i : ℕ), P (f i)), m (⋃ i, f i) ⋯ ≤ ∑' (i : ℕ), m (f i) ⋯
m_mono : ∀ ⦃s₁ s₂ : Set α⦄ (hs₁ : P s₁) (hs₂ : P s₂), s₁ ⊆ s₂ → m s₁ hs₁ ≤ m s₂ hs₂
β : Type u_2
inst✝ : Countable β
f : β → Set α
hd : Pairwise (Disjoint on f)
hm : ∀ (i : β), P (f i)
val✝ : Encodable β
\u22a2 extend m ∅ = 0
-- Mathlib/Analysis/SpecificLimits/Normed.lean
α : Type u_1
β : Type u_2
ι : Type u_3
𝕜 : Type u_4
inst✝ : NormedDivisionRing 𝕜
m : ℤ
hm : m < 0
\u22a2 Tendsto (fun x => ‖x ^ m‖) (𝓝[≠] 0) atTop
-- Mathlib/Analysis/SpecificLimits/Normed.lean
α : Type u_1
β : Type u_2
ι : Type u_3
𝕜 : Type u_4
inst✝ : NormedDivisionRing 𝕜
m : ℤ
hm : -m < 0
\u22a2 Tendsto (fun x => ‖x ^ (-m)‖) (𝓝[≠] 0) atTop
-- Mathlib/Analysis/SpecificLimits/Normed.lean
α : Type u_1
β : Type u_2
ι : Type u_3
𝕜 : Type u_4
inst✝ : NormedDivisionRing 𝕜
m : ℕ
hm : 0 < ↑m
\u22a2 Tendsto (fun x => ‖x ^ (-↑m)‖) (𝓝[≠] 0) atTop
-- Mathlib/Analysis/SpecificLimits/Normed.lean
α : Type u_1
β : Type u_2
ι : Type u_3
𝕜 : Type u_4
inst✝ : NormedDivisionRing 𝕜
m : ℕ
hm : 0 < m
\u22a2 Tendsto (fun x => ‖x ^ (-↑m)‖) (𝓝[≠] 0) atTop
-- Mathlib/Analysis/SpecificLimits/Normed.lean
α : Type u_1
β : Type u_2
ι : Type u_3
𝕜 : Type u_4
inst✝ : NormedDivisionRing 𝕜
m : ℕ
hm : 0 < m
\u22a2 Tendsto (fun x => ‖x⁻¹‖ ^ m) (𝓝[≠] 0) atTop
-- Mathlib/LinearAlgebra/FiniteDimensional.lean
K : Type u
V : Type v
F : Type u_1
E : Type u_2
inst✝² : Field F
inst✝¹ : Ring E
inst✝ : Algebra F E
hr : finrank F E = 2
i : Nontrivial E := nontrivial_of_finrank_pos (LT.lt.trans_eq zero_lt_two (Eq.symm hr))
h : ⊥ = ⊤
\u22a2 False
-- Mathlib/LinearAlgebra/FiniteDimensional.lean
K : Type u
V : Type v
F : Type u_1
E : Type u_2
inst✝² : Field F
inst✝¹ : Ring E
inst✝ : Algebra F E
hr : finrank F E = 2
i : Nontrivial E := nontrivial_of_finrank_pos (LT.lt.trans_eq zero_lt_two (Eq.symm hr))
S : Subalgebra F E
\u22a2 S = ⊥ ∨ S = ⊤
-- Mathlib/LinearAlgebra/FiniteDimensional.lean
K : Type u
V : Type v
F : Type u_1
E : Type u_2
inst✝² : Field F
inst✝¹ : Ring E
inst✝ : Algebra F E
hr : finrank F E = 2
i : Nontrivial E := nontrivial_of_finrank_pos (LT.lt.trans_eq zero_lt_two (Eq.symm hr))
S : Subalgebra F E
this : FiniteDimensional F E
\u22a2 S = ⊥ ∨ S = ⊤
-- Mathlib/LinearAlgebra/FiniteDimensional.lean
K : Type u
V : Type v
F : Type u_1
E : Type u_2
inst✝² : Field F
inst✝¹ : Ring E
inst✝ : Algebra F E
hr : finrank F E = 2
i : Nontrivial E := nontrivial_of_finrank_pos (LT.lt.trans_eq zero_lt_two (Eq.symm hr))
S : Subalgebra F E
this✝ : FiniteDimensional F E
this : FiniteDimensional F ↥S
\u22a2 S = ⊥ ∨ S = ⊤
-- Mathlib/LinearAlgebra/FiniteDimensional.lean
K : Type u
V : Type v
F : Type u_1
E : Type u_2
inst✝² : Field F
inst✝¹ : Ring E
inst✝ : Algebra F E
hr : finrank F E = 2
i : Nontrivial E := nontrivial_of_finrank_pos (LT.lt.trans_eq zero_lt_two (Eq.symm hr))
S : Subalgebra F E
this✝¹ : FiniteDimensional F E
this✝ : FiniteDimensional F ↥S
this : finrank F ↥S ≤ 2
\u22a2 S = ⊥ ∨ S = ⊤
-- Mathlib/LinearAlgebra/FiniteDimensional.lean
K : Type u
V : Type v
F : Type u_1
E : Type u_2
inst✝² : Field F
inst✝¹ : Ring E
inst✝ : Algebra F E
hr : finrank F E = 2
i : Nontrivial E := nontrivial_of_finrank_pos (LT.lt.trans_eq zero_lt_two (Eq.symm hr))
S : Subalgebra F E
this✝² : FiniteDimensional F E
this✝¹ : FiniteDimensional F ↥S
this✝ : finrank F ↥S ≤ 2
this : 0 < finrank F ↥S
\u22a2 S = ⊥ ∨ S = ⊤
-- Mathlib/Algebra/Associated/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝ : CancelMonoidWithZero α
a c d : α
a_eq : a = a * c * d
ha0 : ¬a = 0
\u22a2 a ~ᵤ a * c
-- Mathlib/Algebra/Associated/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝ : CancelMonoidWithZero α
a c d : α
a_eq : a = a * c * d
ha0 : ¬a = 0
hac0 : a * c ≠ 0
\u22a2 a ~ᵤ a * c
-- Mathlib/Algebra/Associated/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝ : CancelMonoidWithZero α
a c d : α
a_eq : a = a * c * d
ha0 : ¬a = 0
hac0 : a * c ≠ 0
this : a * (c * d) = a * 1
\u22a2 a ~ᵤ a * c
-- Mathlib/Algebra/Associated/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝ : CancelMonoidWithZero α
a c d : α
a_eq : a = a * c * d
ha0 : ¬a = 0
hac0 : a * c ≠ 0
this : a * (c * d) = a * 1
hcd : c * d = 1
\u22a2 a ~ᵤ a * c
-- Mathlib/Algebra/Associated/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝ : CancelMonoidWithZero α
a c d : α
a_eq : a = a * c * d
ha0 : ¬a = 0
hac0 : a * c ≠ 0
this✝ : a * (c * d) = a * 1
hcd : c * d = 1
this : a * c * (d * c) = a * c * 1
\u22a2 a ~ᵤ a * c
-- Mathlib/Algebra/Associated/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝ : CancelMonoidWithZero α
a c d : α
a_eq : a = a * c * d
ha0 : ¬a = 0
hac0 : a * c ≠ 0
this✝ : a * (c * d) = a * 1
hcd : c * d = 1
this : a * c * (d * c) = a * c * 1
hdc : d * c = 1
\u22a2 a ~ᵤ a * c
-- Mathlib/Data/Nat/Factorization/Basic.lean
a b m n✝ p n : ℕ
\u22a2 n.factorization = 0 ↔ n = 0 ∨ n = 1
-- Mathlib/Data/Nat/Factorization/Basic.lean
a b m n✝ p n : ℕ
\u22a2 Multiset.toFinsupp ↑n.primeFactorsList = 0 ↔ n = 0 ∨ n = 1
-- Mathlib/RepresentationTheory/GroupCohomology/LowDegree.lean
k G : Type u
inst✝² : CommRing k
inst✝¹ : Group G
A : Rep k G
inst✝ : A.IsTrivial
f : Additive G →+ CoeSort.coe A
g h : G
\u22a2 (⇑f ∘ ⇑Additive.ofMul) (g * h) = (A.ρ g) ((⇑f ∘ ⇑Additive.ofMul) h) + (⇑f ∘ ⇑Additive.ofMul) g
-- Mathlib/Algebra/Group/Pi/Lemmas.lean
ι : Type u_1
α : Type u_2
I : Type u
f : I → Type v
x✝ y : (i : I) → f i
i j✝ : I
inst✝¹ : DecidableEq I
inst✝ : (i : I) → Group (f i)
g : (i : I) → f i
x : f i
j : I
\u22a2 Function.update g i x j = (g / mulSingle i (g i) * mulSingle i x) j
-- Mathlib/Algebra/Group/Pi/Lemmas.lean
ι : Type u_1
α : Type u_2
I : Type u
f : I → Type v
x✝ y : (i : I) → f i
i j : I
inst✝¹ : DecidableEq I
inst✝ : (i : I) → Group (f i)
g : (i : I) → f i
x : f i
\u22a2 Function.update g i x i = (g / mulSingle i (g i) * mulSingle i x) i
-- Mathlib/Algebra/Group/Pi/Lemmas.lean
ι : Type u_1
α : Type u_2
I : Type u
f : I → Type v
x✝ y : (i : I) → f i
i j✝ : I
inst✝¹ : DecidableEq I
inst✝ : (i : I) → Group (f i)
g : (i : I) → f i
x : f i
j : I
h : i ≠ j
\u22a2 Function.update g i x j = (g / mulSingle i (g i) * mulSingle i x) j
-- Mathlib/Data/Set/Image.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι : Sort u_4
ι' : Sort u_5
f✝ : α → β
s t : Set α
f : α → β
a : α
x✝ : β
\u22a2 x✝ ∈ f '' {a} ↔ x✝ ∈ {f a}
-- Mathlib/Algebra/Polynomial/Coeff.lean
R : Type u
S : Type v
a b : R
n✝ m : ℕ
inst✝ : Semiring R
p✝ q✝ r : R[X]
n : ℕ
p q : R[ℕ]
\u22a2 ({ toFinsupp := p } * { toFinsupp := q }).coeff n = ∑ x ∈ antidiagonal n, { toFinsupp := p }.coeff x.1 * { toFinsupp := q }.coeff x.2
-- Mathlib/Algebra/Polynomial/Coeff.lean
R : Type u
S : Type v
a b : R
n✝ m : ℕ
inst✝ : Semiring R
p✝ q✝ r : R[X]
n : ℕ
p q : R[ℕ]
\u22a2 (p * q) n = ∑ x ∈ antidiagonal n, p x.1 * q x.2
-- Mathlib/Data/List/Dedup.lean
α : Type u_1
β : Type u_2
inst✝¹ : DecidableEq α
inst✝ : Inhabited α
l✝ : List α
a : α
l : List α
\u22a2 (a :: l).dedup.tail = if (a :: l).headI ∈ (a :: l).tail then (a :: l).tail.dedup.tail else (a :: l).tail.dedup
-- Mathlib/FieldTheory/Minpoly/Field.lean
A : Type u_1
B : Type u_2
inst✝³ : Field A
inst✝² : Ring B
inst✝¹ : Algebra A B
x : B
inst✝ : Nontrivial B
p : A[X]
hp1 : Irreducible p
hp2 : (Polynomial.aeval x) p = 0
\u22a2 p * C p.leadingCoeff⁻¹ = minpoly A x
-- Mathlib/FieldTheory/Minpoly/Field.lean
A : Type u_1
B : Type u_2
inst✝³ : Field A
inst✝² : Ring B
inst✝¹ : Algebra A B
x : B
inst✝ : Nontrivial B
p : A[X]
hp1 : Irreducible p
hp2 : (Polynomial.aeval x) p = 0
this : p.leadingCoeff ≠ 0
\u22a2 p * C p.leadingCoeff⁻¹ = minpoly A x
-- Mathlib/FieldTheory/Minpoly/Field.lean
A : Type u_1
B : Type u_2
inst✝³ : Field A
inst✝² : Ring B
inst✝¹ : Algebra A B
x : B
inst✝ : Nontrivial B
p : A[X]
hp1 : Irreducible p
hp2 : (Polynomial.aeval x) p = 0
this : p.leadingCoeff ≠ 0
\u22a2 Irreducible (p * C p.leadingCoeff⁻¹)
-- Mathlib/FieldTheory/Minpoly/Field.lean
A : Type u_1
B : Type u_2
inst✝³ : Field A
inst✝² : Ring B
inst✝¹ : Algebra A B
x : B
inst✝ : Nontrivial B
p : A[X]
hp1 : Irreducible p
hp2 : (Polynomial.aeval x) p = 0
this : p.leadingCoeff ≠ 0
\u22a2 (Polynomial.aeval x) (p * C p.leadingCoeff⁻¹) = 0
-- Mathlib/FieldTheory/Minpoly/Field.lean
A : Type u_1
B : Type u_2
inst✝³ : Field A
inst✝² : Ring B
inst✝¹ : Algebra A B
x : B
inst✝ : Nontrivial B
p : A[X]
hp1 : Irreducible p
hp2 : (Polynomial.aeval x) p = 0
this : p.leadingCoeff ≠ 0
\u22a2 (p * C p.leadingCoeff⁻¹).Monic
-- Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean
R : Type u
inst✝¹ : CommRing R
W : Affine R
S : Type v
inst✝ : CommRing S
f : R →+* S
hf : Function.Injective ⇑f
x y : R
\u22a2 (map W f).toAffine.Nonsingular (f x) (f y) ↔ W.Nonsingular x y
-- Mathlib/Algebra/Ring/Parity.lean
F : Type u_1
α : Type u_2
β : Type u_3
R : Type u_4
m n : ℕ
\u22a2 Even n ↔ ¬Odd n
-- Mathlib/Analysis/Convex/Star.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
inst✝⁴ : OrderedRing 𝕜
inst✝³ : AddCommGroup E
inst✝² : AddCommGroup F
inst✝¹ : Module 𝕜 E
inst✝ : Module 𝕜 F
x y✝ : E
s✝ t : Set E
f : E →ᵃ[𝕜] F
s : Set E
hs : StarConvex 𝕜 x s
y : F
y' : E
hy' : y' ∈ s
hy'f : f y' = y
a b : 𝕜
ha : 0 ≤ a
hb : 0 ≤ b
hab : a + b = 1
\u22a2 f (a • x + b • y') = a • f x + b • y
-- Mathlib/Data/Real/Sqrt.lean
x✝ y✝ x y : ℝ≥0
\u22a2 sqrt (x * y) = sqrt x * sqrt y
-- Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean
s : ℝ
this : ∀ (r : ℝ), ↑r = ↑r
\u22a2 ∫ (x : ℝ) in Ioi 0, ↑(rexp (-x)) * ↑x ^ (↑s - 1) = ↑(∫ (x : ℝ) in Ioi 0, rexp (-x) * x ^ (s - 1))
-- Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean
s : ℝ
this : ∀ (r : ℝ), ↑r = ↑r
\u22a2 ∫ (x : ℝ) in Ioi 0, ↑(rexp (-x)) * ↑x ^ (↑s - 1) = ∫ (x : ℝ) in Ioi 0, ↑(rexp (-x) * x ^ (s - 1))
-- Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean
s : ℝ
this : ∀ (r : ℝ), ↑r = ↑r
\u22a2 EqOn (fun x => ↑(rexp (-x)) * ↑x ^ (↑s - 1)) (fun x => ↑(rexp (-x) * x ^ (s - 1))) (Ioi 0)
-- Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean
s : ℝ
this : ∀ (r : ℝ), ↑r = ↑r
x : ℝ
hx : x ∈ Ioi 0
\u22a2 ↑(rexp (-x)) * ↑x ^ (↑s - 1) = ↑(rexp (-x) * x ^ (s - 1))
-- Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean
s : ℝ
this : ∀ (r : ℝ), ↑r = ↑r
x : ℝ
hx : x ∈ Ioi 0
\u22a2 ↑(rexp (-x)) * ↑x ^ (↑s - 1) = ↑(rexp (-x)) * ↑x ^ ↑(s - 1)
-- Mathlib/MeasureTheory/Constructions/Prod/Basic.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 ν
s : Set α
hs : MeasurableSet s
\u22a2 (map Prod.fst (μ.prod ν)) s = (ν univ • μ) s
-- Mathlib/CategoryTheory/Limits/ConcreteCategory.lean
C : Type u
inst✝⁴ : Category.{v, u} C
inst✝³ : ConcreteCategory C
inst✝² : (forget C).Corepresentable
J : Type w
inst✝¹ : Category.{t, w} J
G : J ⥤ C
inst✝ : HasLimit G
\u22a2 Small.{v, max v w} ↑(G ⋙ forget C).sections
-- Mathlib/CategoryTheory/Limits/ConcreteCategory.lean
C : Type u
inst✝⁴ : Category.{v, u} C
inst✝³ : ConcreteCategory C
inst✝² : (forget C).Corepresentable
J : Type w
inst✝¹ : Category.{t, w} J
G : J ⥤ C
inst✝ : HasLimit G
\u22a2 HasLimit (G ⋙ forget C)
-- Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
w₁ : InfinitePlace K
B : ℕ
hB : minkowskiBound K 1 < ↑(convexBodyLTFactor K) * ↑B
n m : ℕ
h : n < m
w : InfinitePlace K
hw : w ≠ w₁
\u22a2 w ((algebraMap (𝓞 K) K) ↑(seq K w₁ hB m)) < w ((algebraMap (𝓞 K) K) ↑(seq K w₁ hB n))
-- Mathlib/Algebra/Order/Group/Unbundled/Abs.lean
α : Type u_1
inst✝¹ : Lattice α
inst✝ : Group α
a✝ b✝ a b : α
\u22a2 mabs (a / b) = mabs (b / a)
-- Mathlib/RingTheory/MvPolynomial/NewtonIdentities.lean
σ : Type u_1
inst✝² : Fintype σ
inst✝¹ : DecidableEq σ
R : Type u_2
inst✝ : CommRing R
k : ℕ
\u22a2 (filter (fun t => t.1.card < k) (MvPolynomial.NewtonIdentities.pairs σ k)).disjUnion (filter (fun t => t.1.card = k) (MvPolynomial.NewtonIdentities.pairs σ k)) ⋯ = MvPolynomial.NewtonIdentities.pairs σ k
-- Mathlib/RingTheory/MvPolynomial/NewtonIdentities.lean
σ : Type u_1
inst✝² : Fintype σ
inst✝¹ : DecidableEq σ
R : Type u_2
inst✝ : CommRing R
k : ℕ
\u22a2 ∀ (a : Finset σ × σ), a ∈ filter (fun a => (a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card < k) univ ∪ filter (fun a => (a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card = k) univ ↔ a ∈ univ ∧ a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)
-- Mathlib/RingTheory/MvPolynomial/NewtonIdentities.lean
σ : Type u_1
inst✝² : Fintype σ
inst✝¹ : DecidableEq σ
R : Type u_2
inst✝ : CommRing R
k : ℕ
a : Finset σ × σ
\u22a2 a ∈ filter (fun a => (a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card < k) univ ∪ filter (fun a => (a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card = k) univ ↔ a ∈ univ ∧ a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)
-- Mathlib/RingTheory/MvPolynomial/NewtonIdentities.lean
σ : Type u_1
inst✝² : Fintype σ
inst✝¹ : DecidableEq σ
R : Type u_2
inst✝ : CommRing R
k : ℕ
a : Finset σ × σ
\u22a2 a ∈ univ ∧ ((a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card < k ∨ (a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card = k) ↔ a ∈ univ ∧ a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)
-- Mathlib/RingTheory/MvPolynomial/NewtonIdentities.lean
σ : Type u_1
inst✝² : Fintype σ
inst✝¹ : DecidableEq σ
R : Type u_2
inst✝ : CommRing R
k : ℕ
a : Finset σ × σ
ha : a ∈ univ ∧ a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)
\u22a2 a ∈ univ ∧ ((a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card < k ∨ (a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card = k)
-- Mathlib/RingTheory/MvPolynomial/NewtonIdentities.lean
σ : Type u_1
inst✝² : Fintype σ
inst✝¹ : DecidableEq σ
R : Type u_2
inst✝ : CommRing R
k : ℕ
a : Finset σ × σ
ha : a ∈ univ ∧ a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)
hacard : a.1.card < k ∨ a.1.card = k
\u22a2 a ∈ univ ∧ ((a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card < k ∨ (a.1.card ≤ k ∧ (a.1.card = k → a.2 ∈ a.1)) ∧ a.1.card = k)
-- Mathlib/MeasureTheory/SetAlgebra.lean
α : Type u_1
𝒜 : Set (Set α)
s t : Set α
h : 𝒜.Countable
ℬ : Set (Set α) := {s | s ∈ 𝒜} ∪ {s | sᶜ ∈ 𝒜}
\u22a2 (generateSetAlgebra 𝒜).Countable
-- Mathlib/MeasureTheory/SetAlgebra.lean
α : Type u_1
𝒜 : Set (Set α)
s t : Set α
h : 𝒜.Countable
ℬ : Set (Set α) := {s | s ∈ 𝒜} ∪ {s | sᶜ ∈ 𝒜}
count_ℬ : ℬ.Countable
\u22a2 (generateSetAlgebra 𝒜).Countable
-- Mathlib/MeasureTheory/SetAlgebra.lean
α : Type u_1
𝒜 : Set (Set α)
s t : Set α
h : 𝒜.Countable
ℬ : Set (Set α) := {s | s ∈ 𝒜} ∪ {s | sᶜ ∈ 𝒜}
count_ℬ : ℬ.Countable
f : Set (Set (Set α)) → Set α := fun A => ⋃ a ∈ A, ⋂ t ∈ a, t
𝒞 : Set (Set (Set α)) := {a | a.Finite ∧ a ⊆ ℬ}
\u22a2 (generateSetAlgebra 𝒜).Countable
-- Mathlib/MeasureTheory/SetAlgebra.lean
α : Type u_1
𝒜 : Set (Set α)
s t : Set α
h : 𝒜.Countable
ℬ : Set (Set α) := {s | s ∈ 𝒜} ∪ {s | sᶜ ∈ 𝒜}
count_ℬ : ℬ.Countable
f : Set (Set (Set α)) → Set α := fun A => ⋃ a ∈ A, ⋂ t ∈ a, t
𝒞 : Set (Set (Set α)) := {a | a.Finite ∧ a ⊆ ℬ}
count_𝒞 : 𝒞.Countable
\u22a2 (generateSetAlgebra 𝒜).Countable
-- Mathlib/MeasureTheory/SetAlgebra.lean
α : Type u_1
𝒜 : Set (Set α)
s t : Set α
h : 𝒜.Countable
ℬ : Set (Set α) := {s | s ∈ 𝒜} ∪ {s | sᶜ ∈ 𝒜}
count_ℬ : ℬ.Countable
f : Set (Set (Set α)) → Set α := fun A => ⋃ a ∈ A, ⋂ t ∈ a, t
𝒞 : Set (Set (Set α)) := {a | a.Finite ∧ a ⊆ ℬ}
count_𝒞 : 𝒞.Countable
𝒟 : Set (Set (Set (Set α))) := {A | A.Finite ∧ A ⊆ 𝒞}
\u22a2 (generateSetAlgebra 𝒜).Countable
-- Mathlib/MeasureTheory/SetAlgebra.lean
α : Type u_1
𝒜 : Set (Set α)
s t : Set α
h : 𝒜.Countable
ℬ : Set (Set α) := {s | s ∈ 𝒜} ∪ {s | sᶜ ∈ 𝒜}
count_ℬ : ℬ.Countable
f : Set (Set (Set α)) → Set α := fun A => ⋃ a ∈ A, ⋂ t ∈ a, t
𝒞 : Set (Set (Set α)) := {a | a.Finite ∧ a ⊆ ℬ}
count_𝒞 : 𝒞.Countable
𝒟 : Set (Set (Set (Set α))) := {A | A.Finite ∧ A ⊆ 𝒞}
count_𝒟 : 𝒟.Countable
\u22a2 (generateSetAlgebra 𝒜).Countable
-- Mathlib/MeasureTheory/SetAlgebra.lean
α : Type u_1
𝒜 : Set (Set α)
s t : Set α
h : 𝒜.Countable
ℬ : Set (Set α) := {s | s ∈ 𝒜} ∪ {s | sᶜ ∈ 𝒜}
count_ℬ : ℬ.Countable
f : Set (Set (Set α)) → Set α := fun A => ⋃ a ∈ A, ⋂ t ∈ a, t
𝒞 : Set (Set (Set α)) := {a | a.Finite ∧ a ⊆ ℬ}
count_𝒞 : 𝒞.Countable
𝒟 : Set (Set (Set (Set α))) := {A | A.Finite ∧ A ⊆ 𝒞}
count_𝒟 : 𝒟.Countable
this : generateSetAlgebra 𝒜 ⊆ f '' 𝒟
\u22a2 (generateSetAlgebra 𝒜).Countable
-- Mathlib/Topology/ContinuousOn.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝² : TopologicalSpace α
ι : Type u_5
π : ι → Type u_6
inst✝¹ : (i : ι) → TopologicalSpace (π i)
inst✝ : Finite ι
s : (i : ι) → Set (π i)
x : (i : ι) → π i
\u22a2 𝓝[univ.pi s] x = ⨅ i, comap (fun x => x i) (𝓝[s i] x i)
-- Mathlib/Order/Interval/Finset/Basic.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝² : PartialOrder α
inst✝¹ : LocallyFiniteOrder α
inst✝ : Preorder β
f : α → β
\u22a2 Monotone f ↔ ∀ (a b : α), a ⋖ b → f a ≤ f b
-- Mathlib/Order/Interval/Finset/Basic.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝² : PartialOrder α
inst✝¹ : LocallyFiniteOrder α
inst✝ : Preorder β
f : α → β
h : ∀ (a b : α), a ⋖ b → f a ≤ f b
a b : α
hab : a ≤ b
\u22a2 f a ≤ f b
-- Mathlib/MeasureTheory/Measure/VectorMeasure.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
i : Set α
hi : MeasurableSet i
\u22a2 ↑(μ + ν).toSignedMeasure i = ↑(μ.toSignedMeasure + ν.toSignedMeasure) i
-- Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean
C : Type u
inst✝² : Category.{v, u} C
X Y : C
inst✝¹ : HasTerminal C
inst✝ : HasBinaryProducts C
f : X ⟶ Y
\u22a2 (leftUnitor X).inv ≫ map (𝟙 (⊤_ C)) f = f ≫ (leftUnitor Y).inv
-- Mathlib/Algebra/Group/Conj.lean
α✝ : Type u
β : Type v
inst✝² : Monoid α✝
inst✝¹ : Monoid β
α : Type u_1
inst✝ : CommMonoid α
a b : α
x✝ : IsConj a b
c : αˣ
hc : SemiconjBy (↑c) a b
\u22a2 a = b
-- Mathlib/Algebra/Group/Conj.lean
α✝ : Type u
β : Type v
inst✝² : Monoid α✝
inst✝¹ : Monoid β
α : Type u_1
inst✝ : CommMonoid α
a b : α
x✝ : IsConj a b
c : αˣ
hc : a = b
\u22a2 a = b
-- Mathlib/MeasureTheory/Function/ConditionalExpectation/AEMeasurable.lean
α : Type u_1
β✝ : Type u_2
𝕜✝ : Type u_3
m m0 : MeasurableSpace α
μ : Measure α
inst✝³ : TopologicalSpace β✝
f✝ g : α → β✝
𝕜 : Type u_4
β : Type u_5
inst✝² : RCLike 𝕜
inst✝¹ : NormedAddCommGroup β
inst✝ : InnerProductSpace 𝕜 β
f : α → β
c : β
f' : α → β
hf'_meas : StronglyMeasurable f'
hf_ae : f =ᶠ[ae μ] f'
\u22a2 AEStronglyMeasurable' m (fun x => ⟪c, f x⟫_𝕜) μ
-- Mathlib/MeasureTheory/Function/ConditionalExpectation/AEMeasurable.lean
α : Type u_1
β✝ : Type u_2
𝕜✝ : Type u_3
m m0 : MeasurableSpace α
μ : Measure α
inst✝³ : TopologicalSpace β✝
f✝ g : α → β✝
𝕜 : Type u_4
β : Type u_5
inst✝² : RCLike 𝕜
inst✝¹ : NormedAddCommGroup β
inst✝ : InnerProductSpace 𝕜 β
f : α → β
c : β
f' : α → β
hf'_meas : StronglyMeasurable f'
hf_ae : f =ᶠ[ae μ] f'
x : α
hx : f x = f' x
\u22a2 (fun x => ⟪c, f x⟫_𝕜) x = (fun x => ⟪c, f' x⟫_𝕜) x
-- Mathlib/Data/Rat/Lemmas.lean
n : ℕ
\u22a2 IsSquare ↑n ↔ IsSquare n
-- Mathlib/Analysis/Convex/Segment.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
ι : Type u_5
π : ι → Type u_6
inst✝⁵ : OrderedRing 𝕜
inst✝⁴ : AddCommGroup E
inst✝³ : AddCommGroup F
inst✝² : AddCommGroup G
inst✝¹ : Module 𝕜 E
inst✝ : Module 𝕜 F
f : E →ᵃ[𝕜] F
a b : E
x : F
\u22a2 x ∈ ⇑f '' [a-[𝕜]b] ↔ x ∈ [f a-[𝕜]f b]
-- Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean
C : Type u
inst✝ : Category.{v, u} C
X✝ Y✝ X Y : C
h : IsInitial X
c : BinaryCofan X Y
\u22a2 Nonempty (IsColimit c) ↔ IsIso c.inr
-- Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean
C : Type u
inst✝ : Category.{v, u} C
X✝ Y✝ X Y : C
h : IsInitial X
c : BinaryCofan X Y
\u22a2 Nonempty (IsColimit c) ↔ Nonempty (IsColimit (mk c.inr c.inl))
-- Mathlib/RingTheory/MvPolynomial/Homogeneous.lean
σ : Type u_1
τ : Type u_2
R : Type u_3
S : Type u_4
inst✝¹ inst✝ : CommSemiring R
n : ℕ
\u22a2 homogeneousSubmodule σ R n = supported R R {d | d.degree = n}
-- Mathlib/RingTheory/MvPolynomial/Homogeneous.lean
σ : Type u_1
τ : Type u_2
R : Type u_3
S : Type u_4
inst✝¹ inst✝ : CommSemiring R
n : ℕ
\u22a2 homogeneousSubmodule σ R n = supported R R {d | (weight 1) d = n}
-- Mathlib/Algebra/MvPolynomial/Basic.lean
R : Type u
S₁ : Type v
S₂ : Type w
S₃ : Type x
σ : Type u_1
a a' a₁ a₂ : R
e : ℕ
n m : σ
s : σ →₀ ℕ
inst✝² : CommSemiring R
inst✝¹ : CommSemiring S₁
p q : MvPolynomial σ R
f✝ : R →+* S₁
g✝ : σ → S₁
inst✝ : Fintype σ
g : R →+* S₁
X : σ → S₁
f : MvPolynomial σ R
\u22a2 eval₂ g X f = ∑ d ∈ f.support, g (coeff d f) * ∏ i : σ, X i ^ d i
-- Mathlib/Algebra/MvPolynomial/Basic.lean
R : Type u
S₁ : Type v
S₂ : Type w
S₃ : Type x
σ : Type u_1
a a' a₁ a₂ : R
e : ℕ
n m : σ
s : σ →₀ ℕ
inst✝² : CommSemiring R
inst✝¹ : CommSemiring S₁
p q : MvPolynomial σ R
f✝ : R →+* S₁
g✝ : σ → S₁
inst✝ : Fintype σ
g : R →+* S₁
X : σ → S₁
f : MvPolynomial σ R
\u22a2 ∑ d ∈ f.support, g (coeff d f) * ∏ i ∈ d.support, X i ^ d i = ∑ x ∈ f.support, g (coeff x f) * x.prod fun a b => X a ^ b
-- Mathlib/Analysis/LocallyConvex/Bounded.lean
𝕜 : Type u_1
𝕜' : Type u_2
E : Type u_3
E' : Type u_4
F : Type u_5
ι : Type u_6
inst✝⁵ : NontriviallyNormedField 𝕜
inst✝⁴ : AddCommGroup E
inst✝³ : Module 𝕜 E
inst✝² : TopologicalSpace E
inst✝¹ : ContinuousSMul 𝕜 E
ε : ι → 𝕜
l : Filter ι
inst✝ : l.NeBot
hε : Tendsto ε l (𝓝[≠] 0)
S : Set E
\u22a2 ∀ᶠ (n : ι) in l, ε n ≠ 0
-- Mathlib/CategoryTheory/Abelian/Pseudoelements.lean
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : Abelian C
P Q : C
f : Over P
hf : f.hom = 0
\u22a2 biprod.fst ≫ f.hom = biprod.snd ≫ (Over.mk 0).hom
-- Mathlib/Computability/DFA.lean
α : Type u
σ : Type v
M : DFA α σ
α' : Type u_1
σ' : Type u_2
g : σ ≃ σ'
s : σ'
x : List α
\u22a2 ((reindex g) M).evalFrom s x = g (M.evalFrom (g.symm s) x)
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
n : ℕ
hn1 : n ≠ 0
hn2 : f ↑n ≠ 1
P : Set ℕ := {m | 0 < f ↑m ∧ f ↑m < 1}
\u22a2 ∃ p, (0 < f ↑p ∧ f ↑p < 1) ∧ ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
n : ℕ
hn1 : n ≠ 0
hn2 : f ↑n ≠ 1
P : Set ℕ := {m | 0 < f ↑m ∧ f ↑m < 1}
hP : P.Nonempty
\u22a2 ∃ p, (0 < f ↑p ∧ f ↑p < 1) ∧ ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m
-- Mathlib/CategoryTheory/Localization/CalculusOfFractions.lean
C : Type u_1
D : Type u_2
inst✝³ : Category.{u_4, u_1} C
inst✝² : Category.{?u.87374, u_2} D
W : MorphismProperty C
inst✝¹ : W.HasLeftCalculusOfFractions
E : Type u_3
inst✝ : Category.{u_5, u_3} E
F₁ F₂ : Localization W ⥤ E
h : Q W ⋙ F₁ = Q W ⋙ F₂
X Y : C
f : X ⟶ Y
\u22a2 F₁.map f = eqToHom ⋯ ≫ F₂.map f ≫ eqToHom ⋯
-- Mathlib/CategoryTheory/Localization/CalculusOfFractions.lean
C : Type u_1
D : Type u_2
inst✝³ : Category.{u_4, u_1} C
inst✝² : Category.{?u.87374, u_2} D
W : MorphismProperty C
inst✝¹ : W.HasLeftCalculusOfFractions
E : Type u_3
inst✝ : Category.{u_5, u_3} E
F₁ F₂ : Localization W ⥤ E
h : Q W ⋙ F₁ = Q W ⋙ F₂
X Y : C
f : W.LeftFraction X Y
\u22a2 F₁.map (Hom.mk f) = eqToHom ⋯ ≫ F₂.map (Hom.mk f) ≫ eqToHom ⋯
-- Mathlib/CategoryTheory/Localization/CalculusOfFractions.lean
C : Type u_1
D : Type u_2
inst✝³ : Category.{u_4, u_1} C
inst✝² : Category.{?u.87374, u_2} D
W : MorphismProperty C
inst✝¹ : W.HasLeftCalculusOfFractions
E : Type u_3
inst✝ : Category.{u_5, u_3} E
F₁ F₂ : Localization W ⥤ E
h : Q W ⋙ F₁ = Q W ⋙ F₂
X Y : C
f : W.LeftFraction X Y
\u22a2 F₁.map ((Q W).map f.f) ≫ F₁.map (Qinv f.s ⋯) = eqToHom ⋯ ≫ F₂.map ((Q W).map f.f) ≫ F₂.map (Qinv f.s ⋯) ≫ eqToHom ⋯