ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/MeasureTheory/Measure/Portmanteau.lean
Ω : Type u_1
ι : Type u_2
L : Filter ι
inst✝³ : MeasurableSpace Ω
inst✝² : TopologicalSpace Ω
inst✝¹ : HasOuterApproxClosed Ω
inst✝ : OpensMeasurableSpace Ω
μ : FiniteMeasure Ω
μs : ι → FiniteMeasure Ω
μs_lim : Tendsto μs L (𝓝 μ)
F : Set Ω
F_closed : IsClosed F
hne : L.NeBot
ε : ℝ≥0
ε_pos : 0 < ε
a✝ : ↑μ F < ⊤
fs : ℕ → Ω →ᵇ ℝ≥0 := F_closed.apprSeq
key₁ : Tendsto (fun n => ∫⁻ (ω : Ω), ↑((fs n) ω) ∂↑μ) atTop (𝓝 (↑μ F))
room₁ : ↑μ F < ↑μ F + ↑ε / 2
M : ℕ
hM : ∀ b ≥ M, ∫⁻ (ω : Ω), ↑((fs b) ω) ∂↑μ < ↑μ F + ↑ε / 2
key₂ : Tendsto (fun i => ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs i)) L (𝓝 (∫⁻ (x : Ω), ↑((fs M) x) ∂↑μ))
room₂ : ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ < ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2

⊢ limsup (fun i => ↑(μs i) F) L ≤ ↑μ F + ↑ε
-- Mathlib/MeasureTheory/Measure/Portmanteau.lean
Ω : Type u_1
ι : Type u_2
L : Filter ι
inst✝³ : MeasurableSpace Ω
inst✝² : TopologicalSpace Ω
inst✝¹ : HasOuterApproxClosed Ω
inst✝ : OpensMeasurableSpace Ω
μ : FiniteMeasure Ω
μs : ι → FiniteMeasure Ω
μs_lim : Tendsto μs L (𝓝 μ)
F : Set Ω
F_closed : IsClosed F
hne : L.NeBot
ε : ℝ≥0
ε_pos : 0 < ε
a✝ : ↑μ F < ⊤
fs : ℕ → Ω →ᵇ ℝ≥0 := F_closed.apprSeq
key₁ : Tendsto (fun n => ∫⁻ (ω : Ω), ↑((fs n) ω) ∂↑μ) atTop (𝓝 (↑μ F))
room₁ : ↑μ F < ↑μ F + ↑ε / 2
M : ℕ
hM : ∀ b ≥ M, ∫⁻ (ω : Ω), ↑((fs b) ω) ∂↑μ < ↑μ F + ↑ε / 2
key₂ : Tendsto (fun i => ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs i)) L (𝓝 (∫⁻ (x : Ω), ↑((fs M) x) ∂↑μ))
room₂ : ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ < ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near : ∀ᶠ (x : ι) in L, ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs x) ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2

⊢ limsup (fun i => ↑(μs i) F) L ≤ ↑μ F + ↑ε
-- Mathlib/MeasureTheory/Measure/Portmanteau.lean
Ω : Type u_1
ι : Type u_2
L : Filter ι
inst✝³ : MeasurableSpace Ω
inst✝² : TopologicalSpace Ω
inst✝¹ : HasOuterApproxClosed Ω
inst✝ : OpensMeasurableSpace Ω
μ : FiniteMeasure Ω
μs : ι → FiniteMeasure Ω
μs_lim : Tendsto μs L (𝓝 μ)
F : Set Ω
F_closed : IsClosed F
hne : L.NeBot
ε : ℝ≥0
ε_pos : 0 < ε
a✝ : ↑μ F < ⊤
fs : ℕ → Ω →ᵇ ℝ≥0 := F_closed.apprSeq
key₁ : Tendsto (fun n => ∫⁻ (ω : Ω), ↑((fs n) ω) ∂↑μ) atTop (𝓝 (↑μ F))
room₁ : ↑μ F < ↑μ F + ↑ε / 2
M : ℕ
hM : ∀ b ≥ M, ∫⁻ (ω : Ω), ↑((fs b) ω) ∂↑μ < ↑μ F + ↑ε / 2
key₂ : Tendsto (fun i => ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs i)) L (𝓝 (∫⁻ (x : Ω), ↑((fs M) x) ∂↑μ))
room₂ : ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ < ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near : ∀ᶠ (x : ι) in L, ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs x) ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near' : ∀ᶠ (x : ι) in L, ↑(μs x) F ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2

⊢ limsup (fun i => ↑(μs i) F) L ≤ ↑μ F + ↑ε
-- Mathlib/MeasureTheory/Measure/Portmanteau.lean
Ω : Type u_1
ι : Type u_2
L : Filter ι
inst✝³ : MeasurableSpace Ω
inst✝² : TopologicalSpace Ω
inst✝¹ : HasOuterApproxClosed Ω
inst✝ : OpensMeasurableSpace Ω
μ : FiniteMeasure Ω
μs : ι → FiniteMeasure Ω
μs_lim : Tendsto μs L (𝓝 μ)
F : Set Ω
F_closed : IsClosed F
hne : L.NeBot
ε : ℝ≥0
ε_pos : 0 < ε
a✝ : ↑μ F < ⊤
fs : ℕ → Ω →ᵇ ℝ≥0 := F_closed.apprSeq
key₁ : Tendsto (fun n => ∫⁻ (ω : Ω), ↑((fs n) ω) ∂↑μ) atTop (𝓝 (↑μ F))
room₁ : ↑μ F < ↑μ F + ↑ε / 2
M : ℕ
hM : ∀ b ≥ M, ∫⁻ (ω : Ω), ↑((fs b) ω) ∂↑μ < ↑μ F + ↑ε / 2
key₂ : Tendsto (fun i => ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs i)) L (𝓝 (∫⁻ (x : Ω), ↑((fs M) x) ∂↑μ))
room₂ : ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ < ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near : ∀ᶠ (x : ι) in L, ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs x) ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near' : ∀ᶠ (x : ι) in L, ↑(μs x) F ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2

⊢ limsup (fun x => ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2) L ≤ ↑μ F + ↑ε
-- Mathlib/MeasureTheory/Measure/Portmanteau.lean
Ω : Type u_1
ι : Type u_2
L : Filter ι
inst✝³ : MeasurableSpace Ω
inst✝² : TopologicalSpace Ω
inst✝¹ : HasOuterApproxClosed Ω
inst✝ : OpensMeasurableSpace Ω
μ : FiniteMeasure Ω
μs : ι → FiniteMeasure Ω
μs_lim : Tendsto μs L (𝓝 μ)
F : Set Ω
F_closed : IsClosed F
hne : L.NeBot
ε : ℝ≥0
ε_pos : 0 < ε
a✝ : ↑μ F < ⊤
fs : ℕ → Ω →ᵇ ℝ≥0 := F_closed.apprSeq
key₁ : Tendsto (fun n => ∫⁻ (ω : Ω), ↑((fs n) ω) ∂↑μ) atTop (𝓝 (↑μ F))
room₁ : ↑μ F < ↑μ F + ↑ε / 2
M : ℕ
hM : ∀ b ≥ M, ∫⁻ (ω : Ω), ↑((fs b) ω) ∂↑μ < ↑μ F + ↑ε / 2
key₂ : Tendsto (fun i => ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs i)) L (𝓝 (∫⁻ (x : Ω), ↑((fs M) x) ∂↑μ))
room₂ : ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ < ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near : ∀ᶠ (x : ι) in L, ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs x) ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near' : ∀ᶠ (x : ι) in L, ↑(μs x) F ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2

⊢ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2 ≤ ↑μ F + ↑ε
-- Mathlib/MeasureTheory/Measure/Portmanteau.lean
Ω : Type u_1
ι : Type u_2
L : Filter ι
inst✝³ : MeasurableSpace Ω
inst✝² : TopologicalSpace Ω
inst✝¹ : HasOuterApproxClosed Ω
inst✝ : OpensMeasurableSpace Ω
μ : FiniteMeasure Ω
μs : ι → FiniteMeasure Ω
μs_lim : Tendsto μs L (𝓝 μ)
F : Set Ω
F_closed : IsClosed F
hne : L.NeBot
ε : ℝ≥0
ε_pos : 0 < ε
a✝ : ↑μ F < ⊤
fs : ℕ → Ω →ᵇ ℝ≥0 := F_closed.apprSeq
key₁ : Tendsto (fun n => ∫⁻ (ω : Ω), ↑((fs n) ω) ∂↑μ) atTop (𝓝 (↑μ F))
room₁ : ↑μ F < ↑μ F + ↑ε / 2
M : ℕ
hM : ∀ b ≥ M, ∫⁻ (ω : Ω), ↑((fs b) ω) ∂↑μ < ↑μ F + ↑ε / 2
key₂ : Tendsto (fun i => ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs i)) L (𝓝 (∫⁻ (x : Ω), ↑((fs M) x) ∂↑μ))
room₂ : ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ < ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near : ∀ᶠ (x : ι) in L, ∫⁻ (x : Ω), ↑((fs M) x) ∂↑(μs x) ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2
ev_near' : ∀ᶠ (x : ι) in L, ↑(μs x) F ≤ ∫⁻ (a : Ω), ↑((fs M) a) ∂↑μ + ↑ε / 2

⊢ ↑μ F + ↑ε / 2 + ↑ε / 2 ≤ ↑μ F + ↑ε
-- Mathlib/Algebra/AddTorsor.lean
G : Type u_1
P : Type u_2
inst✝ : AddGroup G
T : AddTorsor G P
p₁ p₂ : P
g : G

⊢ p₁ -ᵥ (g +ᵥ p₂) = p₁ -ᵥ p₂ - g
-- Mathlib/Combinatorics/Hall/Finite.lean
ι : Type u
α : Type v
inst✝¹ : DecidableEq α
t : ι → Finset α
inst✝ : Fintype ι
n : ℕ
hn : Fintype.card ι = n + 1
ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card
ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x
ha : ∀ (s : Finset ι), s.Nonempty → s ≠ univ → s.card < (s.biUnion t).card

⊢ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x
-- Mathlib/Combinatorics/Hall/Finite.lean
ι : Type u
α : Type v
inst✝¹ : DecidableEq α
t : ι → Finset α
inst✝ : Fintype ι
n : ℕ
hn : Fintype.card ι = n + 1
ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card
ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x
ha : ∀ (s : Finset ι), s.Nonempty → s ≠ univ → s.card < (s.biUnion t).card
this : Nonempty ι

⊢ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x
-- Mathlib/Combinatorics/Hall/Finite.lean
ι : Type u
α : Type v
inst✝¹ : DecidableEq α
t : ι → Finset α
inst✝ : Fintype ι
n : ℕ
hn : Fintype.card ι = n + 1
ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card
ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x
ha : ∀ (s : Finset ι), s.Nonempty → s ≠ univ → s.card < (s.biUnion t).card
this✝ : Nonempty ι
this : DecidableEq ι
x : ι := Classical.arbitrary ι

⊢ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x
-- Mathlib/Combinatorics/Hall/Finite.lean
ι : Type u
α : Type v
inst✝¹ : DecidableEq α
t : ι → Finset α
inst✝ : Fintype ι
n : ℕ
hn : Fintype.card ι = n + 1
ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card
ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x
ha : ∀ (s : Finset ι), s.Nonempty → s ≠ univ → s.card < (s.biUnion t).card
this✝ : Nonempty ι
this : DecidableEq ι
x : ι := Classical.arbitrary ι
tx_ne : (t x).Nonempty

⊢ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x
-- Mathlib/Combinatorics/Hall/Finite.lean
ι : Type u
α : Type v
inst✝¹ : DecidableEq α
t : ι → Finset α
inst✝ : Fintype ι
n : ℕ
hn : Fintype.card ι = n + 1
ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card
ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x
ha : ∀ (s : Finset ι), s.Nonempty → s ≠ univ → s.card < (s.biUnion t).card
this✝ : Nonempty ι
this : DecidableEq ι
x : ι := Classical.arbitrary ι
y : α
hy : y ∈ t x
ι' : Set ι := {x' | x' ≠ x}
t' : ↑ι' → Finset α := fun x' => (t ↑x').erase y

⊢ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x
-- Mathlib/Combinatorics/Hall/Finite.lean
ι : Type u
α : Type v
inst✝¹ : DecidableEq α
t : ι → Finset α
inst✝ : Fintype ι
n : ℕ
hn : Fintype.card ι = n + 1
ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card
ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x
ha : ∀ (s : Finset ι), s.Nonempty → s ≠ univ → s.card < (s.biUnion t).card
this✝ : Nonempty ι
this : DecidableEq ι
x : ι := Classical.arbitrary ι
y : α
hy : y ∈ t x
ι' : Set ι := {x' | x' ≠ x}
t' : ↑ι' → Finset α := fun x' => (t ↑x').erase y
card_ι' : Fintype.card ↑ι' = n

⊢ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x
-- Mathlib/Combinatorics/Hall/Finite.lean
ι : Type u
α : Type v
inst✝¹ : DecidableEq α
t : ι → Finset α
inst✝ : Fintype ι
n : ℕ
hn : Fintype.card ι = n + 1
ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card
ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x
ha : ∀ (s : Finset ι), s.Nonempty → s ≠ univ → s.card < (s.biUnion t).card
this✝ : Nonempty ι
this : DecidableEq ι
x : ι := Classical.arbitrary ι
y : α
hy : y ∈ t x
ι' : Set ι := {x' | x' ≠ x}
t' : ↑ι' → Finset α := fun x' => (t ↑x').erase y
card_ι' : Fintype.card ↑ι' = n
f' : ↑ι' → α
hfinj : Function.Injective f'
hfr : ∀ (x : ↑ι'), f' x ∈ t' x

⊢ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x
-- Mathlib/GroupTheory/CoprodI.lean
ι : Type u_1
M : ι → Type u_2
inst✝³ : (i : ι) → Monoid (M i)
N : Type u_3
inst✝² : Monoid N
inst✝¹ : (i : ι) → DecidableEq (M i)
inst✝ : DecidableEq ι
i j : ι
w : Word M
m : M i

⊢ ⟨i, m⟩ ∈ ((equivPair j) w).tail.toList ↔ ⟨i, m⟩ ∈ w.toList.tail ∨ i ≠ j ∧ ∃ (h : w.toList ≠ []), w.toList.head h = ⟨i, m⟩
-- Mathlib/GroupTheory/CoprodI.lean
ι : Type u_1
M : ι → Type u_2
inst✝³ : (i : ι) → Monoid (M i)
N : Type u_3
inst✝² : Monoid N
inst✝¹ : (i : ι) → DecidableEq (M i)
inst✝ : DecidableEq ι
i j : ι
w : Word M
m : M i

⊢ ⟨i, m⟩ ∈ (↑(consRecOn w ⟨{ head := 1, tail := empty, fstIdx_ne := ⋯ }, ⋯⟩ fun j_1 m w h1 h2 x => if ij : j = j_1 then ⟨{ head := ⋯ ▸ m, tail := w, fstIdx_ne := ⋯ }, ⋯⟩ else ⟨{ head := 1, tail := cons m w h1 h2, fstIdx_ne := ⋯ }, ⋯⟩)).tail.toList ↔ ⟨i, m⟩ ∈ w.toList.tail ∨ ¬i = j ∧ ∃ (h : ¬w.toList = []), w.toList.head h = ⟨i, m⟩
-- Mathlib/Geometry/Manifold/LocalDiffeomorph.lean
𝕜 : Type u_1
inst✝¹⁰ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁹ : NormedAddCommGroup E
inst✝⁸ : NormedSpace 𝕜 E
F : Type u_3
inst✝⁷ : NormedAddCommGroup F
inst✝⁶ : NormedSpace 𝕜 F
H : Type u_4
inst✝⁵ : TopologicalSpace H
G : Type u_5
inst✝⁴ : TopologicalSpace G
I : ModelWithCorners 𝕜 E H
J : ModelWithCorners 𝕜 F G
M : Type u_6
inst✝³ : TopologicalSpace M
inst✝² : ChartedSpace H M
N : Type u_7
inst✝¹ : TopologicalSpace N
inst✝ : ChartedSpace G N
n : ℕ∞
f : M → N
s : Set M
x : M
Φ : PartialDiffeomorph I J M N n
hx : x ∈ Φ.source
heq : EqOn f (↑Φ.toPartialEquiv) Φ.source

⊢ ContMDiffAt I J n f x
-- Mathlib/Analysis/SpecialFunctions/Gamma/BohrMollerup.lean

⊢ Gamma 2 = 1
-- Mathlib/Data/Real/EReal.lean
x y : ℝ

⊢ Real.toEReal '' Ioo x y = Ioo ↑x ↑y
-- Mathlib/Data/Real/EReal.lean
x y : ℝ

⊢ WithBot.some '' (WithTop.some '' Ioo x y) = Ioo ↑x ↑y
-- Mathlib/Data/Real/EReal.lean
x y : ℝ

⊢ Ioo ↑↑x ↑↑y = Ioo ↑x ↑y
-- Mathlib/Algebra/GroupWithZero/Semiconj.lean
α : Type u_1
M₀ : Type u_2
G₀ : Type u_3
M₀' : Type u_4
G₀' : Type u_5
F : Type u_6
F' : Type u_7
inst✝ : GroupWithZero G₀
a x y x' y' : G₀
ha : a = 0

⊢ SemiconjBy a⁻¹ x y ↔ SemiconjBy a y x
-- Mathlib/AlgebraicGeometry/Noetherian.lean
X : Scheme
U : X.Opens
hU : IsAffineOpen U
inst✝ : IsNoetherianRing ↑Γ(X, U)

⊢ NoetherianSpace ↑↑(↑U).toPresheafedSpace
-- Mathlib/AlgebraicGeometry/Noetherian.lean
X : Scheme
U : X.Opens
hU : IsAffineOpen U
inst✝ : IsNoetherianRing ↑Γ(X, U)
this : IsNoetherianRing ↑Γ(↑U, ⊤)

⊢ NoetherianSpace ↑↑(↑U).toPresheafedSpace
-- Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev.lean
R : Type u_1
A : Type u_2
inst✝² : CommRing R
inst✝¹ : CommRing A
inst✝ : Algebra R A
x : A
n : ℤ

⊢ (aeval x) (U R n) = eval x (U A n)
-- Mathlib/RingTheory/Polynomial/Content.lean
R : Type u_1
inst✝² : CommRing R
inst✝¹ : IsDomain R
inst✝ : NormalizedGCDMonoid R
p : R[X]

⊢ p.IsPrimitive ↔ p.content = 1
-- Mathlib/RingTheory/Polynomial/Content.lean
R : Type u_1
inst✝² : CommRing R
inst✝¹ : IsDomain R
inst✝ : NormalizedGCDMonoid R
p : R[X]

⊢ (∀ (r : R), C r ∣ p → IsUnit r) ↔ IsUnit p.content
-- Mathlib/RingTheory/Polynomial/Content.lean
R : Type u_1
inst✝² : CommRing R
inst✝¹ : IsDomain R
inst✝ : NormalizedGCDMonoid R
p : R[X]

⊢ (∀ (r : R), r ∣ p.content → IsUnit r) ↔ IsUnit p.content
-- Mathlib/Data/Nat/Defs.lean
a✝ b✝ c d m n✝ k : ℕ
p q : ℕ → Prop
a b n : ℕ

⊢ a ^ b % n = (a % n) ^ b % n
-- Mathlib/Topology/Connected/Basic.lean
α : Type u
β : Type v
ι : Type u_1
π : ι → Type u_2
inst✝ : TopologicalSpace α
s t u v : Set α
hs : IsPreconnected s
hu : IsOpen u
h'u : (s ∩ u).Nonempty
h : closure u ∩ s ⊆ u
A : s ⊆ u ∪ (closure u)ᶜ

⊢ s ⊆ u
-- Mathlib/Topology/Connected/Basic.lean
α : Type u
β : Type v
ι : Type u_1
π : ι → Type u_2
inst✝ : TopologicalSpace α
s t u v : Set α
hs : IsPreconnected s
hu : IsOpen u
h'u : (s ∩ u).Nonempty
h : closure u ∩ s ⊆ u
A : s ⊆ u ∪ (closure u)ᶜ

⊢ Disjoint u (closure u)ᶜ
-- Mathlib/RingTheory/Finiteness.lean
R : Type u_1
M : Type u_2
inst✝⁴ : Semiring R
inst✝³ : AddCommMonoid M
inst✝² : Module R M
P : Type u_3
inst✝¹ : AddCommMonoid P
inst✝ : Module R P
f : M →ₗ[R] P
N : Submodule R M
h : N.FG

⊢ (map N.subtype ⊤).FG
-- Mathlib/LinearAlgebra/Matrix/Transvection.lean
n : Type u_1
p : Type u_2
R : Type u₂
𝕜 : Type u_3
inst✝³ : Field 𝕜
inst✝² : DecidableEq n
inst✝¹ : DecidableEq p
inst✝ : CommRing R
r : ℕ
M : Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜
i : Fin r ⊕ Unit
A : (listTransvecRow M).length = r

⊢ (M * (listTransvecRow M).prod) i (inr ()) = M i (inr ())
-- Mathlib/LinearAlgebra/Matrix/Transvection.lean
n : Type u_1
p : Type u_2
R : Type u₂
𝕜 : Type u_3
inst✝³ : Field 𝕜
inst✝² : DecidableEq n
inst✝¹ : DecidableEq p
inst✝ : CommRing R
r : ℕ
M : Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜
i : Fin r ⊕ Unit
A : (listTransvecRow M).length = r

⊢ (M * (List.take r (listTransvecRow M)).prod) i (inr ()) = M i (inr ())
-- Mathlib/RingTheory/WittVector/Truncated.lean
p : ℕ
hp : Fact (Nat.Prime p)
n : ℕ
R : Type u_1
inst✝ : CommRing R

⊢ ⨅ i, RingHom.ker (WittVector.truncate i) = ⊥
-- Mathlib/RingTheory/WittVector/Truncated.lean
p : ℕ
hp : Fact (Nat.Prime p)
n : ℕ
R : Type u_1
inst✝ : CommRing R

⊢ ∀ x ∈ ⨅ i, RingHom.ker (WittVector.truncate i), x = 0
-- Mathlib/RingTheory/WittVector/Truncated.lean
p : ℕ
hp : Fact (Nat.Prime p)
n : ℕ
R : Type u_1
inst✝ : CommRing R
x : 𝕎 R
hx : x ∈ ⨅ i, RingHom.ker (WittVector.truncate i)
n✝ : ℕ

⊢ x.coeff n✝ = WittVector.coeff 0 n✝
-- Mathlib/RingTheory/WittVector/Truncated.lean
p : ℕ
hp : Fact (Nat.Prime p)
n : ℕ
R : Type u_1
inst✝ : CommRing R
x : 𝕎 R
n✝ : ℕ
hx : ∀ (i i_1 : ℕ), i_1 < i → x.coeff i_1 = 0

⊢ x.coeff n✝ = 0
-- Mathlib/Order/Height.lean
α : Type u_1
β : Type u_2
inst✝¹ : LT α
inst✝ : LT β
s t : Set α
l : List α
a : α

⊢ s.chainHeight = 0 ↔ s = ∅
-- Mathlib/CategoryTheory/Closed/Ideal.lean
C : Type u₁
D : Type u₂
inst✝⁶ : Category.{v₁, u₁} C
inst✝⁵ : Category.{v₁, u₂} D
i : D ⥤ C
inst✝⁴ : HasFiniteProducts C
inst✝³ : Reflective i
inst✝² : CartesianClosed C
inst✝¹ : HasFiniteProducts D
inst✝ : ExponentialIdeal i
A B : C
X X' : D
f : (reflector i).obj (A ⨯ B) ⟶ X
g : X ⟶ X'

⊢ i.fullyFaithfulOfReflective.preimage (prodComparison i ((reflector i).obj A) ((reflector i).obj B) ≫ ((exp.adjunction (i.obj ((reflector i).obj A))).homEquiv (i.obj ((reflector i).obj B)) (i.obj X')).symm ((unitCompPartialBijective B ⋯) (((exp.adjunction (i.obj ((reflector i).obj A))).homEquiv B (i.obj X')) (prod.lift prod.snd prod.fst ≫ ((exp.adjunction B).homEquiv (i.obj ((reflector i).obj A)) (i.obj X')).symm ((unitCompPartialBijective A ⋯) (((exp.adjunction B).homEquiv A (i.obj X')) (prod.lift prod.snd prod.fst ≫ ((reflectorAdjunction i).homEquiv (A ⨯ B) X') (f ≫ g) ≫ 𝟙 (i.obj X')))) ≫ 𝟙 (i.obj X')))) ≫ 𝟙 (i.obj X')) = i.fullyFaithfulOfReflective.preimage (prodComparison i ((reflector i).obj A) ((reflector i).obj B) ≫ ((exp.adjunction (i.obj ((reflector i).obj A))).homEquiv (i.obj ((reflector i).obj B)) (i.obj X)).symm ((unitCompPartialBijective B ⋯) (((exp.adjunction (i.obj ((reflector i).obj A))).homEquiv B (i.obj X)) (prod.lift prod.snd prod.fst ≫ ((exp.adjunction B).homEquiv (i.obj ((reflector i).obj A)) (i.obj X)).symm ((unitCompPartialBijective A ⋯) (((exp.adjunction B).homEquiv A (i.obj X)) (prod.lift prod.snd prod.fst ≫ ((reflectorAdjunction i).homEquiv (A ⨯ B) X) f ≫ 𝟙 (i.obj X)))) ≫ 𝟙 (i.obj X)))) ≫ 𝟙 (i.obj X)) ≫ g
-- Mathlib/CategoryTheory/Closed/Ideal.lean
C : Type u₁
D : Type u₂
inst✝⁶ : Category.{v₁, u₁} C
inst✝⁵ : Category.{v₁, u₂} D
i : D ⥤ C
inst✝⁴ : HasFiniteProducts C
inst✝³ : Reflective i
inst✝² : CartesianClosed C
inst✝¹ : HasFiniteProducts D
inst✝ : ExponentialIdeal i
A B : C
X X' : D
f : (reflector i).obj (A ⨯ B) ⟶ X
g : X ⟶ X'

⊢ i.fullyFaithfulOfReflective.preimage (prodComparison i ((reflector i).obj A) ((reflector i).obj B) ≫ uncurry ((unitCompPartialBijective B ⋯) (curry (prod.lift prod.snd prod.fst ≫ uncurry ((unitCompPartialBijective A ⋯) (curry (prod.lift prod.snd prod.fst ≫ ((reflectorAdjunction i).homEquiv (A ⨯ B) X') (f ≫ g) ≫ 𝟙 (i.obj X')))) ≫ 𝟙 (i.obj X')))) ≫ 𝟙 (i.obj X')) = i.fullyFaithfulOfReflective.preimage (prodComparison i ((reflector i).obj A) ((reflector i).obj B) ≫ uncurry ((unitCompPartialBijective B ⋯) (curry (prod.lift prod.snd prod.fst ≫ uncurry ((unitCompPartialBijective A ⋯) (curry (prod.lift prod.snd prod.fst ≫ ((reflectorAdjunction i).homEquiv (A ⨯ B) X) f ≫ 𝟙 (i.obj X)))) ≫ 𝟙 (i.obj X)))) ≫ 𝟙 (i.obj X)) ≫ g
-- Mathlib/CategoryTheory/Closed/Ideal.lean
C : Type u₁
D : Type u₂
inst✝⁶ : Category.{v₁, u₁} C
inst✝⁵ : Category.{v₁, u₂} D
i : D ⥤ C
inst✝⁴ : HasFiniteProducts C
inst✝³ : Reflective i
inst✝² : CartesianClosed C
inst✝¹ : HasFiniteProducts D
inst✝ : ExponentialIdeal i
A B : C
X X' : D
f : (reflector i).obj (A ⨯ B) ⟶ X
g : X ⟶ X'

⊢ i.map (i.fullyFaithfulOfReflective.preimage (prodComparison i ((reflector i).obj A) ((reflector i).obj B) ≫ uncurry ((unitCompPartialBijective B ⋯) (curry (prod.lift prod.snd prod.fst ≫ uncurry ((unitCompPartialBijective A ⋯) (curry (prod.lift prod.snd prod.fst ≫ ((reflectorAdjunction i).homEquiv (A ⨯ B) X') (f ≫ g) ≫ 𝟙 (i.obj X')))) ≫ 𝟙 (i.obj X')))) ≫ 𝟙 (i.obj X'))) = i.map (i.fullyFaithfulOfReflective.preimage (prodComparison i ((reflector i).obj A) ((reflector i).obj B) ≫ uncurry ((unitCompPartialBijective B ⋯) (curry (prod.lift prod.snd prod.fst ≫ uncurry ((unitCompPartialBijective A ⋯) (curry (prod.lift prod.snd prod.fst ≫ ((reflectorAdjunction i).homEquiv (A ⨯ B) X) f ≫ 𝟙 (i.obj X)))) ≫ 𝟙 (i.obj X)))) ≫ 𝟙 (i.obj X)) ≫ g)
-- Mathlib/Analysis/Calculus/FDeriv/Basic.lean
𝕜 : Type u_1
inst✝⁸ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁷ : NormedAddCommGroup E
inst✝⁶ : NormedSpace 𝕜 E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
G : Type u_4
inst✝³ : NormedAddCommGroup G
inst✝² : NormedSpace 𝕜 G
G' : Type u_5
inst✝¹ : NormedAddCommGroup G'
inst✝ : NormedSpace 𝕜 G'
f f₀ f₁ g : E → F
f' f₀' f₁' g' e : E →L[𝕜] F
x : E
s t : Set E
L L₁ L₂ : Filter E
h : s ∈ 𝓝 x

⊢ fderivWithin 𝕜 f s x = fderiv 𝕜 f x
-- Mathlib/Algebra/ModEq.lean
α : Type u_1
a b z : ℤ

⊢ a ≡ b [PMOD z] ↔ a ≡ b [ZMOD z]
-- Mathlib/Topology/Algebra/Module/FiniteDimension.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
inst✝¹⁴ : NontriviallyNormedField 𝕜
inst✝¹³ : CompleteSpace 𝕜
inst✝¹² : AddCommGroup E
inst✝¹¹ : TopologicalSpace E
inst✝¹⁰ : T2Space E
inst✝⁹ : TopologicalAddGroup E
inst✝⁸ : Module 𝕜 E
inst✝⁷ : ContinuousSMul 𝕜 E
inst✝⁶ : AddCommGroup F
inst✝⁵ : TopologicalSpace F
inst✝⁴ : T2Space F
inst✝³ : TopologicalAddGroup F
inst✝² : Module 𝕜 F
inst✝¹ : ContinuousSMul 𝕜 F
inst✝ : FiniteDimensional 𝕜 E
f : E →ₗ[𝕜] F
hf : ker f = ⊥
g : E ≃ₗ[𝕜] ↥(range f) := LinearEquiv.ofInjective f ⋯
this : FiniteDimensional 𝕜 ↥(range f)

⊢ IsClosed (Set.range ⇑f)
-- Mathlib/MeasureTheory/OuterMeasure/Induced.lean
α : Type u_1
inst✝ : MeasurableSpace α
m μ : OuterMeasure α
s : Set α
hs : MeasurableSet s

⊢ ((restrict s) μ).trim = (restrict s) μ.trim
-- Mathlib/MeasureTheory/OuterMeasure/Induced.lean
α : Type u_1
inst✝ : MeasurableSpace α
m μ : OuterMeasure α
s : Set α
hs : MeasurableSet s
t : Set α

⊢ ((restrict s) μ).trim t ≤ ((restrict s) μ.trim) t
-- Mathlib/MeasureTheory/OuterMeasure/Induced.lean
α : Type u_1
inst✝ : MeasurableSpace α
m μ : OuterMeasure α
s : Set α
hs : MeasurableSet s
t : Set α
ht : MeasurableSet t

⊢ ((restrict s) μ.trim) t ≤ ((restrict s) μ) t
-- Mathlib/SetTheory/Surreal/Multiplication.lean
x x₁ x₂ x₃ x' y y₁ y₂ y₃ y' : PGame
ih : ∀ (a : Args), ArgsRel a (Args.P1 x y) → P124 a

⊢ ∀ (a : Args), ArgsRel a (Args.P1 y x) → P124 a
-- Mathlib/SetTheory/Surreal/Multiplication.lean
x x₁ x₂ x₃ x' y y₁ y₂ y₃ y' : PGame
ih : ∀ (a : Args), TransGen (CutExpand IsOption) (match a with | Args.P1 x y => {y, x} | Args.P24 x₁ x₂ y => {x₁, y, x₂}) {y, x} → P124 a

⊢ ∀ (a : Args), TransGen (CutExpand IsOption) (match a with | Args.P1 x y => {y, x} | Args.P24 x₁ x₂ y => {x₁, y, x₂}) {y, x} → P124 a
-- Mathlib/Topology/NoetherianSpace.lean
α : Type u_1
β : Type u_2
inst✝² : TopologicalSpace α
inst✝¹ : TopologicalSpace β
inst✝ : NoetherianSpace α
s : Closeds α

⊢ ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ s = sSup S
-- Mathlib/Topology/NoetherianSpace.lean
α : Type u_1
β : Type u_2
inst✝² : TopologicalSpace α
inst✝¹ : TopologicalSpace β
inst✝ : NoetherianSpace α
s : Closeds α

⊢ ∀ (x : Closeds α), (∀ y < x, ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ y = sSup S) → ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ x = sSup S
-- Mathlib/Topology/NoetherianSpace.lean
α : Type u_1
β : Type u_2
inst✝² : TopologicalSpace α
inst✝¹ : TopologicalSpace β
inst✝ : NoetherianSpace α
s : Closeds α
H : ∀ y < s, ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ y = sSup S

⊢ ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ s = sSup S
-- Mathlib/Topology/NoetherianSpace.lean
α : Type u_1
β : Type u_2
inst✝² : TopologicalSpace α
inst✝¹ : TopologicalSpace β
inst✝ : NoetherianSpace α
H : ∀ y < ⊥, ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ y = sSup S

⊢ ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ ⊥ = sSup S
-- Mathlib/Topology/NoetherianSpace.lean
α : Type u_1
β : Type u_2
inst✝² : TopologicalSpace α
inst✝¹ : TopologicalSpace β
inst✝ : NoetherianSpace α
s : Closeds α
H : ∀ y < s, ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ y = sSup S
h₀ : s ≠ ⊥

⊢ ∃ S, S.Finite ∧ (∀ t ∈ S, IsIrreducible ↑t) ∧ s = sSup S
-- Mathlib/MeasureTheory/SetSemiring.lean
α : Type u_1
C : Set (Set α)
s t : Set α
I : Finset (Set α)
hC : IsSetSemiring C
hs : s ∈ C
hI : ↑I ⊆ C
h_dis : (↑I).PairwiseDisjoint id

⊢ (↑I ∪ ↑(hC.diffFinset₀ hs hI)).PairwiseDisjoint id
-- Mathlib/MeasureTheory/SetSemiring.lean
α : Type u_1
C : Set (Set α)
s t : Set α
I : Finset (Set α)
hC : IsSetSemiring C
hs : s ∈ C
hI : ↑I ⊆ C
h_dis : (↑I).PairwiseDisjoint id

⊢ (↑I).PairwiseDisjoint id ∧ (↑(hC.diffFinset₀ hs hI)).PairwiseDisjoint id ∧ ∀ ⦃i : Set α⦄, i ∈ ↑I → ∀ ⦃j : Set α⦄, j ∈ ↑(hC.diffFinset₀ hs hI) → i ≠ j → Disjoint (id i) (id j)
-- Mathlib/MeasureTheory/SetSemiring.lean
α : Type u_1
C : Set (Set α)
s t : Set α
I : Finset (Set α)
hC : IsSetSemiring C
hs : s ∈ C
hI : ↑I ⊆ C
h_dis : (↑I).PairwiseDisjoint id
u : Set α
hu : u ∈ ↑I
v : Set α
hv : v ∈ ↑(hC.diffFinset₀ hs hI)
x✝ : u ≠ v

⊢ Disjoint (id u) (id v)