ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/Algebra/BigOperators/Group/Finset.lean
ι : Type u_1
κ : Type u_2
α : Type u_3
β : Type u_4
γ : Type u_5
s s₁ s₂ : Finset α
a : α
f g : α → β
inst✝¹ : CommMonoid β
inst✝ : DecidableEq α
h : s₁ ⊆ s₂
hg : ∀ x ∈ s₂ \ s₁, g x = 1
hfg : ∀ x ∈ s₁, f x = g x
\u22a2 ∏ i ∈ s₁, f i = ∏ i ∈ s₂, g i
-- Mathlib/Algebra/BigOperators/Group/Finset.lean
ι : Type u_1
κ : Type u_2
α : Type u_3
β : Type u_4
γ : Type u_5
s s₁ s₂ : Finset α
a : α
f g : α → β
inst✝¹ : CommMonoid β
inst✝ : DecidableEq α
h : s₁ ⊆ s₂
hg : ∀ x ∈ s₂ \ s₁, g x = 1
hfg : ∀ x ∈ s₁, f x = g x
\u22a2 ∏ i ∈ s₁, f i = ∏ x ∈ s₁, g x
-- Mathlib/Data/Multiset/Fintype.lean
α : Type u_1
inst✝ : DecidableEq α
m✝ m : Multiset α
a : α
\u22a2 count a (map Prod.fst m.toEnumFinset.val) = count a m
-- Mathlib/MeasureTheory/Measure/WithDensity.lean
α : Type u_1
m0 : MeasurableSpace α
μ✝ μ : Measure α
f : α → ℝ≥0∞
hf : AEMeasurable f μ
h'f : ∀ᵐ (x : α) ∂μ, f x < ⊤
g : α → ℝ≥0∞
f' : α → ℝ≥0∞ := AEMeasurable.mk f hf
\u22a2 ∫⁻ (a : α), g a ∂μ.withDensity f = ∫⁻ (a : α), (f * g) a ∂μ
-- Mathlib/Algebra/Order/Floor.lean
F : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : LinearOrderedRing α
inst✝ : FloorRing α
z : ℤ
a✝ a : α
n : ℕ
\u22a2 ⌊a + ↑n⌋ = ⌊a⌋ + ↑n
-- Mathlib/Algebra/Group/Subgroup/Basic.lean
G : Type u_1
G' : Type u_2
G'' : Type u_3
inst✝³ : Group G
inst✝² : Group G'
inst✝¹ : Group G''
A : Type u_4
inst✝ : AddGroup A
H K : Subgroup G
h : Subsingleton G
x y : Subgroup G
i : G
\u22a2 1 ∈ x ↔ 1 ∈ y
-- Mathlib/Analysis/InnerProductSpace/Basic.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
inst✝⁴ : _root_.RCLike 𝕜
inst✝³ : NormedAddCommGroup E
inst✝² : InnerProductSpace 𝕜 E
inst✝¹ : NormedAddCommGroup F
inst✝ : InnerProductSpace ℝ F
x y z : E
\u22a2 ⟪x, y + z⟫_𝕜 = ⟪x, y⟫_𝕜 + ⟪x, z⟫_𝕜
-- Mathlib/Analysis/InnerProductSpace/Basic.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
inst✝⁴ : _root_.RCLike 𝕜
inst✝³ : NormedAddCommGroup E
inst✝² : InnerProductSpace 𝕜 E
inst✝¹ : NormedAddCommGroup F
inst✝ : InnerProductSpace ℝ F
x y z : E
\u22a2 (starRingEnd 𝕜) ⟪y, x⟫_𝕜 + (starRingEnd 𝕜) ⟪z, x⟫_𝕜 = ⟪x, y⟫_𝕜 + ⟪x, z⟫_𝕜
-- Mathlib/Analysis/InnerProductSpace/EuclideanDist.lean
E : Type u_1
inst✝⁶ : AddCommGroup E
inst✝⁵ : TopologicalSpace E
inst✝⁴ : TopologicalAddGroup E
inst✝³ : T2Space E
inst✝² : Module ℝ E
inst✝¹ : ContinuousSMul ℝ E
inst✝ : FiniteDimensional ℝ E
x : E
r : ℝ
\u22a2 closedBall x r = ⇑toEuclidean.symm '' Metric.closedBall (toEuclidean x) r
-- Mathlib/MeasureTheory/OuterMeasure/Operations.lean
α : Type u_1
β : Type u_2
m : OuterMeasure α
a : ℝ≥0∞
b : α
s : Set α
\u22a2 (a • dirac b) s = s.indicator (fun x => a) b
-- Mathlib/Algebra/Polynomial/Bivariate.lean
R : Type u_1
S : Type u_2
inst✝ : Semiring R
x y : R
\u22a2 evalEval x y Y = y
-- Mathlib/Data/Finset/Sups.lean
F : Type u_1
α : Type u_2
β : Type u_3
inst✝² : DecidableEq α
inst✝¹ : DecidableEq β
inst✝ : BooleanAlgebra α
s s₁ s₂ t t₁ t₂ u v : Finset α
a b c : α
\u22a2 sᶜˢ ⊆ t ↔ s ⊆ tᶜˢ
-- Mathlib/Data/Finset/NoncommProd.lean
F : Type u_1
ι : Type u_2
α : Type u_3
β : Type u_4
γ : Type u_5
f✝ : α → β → β
op : α → α → α
inst✝¹ : Monoid β
inst✝ : Monoid γ
s : Finset α
a : α
f : α → β
ha : a ∉ s
comm : (↑(cons a s ha)).Pairwise fun a b => Commute (f a) (f b)
\u22a2 (cons a s ha).noncommProd f comm = s.noncommProd f ⋯ * f a
-- Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean
V : Type u_1
V' : Type u_2
inst✝⁵ : NormedAddCommGroup V
inst✝⁴ : NormedAddCommGroup V'
inst✝³ : InnerProductSpace ℝ V
inst✝² : InnerProductSpace ℝ V'
inst✝¹ : Fact (finrank ℝ V = 2)
inst✝ : Fact (finrank ℝ V' = 2)
o : Orientation ℝ V (Fin 2)
x y z : V
h : Submodule.span ℝ {x} = Submodule.span ℝ {y}
\u22a2 2 • o.oangle x z = 2 • o.oangle y z
-- Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean
V : Type u_1
V' : Type u_2
inst✝⁵ : NormedAddCommGroup V
inst✝⁴ : NormedAddCommGroup V'
inst✝³ : InnerProductSpace ℝ V
inst✝² : InnerProductSpace ℝ V'
inst✝¹ : Fact (finrank ℝ V = 2)
inst✝ : Fact (finrank ℝ V' = 2)
o : Orientation ℝ V (Fin 2)
x y z : V
h : ∃ z, z • x = y
\u22a2 2 • o.oangle x z = 2 • o.oangle y z
-- Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean
V : Type u_1
V' : Type u_2
inst✝⁵ : NormedAddCommGroup V
inst✝⁴ : NormedAddCommGroup V'
inst✝³ : InnerProductSpace ℝ V
inst✝² : InnerProductSpace ℝ V'
inst✝¹ : Fact (finrank ℝ V = 2)
inst✝ : Fact (finrank ℝ V' = 2)
o : Orientation ℝ V (Fin 2)
x z : V
r : ℝˣ
\u22a2 2 • o.oangle x z = 2 • o.oangle (r • x) z
-- Mathlib/Data/Finset/NAry.lean
α : Type u_1
α' : Type u_2
β : Type u_3
β' : Type u_4
γ : Type u_5
γ' : Type u_6
δ : Type u_7
δ' : Type u_8
ε : Type u_9
ε' : Type u_10
ζ : Type u_11
ζ' : Type u_12
ν : Type u_13
inst✝⁷ : DecidableEq α'
inst✝⁶ : DecidableEq β'
inst✝⁵ : DecidableEq γ
inst✝⁴ : DecidableEq γ'
inst✝³ : DecidableEq δ
inst✝² : DecidableEq δ'
inst✝¹ : DecidableEq ε
inst✝ : DecidableEq ε'
f f' : α → β → γ
g g' : α → β → γ → δ
s s' : Finset α
t✝ t' : Finset β
u u' : Finset γ
a a' : α
b✝ b' : β
c : γ
t : Finset β
hf : ∀ (b : β), Injective fun a => f a b
b : β
hb : b ∈ t
\u22a2 s.card ≤ (image₂ f s t).card
-- Mathlib/Data/Finset/NAry.lean
α : Type u_1
α' : Type u_2
β : Type u_3
β' : Type u_4
γ : Type u_5
γ' : Type u_6
δ : Type u_7
δ' : Type u_8
ε : Type u_9
ε' : Type u_10
ζ : Type u_11
ζ' : Type u_12
ν : Type u_13
inst✝⁷ : DecidableEq α'
inst✝⁶ : DecidableEq β'
inst✝⁵ : DecidableEq γ
inst✝⁴ : DecidableEq γ'
inst✝³ : DecidableEq δ
inst✝² : DecidableEq δ'
inst✝¹ : DecidableEq ε
inst✝ : DecidableEq ε'
f f' : α → β → γ
g g' : α → β → γ → δ
s s' : Finset α
t✝ t' : Finset β
u u' : Finset γ
a a' : α
b✝ b' : β
c : γ
t : Finset β
hf : ∀ (b : β), Injective fun a => f a b
b : β
hb : b ∈ t
\u22a2 (image₂ f s {b}).card ≤ (image₂ f s t).card
-- Mathlib/CategoryTheory/Sites/Coherent/SheafComparison.lean
C : Type u_1
D : Type u_2
inst✝⁷ : Category.{u_3, u_1} C
inst✝⁶ : Category.{?u.63975, u_2} D
F✝ : C ⥤ D
A : Type u₃
inst✝⁵ : Category.{v₃, u₃} A
F : Cᵒᵖ ⥤ A
B : Type u₄
inst✝⁴ : Category.{v₄, u₄} B
s : A ⥤ B
inst✝³ : Preregular C
inst✝² : FinitaryExtensive C
inst✝¹ : ∀ (X : C), Projective X
inst✝ : ReflectsFiniteProducts s
hF : IsSheaf (coherentTopology C) (F ⋙ s)
\u22a2 IsSheaf (coherentTopology C) F
-- Mathlib/CategoryTheory/Sites/Coherent/SheafComparison.lean
C : Type u_1
D : Type u_2
inst✝⁷ : Category.{u_3, u_1} C
inst✝⁶ : Category.{?u.63975, u_2} D
F✝ : C ⥤ D
A : Type u₃
inst✝⁵ : Category.{v₃, u₃} A
F : Cᵒᵖ ⥤ A
B : Type u₄
inst✝⁴ : Category.{v₄, u₄} B
s : A ⥤ B
inst✝³ : Preregular C
inst✝² : FinitaryExtensive C
inst✝¹ : ∀ (X : C), Projective X
inst✝ : ReflectsFiniteProducts s
hF : Nonempty (PreservesFiniteProducts (F ⋙ s))
\u22a2 Nonempty (PreservesFiniteProducts F)
-- Mathlib/Algebra/Homology/ShortComplex/RightHomology.lean
C : Type u_1
inst✝² : Category.{u_2, u_1} C
inst✝¹ : HasZeroMorphisms C
S S₁ S₂ S₃ : ShortComplex C
inst✝ : S.HasRightHomology
A : C
f₁ f₂ : S.opcycles ⟶ A
\u22a2 f₁ = f₂ ↔ S.pOpcycles ≫ f₁ = S.pOpcycles ≫ f₂
-- Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean
k : Type u_1
V : Type u_2
P : Type u_3
inst✝³ : Ring k
inst✝² : AddCommGroup V
inst✝¹ : Module k V
inst✝ : AffineSpace V P
ι : Type u_4
p₁ p₂ : P
\u22a2 vectorSpan k {p₁, p₂} = Submodule.span k {p₁ -ᵥ p₂}
-- Mathlib/CategoryTheory/Subobject/FactorThru.lean
C : Type u₁
inst✝¹ : Category.{v₁, u₁} C
X Y✝ Z✝ : C
D : Type u₂
inst✝ : Category.{v₂, u₂} D
Y Z : C
P Q : Subobject Y
f : Z ⟶ Y
h : P ≤ Q
\u22a2 P.Factors f → Q.Factors f
-- Mathlib/CategoryTheory/Subobject/FactorThru.lean
C : Type u₁
inst✝¹ : Category.{v₁, u₁} C
X Y✝ Z✝ : C
D : Type u₂
inst✝ : Category.{v₂, u₂} D
Y Z : C
P Q : Subobject Y
f : Z ⟶ Y
h : P ≤ Q
\u22a2 (representative.obj P).Factors f → (representative.obj Q).Factors f
-- Mathlib/CategoryTheory/FintypeCat.lean
X Y : Skeleton
x✝ : IsIsomorphic X Y
h : X ≅ Y
a : Fin X.len
\u22a2 (h.inv { down := (fun x => (h.hom { down := x }).down) a }).down = a
-- Mathlib/CategoryTheory/FintypeCat.lean
X Y : Skeleton
x✝ : IsIsomorphic X Y
h : X ≅ Y
a : Fin X.len
\u22a2 (h.inv (h.hom { down := a })).down = a
-- Mathlib/CategoryTheory/FintypeCat.lean
X Y : Skeleton
x✝ : IsIsomorphic X Y
h : X ≅ Y
a : Fin Y.len
\u22a2 (h.hom { down := (fun x => (h.inv { down := x }).down) a }).down = a
-- Mathlib/CategoryTheory/FintypeCat.lean
X Y : Skeleton
x✝ : IsIsomorphic X Y
h : X ≅ Y
a : Fin Y.len
\u22a2 (h.hom (h.inv { down := a })).down = a
-- Mathlib/Algebra/BigOperators/Intervals.lean
α : Type u_1
M : Type u_2
inst✝ : CommMonoid M
s₂ s₁ s : Finset α
a✝ : α
g f✝ : α → M
a b : ℕ
hab : a < b
f : ℕ → M
ha : a ∉ Ico (a + 1) b
\u22a2 ∏ k ∈ Ico a b, f k = f a * ∏ k ∈ Ico (a + 1) b, f k
-- Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean
V : Type u_1
inst✝¹ : NormedAddCommGroup V
inst✝ : InnerProductSpace ℝ V
x✝ y✝ x y : V
hx : x ≠ 0
hy : y ≠ 0
\u22a2 ⟪x, y⟫_ℝ = -(‖x‖ * ‖y‖) ↔ angle x y = π
-- Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean
V : Type u_1
inst✝¹ : NormedAddCommGroup V
inst✝ : InnerProductSpace ℝ V
x✝ y✝ x y : V
hx : x ≠ 0
hy : y ≠ 0
h : ⟪x, y⟫_ℝ = -(‖x‖ * ‖y‖)
\u22a2 angle x y = π
-- Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean
V : Type u_1
inst✝¹ : NormedAddCommGroup V
inst✝ : InnerProductSpace ℝ V
x✝ y✝ x y : V
hx : x ≠ 0
hy : y ≠ 0
h : ⟪x, y⟫_ℝ = -(‖x‖ * ‖y‖)
h₁ : ‖x‖ * ‖y‖ ≠ 0
\u22a2 angle x y = π
-- Mathlib/GroupTheory/Coxeter/Length.lean
B : Type u_1
W : Type u_2
inst✝ : Group W
M : CoxeterMatrix B
cs : CoxeterSystem M W
w₁ w₂ : W
\u22a2 cs.length (w₁ * w₂) ≤ cs.length w₁ + cs.length w₂
-- Mathlib/GroupTheory/Coxeter/Length.lean
B : Type u_1
W : Type u_2
inst✝ : Group W
M : CoxeterMatrix B
cs : CoxeterSystem M W
w₂ : W
ω₁ : List B
hω₁ : ω₁.length = cs.length (cs.wordProd ω₁)
\u22a2 cs.length (cs.wordProd ω₁ * w₂) ≤ cs.length (cs.wordProd ω₁) + cs.length w₂
-- Mathlib/GroupTheory/Coxeter/Length.lean
B : Type u_1
W : Type u_2
inst✝ : Group W
M : CoxeterMatrix B
cs : CoxeterSystem M W
ω₁ : List B
hω₁ : ω₁.length = cs.length (cs.wordProd ω₁)
ω₂ : List B
hω₂ : ω₂.length = cs.length (cs.wordProd ω₂)
\u22a2 cs.length (cs.wordProd ω₁ * cs.wordProd ω₂) ≤ cs.length (cs.wordProd ω₁) + cs.length (cs.wordProd ω₂)
-- Mathlib/GroupTheory/Coxeter/Length.lean
B : Type u_1
W : Type u_2
inst✝ : Group W
M : CoxeterMatrix B
cs : CoxeterSystem M W
ω₁ : List B
hω₁ : ω₁.length = cs.length (cs.wordProd ω₁)
ω₂ : List B
hω₂ : ω₂.length = cs.length (cs.wordProd ω₂)
this : cs.length (cs.wordProd (ω₁ ++ ω₂)) ≤ (ω₁ ++ ω₂).length
\u22a2 cs.length (cs.wordProd ω₁ * cs.wordProd ω₂) ≤ cs.length (cs.wordProd ω₁) + cs.length (cs.wordProd ω₂)
-- Mathlib/Algebra/Group/Hom/CompTypeclasses.lean
M' : Type u_1
inst✝³ : Monoid M'
M : Type u_2
N : Type u_3
P : Type u_4
inst✝² : Monoid M
inst✝¹ : Monoid N
inst✝ : Monoid P
φ : M →* N
ψ : N →* P
χ : M →* P
h : φ.CompTriple ψ χ
x : M
\u22a2 ψ (φ x) = χ x
-- Mathlib/LinearAlgebra/Matrix/Determinant/Basic.lean
m : Type u_1
n : Type u_2
inst✝⁴ : DecidableEq n
inst✝³ : Fintype n
inst✝² : DecidableEq m
inst✝¹ : Fintype m
R : Type v
inst✝ : CommRing R
A : Matrix n n R
i j : n
hij : i ≠ j
c : R
\u22a2 (A.updateRow i (A i + c • A j)).det = A.det
-- Mathlib/Data/List/Pi.lean
ι : Type u_1
inst✝ : DecidableEq ι
α : ι → Type u_2
l : List ι
fs : (i : ι) → List (α i)
f : (i : ι) → i ∈ l → α i
\u22a2 f ∈ l.pi fs ↔ f ∈ (↑l).pi fun x => ↑(fs x)
-- Mathlib/Data/List/Pi.lean
ι : Type u_1
inst✝ : DecidableEq ι
α : ι → Type u_2
l : List ι
fs : (i : ι) → List (α i)
f : (i : ι) → i ∈ l → α i
\u22a2 f ∈ l.pi fs ↔ f ∈ ↑(l.pi fs)
-- Mathlib/NumberTheory/Bernoulli.lean
A : Type u_1
inst✝¹ : CommRing A
inst✝ : Algebra ℚ A
n : ℕ
\u22a2 ∑ k ∈ range (n + 1 + 1), ↑((n + 1 + 1).choose k) * bernoulli k = if n + 1 + 1 = 1 then 1 else 0
-- Mathlib/NumberTheory/Bernoulli.lean
A : Type u_1
inst✝¹ : CommRing A
inst✝ : Algebra ℚ A
n : ℕ
\u22a2 ∑ i ∈ range n, ↑((n + 2).choose (i + 2)) * bernoulli (i + 2) = ↑n / 2
-- Mathlib/NumberTheory/Bernoulli.lean
A : Type u_1
inst✝¹ : CommRing A
inst✝ : Algebra ℚ A
n : ℕ
f : ∑ k ∈ range n.succ.succ, ↑(n.succ.succ.choose k) * bernoulli' k = ↑n.succ.succ
\u22a2 ∑ i ∈ range n, ↑((n + 2).choose (i + 2)) * bernoulli (i + 2) = ↑n / 2
-- Mathlib/NumberTheory/Bernoulli.lean
A : Type u_1
inst✝¹ : CommRing A
inst✝ : Algebra ℚ A
n : ℕ
f : ∑ k ∈ range n, ↑(n.succ.succ.choose (k + 1 + 1)) * bernoulli' (k + 1 + 1) = ↑n + 1 + 1 - ↑(n.succ.succ.choose 0) * bernoulli' 0 - ↑(n.succ.succ.choose (0 + 1)) * bernoulli' (0 + 1)
\u22a2 ∑ i ∈ range n, ↑((n + 2).choose (i + 2)) * bernoulli (i + 2) = ↑n / 2
-- Mathlib/NumberTheory/Bernoulli.lean
A : Type u_1
inst✝¹ : CommRing A
inst✝ : Algebra ℚ A
n : ℕ
f : ∑ k ∈ range n, ↑(n.succ.succ.choose (k + 1 + 1)) * bernoulli' (k + 1 + 1) = ↑n + 1 + 1 - ↑(n.succ.succ.choose 0) * bernoulli' 0 - ↑(n.succ.succ.choose (0 + 1)) * bernoulli' (0 + 1)
\u22a2 ∑ i ∈ range n, ↑((n + 2).choose (i + 2)) * bernoulli (i + 2) = ∑ k ∈ range n, ↑(n.succ.succ.choose (k + 1 + 1)) * bernoulli' (k + 1 + 1)
-- Mathlib/NumberTheory/Bernoulli.lean
A : Type u_1
inst✝¹ : CommRing A
inst✝ : Algebra ℚ A
n : ℕ
f : ∑ k ∈ range n, ↑(n.succ.succ.choose (k + 1 + 1)) * bernoulli' (k + 1 + 1) = ↑n + 1 + 1 - ↑(n.succ.succ.choose 0) * bernoulli' 0 - ↑(n.succ.succ.choose (0 + 1)) * bernoulli' (0 + 1)
\u22a2 ↑n + 1 + 1 - ↑(n.succ.succ.choose 0) * bernoulli' 0 - ↑(n.succ.succ.choose (0 + 1)) * bernoulli' (0 + 1) = ↑n / 2
-- Mathlib/Probability/Independence/Kernel.lean
α : Type u_1
Ω : Type u_2
ι : Type u_3
β : ι → Type u_4
mβ : (i : ι) → MeasurableSpace (β i)
_mα : MeasurableSpace α
m : ι → MeasurableSpace Ω
_mΩ : MeasurableSpace Ω
κ : Kernel α Ω
μ : Measure α
π : ι → Set (Set Ω)
s : ι → Set Ω
S : Finset ι
f : (x : ι) → Ω → β x
inst✝ : Fintype ι
h : iIndepSets π κ μ
hs : ∀ (i : ι), s i ∈ π i
\u22a2 ∀ᵐ (a : α) ∂μ, (κ a) (⋂ i, s i) = ∏ i : ι, (κ a) (s i)
-- Mathlib/AlgebraicGeometry/FunctionField.lean
X : Scheme
inst✝¹ : IsIntegral X
U : X.Opens
hU : IsAffineOpen U
inst✝ : Nonempty ↑↑(↑U).toPresheafedSpace
this : IsAffine ↑U
\u22a2 IsFractionRing ↑Γ(X, U) ↑X.functionField
-- Mathlib/AlgebraicGeometry/FunctionField.lean
X : Scheme
inst✝¹ : IsIntegral X
U : X.Opens
hU : IsAffineOpen U
inst✝ : Nonempty ↑↑(↑U).toPresheafedSpace
this✝ : IsAffine ↑U
this : IsIntegral ↑U
\u22a2 IsFractionRing ↑Γ(X, U) ↑X.functionField
-- Mathlib/AlgebraicGeometry/FunctionField.lean
X : Scheme
inst✝¹ : IsIntegral X
U : X.Opens
hU : IsAffineOpen U
inst✝ : Nonempty ↑↑(↑U).toPresheafedSpace
this✝ : IsAffine ↑U
this : IsIntegral ↑U
\u22a2 IsLocalization (nonZeroDivisors ↑Γ(X, U)) ↑(X.presheaf.stalk (genericPoint ↑↑X.toPresheafedSpace))
-- Mathlib/AlgebraicGeometry/FunctionField.lean
X : Scheme
inst✝¹ : IsIntegral X
U : X.Opens
hU : IsAffineOpen U
inst✝ : Nonempty ↑↑(↑U).toPresheafedSpace
this✝ : IsAffine ↑U
this : IsIntegral ↑U
\u22a2 nonZeroDivisors ↑Γ(X, U) = (hU.primeIdealOf ⟨genericPoint ↑↑X.toPresheafedSpace, ⋯⟩).asIdeal.primeCompl
-- Mathlib/AlgebraicGeometry/FunctionField.lean
X : Scheme
inst✝¹ : IsIntegral X
U : X.Opens
hU : IsAffineOpen U
inst✝ : Nonempty ↑↑(↑U).toPresheafedSpace
this✝ : IsAffine ↑U
this : IsIntegral ↑U
\u22a2 nonZeroDivisors ↑Γ(X, U) = ⊥.asIdeal.primeCompl
-- Mathlib/AlgebraicGeometry/FunctionField.lean
X : Scheme
inst✝¹ : IsIntegral X
U : X.Opens
hU : IsAffineOpen U
inst✝ : Nonempty ↑↑(↑U).toPresheafedSpace
this✝ : IsAffine ↑U
this : IsIntegral ↑U
x✝ : ↑Γ(X, U)
\u22a2 x✝ ∈ nonZeroDivisors ↑Γ(X, U) ↔ x✝ ∈ ⊥.asIdeal.primeCompl
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
h : ¬μ ⟂ₘ ν
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
h : ¬μ ⟂ₘ ν
this : ∀ (n : ℕ), ∃ i, MeasurableSet i ∧ VectorMeasure.restrict 0 i ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) i ∧ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) iᶜ ≤ VectorMeasure.restrict 0 iᶜ
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
h : ¬μ ⟂ₘ ν
f : ℕ → Set α
hf₁ : ∀ (n : ℕ), MeasurableSet (f n)
hf₂ : ∀ (n : ℕ), VectorMeasure.restrict 0 (f n) ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)
hf₃ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)ᶜ ≤ VectorMeasure.restrict 0 (f n)ᶜ
A : Set α := ⋂ n, (f n)ᶜ
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
h : ¬μ ⟂ₘ ν
f : ℕ → Set α
hf₁ : ∀ (n : ℕ), MeasurableSet (f n)
hf₂ : ∀ (n : ℕ), VectorMeasure.restrict 0 (f n) ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)
hf₃ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)ᶜ ≤ VectorMeasure.restrict 0 (f n)ᶜ
A : Set α := ⋂ n, (f n)ᶜ
hAmeas : MeasurableSet A
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
h : ¬μ ⟂ₘ ν
f : ℕ → Set α
hf₁ : ∀ (n : ℕ), MeasurableSet (f n)
hf₂ : ∀ (n : ℕ), VectorMeasure.restrict 0 (f n) ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)
hf₃ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)ᶜ ≤ VectorMeasure.restrict 0 (f n)ᶜ
A : Set α := ⋂ n, (f n)ᶜ
hAmeas : MeasurableSet A
hA₂ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) A ≤ VectorMeasure.restrict 0 A
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
h : ¬μ ⟂ₘ ν
f : ℕ → Set α
hf₁ : ∀ (n : ℕ), MeasurableSet (f n)
hf₂ : ∀ (n : ℕ), VectorMeasure.restrict 0 (f n) ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)
hf₃ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)ᶜ ≤ VectorMeasure.restrict 0 (f n)ᶜ
A : Set α := ⋂ n, (f n)ᶜ
hAmeas : MeasurableSet A
hA₂ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) A ≤ VectorMeasure.restrict 0 A
hA₃ : ∀ (n : ℕ), μ A ≤ ↑(1 / (↑n + 1)) * ν A
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
f : ℕ → Set α
hf₁ : ∀ (n : ℕ), MeasurableSet (f n)
hf₂ : ∀ (n : ℕ), VectorMeasure.restrict 0 (f n) ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)
hf₃ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)ᶜ ≤ VectorMeasure.restrict 0 (f n)ᶜ
A : Set α := ⋂ n, (f n)ᶜ
hAmeas : MeasurableSet A
hA₂ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) A ≤ VectorMeasure.restrict 0 A
hA₃ : ∀ (n : ℕ), μ A ≤ ↑(1 / (↑n + 1)) * ν A
hμ : μ A = 0
h : ∀ (s : Set α), MeasurableSet s → μ s = 0 → ν sᶜ ≠ 0
this : ν Aᶜ ≠ 0
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
f : ℕ → Set α
hf₁ : ∀ (n : ℕ), MeasurableSet (f n)
hf₂ : ∀ (n : ℕ), VectorMeasure.restrict 0 (f n) ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)
hf₃ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)ᶜ ≤ VectorMeasure.restrict 0 (f n)ᶜ
A : Set α := ⋂ n, (f n)ᶜ
hAmeas : MeasurableSet A
hA₂ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) A ≤ VectorMeasure.restrict 0 A
hA₃ : ∀ (n : ℕ), μ A ≤ ↑(1 / (↑n + 1)) * ν A
hμ : μ A = 0
h : ∀ (s : Set α), MeasurableSet s → μ s = 0 → ν sᶜ ≠ 0
this : ν (⋃ i, f i) ≠ 0
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ✝ ν✝ μ ν : Measure α
inst✝¹ : IsFiniteMeasure μ
inst✝ : IsFiniteMeasure ν
f : ℕ → Set α
hf₁ : ∀ (n : ℕ), MeasurableSet (f n)
hf₂ : ∀ (n : ℕ), VectorMeasure.restrict 0 (f n) ≤ VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)
hf₃ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) (f n)ᶜ ≤ VectorMeasure.restrict 0 (f n)ᶜ
A : Set α := ⋂ n, (f n)ᶜ
hAmeas : MeasurableSet A
hA₂ : ∀ (n : ℕ), VectorMeasure.restrict (μ.toSignedMeasure - ((1 / (↑n + 1)) • ν).toSignedMeasure) A ≤ VectorMeasure.restrict 0 A
hA₃ : ∀ (n : ℕ), μ A ≤ ↑(1 / (↑n + 1)) * ν A
hμ : μ A = 0
h : ∀ (s : Set α), MeasurableSet s → μ s = 0 → ν sᶜ ≠ 0
this : ν (⋃ i, f i) ≠ 0
n : ℕ
hn : 0 < ν (f n)
\u22a2 ∃ ε, 0 < ε ∧ ∃ E, MeasurableSet E ∧ 0 < ν E ∧ VectorMeasure.restrict 0 E ≤ VectorMeasure.restrict (μ.toSignedMeasure - (ε • ν).toSignedMeasure) E
-- Mathlib/CategoryTheory/Opposites.lean
C : Type u₁
inst✝ : Category.{v₁, u₁} C
X Y : Cᵒᵖ
f : X ⟶ Y
\u22a2 IsIso f.unop ↔ IsIso f
-- Mathlib/Deprecated/Subfield.lean
F : Type u_1
inst✝ : Field F
S✝ S : Set F
hS : IsSubfield S
x y : F
hx : x ∈ S
hy : y ∈ S
\u22a2 x / y ∈ S
-- Mathlib/Deprecated/Subfield.lean
F : Type u_1
inst✝ : Field F
S✝ S : Set F
hS : IsSubfield S
x y : F
hx : x ∈ S
hy : y ∈ S
\u22a2 x * y⁻¹ ∈ S
-- Mathlib/LinearAlgebra/FreeModule/PID.lean
R : Type u_1
S : Type u_2
M : Type u_3
ι : Type u_4
inst✝⁶ : CommSemiring R
inst✝⁵ : Semiring S
inst✝⁴ : AddCommMonoid M
inst✝³ : Algebra R S
inst✝² : Module R M
inst✝¹ : Module S M
inst✝ : IsScalarTower R S M
hinj : Function.Injective ⇑(algebraMap R S)
v : ι → M
li : LinearIndependent S v
\u22a2 Function.Injective fun r => r • 1
-- Mathlib/Algebra/Order/Interval/Set/Group.lean
α : Type u_1
inst✝ : OrderedCommGroup α
a b : α
\u22a2 Pairwise fun x y => Disjoint (Ico (a * b ^ x) (a * b ^ (x + 1))) (Ico (a * b ^ y) (a * b ^ (y + 1)))
-- Mathlib/Algebra/Order/Interval/Set/Group.lean
α : Type u_1
inst✝ : OrderedCommGroup α
a b : α
\u22a2 Pairwise fun x y => Ico (a * b ^ x) (a * b ^ (x + 1)) ∩ Ico (a * b ^ y) (a * b ^ (y + 1)) ⊆ ∅
-- Mathlib/Algebra/Order/Interval/Set/Group.lean
α : Type u_1
inst✝ : OrderedCommGroup α
a b : α
m n : ℤ
hmn : m ≠ n
x : α
hx : x ∈ Ico (a * b ^ m) (a * b ^ (m + 1)) ∩ Ico (a * b ^ n) (a * b ^ (n + 1))
\u22a2 m = n
-- Mathlib/Algebra/Order/Interval/Set/Group.lean
α : Type u_1
inst✝ : OrderedCommGroup α
a b : α
m n : ℤ
hmn : m ≠ n
x : α
hx : x ∈ Ico (a * b ^ m) (a * b ^ (m + 1)) ∩ Ico (a * b ^ n) (a * b ^ (n + 1))
hb : 1 < b
\u22a2 m = n
-- Mathlib/Algebra/Order/Interval/Set/Group.lean
α : Type u_1
inst✝ : OrderedCommGroup α
a b : α
m n : ℤ
hmn : m ≠ n
x : α
hx : x ∈ Ico (a * b ^ m) (a * b ^ (m + 1)) ∩ Ico (a * b ^ n) (a * b ^ (n + 1))
hb : 1 < b
i1 : a * b ^ m < a * b ^ (n + 1)
\u22a2 m = n
-- Mathlib/Algebra/Order/Interval/Set/Group.lean
α : Type u_1
inst✝ : OrderedCommGroup α
a b : α
m n : ℤ
hmn : m ≠ n
x : α
hx : x ∈ Ico (a * b ^ m) (a * b ^ (m + 1)) ∩ Ico (a * b ^ n) (a * b ^ (n + 1))
hb : 1 < b
i1 : a * b ^ m < a * b ^ (n + 1)
i2 : a * b ^ n < a * b ^ (m + 1)
\u22a2 m = n