ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/RingTheory/RootsOfUnity/Basic.lean
M : Type u_1
N : Type u_2
G : Type u_3
R : Type u_4
S : Type u_5
F : Type u_6
inst✝⁴ : CommMonoid M
inst✝³ : CommMonoid N
inst✝² : DivisionCommMonoid G
k l : ℕ
inst✝¹ : CommRing R
ζ✝ : Rˣ
h✝ : IsPrimitiveRoot ζ✝ k
inst✝ : IsDomain R
ζ : R
n : ℕ+
h : IsPrimitiveRoot ζ ↑n

⊢ ((↑n).divisors.biUnion fun i => primitiveRoots i R) = nthRootsFinset (↑n) R
-- Mathlib/RingTheory/RootsOfUnity/Basic.lean
M : Type u_1
N : Type u_2
G : Type u_3
R : Type u_4
S : Type u_5
F : Type u_6
inst✝⁴ : CommMonoid M
inst✝³ : CommMonoid N
inst✝² : DivisionCommMonoid G
k l : ℕ
inst✝¹ : CommRing R
ζ✝ : Rˣ
h✝ : IsPrimitiveRoot ζ✝ k
inst✝ : IsDomain R
ζ : R
n : ℕ+
h : IsPrimitiveRoot ζ ↑n

⊢ ((↑n).divisors.biUnion fun i => primitiveRoots i R) ⊆ nthRootsFinset (↑n) R
-- Mathlib/RingTheory/RootsOfUnity/Basic.lean
M : Type u_1
N : Type u_2
G : Type u_3
R : Type u_4
S : Type u_5
F : Type u_6
inst✝⁴ : CommMonoid M
inst✝³ : CommMonoid N
inst✝² : DivisionCommMonoid G
k l : ℕ
inst✝¹ : CommRing R
ζ✝ : Rˣ
h✝ : IsPrimitiveRoot ζ✝ k
inst✝ : IsDomain R
ζ : R
n : ℕ+
h : IsPrimitiveRoot ζ ↑n

⊢ (nthRootsFinset (↑n) R).card ≤ ((↑n).divisors.biUnion fun i => primitiveRoots i R).card
-- Mathlib/MeasureTheory/Measure/MutuallySingular.lean
α : Type u_1
m0 : MeasurableSpace α
μ μ₁ μ₂ ν ν₁ ν₂ : Measure α

⊢ μ₁ + μ₂ ⟂ₘ ν ↔ μ₁ ⟂ₘ ν ∧ μ₂ ⟂ₘ ν
-- Mathlib/Algebra/Polynomial/Degree/Definitions.lean
R : Type u
S : Type v
a b c d : R
n m : ℕ
inst✝ : Ring R
p q : R[X]
h : p.degree = q.degree
hlc : p.leadingCoeff ≠ q.leadingCoeff

⊢ (p - q).leadingCoeff = p.leadingCoeff - q.leadingCoeff
-- Mathlib/Algebra/Polynomial/Degree/Definitions.lean
R : Type u
S : Type v
a b c d : R
n m : ℕ
inst✝ : Ring R
p q : R[X]
hlc : p.leadingCoeff ≠ q.leadingCoeff
h : p.degree = (-q).degree

⊢ (p - q).leadingCoeff = p.leadingCoeff - q.leadingCoeff
-- Mathlib/Algebra/Polynomial/Degree/Definitions.lean
R : Type u
S : Type v
a b c d : R
n m : ℕ
inst✝ : Ring R
p q : R[X]
h : p.degree = (-q).degree
hlc : p.leadingCoeff + (-q).leadingCoeff ≠ 0

⊢ (p - q).leadingCoeff = p.leadingCoeff - q.leadingCoeff
-- Mathlib/LinearAlgebra/Matrix/Spectrum.lean
𝕜 : Type u_1
inst✝² : RCLike 𝕜
n : Type u_2
inst✝¹ : Fintype n
A : Matrix n n 𝕜
inst✝ : DecidableEq n
hA : A.IsHermitian
i : n

⊢ hA.eigenvalues i = RCLike.re (star ((WithLp.equiv 2 ((i : n) → (fun x => 𝕜) i)) (hA.eigenvectorBasis i)) ⬝ᵥ A *ᵥ (WithLp.equiv 2 ((i : n) → (fun x => 𝕜) i)) (hA.eigenvectorBasis i))
-- Mathlib/Data/Set/Pointwise/Basic.lean
F : Type u_1
α : Type u_2
β : Type u_3
γ : Type u_4
inst✝³ : Group α
inst✝² : DivisionMonoid β
inst✝¹ : FunLike F α β
inst✝ : MonoidHomClass F α β
m : F
s✝ t✝ : Set α
s t : Set β
hs : s ⊆ range ⇑m
ht : t ⊆ range ⇑m
a : α
ha : m a ∈ s
b : α
hb : m b ∈ t

⊢ (fun x x_1 => x / x_1) (m a) (m b) ∈ range ⇑m
-- Mathlib/Order/WellFounded.lean
α : Type u_1
β : Type u_2
γ : Type u_3
r r' : α → α → Prop
inst✝¹ : LinearOrder β
inst✝ : PartialOrder γ
h : WellFounded fun x x_1 => x < x_1
f g : β → γ
hf : StrictMono f
hg : StrictMono g
hfg : range f = range g

⊢ f = g
-- Mathlib/Order/WellFounded.lean
α : Type u_1
β : Type u_2
γ : Type u_3
r r' : α → α → Prop
inst✝¹ : LinearOrder β
inst✝ : PartialOrder γ
h : WellFounded fun x x_1 => x < x_1
f g : β → γ
hf : StrictMono f
hg : StrictMono g
hfg : range f = range g
a : β

⊢ f a = g a
-- Mathlib/Order/WellFounded.lean
α : Type u_1
β : Type u_2
γ : Type u_3
r r' : α → α → Prop
inst✝¹ : LinearOrder β
inst✝ : PartialOrder γ
h : WellFounded fun x x_1 => x < x_1
f g : β → γ
hf : StrictMono f
hg : StrictMono g
hfg : range f = range g
a : β

⊢ ∀ (x : β), (∀ y < x, f y = g y) → f x = g x
-- Mathlib/Algebra/DirectSum/Ring.lean
ι : Type u_1
inst✝³ : DecidableEq ι
A : ι → Type u_2
inst✝² : Add ι
inst✝¹ : (i : ι) → AddCommMonoid (A i)
inst✝ : GNonUnitalNonAssocSemiring A
i j : ι
a : A i
b : A j

⊢ ((toAddMonoid fun x => (toAddMonoid fun x_1 => ((compHom (of A (x + x_1))).comp (gMulHom A)).flip).flip) ((of A i) a)) ((of A j) b) = (of A (i + j)) (GradedMonoid.GMul.mul a b)
-- Mathlib/Algebra/DirectSum/Ring.lean
ι : Type u_1
inst✝³ : DecidableEq ι
A : ι → Type u_2
inst✝² : Add ι
inst✝¹ : (i : ι) → AddCommMonoid (A i)
inst✝ : GNonUnitalNonAssocSemiring A
i j : ι
a : A i
b : A j

⊢ ((compHom (of A (i + j))) ((gMulHom A) a)) b = (of A (i + j)) (GradedMonoid.GMul.mul a b)
-- Mathlib/Data/Set/Basic.lean
α : Type u
β : Type v
γ : Type w
ι : Sort x
a✝ b : α
s✝ s₁ s₂ t t₁ t₂ u : Set α
P : α → Prop
a : α
s : Set α

⊢ (∃ x ∈ insert a s, P x) ↔ P a ∨ ∃ x ∈ s, P x
-- Mathlib/Order/Monotone/Basic.lean
ι : Type u_1
α : Type u
β : Type v
γ : Type w
δ : Type u_2
π : ι → Type u_3
r : α → α → Prop
inst✝¹ : Preorder α
inst✝ : Preorder β
f : α → β
s : Set α

⊢ MonotoneOn (⇑toDual ∘ f ∘ ⇑ofDual) s ↔ MonotoneOn f s
-- Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean
R : Type u
inst✝¹ : CommRing R
W' : Jacobian R
F : Type v
inst✝ : Field F
W : Jacobian F
P : Fin 3 → R
hP : W'.Equation P

⊢ W'.addXYZ P P = ![0, 0, 0]
-- Mathlib/Topology/MetricSpace/HausdorffDimension.lean
ι : Type u_1
X : Type u_2
Y : Type u_3
inst✝¹ : EMetricSpace X
inst✝ : EMetricSpace Y
C K r : ℝ≥0
f : X → Y
s t : Set X
e : X ≃ᵢ Y

⊢ dimH univ = dimH univ
-- Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean
l : Type u_1
m : Type u
n : Type u'
α : Type v
inst✝³ : Fintype n
inst✝² : DecidableEq n
inst✝¹ : CommRing α
A B : Matrix n n α
inst✝ : Invertible A
this : Invertible A.det := A.detInvertibleOfInvertible

⊢ ⅟A = A⁻¹
-- Mathlib/Algebra/Field/Basic.lean
α : Type u_1
β : Type u_2
K : Type u_3
inst✝ : DivisionSemiring α
a b c d : α
hab : Commute a b
ha : a ≠ 0
hb : b ≠ 0

⊢ a⁻¹ + b⁻¹ = (a + b) / (a * b)
-- Mathlib/Order/Interval/Set/UnorderedInterval.lean
α : Type u_1
β : Type u_2
inst✝¹ : LinearOrder α
inst✝ : Lattice β
f : α → β
s : Set α
a b : α
hf : MonotoneOn f [[a, b]]

⊢ MapsTo f [[a, b]] [[f a, f b]]
-- 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 : γ
f : γ → β → γ
b : β
h : ∀ (a : γ), f a b = a
s : Finset γ

⊢ image₂ f s {b} = s
-- Mathlib/SetTheory/Cardinal/Ordinal.lean
c : Cardinal.{u}
n : ℕ

⊢ c ^ ↑n ≤ max c ℵ₀
-- Mathlib/SetTheory/Cardinal/Ordinal.lean
c : Cardinal.{u}
n : ℕ
hc : ℵ₀ ≤ c

⊢ c ^ ↑n ≤ max c ℵ₀
-- Mathlib/SetTheory/Cardinal/Ordinal.lean
c : Cardinal.{u}
n : ℕ
hc : c < ℵ₀

⊢ c ^ ↑n ≤ max c ℵ₀
-- Mathlib/CategoryTheory/Sites/LocallyInjective.lean
C : Type u
inst✝² : Category.{v, u} C
D : Type u'
inst✝¹ : Category.{v', u'} D
inst✝ : ConcreteCategory D
J : GrothendieckTopology C
F₁ F₂ : Sheaf J D
φ : F₁ ⟶ F₂

⊢ Presheaf.IsLocallyInjective J ((sheafToPresheaf J D).map φ) ↔ IsLocallyInjective φ
-- Mathlib/Data/Nat/Digits.lean
n✝ n b e : ℕ
h_b_pos : 0 < b

⊢ n < b ^ e.succ → n / b < b ^ e
-- Mathlib/Data/Nat/Digits.lean
n✝ n b e : ℕ
h_b_pos : 0 < b

⊢ n < b ^ e * b → n / b < b ^ e
-- Mathlib/Data/List/InsertNth.lean
ι : Type u_1
α : Type u
β : Type v
γ : Type w
l₁ l₂ : List α
a : α
l : List α
x : α
n k : ℕ
hk' : n + k < l.length
hk : optParam (n + k + 1 < (insertNth n x l).length) ⋯

⊢ (insertNth n x l).get ⟨n + k + 1, hk⟩ = l.get ⟨n + k, hk'⟩
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I

⊢ ∃ i, p.coeff i ∈ ↑(comap f J) \ ↑(comap f I)
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0

⊢ ∃ i, p.coeff i ∈ ↑(comap f J) \ ↑(comap f I)
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0
rbar_mem_J : (Quotient.mk I) r ∈ map (Quotient.mk I) J

⊢ ∃ i, p.coeff i ∈ ↑(comap f J) \ ↑(comap f I)
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0
rbar_mem_J : (Quotient.mk I) r ∈ map (Quotient.mk I) J
quotient_f : ∀ x ∈ comap f I, ((Quotient.mk I).comp f) x = 0

⊢ ∃ i, p.coeff i ∈ ↑(comap f J) \ ↑(comap f I)
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0
rbar_mem_J : (Quotient.mk I) r ∈ map (Quotient.mk I) J
quotient_f : ∀ x ∈ comap f I, ((Quotient.mk I).comp f) x = 0
rbar_root : eval₂ (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) ((Quotient.mk I) r) (Polynomial.map (Quotient.mk (comap f I)) p) = 0

⊢ ∃ i, p.coeff i ∈ ↑(comap f J) \ ↑(comap f I)
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0
rbar_mem_J : (Quotient.mk I) r ∈ map (Quotient.mk I) J
quotient_f : ∀ x ∈ comap f I, ((Quotient.mk I).comp f) x = 0
rbar_root : eval₂ (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) ((Quotient.mk I) r) (Polynomial.map (Quotient.mk (comap f I)) p) = 0
i : ℕ
ne_zero : (Polynomial.map (Quotient.mk (comap f I)) p).coeff i ≠ 0
mem : (Polynomial.map (Quotient.mk (comap f I)) p).coeff i ∈ comap (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) (map (Quotient.mk I) J)

⊢ ∃ i, p.coeff i ∈ ↑(comap f J) \ ↑(comap f I)
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0
rbar_mem_J : (Quotient.mk I) r ∈ map (Quotient.mk I) J
quotient_f : ∀ x ∈ comap f I, ((Quotient.mk I).comp f) x = 0
rbar_root : eval₂ (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) ((Quotient.mk I) r) (Polynomial.map (Quotient.mk (comap f I)) p) = 0
i : ℕ
ne_zero : (Quotient.mk (comap f I)) (p.coeff i) ≠ 0
mem : (Quotient.mk (comap f I)) (p.coeff i) ∈ comap (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) (map (Quotient.mk I) J)

⊢ ∃ i, p.coeff i ∈ ↑(comap f J) \ ↑(comap f I)
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0
rbar_mem_J : (Quotient.mk I) r ∈ map (Quotient.mk I) J
quotient_f : ∀ x ∈ comap f I, ((Quotient.mk I).comp f) x = 0
rbar_root : eval₂ (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) ((Quotient.mk I) r) (Polynomial.map (Quotient.mk (comap f I)) p) = 0
i : ℕ
ne_zero : (Quotient.mk (comap f I)) (p.coeff i) ≠ 0
mem : (Quotient.mk (comap f I)) (p.coeff i) ∈ comap (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) (map (Quotient.mk I) J)

⊢ (Quotient.mk I) (f (p.coeff i)) ∈ map (Quotient.mk I) J
-- Mathlib/RingTheory/Ideal/Over.lean
R : Type u_1
inst✝² : CommRing R
S : Type u_2
inst✝¹ : CommRing S
f : R →+* S
I J : Ideal S
inst✝ : I.IsPrime
hIJ : I ≤ J
r : S
p : R[X]
p_ne_zero : Polynomial.map (Quotient.mk (comap f I)) p ≠ 0
hpI : eval₂ f r p ∈ I
hrJ : r ∈ ↑J
hrI : r ∉ ↑I
rbar_ne_zero : (Quotient.mk I) r ≠ 0
rbar_mem_J : (Quotient.mk I) r ∈ map (Quotient.mk I) J
quotient_f : ∀ x ∈ comap f I, ((Quotient.mk I).comp f) x = 0
rbar_root : eval₂ (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) ((Quotient.mk I) r) (Polynomial.map (Quotient.mk (comap f I)) p) = 0
i : ℕ
ne_zero : (Quotient.mk (comap f I)) (p.coeff i) ≠ 0
mem : (Quotient.mk (comap f I)) (p.coeff i) ∈ comap (Quotient.lift (comap f I) ((Quotient.mk I).comp f) quotient_f) (map (Quotient.mk I) J)

⊢ p.coeff i ∈ ↑(comap f I) → (Quotient.mk (comap f I)) (p.coeff i) = 0
-- Mathlib/MeasureTheory/Measure/Trim.lean
α : Type u_1
m m0 : MeasurableSpace α
μ : Measure α
s✝ : Set α
ν : Measure α
hm : m ≤ m0
s : Set α
hs : MeasurableSet s

⊢ ((μ + ν).trim hm) s = (μ.trim hm + ν.trim hm) s
-- Mathlib/Algebra/Ring/BooleanRing.lean
α : Type u_1
β : Type u_2
γ : Type u_3
inst✝² : BooleanRing α
inst✝¹ : BooleanRing β
inst✝ : BooleanRing γ
a b c : α

⊢ (a + b + a * b) * (a + c + a * c) + (a + b * c + a * (b * c)) + (a + b + a * b) * (a + c + a * c) * (a + b * c + a * (b * c)) = a + b * c + a * (b * c)
-- Mathlib/MeasureTheory/Function/LpSpace.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
β : Type u_5
inst✝ : MeasurableSpace β
μb : Measure β
f : α → β
s : Set β
hs : MeasurableSet s
hμs : μb s ≠ ⊤
c : E
hf : MeasurePreserving f μ μb

⊢ μ (f ⁻¹' s) ≠ ⊤
-- Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean
this : -(π / 2) < π / 2

⊢ Tendsto (fun x => tan ↑x) atBot atBot
-- Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean
this : -(π / 2) < π / 2

⊢ Tendsto tan (𝓝[>] (-(π / 2))) atBot
-- Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean
this : -(π / 2) < π / 2

⊢ Tendsto (fun x => tan ↑x) atTop atTop
-- Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean
this : -(π / 2) < π / 2

⊢ Tendsto tan (𝓝[<] (π / 2)) atTop
-- Mathlib/Algebra/BigOperators/Finprod.lean
α : Type u_1
β : Type u_2
ι : Type u_3
G : Type u_4
M : Type u_5
N : Type u_6
inst✝¹ : CommMonoid M
inst✝ : CommMonoid N
f✝ g : α → M
a b : α
s t : Set α
f : α × β → M
hf : (mulSupport f).Finite
h₁ : ∀ (a : α × β), ∏ᶠ (_ : a ∈ hf.toFinset), f a = f a
h₂ : ∏ᶠ (a : α × β), f a = ∏ᶠ (a : α × β) (_ : a ∈ hf.toFinset), f a

⊢ ∏ᶠ (ab : α × β), f ab = ∏ᶠ (a : α) (b : β), f (a, b)
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)

⊢ ¬Tendsto diracProba L (𝓝 (diracProba x))
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U

⊢ ¬Tendsto diracProba L (𝓝 (diracProba x))
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x

⊢ ¬Tendsto diracProba L (𝓝 (diracProba x))
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x
f : X →ᵇ ℝ≥0
fx_eq_one : f x = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0

⊢ ¬Tendsto diracProba L (𝓝 (diracProba x))
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x
f : X →ᵇ ℝ≥0
fx_eq_one : f x = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0

⊢ ∃ x_1, ¬Tendsto (fun i => ∫⁻ (ω : X), ↑(x_1 ω) ∂↑(diracProba i)) L (𝓝 (∫⁻ (ω : X), ↑(x_1 ω) ∂↑(diracProba x)))
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x
f : X →ᵇ ℝ≥0
fx_eq_one : f x = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0

⊢ ¬Tendsto (fun i => ∫⁻ (ω : X), ↑(f ω) ∂↑(diracProba i)) L (𝓝 (∫⁻ (ω : X), ↑(f ω) ∂↑(diracProba x)))
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x
f : X →ᵇ ℝ≥0
fx_eq_one : f x = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0

⊢ ¬Tendsto (fun i => ↑(f i)) L (𝓝 ↑1)
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x
f : X →ᵇ ℝ≥0
fx_eq_one : f x = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0

⊢ ∃ s ∈ 𝓝 ↑1, ∃ᶠ (x : X) in L, ↑(f x) ∉ s
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x : X
L : Filter X
h : ¬Tendsto id L (𝓝 x)
U : Set X
U_nhd : U ∈ 𝓝 x
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x
f : X →ᵇ ℝ≥0
fx_eq_one : f x = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0

⊢ ∀ x ∉ U, ↑(f x) ∉ Ioi 0
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x✝ : X
L : Filter X
h : ¬Tendsto id L (𝓝 x✝)
U : Set X
U_nhd : U ∈ 𝓝 x✝
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x✝
f : X →ᵇ ℝ≥0
fx_eq_one : f x✝ = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0
x : X
x_notin_U : x ∉ U

⊢ ↑(f x) ∉ Ioi 0
-- Mathlib/MeasureTheory/Measure/DiracProba.lean
X : Type u_1
inst✝³ : MeasurableSpace X
inst✝² : TopologicalSpace X
inst✝¹ : OpensMeasurableSpace X
inst✝ : CompletelyRegularSpace X
x✝ : X
L : Filter X
h : ¬Tendsto id L (𝓝 x✝)
U : Set X
U_nhd : U ∈ 𝓝 x✝
hU : ∃ᶠ (x : X) in L, x ∉ U
Uint_nhd : interior U ∈ 𝓝 x✝
f : X →ᵇ ℝ≥0
fx_eq_one : f x✝ = 1
f_vanishes_outside : ∀ y ∈ (interior U)ᶜ, f y = 0
x : X
x_notin_U : x ∉ U

⊢ ↑0 ∉ Ioi 0
-- Mathlib/Data/Fintype/BigOperators.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι : Type u_4
inst✝² : DecidableEq ι
inst✝¹ : Fintype ι
inst✝ : CommMonoid α
s : Finset ι
f : ι → α

⊢ (∏ i : ι, if i ∈ s then f i else 1) = ∏ i ∈ s, f i
-- Mathlib/Topology/FiberBundle/IsHomeomorphicTrivialBundle.lean
B : Type u_1
F : Type u_2
Z : Type u_3
inst✝² : TopologicalSpace B
inst✝¹ : TopologicalSpace F
inst✝ : TopologicalSpace Z
proj : Z → B
h : IsHomeomorphicTrivialFiberBundle F proj

⊢ Continuous proj
-- Mathlib/Topology/FiberBundle/IsHomeomorphicTrivialBundle.lean
B : Type u_1
F : Type u_2
Z : Type u_3
inst✝² : TopologicalSpace B
inst✝¹ : TopologicalSpace F
inst✝ : TopologicalSpace Z
e : Z ≃ₜ B × F
h : IsHomeomorphicTrivialFiberBundle F (Prod.fst ∘ ⇑e)

⊢ Continuous (Prod.fst ∘ ⇑e)
-- Mathlib/MeasureTheory/Measure/FiniteMeasure.lean
Ω : Type u_1
inst✝⁴ : MeasurableSpace Ω
R : Type u_2
inst✝³ : SMul R ℝ≥0
inst✝² : SMul R ℝ≥0∞
inst✝¹ : IsScalarTower R ℝ≥0 ℝ≥0∞
inst✝ : IsScalarTower R ℝ≥0∞ ℝ≥0∞
μ : FiniteMeasure Ω
A : Set Ω

⊢ μ.restrict A = 0 ↔ μ A = 0
-- Mathlib/Algebra/Homology/DerivedCategory/Ext.lean
C : Type u
inst✝² : Category.{v, u} C
inst✝¹ : Abelian C
inst✝ : HasDerivedCategory C

⊢ (∀ (X Y : C), HasSmallLocalizedShiftedHom (HomologicalComplex.quasiIso C (ComplexShape.up ℤ)) ℤ ((CochainComplex.singleFunctor C 0).obj X) ((CochainComplex.singleFunctor C 0).obj Y)) ↔ ∀ (X Y : C) (n : ℤ), Small.{w, w'} ((DerivedCategory.singleFunctor C 0).obj X ⟶ (shiftFunctor (DerivedCategory C) n).obj ((DerivedCategory.singleFunctor C 0).obj Y))
-- Mathlib/Algebra/Homology/DerivedCategory/Ext.lean
C : Type u
inst✝² : Category.{v, u} C
inst✝¹ : Abelian C
inst✝ : HasDerivedCategory C

⊢ (∀ (X Y : C) (a b : ℤ), Small.{w, w'} ((shiftFunctor (DerivedCategory C) a).obj (DerivedCategory.Q.obj ((CochainComplex.singleFunctor C 0).obj X)) ⟶ (shiftFunctor (DerivedCategory C) b).obj (DerivedCategory.Q.obj ((CochainComplex.singleFunctor C 0).obj Y)))) ↔ ∀ (X Y : C) (n : ℤ), Small.{w, w'} ((DerivedCategory.singleFunctor C 0).obj X ⟶ (shiftFunctor (DerivedCategory C) n).obj ((DerivedCategory.singleFunctor C 0).obj Y))
-- Mathlib/MeasureTheory/Measure/Count.lean
α : Type u_1
β : Type u_2
inst✝² : MeasurableSpace α
inst✝¹ : MeasurableSpace β
s : Set α
inst✝ : MeasurableSingletonClass α
hs' : s.Nonempty

⊢ count s ≠ 0
-- Mathlib/MeasureTheory/Measure/Count.lean
α : Type u_1
β : Type u_2
inst✝² : MeasurableSpace α
inst✝¹ : MeasurableSpace β
s : Set α
inst✝ : MeasurableSingletonClass α
hs' : s.Nonempty

⊢ ¬s = ∅
-- Mathlib/Algebra/Regular/Basic.lean
R : Type u_1
inst✝ : MulZeroClass R
a b : R
hb : IsRightRegular b

⊢ a * b = 0 ↔ a = 0
-- Mathlib/Algebra/Regular/Basic.lean
R : Type u_1
inst✝ : MulZeroClass R
a b : R
hb : IsRightRegular b

⊢ a * b = 0 * b ↔ a = 0
-- Mathlib/Algebra/DirectSum/Algebra.lean
ι : Type uι
R : Type uR
A : ι → Type uA
B : Type uB
inst✝⁸ : DecidableEq ι
inst✝⁷ : CommSemiring R
inst✝⁶ : (i : ι) → AddCommMonoid (A i)
inst✝⁵ : (i : ι) → Module R (A i)
inst✝⁴ : AddMonoid ι
inst✝³ : GSemiring A
inst✝² : Semiring B
inst✝¹ : GAlgebra R A
inst✝ : Algebra R B
f : (i : ι) → A i →ₗ[R] B
hone : (f 0) GradedMonoid.GOne.one = 1
hmul : ∀ {i j : ι} (ai : A i) (aj : A j), (f (i + j)) (GradedMonoid.GMul.mul ai aj) = (f i) ai * (f j) aj
r : R

⊢ (toModule R ι B f) ((algebraMap R (⨁ (i : ι), A i)) r) = (algebraMap R B) r
-- Mathlib/Analysis/InnerProductSpace/Basic.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
inst✝² : _root_.RCLike 𝕜
inst✝¹ : AddCommGroup F
inst✝ : Module 𝕜 F
c : Core 𝕜 F
x y : F

⊢ ⟪x - y, x - y⟫_𝕜 = ⟪x, x⟫_𝕜 - ⟪x, y⟫_𝕜 - ⟪y, x⟫_𝕜 + ⟪y, y⟫_𝕜
-- Mathlib/Analysis/InnerProductSpace/Basic.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
inst✝² : _root_.RCLike 𝕜
inst✝¹ : AddCommGroup F
inst✝ : Module 𝕜 F
c : Core 𝕜 F
x y : F

⊢ ⟪x, x⟫_𝕜 - ⟪y, x⟫_𝕜 - (⟪x, y⟫_𝕜 - ⟪y, y⟫_𝕜) = ⟪x, x⟫_𝕜 - ⟪x, y⟫_𝕜 - ⟪y, x⟫_𝕜 + ⟪y, y⟫_𝕜
-- Mathlib/Algebra/Group/Basic.lean
α : Type u_1
β : Type u_2
G : Type u_3
M : Type u_4
inst✝ : DivisionMonoid α
a✝ b c d a : α
n : ℕ

⊢ a⁻¹ ^ ↑n = (a ^ ↑n)⁻¹
-- Mathlib/Algebra/Group/Basic.lean
α : Type u_1
β : Type u_2
G : Type u_3
M : Type u_4
inst✝ : DivisionMonoid α
a✝ b c d a : α
n : ℕ

⊢ a⁻¹ ^ Int.negSucc n = (a ^ Int.negSucc n)⁻¹
-- Mathlib/LinearAlgebra/LinearIndependent.lean
ι : Type u'
ι' : Type u_1
R : Type u_2
K : Type u_3
M : Type u_4
M' : Type u_5
M'' : Type u_6
V : Type u
V' : Type u_7
inst✝⁴ : DivisionRing K
inst✝³ : AddCommGroup V
inst✝² : AddCommGroup V'
inst✝¹ : Module K V
inst✝ : Module K V'
v : ι → V
s t : Set V
x y z : V
hs : LinearIndependent K fun (b : ↑s) => ↑b
hx : x ∉ span K s

⊢ LinearIndependent K fun (b : ↑(insert x s)) => ↑b