ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/Topology/MetricSpace/Thickening.lean
ι : Sort u_1
α✝ : Type u
β : Type v
inst✝¹ : PseudoEMetricSpace α✝
δ✝ ε : ℝ
s t : Set α✝
x✝ : α✝
α : Type u_2
inst✝ : PseudoMetricSpace α
E : Set α
δ δ' : ℝ
hδ₀ : 0 < δ'
hδδ' : δ < δ'
x : α
hx : x ∈ thickening δ' E
y : α
hy₁ : y ∈ E
hy₂ : dist x y < δ'

⊢ x ∈ ⋃ x ∈ E, closedBall x δ'
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1

⊢ StrictConvexOn ℝ (Ioi 0) fun x => x ^ m
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1

⊢ ContinuousOn (fun x => x ^ m) (Ioi 0)
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1

⊢ ∀ x ∈ Ioi 0, 0 < deriv^[2] (fun x => x ^ m) x
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1
x : ℝ
hx : x ∈ Ioi 0

⊢ 0 < deriv^[2] (fun x => x ^ m) x
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1
x : ℝ
hx : 0 < x

⊢ 0 < deriv^[2] (fun x => x ^ m) x
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1
x : ℝ
hx : 0 < x

⊢ 0 < (∏ i ∈ Finset.range 2, (↑m - ↑i)) * x ^ (m - ↑2)
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1
x : ℝ
hx : 0 < x

⊢ 0 < ∏ i ∈ Finset.range 2, (↑m - ↑i)
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1
x : ℝ
hx : 0 < x

⊢ 0 < ∏ i ∈ Finset.range 2, (m - ↑i)
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1
x : ℝ
hx : 0 < x
hm : m ∈ Ico 0 ↑2

⊢ False
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
hm₀ : m ≠ 0
hm₁ : m ≠ 1
x : ℝ
hx : 0 < x
hm : m ∈ ↑(Finset.Ico 0 ↑2)

⊢ False
-- Mathlib/Topology/EMetricSpace/Basic.lean
α : Type u
β : Type v
X : Type u_1
inst✝¹ : PseudoEMetricSpace α
x✝² y z : α
ε✝ ε₁ ε₂ : ℝ≥0∞
s t✝ : Set α
inst✝ : PseudoEMetricSpace β
f : α → β
t : Set β
a : α
b : β
ε : ℝ≥0∞
x✝¹ : 0 < ε
δ : ℝ≥0∞
x✝ : 0 < δ
x : α

⊢ edist x a < δ → x ∈ s → edist (f x) b < ε ∧ f x ∈ t ↔ x ∈ s → edist x a < δ → f x ∈ t ∧ edist (f x) b < ε
-- Mathlib/Topology/List.lean
α : Type u_1
β : Type u_2
inst✝¹ : TopologicalSpace α
inst✝ : TopologicalSpace β
a : α
l : List α

⊢ 𝓝 (a :: l) = Seq.seq (List.cons <$> 𝓝 a) fun x => 𝓝 l
-- Mathlib/Data/Fintype/Lattice.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝² : Finite α
inst✝¹ : Nonempty α
inst✝ : LinearOrder β
f : α → β

⊢ ∃ x₀, ∀ (x : α), f x₀ ≤ f x
-- Mathlib/Data/Fintype/Lattice.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝² : Finite α
inst✝¹ : Nonempty α
inst✝ : LinearOrder β
f : α → β
val✝ : Fintype α

⊢ ∃ x₀, ∀ (x : α), f x₀ ≤ f x
-- Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
P : MorphismProperty Scheme
inst✝² : IsLocalAtSource P
X✝ Y✝ U V : Scheme
f✝ : X✝ ⟶ Y✝
g : U ⟶ Y✝
inst✝¹ : IsOpenImmersion g
𝒰✝ : X✝.OpenCover
inst✝ : P.IsMultiplicative
hP : ∀ {X Y Z : Scheme} (f : X ⟶ Y) (g : Y ⟶ Z) [inst : IsOpenImmersion g], P (f ≫ g) → P f
X Y : Scheme
f : X ⟶ Y
𝒰 : Y.OpenCover

⊢ P f ↔ ∀ (i : (𝒰.pullbackCover f).J), P (𝒰.pullbackHom f i)
-- Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
P : MorphismProperty Scheme
inst✝² : IsLocalAtSource P
X✝ Y✝ U V : Scheme
f✝ : X✝ ⟶ Y✝
g : U ⟶ Y✝
inst✝¹ : IsOpenImmersion g
𝒰✝ : X✝.OpenCover
inst✝ : P.IsMultiplicative
hP : ∀ {X Y Z : Scheme} (f : X ⟶ Y) (g : Y ⟶ Z) [inst : IsOpenImmersion g], P (f ≫ g) → P f
X Y : Scheme
f : X ⟶ Y
𝒰 : Y.OpenCover
i : (𝒰.pullbackCover f).J

⊢ P ((𝒰.pullbackCover f).map i ≫ f) ↔ P (𝒰.pullbackHom f i)
-- Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
P : MorphismProperty Scheme
inst✝² : IsLocalAtSource P
X✝ Y✝ U V : Scheme
f✝ : X✝ ⟶ Y✝
g : U ⟶ Y✝
inst✝¹ : IsOpenImmersion g
𝒰✝ : X✝.OpenCover
inst✝ : P.IsMultiplicative
hP : ∀ {X Y Z : Scheme} (f : X ⟶ Y) (g : Y ⟶ Z) [inst : IsOpenImmersion g], P (f ≫ g) → P f
X Y : Scheme
f : X ⟶ Y
𝒰 : Y.OpenCover
i : (𝒰.pullbackCover f).J

⊢ P (𝒰.pullbackHom f i ≫ 𝒰.map i) ↔ P (𝒰.pullbackHom f i)
-- Mathlib/Data/Nat/Defs.lean
a b c d m n k : ℕ
p q : ℕ → Prop
motive : (m : ℕ) → m ≤ k → Sort u_1
hmn : m ≤ n
hnk : n ≤ k
of_succ : (k_1 : ℕ) → (h : k_1 < k) → motive (k_1 + 1) h → motive k_1 ⋯
self : motive k ⋯

⊢ decreasingInduction of_succ self ⋯ = decreasingInduction (fun n_1 ih => of_succ n_1 ⋯) (decreasingInduction of_succ self hnk) hmn
-- Mathlib/RingTheory/UniqueFactorizationDomain.lean
α : Type u_1
inst✝² : CancelCommMonoidWithZero α
inst✝¹ : NormalizationMonoid α
inst✝ : UniqueFactorizationMonoid α
a : α
ane0 : ¬a = 0
x : α
hx : x ∈ Multiset.map (fun x => normalize x) (Classical.choose ⋯)

⊢ Prime x
-- Mathlib/RingTheory/UniqueFactorizationDomain.lean
α : Type u_1
inst✝² : CancelCommMonoidWithZero α
inst✝¹ : NormalizationMonoid α
inst✝ : UniqueFactorizationMonoid α
a : α
ane0 : ¬a = 0
y : α
hy : y ∈ Classical.choose ⋯
hx : normalize y ∈ Multiset.map (fun x => normalize x) (Classical.choose ⋯)

⊢ Prime (normalize y)
-- Mathlib/RingTheory/UniqueFactorizationDomain.lean
α : Type u_1
inst✝² : CancelCommMonoidWithZero α
inst✝¹ : NormalizationMonoid α
inst✝ : UniqueFactorizationMonoid α
a : α
ane0 : ¬a = 0
y : α
hy : y ∈ Classical.choose ⋯
hx : normalize y ∈ Multiset.map (fun x => normalize x) (Classical.choose ⋯)

⊢ Prime y
-- Mathlib/Data/Rat/Defs.lean
q : ℚ
a b : ℤ
b0 : b ≠ 0

⊢ a /. b = 0 ↔ a = 0
-- Mathlib/CategoryTheory/Galois/Prorepresentability.lean
C : Type u₁
inst✝² : Category.{u₂, u₁} C
inst✝¹ : GaloisCategory C
F : C ⥤ FintypeCat
inst✝ : FiberFunctor F
A B : PointedGaloisObject F
f : A ⟶ B
φ : Aut B.obj

⊢ ∃ a, ((autGaloisSystem F).map f) a = φ
-- Mathlib/CategoryTheory/Galois/Prorepresentability.lean
C : Type u₁
inst✝² : Category.{u₂, u₁} C
inst✝¹ : GaloisCategory C
F : C ⥤ FintypeCat
inst✝ : FiberFunctor F
A B : PointedGaloisObject F
f : A ⟶ B
φ : Aut B.obj
ψ : Aut A.obj
hψ : autMap f.val ψ = φ

⊢ ∃ a, ((autGaloisSystem F).map f) a = φ
-- Mathlib/CategoryTheory/Galois/Prorepresentability.lean
C : Type u₁
inst✝² : Category.{u₂, u₁} C
inst✝¹ : GaloisCategory C
F : C ⥤ FintypeCat
inst✝ : FiberFunctor F
A B : PointedGaloisObject F
f : A ⟶ B
φ : Aut B.obj
ψ : Aut A.obj
hψ : autMap f.val ψ = φ

⊢ ((autGaloisSystem F).map f) ψ = φ
-- Mathlib/CategoryTheory/Galois/Prorepresentability.lean
C : Type u₁
inst✝² : Category.{u₂, u₁} C
inst✝¹ : GaloisCategory C
F : C ⥤ FintypeCat
inst✝ : FiberFunctor F
A B : PointedGaloisObject F
f : A ⟶ B
φ : Aut B.obj
ψ : Aut A.obj
hψ : autMap f.val ψ = φ

⊢ (autMapHom f.val) ψ = φ
-- Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean
X Y : TopCat
f g : C(↑X, ↑Y)
H : f.Homotopy g
x₀ x₁ : ↑X
p : fromTop x₀ ⟶ fromTop x₁

⊢ (π.map f).map p ≫ ⟦H.evalAt x₁⟧ = H.diagonalPath' p ∧ ⟦H.evalAt x₀⟧ ≫ (π.map g).map p = H.diagonalPath' p
-- Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean
X Y : TopCat
f g : C(↑X, ↑Y)
H : f.Homotopy g
x₀ x₁ : ↑X
p : fromTop x₀ ⟶ fromTop x₁

⊢ (hcast ⋯ ≫ (π.map H.uliftMap).map (prodToProdTopI (𝟙 (fromTop { down := 0 })) p) ≫ hcast ⋯) ≫ ⟦H.evalAt x₁⟧ = H.diagonalPath' p ∧ (hcast ⋯ ≫ (π.map H.uliftMap).map (prodToProdTopI uhpath01 (𝟙 (fromTop x₀))) ≫ hcast ⋯) ≫ hcast ⋯ ≫ (π.map H.uliftMap).map (prodToProdTopI (𝟙 (fromTop { down := 1 })) p) ≫ hcast ⋯ = H.diagonalPath' p
-- Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean
X Y : TopCat
f g : C(↑X, ↑Y)
H : f.Homotopy g
x₀ x₁ : ↑X
p : fromTop x₀ ⟶ fromTop x₁

⊢ (hcast ⋯ ≫ (π.map H.uliftMap).map (prodToProdTopI (𝟙 (fromTop { down := 0 })) p) ≫ hcast ⋯) ≫ hcast ⋯ ≫ (π.map H.uliftMap).map (prodToProdTopI uhpath01 (𝟙 (fromTop (fromTop x₁).as))) ≫ hcast ⋯ = H.diagonalPath' p ∧ (hcast ⋯ ≫ (π.map H.uliftMap).map (prodToProdTopI uhpath01 (𝟙 (fromTop x₀))) ≫ hcast ⋯) ≫ hcast ⋯ ≫ (π.map H.uliftMap).map (prodToProdTopI (𝟙 (fromTop { down := 1 })) p) ≫ hcast ⋯ = H.diagonalPath' p
-- Mathlib/Data/Array/ExtractLemmas.lean
α : Type u
i s1 e2 e1 s2 : Nat
a : Array α
h : s1 + e2 ≤ e1

⊢ (a.extract s1 e1).extract s2 e2 = a.extract (s1 + s2) (s1 + e2)
-- Mathlib/Data/Array/ExtractLemmas.lean
α : Type u
i s1 e2 e1 s2 : Nat
a : Array α
h : s1 + e2 ≤ e1

⊢ ((a.extract s1 e1).extract s2 e2).size = (a.extract (s1 + s2) (s1 + e2)).size
-- Mathlib/Data/Array/ExtractLemmas.lean
α : Type u
i s1 e2 e1 s2 : Nat
a : Array α
h : s1 + e2 ≤ e1

⊢ ∀ (i : Nat) (hi₁ : i < ((a.extract s1 e1).extract s2 e2).size) (hi₂ : i < (a.extract (s1 + s2) (s1 + e2)).size), ((a.extract s1 e1).extract s2 e2)[i] = (a.extract (s1 + s2) (s1 + e2))[i]
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
p : ℕ
hp0 : 0 < f ↑p
hp1 : f ↑p < 1
hmin : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m

⊢ ∃! p, ∃ (hp : Fact (Nat.Prime p)), f.equiv (mulRingNorm_padic p)
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
p✝ : ℕ
hp0 : 0 < f ↑p✝
hp1 : f ↑p✝ < 1
hmin✝ : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p✝ ≤ m
p : ℕ
hfp : 0 < f ↑p ∧ f ↑p < 1
hmin : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m

⊢ ∃! p, ∃ (hp : Fact (Nat.Prime p)), f.equiv (mulRingNorm_padic p)
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
p✝ : ℕ
hp0 : 0 < f ↑p✝
hp1 : f ↑p✝ < 1
hmin✝ : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p✝ ≤ m
p : ℕ
hfp : 0 < f ↑p ∧ f ↑p < 1
hmin : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m
hprime : Nat.Prime p

⊢ ∃! p, ∃ (hp : Fact (Nat.Prime p)), f.equiv (mulRingNorm_padic p)
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
p✝ : ℕ
hp0 : 0 < f ↑p✝
hp1 : f ↑p✝ < 1
hmin✝ : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p✝ ≤ m
p : ℕ
hfp : 0 < f ↑p ∧ f ↑p < 1
hmin : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m
hprime : Nat.Prime p
hprime_fact : Fact (Nat.Prime p)

⊢ ∃! p, ∃ (hp : Fact (Nat.Prime p)), f.equiv (mulRingNorm_padic p)
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
p✝ : ℕ
hp0 : 0 < f ↑p✝
hp1 : f ↑p✝ < 1
hmin✝ : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p✝ ≤ m
p : ℕ
hfp : 0 < f ↑p ∧ f ↑p < 1
hmin : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m
hprime : Nat.Prime p
hprime_fact : Fact (Nat.Prime p)
t : ℝ
h : 0 < t ∧ f ↑p = ↑p ^ (-t)

⊢ ∃! p, ∃ (hp : Fact (Nat.Prime p)), f.equiv (mulRingNorm_padic p)
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
p✝ : ℕ
hp0 : 0 < f ↑p✝
hp1 : f ↑p✝ < 1
hmin✝ : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p✝ ≤ m
p : ℕ
hfp : 0 < f ↑p ∧ f ↑p < 1
hmin : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m
hprime : Nat.Prime p
hprime_fact : Fact (Nat.Prime p)
t : ℝ
h : 0 < t ∧ f ↑p = ↑p ^ (-t)

⊢ ∃! p, ∃ (h : Fact (Nat.Prime p)), ∃ c, 0 < c ∧ ∀ (n : ℕ), f ↑n ^ c = (mulRingNorm_padic p) ↑n
-- Mathlib/NumberTheory/Ostrowski.lean
f g : MulRingNorm ℚ
hf_nontriv : f ≠ 1
bdd : ∀ (n : ℕ), f ↑n ≤ 1
p✝ : ℕ
hp0 : 0 < f ↑p✝
hp1 : f ↑p✝ < 1
hmin✝ : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p✝ ≤ m
p : ℕ
hfp : 0 < f ↑p ∧ f ↑p < 1
hmin : ∀ (m : ℕ), 0 < f ↑m ∧ f ↑m < 1 → p ≤ m
hprime : Nat.Prime p
hprime_fact : Fact (Nat.Prime p)
t : ℝ
h : 0 < t ∧ f ↑p = ↑p ^ (-t)

⊢ (fun p => ∃ (h : Fact (Nat.Prime p)), ∃ c, 0 < c ∧ ∀ (n : ℕ), f ↑n ^ c = (mulRingNorm_padic p) ↑n) p ∧ ∀ (y : ℕ), (fun p => ∃ (h : Fact (Nat.Prime p)), ∃ c, 0 < c ∧ ∀ (n : ℕ), f ↑n ^ c = (mulRingNorm_padic p) ↑n) y → y = p
-- Mathlib/MeasureTheory/Function/SimpleFunc.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
m : MeasurableSpace α
μ ν : Measure α
f : α →ₛ ℝ≥0∞
s : Set α
hs : MeasurableSet s
x : α
hx : ↑(f.restrict s) x ≠ 0
hxs : x ∈ s
x✝ : μ (↑(f.restrict s) ⁻¹' {↑(f.restrict s) x}) ≠ 0

⊢ ↑(f.restrict s) x ∈ f.range
-- Mathlib/MeasureTheory/Function/SimpleFunc.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
m : MeasurableSpace α
μ ν : Measure α
f : α →ₛ ℝ≥0∞
s : Set α
hs : MeasurableSet s
b : α
hb : ↑f b = 0

⊢ ↑f b * μ (↑(f.restrict s) ⁻¹' {↑f b}) = ↑f b * μ (↑f ⁻¹' {↑f b} ∩ s)
-- Mathlib/MeasureTheory/Function/SimpleFunc.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
m : MeasurableSpace α
μ ν : Measure α
f : α →ₛ ℝ≥0∞
s : Set α
hs : MeasurableSet s
b : α
hb : ¬↑f b = 0

⊢ ↑f b * μ (↑(f.restrict s) ⁻¹' {↑f b}) = ↑f b * μ (↑f ⁻¹' {↑f b} ∩ s)
-- Mathlib/SetTheory/Ordinal/Arithmetic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
r : α → α → Prop
s : β → β → Prop
t : γ → γ → Prop
a : Ordinal.{u_4}
h : a ≠ 0

⊢ a / a = 1
-- Mathlib/MeasureTheory/Decomposition/SignedLebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
s t✝ t : SignedMeasure α
f : α → ℝ
hfi : Integrable f μ
htμ : t ⟂ᵥ μ.toENNRealVectorMeasure
hadd : s = t + μ.withDensityᵥ f

⊢ f =ᶠ[ae μ] s.rnDeriv μ
-- Mathlib/MeasureTheory/Decomposition/SignedLebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
s t✝ t : SignedMeasure α
f : α → ℝ
hfi : Integrable f μ
htμ : t ⟂ᵥ μ.toENNRealVectorMeasure
hadd : s = t + μ.withDensityᵥ f
f' : α → ℝ := AEStronglyMeasurable.mk f ⋯

⊢ f =ᶠ[ae μ] s.rnDeriv μ
-- Mathlib/MeasureTheory/Decomposition/SignedLebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
s t✝ t : SignedMeasure α
f : α → ℝ
hfi : Integrable f μ
htμ : t ⟂ᵥ μ.toENNRealVectorMeasure
hadd : s = t + μ.withDensityᵥ f
f' : α → ℝ := AEStronglyMeasurable.mk f ⋯
hadd' : s = t + μ.withDensityᵥ f'

⊢ f =ᶠ[ae μ] s.rnDeriv μ
-- Mathlib/MeasureTheory/Decomposition/SignedLebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
s t✝ t : SignedMeasure α
f : α → ℝ
hfi : Integrable f μ
htμ : t ⟂ᵥ μ.toENNRealVectorMeasure
hadd : s = t + μ.withDensityᵥ f
f' : α → ℝ := AEStronglyMeasurable.mk f ⋯
hadd' : s = t + μ.withDensityᵥ f'
this : s.HaveLebesgueDecomposition μ

⊢ f =ᶠ[ae μ] s.rnDeriv μ
-- Mathlib/MeasureTheory/Decomposition/SignedLebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
s t✝ t : SignedMeasure α
f : α → ℝ
hfi : Integrable f μ
htμ : t ⟂ᵥ μ.toENNRealVectorMeasure
hadd : s = t + μ.withDensityᵥ f
f' : α → ℝ := AEStronglyMeasurable.mk f ⋯
hadd' : s = t + μ.withDensityᵥ f'
this : s.HaveLebesgueDecomposition μ

⊢ μ.withDensityᵥ (s.rnDeriv μ) = μ.withDensityᵥ f
-- Mathlib/Algebra/Quandle.lean
R✝ : Type u_1
inst✝¹ : Rack R✝
R : Type u_2
inst✝ : Rack R
x y z : R

⊢ x ◃ y ◃ z = (x ◃ y) ◃ z ↔ x ◃ z = z
-- Mathlib/Algebra/Quandle.lean
R✝ : Type u_1
inst✝¹ : Rack R✝
R : Type u_2
inst✝ : Rack R
x y z : R

⊢ (x ◃ y) ◃ x ◃ z = (x ◃ y) ◃ z ↔ x ◃ z = z
-- Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean
R : Type u
inst✝⁴ : CommRing R
n G : Type v
inst✝³ : DecidableEq n
inst✝² : Fintype n
α β : Type v
inst✝¹ : DecidableEq α
M✝ : Matrix n n R
p : ℕ
inst✝ : Fact (Nat.Prime p)
M : Matrix n n R
a✝ : Nontrivial R

⊢ M.charpolyRev.coeff 1 = -M.trace
-- Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean
R : Type u
inst✝⁴ : CommRing R
n G : Type v
inst✝³ : DecidableEq n
inst✝² : Fintype n
α β : Type v
inst✝¹ : DecidableEq α
M✝ : Matrix n n R
p : ℕ
inst✝ : Fact (Nat.Prime p)
M : Matrix n n R
a✝ : Nontrivial R
h✝ : IsEmpty n

⊢ M.charpolyRev.coeff 1 = -M.trace
-- Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean
R : Type u
inst✝⁴ : CommRing R
n G : Type v
inst✝³ : DecidableEq n
inst✝² : Fintype n
α β : Type v
inst✝¹ : DecidableEq α
M✝ : Matrix n n R
p : ℕ
inst✝ : Fact (Nat.Prime p)
M : Matrix n n R
a✝ : Nontrivial R
h✝ : Nonempty n

⊢ M.charpolyRev.coeff 1 = -M.trace
-- Mathlib/Data/Finset/PImage.lean
α : Type u_1
β : Type u_2
inst✝³ : DecidableEq β
f g : α →. β
inst✝² : (x : α) → Decidable (f x).Dom
inst✝¹ : (x : α) → Decidable (g x).Dom
s t : Finset α
b : β
inst✝ : DecidableEq α

⊢ pimage f (s ∩ t) ⊆ pimage f s ∩ pimage f t
-- Mathlib/Data/Set/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
f f' : α → β → γ
g g' : α → β → γ → δ
s s' : Set α
t t' : Set β
u u' : Set γ
v : Set δ
a a' : α
b b' : β
c c' : γ
d d' : δ

⊢ image2 f (insert a s) t = (fun b => f a b) '' t ∪ image2 f s t
-- Mathlib/CategoryTheory/Localization/Bousfield.lean
C : Type u_1
D : Type u_2
inst✝³ : Category.{u_4, u_1} C
inst✝² : Category.{u_3, u_2} D
F : C ⥤ D
G : D ⥤ C
adj : G ⊣ F
inst✝¹ : F.Full
inst✝ : F.Faithful
X Y : D
f : X ⟶ Y

⊢ W (fun x => x ∈ Set.range F.obj) f ↔ IsIso (G.map f)
-- Mathlib/CategoryTheory/Localization/Bousfield.lean
C : Type u_1
D : Type u_2
inst✝³ : Category.{u_4, u_1} C
inst✝² : Category.{u_3, u_2} D
F : C ⥤ D
G : D ⥤ C
adj : G ⊣ F
inst✝¹ : F.Full
inst✝ : F.Faithful
X Y : D
f : X ⟶ Y

⊢ W (fun x => x ∈ Set.range F.obj) (f ≫ adj.unit.app Y) ↔ IsIso (G.map f)
-- Mathlib/CategoryTheory/Localization/Bousfield.lean
C : Type u_1
D : Type u_2
inst✝³ : Category.{u_4, u_1} C
inst✝² : Category.{u_3, u_2} D
F : C ⥤ D
G : D ⥤ C
adj : G ⊣ F
inst✝¹ : F.Full
inst✝ : F.Faithful
X Y : D
f : X ⟶ Y

⊢ W (fun x => x ∈ Set.range F.obj) (adj.unit.app X ≫ (G ⋙ F).map f) ↔ IsIso (G.map f)
-- Mathlib/CategoryTheory/Localization/Bousfield.lean
C : Type u_1
D : Type u_2
inst✝³ : Category.{u_4, u_1} C
inst✝² : Category.{u_3, u_2} D
F : C ⥤ D
G : D ⥤ C
adj : G ⊣ F
inst✝¹ : F.Full
inst✝ : F.Faithful
X Y : D
f : X ⟶ Y

⊢ IsIso ((G ⋙ F).map f) ↔ IsIso (G.map f)
-- Mathlib/Algebra/Order/Ring/WithTop.lean
α : Type u_1
inst✝¹ : DecidableEq α
inst✝ : MulZeroClass α
a b : WithTop α

⊢ a * b = ⊤ ↔ a ≠ 0 ∧ b = ⊤ ∨ a = ⊤ ∧ b ≠ 0
-- Mathlib/Algebra/Order/Ring/WithTop.lean
α : Type u_1
inst✝¹ : DecidableEq α
inst✝ : MulZeroClass α
a b : WithTop α

⊢ (if a = 0 ∨ b = 0 then 0 else map₂ (fun x x_1 => x * x_1) a b) = ⊤ ↔ a ≠ 0 ∧ b = ⊤ ∨ a = ⊤ ∧ b ≠ 0
-- Mathlib/Order/Heyting/Regular.lean
α : Type u_1
inst✝ : HeytingAlgebra α
a b : α

⊢ IsRegular ⊥
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m : MeasurableSpace α
μ μ₁ μ₂ : Measure α
s s₁ s₂ t : Set α
hμst : μ (s ∆ t) ≠ ⊤

⊢ μ s = ⊤ ↔ μ t = ⊤
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m : MeasurableSpace α
μ μ₁ μ₂ : Measure α
s s₁ s₂ t : Set α
hμst : μ (s ∆ t) ≠ ⊤

⊢ ∀ (u v : Set α), μ (u ∆ v) ≠ ⊤ → μ u = ⊤ → μ v = ⊤
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m : MeasurableSpace α
μ μ₁ μ₂ : Measure α
s s₁ s₂ t : Set α
hμst : μ (s ∆ t) ≠ ⊤
u v : Set α
hμuv : μ (u ∆ v) ≠ ⊤
hμu : μ u = ⊤

⊢ μ v = ⊤
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m : MeasurableSpace α
μ μ₁ μ₂ : Measure α
s s₁ s₂ t : Set α
hμst : μ (s ∆ t) ≠ ⊤
u v : Set α
hμuv : μ (u ∆ v) ≠ ⊤
hμu : μ u = ⊤
hμv : μ v ≠ ⊤

⊢ False
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m : MeasurableSpace α
μ μ₁ μ₂ : Measure α
s s₁ s₂ t : Set α
hμst : μ (s ∆ t) ≠ ⊤
u v : Set α
hμuv : μ (u ∆ v) ≠ ⊤
hμu : μ u = ⊤
hμv : μ v ≠ ⊤

⊢ μ (u ∆ v) = ⊤
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m : MeasurableSpace α
μ μ₁ μ₂ : Measure α
s s₁ s₂ t : Set α
hμst : μ (s ∆ t) ≠ ⊤
u v : Set α
hμuv : μ (u ∆ v) ≠ ⊤
hμu : μ u = ⊤
hμv : μ v ≠ ⊤

⊢ ⊤ ≤ μ (u \ v ∪ v \ u)
-- Mathlib/Analysis/SpecialFunctions/Exp.lean
α : Type u_1
x y z : ℝ
l : Filter α
f : α → ℝ

⊢ ((fun x => rexp (f x)) =Θ[l] fun x => 1) ↔ IsBoundedUnder (fun x x_1 => x ≤ x_1) l fun x => |f x|
-- Mathlib/Topology/Compactness/Lindelof.lean
X : Type u
Y : Type v
ι : Type u_1
inst✝¹ : TopologicalSpace X
inst✝ : TopologicalSpace Y
s t : Set X
h : ∀ {ι : Type u} (t : ι → Set X), (∀ (i : ι), IsClosed (t i)) → s ∩ ⋂ i, t i = ∅ → ∃ u, u.Countable ∧ s ∩ ⋂ i ∈ u, t i = ∅
ι✝ : Type u
U : ι✝ → Set X
hUo : ∀ (i : ι✝), IsOpen (U i)
hsU : s ⊆ ⋃ i, U i

⊢ ∃ t, t.Countable ∧ s ⊆ ⋃ i ∈ t, U i
-- Mathlib/Topology/Compactness/Lindelof.lean
X : Type u
Y : Type v
ι : Type u_1
inst✝¹ : TopologicalSpace X
inst✝ : TopologicalSpace Y
s t : Set X
h : ∀ {ι : Type u} (t : ι → Set X), (∀ (i : ι), IsClosed (t i)) → s ∩ ⋂ i, t i = ∅ → ∃ u, u.Countable ∧ s ∩ ⋂ i ∈ u, t i = ∅
ι✝ : Type u
U : ι✝ → Set X
hUo : ∀ (i : ι✝), IsOpen (U i)
hsU : s ⊓ ⋂ i, (U i)ᶜ = ⊥

⊢ ∃ t, t.Countable ∧ s ⊆ ⋃ i ∈ t, U i
-- Mathlib/Topology/Compactness/Lindelof.lean
X : Type u
Y : Type v
ι : Type u_1
inst✝¹ : TopologicalSpace X
inst✝ : TopologicalSpace Y
s t✝ : Set X
h : ∀ {ι : Type u} (t : ι → Set X), (∀ (i : ι), IsClosed (t i)) → s ∩ ⋂ i, t i = ∅ → ∃ u, u.Countable ∧ s ∩ ⋂ i ∈ u, t i = ∅
ι✝ : Type u
U : ι✝ → Set X
hUo : ∀ (i : ι✝), IsOpen (U i)
hsU : s ⊓ ⋂ i, (U i)ᶜ = ⊥
t : Set ι✝
ht : t.Countable ∧ s ∩ ⋂ i ∈ t, (U i)ᶜ = ∅

⊢ t.Countable ∧ s ⊆ ⋃ i ∈ t, U i
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0

⊢ (Polynomial.idealX K).intValuation P = (idealX K).intValuation ↑P
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0

⊢ (Polynomial.idealX K).intValuationDef P = (idealX K).intValuationDef ↑P
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0

⊢ ↑(Multiplicative.ofAdd (-↑((Associates.mk (Polynomial.idealX K).asIdeal).count (Associates.mk (Ideal.span {P})).factors))) = ↑(Multiplicative.ofAdd (-↑((Associates.mk (idealX K).asIdeal).count (Associates.mk (Ideal.span {↑P})).factors)))
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0

⊢ (Associates.mk (Ideal.span {Polynomial.X})).count (Associates.mk (Ideal.span {P})).factors = (Associates.mk (idealX K).asIdeal).count (Associates.mk (Ideal.span {↑P})).factors
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0

⊢ (Associates.mk (Ideal.span {Polynomial.X})).count (Associates.mk (Ideal.span {P})).factors = (Associates.mk (idealX K).asIdeal).count (Associates.mk (Ideal.span {↑P})).factors
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0
span_ne_zero' : Ideal.span {↑P} ≠ 0 ∧ (idealX K).asIdeal ≠ 0

⊢ (Associates.mk (Ideal.span {Polynomial.X})).count (Associates.mk (Ideal.span {P})).factors = (Associates.mk (idealX K).asIdeal).count (Associates.mk (Ideal.span {↑P})).factors
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0
span_ne_zero' : Ideal.span {↑P} ≠ 0 ∧ (idealX K).asIdeal ≠ 0

⊢ Multiset.count (Ideal.span {Polynomial.X}) (UniqueFactorizationMonoid.normalizedFactors (Ideal.span {P})) = Multiset.count (idealX K).asIdeal (UniqueFactorizationMonoid.normalizedFactors (Ideal.span {↑P}))
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0
span_ne_zero' : Ideal.span {↑P} ≠ 0 ∧ (idealX K).asIdeal ≠ 0

⊢ Ideal.span {↑P} ≠ 0
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0
span_ne_zero' : Ideal.span {↑P} ≠ 0 ∧ (idealX K).asIdeal ≠ 0

⊢ (idealX K).asIdeal.IsPrime
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0
span_ne_zero' : Ideal.span {↑P} ≠ 0 ∧ (idealX K).asIdeal ≠ 0

⊢ (idealX K).asIdeal ≠ ⊥
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0
span_ne_zero' : Ideal.span {↑P} ≠ 0 ∧ (idealX K).asIdeal ≠ 0

⊢ Multiset.count (Ideal.span {Polynomial.X}) (UniqueFactorizationMonoid.normalizedFactors (Ideal.span {P})) = Multiset.count Polynomial.X (UniqueFactorizationMonoid.normalizedFactors P)
-- Mathlib/RingTheory/LaurentSeries.lean
R : Type u_1
K : Type u_2
inst✝ : Field K
P : K[X]
hP : ¬P = 0
span_ne_zero : Ideal.span {P} ≠ 0 ∧ Ideal.span {Polynomial.X} ≠ 0
span_ne_zero' : Ideal.span {↑P} ≠ 0 ∧ (idealX K).asIdeal ≠ 0

⊢ Multiset.count (idealX K).asIdeal (UniqueFactorizationMonoid.normalizedFactors (Ideal.span {↑P})) = Multiset.count X (UniqueFactorizationMonoid.normalizedFactors ↑P)