ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean
X : Type u
Y : Type v
inst✝⁵ : MetricSpace X
inst✝⁴ : CompactSpace X
inst✝³ : Nonempty X
inst✝² : MetricSpace Y
inst✝¹ : CompactSpace Y
inst✝ : Nonempty Y
f : GromovHausdorff.ProdSpaceFun X Y
x✝ y✝ z✝ t✝ : X ⊕ Y
fA : f ∈ candidates X Y
x y z t : X ⊕ Y

⊢ f (x, y) - f (z, t) ≤ ↑(2 * GromovHausdorff.maxVar X Y) * dist (x, y) (z, t) ∧ f (z, t) - f (x, y) ≤ ↑(2 * GromovHausdorff.maxVar X Y) * dist (x, y) (z, t)
-- Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean
X : Type u
Y : Type v
inst✝⁵ : MetricSpace X
inst✝⁴ : CompactSpace X
inst✝³ : Nonempty X
inst✝² : MetricSpace Y
inst✝¹ : CompactSpace Y
inst✝ : Nonempty Y
f : GromovHausdorff.ProdSpaceFun X Y
x✝ y✝ z✝ t✝ : X ⊕ Y
fA : f ∈ candidates X Y
x y z t : X ⊕ Y

⊢ f (z, t) - f (x, y) ≤ ↑(2 * GromovHausdorff.maxVar X Y) * dist (x, y) (z, t)
-- Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean
X : Type u
Y : Type v
inst✝⁵ : MetricSpace X
inst✝⁴ : CompactSpace X
inst✝³ : Nonempty X
inst✝² : MetricSpace Y
inst✝¹ : CompactSpace Y
inst✝ : Nonempty Y
f : GromovHausdorff.ProdSpaceFun X Y
x✝ y✝ z✝ t✝ : X ⊕ Y
fA : f ∈ candidates X Y
x y z t : X ⊕ Y

⊢ f (z, t) - f (x, y) ≤ ↑(2 * GromovHausdorff.maxVar X Y) * dist (z, t) (x, y)
-- Mathlib/Topology/MetricSpace/Pseudo/Constructions.lean
α : Type u_1
β : Type u_2
inst✝ : PseudoMetricSpace α
c : ℝ
c_pos : ¬0 < c

⊢ ball 0 c = Ico 0 c.toNNReal
-- Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Strong.lean
B : Type u₁
inst✝¹ : Bicategory B
C : Type u₂
inst✝ : Bicategory C
F G H : OplaxFunctor B C
η : StrongOplaxNatTrans F G
θ : StrongOplaxNatTrans G H
a b c : B
a' : C
f : a' ⟶ G.obj a

⊢ f ◁ (θ.naturality (𝟙 a)).hom ≫ f ◁ θ.app a ◁ H.mapId a = f ◁ G.mapId a ▷ θ.app a ≫ f ◁ (λ_ (θ.app a)).hom ≫ f ◁ (ρ_ (θ.app a)).inv
-- Mathlib/Data/Set/Card.lean
α : Type u_1
β : Type u_2
s t : Set α
h : (s ∩ t).Finite

⊢ s.encard = t.encard ↔ (s \ t).encard = (t \ s).encard
-- Mathlib/Data/List/Cycle.lean
α : Type u_1
s : Cycle α
h : s.Nodup

⊢ s.Nontrivial ↔ ¬s.Subsingleton
-- Mathlib/Data/List/Cycle.lean
α : Type u_1
s : Cycle α
h : s.Nodup

⊢ s.Nontrivial ↔ ¬s.length ≤ 1
-- Mathlib/Data/List/Cycle.lean
α : Type u_1
a✝ : List α
h : Nodup (Quotient.mk'' a✝)

⊢ Nontrivial (Quotient.mk'' a✝) ↔ ¬length (Quotient.mk'' a✝) ≤ 1
-- Mathlib/Data/List/Cycle.lean
α : Type u_1
a✝ : List α
h : a✝.Nodup

⊢ Nontrivial (Quotient.mk'' a✝) ↔ ¬length (Quotient.mk'' a✝) ≤ 1
-- Mathlib/LinearAlgebra/SesquilinearForm.lean
R : Type u_1
R₁ : Type u_2
R₂ : Type u_3
R₃ : Type u_4
M : Type u_5
M₁ : Type u_6
M₂ : Type u_7
M₃ : Type u_8
Mₗ₁ : Type u_9
Mₗ₁' : Type u_10
Mₗ₂ : Type u_11
Mₗ₂' : Type u_12
K : Type u_13
K₁ : Type u_14
K₂ : Type u_15
V : Type u_16
V₁ : Type u_17
V₂ : Type u_18
n : Type u_19
inst✝⁵ : CommSemiring R
inst✝⁴ : AddCommMonoid M
inst✝³ : Module R M
inst✝² : CommSemiring R₁
inst✝¹ : AddCommMonoid M₁
inst✝ : Module R₁ M₁
I₁ I₂ : R₁ →+* R
B : M₁ →ₛₗ[I₁] M₁ →ₛₗ[I₂] M
H✝ H : B.IsRefl

⊢ ker B = ⊥ ↔ ker B.flip = ⊥
-- Mathlib/LinearAlgebra/SesquilinearForm.lean
R : Type u_1
R₁ : Type u_2
R₂ : Type u_3
R₃ : Type u_4
M : Type u_5
M₁ : Type u_6
M₂ : Type u_7
M₃ : Type u_8
Mₗ₁ : Type u_9
Mₗ₁' : Type u_10
Mₗ₂ : Type u_11
Mₗ₂' : Type u_12
K : Type u_13
K₁ : Type u_14
K₂ : Type u_15
V : Type u_16
V₁ : Type u_17
V₂ : Type u_18
n : Type u_19
inst✝⁵ : CommSemiring R
inst✝⁴ : AddCommMonoid M
inst✝³ : Module R M
inst✝² : CommSemiring R₁
inst✝¹ : AddCommMonoid M₁
inst✝ : Module R₁ M₁
I₁ I₂ : R₁ →+* R
B : M₁ →ₛₗ[I₁] M₁ →ₛₗ[I₂] M
H✝ H : B.IsRefl
h : ker B.flip = ⊥

⊢ ker B = ⊥
-- Mathlib/Data/Nat/Log.lean
b n : ℕ
hb : 1 < b
hn : n ≠ 0

⊢ log b (n * b) = log b n + 1
-- Mathlib/Data/Nat/Log.lean
b n : ℕ
hb : 1 < b
hn : n ≠ 0

⊢ b ^ log b n * b ≤ n * b
-- Mathlib/Data/Nat/Log.lean
b n : ℕ
hb : 1 < b
hn : n ≠ 0

⊢ n * b < b ^ (log b n + 1) * b
-- Mathlib/Topology/Filter.lean
ι : Sort u_1
α : Type u_2
β : Type u_3
X : Type u_4
Y : Type u_5
l : Filter α
p : ι → Prop
s : ι → Set α
h : l.HasBasis p s

⊢ (𝓝 l).HasBasis p fun i => Iic (𝓟 (s i))
-- Mathlib/Topology/Filter.lean
ι : Sort u_1
α : Type u_2
β : Type u_3
X : Type u_4
Y : Type u_5
l : Filter α
p : ι → Prop
s : ι → Set α
h : l.HasBasis p s

⊢ (l.lift' (Iic ∘ 𝓟)).HasBasis p fun i => Iic (𝓟 (s i))
-- Mathlib/Data/Matroid/Closure.lean
ι✝ : Type u_1
α : Type u_2
M : Matroid α
F X Y : Set α
e : α
ι : Sort u_3
I J B : Set α
f x y : α

⊢ M.Basis' I X ↔ M.Basis I (M.closure X) ∧ I ⊆ X
-- Mathlib/Data/Matroid/Closure.lean
ι✝ : Type u_1
α : Type u_2
M : Matroid α
F X Y : Set α
e : α
ι : Sort u_3
I J B : Set α
f x y : α

⊢ M.Basis I (X ∩ M.E) ↔ M.Basis I (M.closure (X ∩ M.E)) ∧ I ⊆ X
-- Mathlib/MeasureTheory/Measure/AEMeasurable.lean
ι : Type u_1
α : Type u_2
β : Type u_3
γ : Type u_4
δ : Type u_5
R : Type u_6
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
inst✝¹ : MeasurableSpace δ
f✝ g : α → β
μ ν : Measure α
inst✝ : LinearOrder α
f : α → β
a b : α

⊢ AEMeasurable f (μ.restrict (Ι a b)) ↔ AEMeasurable f (μ.restrict (Ioc a b)) ∧ AEMeasurable f (μ.restrict (Ioc b a))
-- Mathlib/Probability/Kernel/Invariance.lean
α : Type u_1
β : Type u_2
γ : Type u_3
mα : MeasurableSpace α
mβ : MeasurableSpace β
mγ : MeasurableSpace γ
μ ν : Measure α
κ : Kernel α β
s : Set β
hs : MeasurableSet s

⊢ ((μ + ν).bind ⇑κ) s = (μ.bind ⇑κ + ν.bind ⇑κ) s
-- Mathlib/SetTheory/Cardinal/Subfield.lean
α : Type u
s : Set α
inst✝ : DivisionRing α

⊢ #(WType (Subfield.Operands s)) ≤ max #↑s ℵ₀
-- Mathlib/SetTheory/Cardinal/Subfield.lean
α : Type u
s : Set α
inst✝ : DivisionRing α

⊢ max #↑s ℵ₀ = max (lift.{0, u} #(Fin 6 ⊕ ↑s)) ℵ₀
-- Mathlib/SetTheory/Cardinal/Subfield.lean
α : Type u
s : Set α
inst✝ : DivisionRing α

⊢ ∀ (a : Fin 6 ⊕ ↑s), Finite (Subfield.Operands s a)
-- Mathlib/RingTheory/MvPolynomial/Homogeneous.lean
σ : Type u_1
τ : Type u_2
R : Type u_3
S : Type u_4
inst✝¹ inst✝ : CommSemiring R
d : σ →₀ ℕ
r : R
n : ℕ
hn : d.degree = n

⊢ ((monomial d) r).IsHomogeneous n
-- Mathlib/RingTheory/MvPolynomial/Homogeneous.lean
σ : Type u_1
τ : Type u_2
R : Type u_3
S : Type u_4
inst✝¹ inst✝ : CommSemiring R
d : σ →₀ ℕ
r : R
n : ℕ
hn : (weight 1) d = n

⊢ ((monomial d) r).IsHomogeneous n
-- Mathlib/Combinatorics/SimpleGraph/Matching.lean
V : Type u_1
G G' : SimpleGraph V
M M' : G.Subgraph
v w : V
inst✝ : (v : V) → Fintype ↑(M.neighborSet v)

⊢ M.IsPerfectMatching ↔ ∀ (v : V), M.degree v = 1
-- Mathlib/GroupTheory/Perm/Sign.lean
α : Type u
inst✝² : DecidableEq α
β : Type v
inst✝¹ : Fintype α
inst✝ : Nontrivial α
a : ℤˣ
h : a = -1
x y : α
hxy : x ≠ y

⊢ sign (swap x y) = a
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α

⊢ g₁ (Quot.mk Setoid.r x) = g₂ (Quot.mk Setoid.r x)
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α

⊢ ∀ (a : (P F).A) (f' : (P F).drop.B a ⟹ α) (f : (P F).last.B a → (P F).W α), (∀ (i : (P F).last.B a), g₁ (Quot.mk Setoid.r (f i)) = g₂ (Quot.mk Setoid.r (f i))) → g₁ (Quot.mk Setoid.r ((P F).wMk a f' f)) = g₂ (Quot.mk Setoid.r ((P F).wMk a f' f))
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α
a : (P F).A
f' : (P F).drop.B a ⟹ α
f : (P F).last.B a → (P F).W α
ih : ∀ (i : (P F).last.B a), g₁ (Quot.mk Setoid.r (f i)) = g₂ (Quot.mk Setoid.r (f i))

⊢ g₁ ⟦(P F).wMk a f' f⟧ = g₂ ⟦(P F).wMk a f' f⟧
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α
a : (P F).A
f' : (P F).drop.B a ⟹ α
f : (P F).last.B a → (P F).W α
ih : ∀ (i : (P F).last.B a), g₁ (Quot.mk Setoid.r (f i)) = g₂ (Quot.mk Setoid.r (f i))

⊢ g₁ (mk (abs ⟨a, (P F).appendContents f' fun x => ⟦f x⟧⟩)) = g₂ (mk (abs ⟨a, (P F).appendContents f' fun x => ⟦f x⟧⟩))
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α
a : (P F).A
f' : (P F).drop.B a ⟹ α
f : (P F).last.B a → (P F).W α
ih : ∀ (i : (P F).last.B a), g₁ (Quot.mk Setoid.r (f i)) = g₂ (Quot.mk Setoid.r (f i))

⊢ (TypeVec.id ::: g₁) <$$> abs ⟨a, (P F).appendContents f' fun x => ⟦f x⟧⟩ = (TypeVec.id ::: g₂) <$$> abs ⟨a, (P F).appendContents f' fun x => ⟦f x⟧⟩
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α
a : (P F).A
f' : (P F).drop.B a ⟹ α
f : (P F).last.B a → (P F).W α
ih : ∀ (i : (P F).last.B a), g₁ (Quot.mk Setoid.r (f i)) = g₂ (Quot.mk Setoid.r (f i))

⊢ abs ⟨a, (TypeVec.id ::: g₁) ⊚ (P F).appendContents f' fun x => ⟦f x⟧⟩ = abs ⟨a, (TypeVec.id ::: g₂) ⊚ (P F).appendContents f' fun x => ⟦f x⟧⟩
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α
a : (P F).A
f' : (P F).drop.B a ⟹ α
f : (P F).last.B a → (P F).W α
ih : ∀ (i : (P F).last.B a), g₁ (Quot.mk Setoid.r (f i)) = g₂ (Quot.mk Setoid.r (f i))

⊢ ((TypeVec.id ::: g₁) ⊚ (P F).appendContents f' fun x => ⟦f x⟧) = (TypeVec.id ::: g₂) ⊚ (P F).appendContents f' fun x => ⟦f x⟧
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
β : Type u
g₁ g₂ : Fix F α → β
h : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)
x : (P F).W α
a : (P F).A
f' : (P F).drop.B a ⟹ α
f : (P F).last.B a → (P F).W α
ih : ∀ (i : (P F).last.B a), g₁ (Quot.mk Setoid.r (f i)) = g₂ (Quot.mk Setoid.r (f i))

⊢ splitFun (TypeVec.id ⊚ f') (g₁ ∘ fun x => ⟦f x⟧) = splitFun (TypeVec.id ⊚ f') (g₂ ∘ fun x => ⟦f x⟧)
-- Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean
a x z : ℂ
hx_re : x.re < 0
hx_im : 0 < x.im

⊢ arg =ᶠ[𝓝 x] fun x => Real.arcsin ((-x).im / abs x) + π
-- Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean
a x z : ℂ
hx_re : x.re < 0
hx_im : 0 < x.im

⊢ ∀ᶠ (y : ℂ) in 𝓝 x, y.re < 0 ∧ 0 < y.im
-- Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean
a x z : ℂ
hx_re : x.re < 0
hx_im : 0 < x.im

⊢ IsOpen fun y => y.re < 0 ∧ 0 < y.im
-- Mathlib/Data/Matrix/RowCol.lean
l : Type u_1
m : Type u_2
n : Type u_3
o : Type u_4
R : Type u_5
α : Type v
β : Type w
ι : Type u_6
inst✝² : Mul α
inst✝¹ : AddCommMonoid α
inst✝ : Unique ι
w : m → α
v : n → α
i✝ : m
j✝ : n

⊢ vecMulVec w v i✝ j✝ = (col ι w * row ι v) i✝ j✝
-- .lake/packages/batteries/Batteries/Data/Rat/Lemmas.lean
n₁ n₂ : Int
d₁ d₂ : Nat
z₁ : d₁ ≠ 0
z₂ : d₂ ≠ 0
num✝ : Int
den✝ : Nat
den_nz✝ : den✝ ≠ 0
reduced✝ : num✝.natAbs.Coprime den✝
e₁ : normalize n₁ d₁ z₁ = { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ }

⊢ { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ } * normalize n₂ d₂ z₂ = normalize (n₁ * n₂) (d₁ * d₂) ⋯
-- .lake/packages/batteries/Batteries/Data/Rat/Lemmas.lean
n₂ : Int
d₂ : Nat
z₂ : d₂ ≠ 0
num✝ : Int
den✝ : Nat
den_nz✝ : den✝ ≠ 0
reduced✝ : num✝.natAbs.Coprime den✝
g₁ : Nat
zg₁ : g₁ ≠ 0
z₁ : den✝ * g₁ ≠ 0
e₁ : normalize (num✝ * ↑g₁) (den✝ * g₁) z₁ = { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ }

⊢ { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ } * normalize n₂ d₂ z₂ = normalize (num✝ * ↑g₁ * n₂) (den✝ * g₁ * d₂) ⋯
-- .lake/packages/batteries/Batteries/Data/Rat/Lemmas.lean
n₂ : Int
d₂ : Nat
z₂ : d₂ ≠ 0
num✝¹ : Int
den✝¹ : Nat
den_nz✝¹ : den✝¹ ≠ 0
reduced✝¹ : num✝¹.natAbs.Coprime den✝¹
g₁ : Nat
zg₁ : g₁ ≠ 0
z₁ : den✝¹ * g₁ ≠ 0
e₁ : normalize (num✝¹ * ↑g₁) (den✝¹ * g₁) z₁ = { num := num✝¹, den := den✝¹, den_nz := den_nz✝¹, reduced := reduced✝¹ }
num✝ : Int
den✝ : Nat
den_nz✝ : den✝ ≠ 0
reduced✝ : num✝.natAbs.Coprime den✝
e₂ : normalize n₂ d₂ z₂ = { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ }

⊢ { num := num✝¹, den := den✝¹, den_nz := den_nz✝¹, reduced := reduced✝¹ } * { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ } = normalize (num✝¹ * ↑g₁ * n₂) (den✝¹ * g₁ * d₂) ⋯
-- .lake/packages/batteries/Batteries/Data/Rat/Lemmas.lean
num✝¹ : Int
den✝¹ : Nat
den_nz✝¹ : den✝¹ ≠ 0
reduced✝¹ : num✝¹.natAbs.Coprime den✝¹
g₁ : Nat
zg₁ : g₁ ≠ 0
z₁ : den✝¹ * g₁ ≠ 0
e₁ : normalize (num✝¹ * ↑g₁) (den✝¹ * g₁) z₁ = { num := num✝¹, den := den✝¹, den_nz := den_nz✝¹, reduced := reduced✝¹ }
num✝ : Int
den✝ : Nat
den_nz✝ : den✝ ≠ 0
reduced✝ : num✝.natAbs.Coprime den✝
g₂ : Nat
zg₂ : g₂ ≠ 0
z₂ : den✝ * g₂ ≠ 0
e₂ : normalize (num✝ * ↑g₂) (den✝ * g₂) z₂ = { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ }

⊢ { num := num✝¹, den := den✝¹, den_nz := den_nz✝¹, reduced := reduced✝¹ } * { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ } = normalize (num✝¹ * ↑g₁ * (num✝ * ↑g₂)) (den✝¹ * g₁ * (den✝ * g₂)) ⋯
-- .lake/packages/batteries/Batteries/Data/Rat/Lemmas.lean
num✝¹ : Int
den✝¹ : Nat
den_nz✝¹ : den✝¹ ≠ 0
reduced✝¹ : num✝¹.natAbs.Coprime den✝¹
g₁ : Nat
zg₁ : g₁ ≠ 0
z₁ : den✝¹ * g₁ ≠ 0
e₁ : normalize (num✝¹ * ↑g₁) (den✝¹ * g₁) z₁ = { num := num✝¹, den := den✝¹, den_nz := den_nz✝¹, reduced := reduced✝¹ }
num✝ : Int
den✝ : Nat
den_nz✝ : den✝ ≠ 0
reduced✝ : num✝.natAbs.Coprime den✝
g₂ : Nat
zg₂ : g₂ ≠ 0
z₂ : den✝ * g₂ ≠ 0
e₂ : normalize (num✝ * ↑g₂) (den✝ * g₂) z₂ = { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ }

⊢ normalize (num✝¹ * num✝) (den✝¹ * den✝) ⋯ = normalize (num✝¹ * ↑g₁ * (num✝ * ↑g₂)) (den✝¹ * g₁ * (den✝ * g₂)) ⋯
-- .lake/packages/batteries/Batteries/Data/Rat/Lemmas.lean
num✝¹ : Int
den✝¹ : Nat
den_nz✝¹ : den✝¹ ≠ 0
reduced✝¹ : num✝¹.natAbs.Coprime den✝¹
g₁ : Nat
zg₁ : g₁ ≠ 0
z₁ : den✝¹ * g₁ ≠ 0
e₁ : normalize (num✝¹ * ↑g₁) (den✝¹ * g₁) z₁ = { num := num✝¹, den := den✝¹, den_nz := den_nz✝¹, reduced := reduced✝¹ }
num✝ : Int
den✝ : Nat
den_nz✝ : den✝ ≠ 0
reduced✝ : num✝.natAbs.Coprime den✝
g₂ : Nat
zg₂ : g₂ ≠ 0
z₂ : den✝ * g₂ ≠ 0
e₂ : normalize (num✝ * ↑g₂) (den✝ * g₂) z₂ = { num := num✝, den := den✝, den_nz := den_nz✝, reduced := reduced✝ }

⊢ normalize (num✝¹ * num✝ * ↑(g₁ * g₂)) (den✝¹ * den✝ * (g₁ * g₂)) ⋯ = normalize (num✝¹ * ↑g₁ * (num✝ * ↑g₂)) (den✝¹ * g₁ * (den✝ * g₂)) ⋯
-- Mathlib/Topology/Algebra/StarSubalgebra.lean
R : Type u_1
A : Type u_2
B : Type u_3
inst✝¹² : CommSemiring R
inst✝¹¹ : StarRing R
inst✝¹⁰ : TopologicalSpace A
inst✝⁹ : Semiring A
inst✝⁸ : StarRing A
inst✝⁷ : TopologicalSemiring A
inst✝⁶ : ContinuousStar A
inst✝⁵ : Algebra R A
inst✝⁴ : StarModule R A
inst✝³ : TopologicalSpace B
inst✝² : Semiring B
inst✝¹ : StarRing B
inst✝ : Algebra R B
x y : A
hy : y ∈ elementalStarAlgebra R x
P : (u : A) → u ∈ elementalStarAlgebra R x → Prop
self : P x ⋯
star_self : P (star x) ⋯
algebraMap : ∀ (r : R), P ((_root_.algebraMap R A) r) ⋯
add : ∀ (u : A) (hu : u ∈ elementalStarAlgebra R x) (v : A) (hv : v ∈ elementalStarAlgebra R x), P u hu → P v hv → P (u + v) ⋯
mul : ∀ (u : A) (hu : u ∈ elementalStarAlgebra R x) (v : A) (hv : v ∈ elementalStarAlgebra R x), P u hu → P v hv → P (u * v) ⋯
closure : ∀ (s : Set A) (hs : s ⊆ ↑(elementalStarAlgebra R x)), (∀ (u : A) (hu : u ∈ s), P u ⋯) → ∀ (v : A) (hv : v ∈ _root_.closure s), P v ⋯

⊢ P y hy
-- Mathlib/Topology/Algebra/StarSubalgebra.lean
R : Type u_1
A : Type u_2
B : Type u_3
inst✝¹² : CommSemiring R
inst✝¹¹ : StarRing R
inst✝¹⁰ : TopologicalSpace A
inst✝⁹ : Semiring A
inst✝⁸ : StarRing A
inst✝⁷ : TopologicalSemiring A
inst✝⁶ : ContinuousStar A
inst✝⁵ : Algebra R A
inst✝⁴ : StarModule R A
inst✝³ : TopologicalSpace B
inst✝² : Semiring B
inst✝¹ : StarRing B
inst✝ : Algebra R B
x y✝ : A
hy✝ : y✝ ∈ elementalStarAlgebra R x
P : (u : A) → u ∈ elementalStarAlgebra R x → Prop
self : P x ⋯
star_self : P (star x) ⋯
algebraMap : ∀ (r : R), P ((_root_.algebraMap R A) r) ⋯
add : ∀ (u : A) (hu : u ∈ elementalStarAlgebra R x) (v : A) (hv : v ∈ elementalStarAlgebra R x), P u hu → P v hv → P (u + v) ⋯
mul : ∀ (u : A) (hu : u ∈ elementalStarAlgebra R x) (v : A) (hv : v ∈ elementalStarAlgebra R x), P u hu → P v hv → P (u * v) ⋯
closure : ∀ (s : Set A) (hs : s ⊆ ↑(elementalStarAlgebra R x)), (∀ (u : A) (hu : u ∈ s), P u ⋯) → ∀ (v : A) (hv : v ∈ _root_.closure s), P v ⋯
y : A
hy : y ∈ ↑(adjoin R {x})

⊢ P y ⋯
-- Mathlib/Topology/Algebra/StarSubalgebra.lean
R : Type u_1
A : Type u_2
B : Type u_3
inst✝¹² : CommSemiring R
inst✝¹¹ : StarRing R
inst✝¹⁰ : TopologicalSpace A
inst✝⁹ : Semiring A
inst✝⁸ : StarRing A
inst✝⁷ : TopologicalSemiring A
inst✝⁶ : ContinuousStar A
inst✝⁵ : Algebra R A
inst✝⁴ : StarModule R A
inst✝³ : TopologicalSpace B
inst✝² : Semiring B
inst✝¹ : StarRing B
inst✝ : Algebra R B
x y✝ : A
hy✝¹ : y✝ ∈ elementalStarAlgebra R x
P : (u : A) → u ∈ elementalStarAlgebra R x → Prop
self : P x ⋯
star_self : P (star x) ⋯
algebraMap : ∀ (r : R), P ((_root_.algebraMap R A) r) ⋯
add : ∀ (u : A) (hu : u ∈ elementalStarAlgebra R x) (v : A) (hv : v ∈ elementalStarAlgebra R x), P u hu → P v hv → P (u + v) ⋯
mul : ∀ (u : A) (hu : u ∈ elementalStarAlgebra R x) (v : A) (hv : v ∈ elementalStarAlgebra R x), P u hu → P v hv → P (u * v) ⋯
closure : ∀ (s : Set A) (hs : s ⊆ ↑(elementalStarAlgebra R x)), (∀ (u : A) (hu : u ∈ s), P u ⋯) → ∀ (v : A) (hv : v ∈ _root_.closure s), P v ⋯
y : A
hy✝ : y ∈ ↑(adjoin R {x})
hy : y ∈ Algebra.adjoin R ({x} ∪ star {x})

⊢ P y ⋯
-- Mathlib/Order/Heyting/Basic.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝ : GeneralizedHeytingAlgebra α
a b✝ c d b : α

⊢ b ≤ ⊤ ⇨ a ↔ b ≤ a
-- Mathlib/Data/Set/Lattice.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι : Sort u_4
ι' : Sort u_5
ι₂ : Sort u_6
κ : ι → Sort u_7
κ₁ : ι → Sort u_8
κ₂ : ι → Sort u_9
κ' : ι' → Sort u_10
f : α → β → γ
s✝ : Set α
t✝ : Set β
s : Set α
t : Set β
x✝ : γ

⊢ x✝ ∈ image2 f s t ↔ x✝ ∈ ⋃ i ∈ s, ⋃ j ∈ t, {f i j}
-- Mathlib/Algebra/Homology/ShortComplex/PreservesHomology.lean
C : Type u_1
D : Type u_2
inst✝⁹ : Category.{u_3, u_1} C
inst✝⁸ : Category.{u_4, u_2} D
inst✝⁷ : HasZeroMorphisms C
inst✝⁶ : HasZeroMorphisms D
S : ShortComplex C
h₁✝ : S.LeftHomologyData
h₂✝ : S.RightHomologyData
F✝ : C ⥤ D
inst✝⁵ : F✝.PreservesZeroMorphisms
hl : S.LeftHomologyData
hr : S.RightHomologyData
S₁ S₂ : ShortComplex C
φ : S₁ ⟶ S₂
hl₁ : S₁.LeftHomologyData
hr₁ : S₁.RightHomologyData
hl₂ : S₂.LeftHomologyData
hr₂ : S₂.RightHomologyData
h₁ : S₁.HomologyData
h₂ : S₂.HomologyData
F : C ⥤ D
inst✝⁴ : F.PreservesZeroMorphisms
inst✝³ : S₁.HasLeftHomology
inst✝² : S₂.HasLeftHomology
inst✝¹ : F.PreservesLeftHomologyOf S₁
inst✝ : F.PreservesLeftHomologyOf S₂

⊢ leftHomologyMap' (F.mapShortComplex.map φ) (F.mapShortComplex.obj S₁).leftHomologyData (F.mapShortComplex.obj S₂).leftHomologyData ≫ leftHomologyMap' (𝟙 (S₂.map F)) (S₂.map F).leftHomologyData (S₂.leftHomologyData.map F) = leftHomologyMap' (𝟙 (S₁.map F)) (S₁.map F).leftHomologyData (S₁.leftHomologyData.map F) ≫ F.map (leftHomologyMap' φ S₁.leftHomologyData S₂.leftHomologyData)
-- Mathlib/FieldTheory/Extension.lean
F : Type u_1
E : Type u_2
K : Type u_3
inst✝⁴ : Field F
inst✝³ : Field E
inst✝² : Field K
inst✝¹ : Algebra F E
inst✝ : Algebra F K
S : Set E
c : Set (Lifts F E K)
hc : IsChain (fun x x_1 => x ≤ x_1) c
t : ↑(insert ⊥ c) → IntermediateField F E := fun i => (↑i).carrier
t' : ↑(insert ⊥ c) → Subalgebra F E := fun i => (t i).toSubalgebra

⊢ ∃ ub, ∀ a ∈ c, a ≤ ub
-- Mathlib/FieldTheory/Extension.lean
F : Type u_1
E : Type u_2
K : Type u_3
inst✝⁴ : Field F
inst✝³ : Field E
inst✝² : Field K
inst✝¹ : Algebra F E
inst✝ : Algebra F K
S : Set E
c : Set (Lifts F E K)
hc✝ : IsChain (fun x x_1 => x ≤ x_1) c
t : ↑(insert ⊥ c) → IntermediateField F E := fun i => (↑i).carrier
t' : ↑(insert ⊥ c) → Subalgebra F E := fun i => (t i).toSubalgebra
hc : IsChain (fun x x_1 => x ≤ x_1) (insert ⊥ c)

⊢ ∃ ub, ∀ a ∈ c, a ≤ ub
-- Mathlib/FieldTheory/Extension.lean
F : Type u_1
E : Type u_2
K : Type u_3
inst✝⁴ : Field F
inst✝³ : Field E
inst✝² : Field K
inst✝¹ : Algebra F E
inst✝ : Algebra F K
S : Set E
c : Set (Lifts F E K)
hc✝ : IsChain (fun x x_1 => x ≤ x_1) c
t : ↑(insert ⊥ c) → IntermediateField F E := fun i => (↑i).carrier
t' : ↑(insert ⊥ c) → Subalgebra F E := fun i => (t i).toSubalgebra
hc : IsChain (fun x x_1 => x ≤ x_1) (insert ⊥ c)
dir : Directed (fun x x_1 => x ≤ x_1) t

⊢ ∃ ub, ∀ a ∈ c, a ≤ ub
-- Mathlib/FieldTheory/Extension.lean
F : Type u_1
E : Type u_2
K : Type u_3
inst✝⁴ : Field F
inst✝³ : Field E
inst✝² : Field K
inst✝¹ : Algebra F E
inst✝ : Algebra F K
S : Set E
c : Set (Lifts F E K)
hc✝ : IsChain (fun x x_1 => x ≤ x_1) c
t : ↑(insert ⊥ c) → IntermediateField F E := fun i => (↑i).carrier
t' : ↑(insert ⊥ c) → Subalgebra F E := fun i => (t i).toSubalgebra
hc : IsChain (fun x x_1 => x ≤ x_1) (insert ⊥ c)
dir : Directed (fun x x_1 => x ≤ x_1) t
i j : ↑(insert ⊥ c)
h : t' i ≤ t' j

⊢ (fun i => (↑i).emb) i = ((fun i => (↑i).emb) j).comp (Subalgebra.inclusion h)
-- Mathlib/FieldTheory/Extension.lean
F : Type u_1
E : Type u_2
K : Type u_3
inst✝⁴ : Field F
inst✝³ : Field E
inst✝² : Field K
inst✝¹ : Algebra F E
inst✝ : Algebra F K
S : Set E
c : Set (Lifts F E K)
hc✝ : IsChain (fun x x_1 => x ≤ x_1) c
t : ↑(insert ⊥ c) → IntermediateField F E := fun i => (↑i).carrier
t' : ↑(insert ⊥ c) → Subalgebra F E := fun i => (t i).toSubalgebra
hc : IsChain (fun x x_1 => x ≤ x_1) (insert ⊥ c)
dir : Directed (fun x x_1 => x ≤ x_1) t
L : Lifts F E K
hL✝ : L ∈ c
hL : L ∈ insert ⊥ c
x : ↥L.carrier

⊢ { carrier := iSup t, emb := (Subalgebra.iSupLift t' dir (fun i => (↑i).emb) ⋯ (iSup t') ⋯).comp ↑((iSup t).equivOfEq (⨆ i, (t i).toSubalgebra) ⋯) }.emb ((inclusion ⋯) x) = L.emb x
-- Mathlib/Analysis/Normed/Order/UpperLower.lean
α : Type u_1
ι : Type u_2
inst✝ : Fintype ι
s t : Set (ι → ℝ)
a₁ a₂ b₁ b₂ x y : ι → ℝ
δ : ℝ

⊢ MonotoneOn (dist x) (Ici x)
-- Mathlib/Algebra/Order/Ring/Canonical.lean
α : Type u
β : Type u_1
inst✝⁴ : CanonicallyOrderedCommSemiring α
a✝ b✝ c : α
inst✝³ : Sub α
inst✝² : OrderedSub α
inst✝¹ : IsTotal α fun x x_1 => x ≤ x_1
inst✝ : ContravariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1
a b : α

⊢ (a - 1) * b = a * b - b
-- Mathlib/RingTheory/LocalProperties.lean
R✝ S✝ : Type u
inst✝¹³ : CommRing R✝
inst✝¹² : CommRing S✝
M✝ : Submonoid R✝
N : Submonoid S✝
R'✝ S'✝ : Type u
inst✝¹¹ : CommRing R'✝
inst✝¹⁰ : CommRing S'✝
f✝ : R✝ →+* S✝
inst✝⁹ : Algebra R✝ R'✝
inst✝⁸ : Algebra S✝ S'✝
R S : Type u_1
inst✝⁷ : CommRing R
inst✝⁶ : CommRing S
f : R →+* S
M : Submonoid R
R' S' : Type u_1
inst✝⁵ : CommRing R'
inst✝⁴ : CommRing S'
inst✝³ : Algebra R R'
inst✝² : Algebra S S'
inst✝¹ : IsLocalization M R'
inst✝ : IsLocalization (Submonoid.map f M) S'
H : Function.Surjective ⇑f
x : S'

⊢ ∃ a, (IsLocalization.map S' f ⋯) a = x
-- Mathlib/RingTheory/LocalProperties.lean
R✝ S✝ : Type u
inst✝¹³ : CommRing R✝
inst✝¹² : CommRing S✝
M✝ : Submonoid R✝
N : Submonoid S✝
R'✝ S'✝ : Type u
inst✝¹¹ : CommRing R'✝
inst✝¹⁰ : CommRing S'✝
f✝ : R✝ →+* S✝
inst✝⁹ : Algebra R✝ R'✝
inst✝⁸ : Algebra S✝ S'✝
R S : Type u_1
inst✝⁷ : CommRing R
inst✝⁶ : CommRing S
f : R →+* S
M : Submonoid R
R' S' : Type u_1
inst✝⁵ : CommRing R'
inst✝⁴ : CommRing S'
inst✝³ : Algebra R R'
inst✝² : Algebra S S'
inst✝¹ : IsLocalization M R'
inst✝ : IsLocalization (Submonoid.map f M) S'
H : Function.Surjective ⇑f
x : S
s : R
hs : s ∈ ↑M

⊢ ∃ a, (IsLocalization.map S' f ⋯) a = IsLocalization.mk' S' x ⟨f s, ⋯⟩