Bit

def LO.Arith.Bit {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i a : V) : Prop

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Bit i a = LO.Arith.LenBit (exp i) a

@[implicit_reducible]

instance LO.Arith.instMembershipVV {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : Membership V V

Equations

• LO.Arith.instMembershipVV = { mem := fun (a i : V) => LO.Arith.Bit i a }

def LO.FirstOrder.Arith.bitDef : Sg0.Semisentence 2

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

theorem LO.Arith.bit_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Relation fun (x1 x2 : V) => x1 ∈ x2 via FirstOrder.Arith.bitDef

@[simp]

theorem LO.Arith.bit_defined_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (v : Fin 2 → V) : V ⊧/v (FirstOrder.Arith.HierarchySymbol.Semiformula.val FirstOrder.Arith.bitDef) ↔ v 0 ∈ v 1

instance LO.Arith.mem_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Relation fun (x1 x2 : V) => x1 ∈ x2

instance LO.Arith.mem_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (ℌ : FirstOrder.Arith.HierarchySymbol) : ℌ-Relation fun (x1 x2 : V) => x1 ∈ x2

instance LO.Arith.mem_definable'' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (ℌ : FirstOrder.Arith.HierarchySymbol) : ℌ-Relation Membership.mem

theorem LO.Arith.mem_absolute {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i a : ℕ) : i ∈ a ↔ ↑i ∈ ↑a

theorem LO.Arith.mem_iff_bit {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} : i ∈ a ↔ Bit i a

theorem LO.Arith.exp_le_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : exp i ≤ a

theorem LO.Arith.lt_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : i < a

theorem LO.Arith.not_mem_of_lt_exp {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : a < exp i) : i ∉ a

theorem LO.Arith.HierarchySymbol.Boldface.ball_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {k : ℕ} (Γ : SigmaPiDelta) (m : ℕ) {P : (Fin k → V) → V → Prop} {f : (Fin k → V) → V} (hf : { Γ := Sg, rank := m + 1 }.BoldfaceFunction f) (h : { Γ := Γ, rank := m + 1 }.Boldface fun (w : Fin (k + 1) → V) => P (fun (x : Fin k) => w x.succ) (w 0)) : { Γ := Γ, rank := m + 1 }.Boldface fun (v : Fin k → V) => ∀ x ∈ f v, P v x

theorem LO.Arith.HierarchySymbol.Boldface.bex_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {k : ℕ} (Γ : SigmaPiDelta) (m : ℕ) {P : (Fin k → V) → V → Prop} {f : (Fin k → V) → V} (hf : { Γ := Sg, rank := m + 1 }.BoldfaceFunction f) (h : { Γ := Γ, rank := m + 1 }.Boldface fun (w : Fin (k + 1) → V) => P (fun (x : Fin k) => w x.succ) (w 0)) : { Γ := Γ, rank := m + 1 }.Boldface fun (v : Fin k → V) => ∃ x ∈ f v, P v x

@[implicit_reducible]

instance LO.FirstOrder.Arith.instMemORing : Semiformula.Operator.Mem ℒₒᵣ

Equations

• LO.FirstOrder.Arith.instMemORing = { mem := { sentence := LO.FirstOrder.Arith.HierarchySymbol.Semiformula.val LO.FirstOrder.Arith.bitDef } }

theorem LO.FirstOrder.Arith.operator_mem_def : op(∈).sentence = HierarchySymbol.Semiformula.val bitDef

def LO.FirstOrder.Arith.ballIn {ξ : Type u_1} {n : ℕ} (t : Semiterm ℒₒᵣ ξ n) (p : Semiformula ℒₒᵣ ξ (n + 1)) : Semiformula ℒₒᵣ ξ n

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.bexIn {ξ : Type u_1} {n : ℕ} (t : Semiterm ℒₒᵣ ξ n) (p : Semiformula ℒₒᵣ ξ (n + 1)) : Semiformula ℒₒᵣ ξ n

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem LO.FirstOrder.Arith.Hierarchy.bit {n : ℕ} {μ : Type u_2} {Γ : Polarity} {s : ℕ} {t u : Semiterm ℒₒᵣ μ n} : Hierarchy Γ s (“!!t ∈ !!u”)

@[simp]

theorem LO.FirstOrder.Arith.Hieralchy.ballIn {ξ : Type u_1} {n : ℕ} {Γ : Polarity} {m : ℕ} (t : Semiterm ℒₒᵣ ξ n) (p : Semiformula ℒₒᵣ ξ (n + 1)) : Hierarchy Γ m (Arith.ballIn t p) ↔ Hierarchy Γ m p

@[simp]

theorem LO.FirstOrder.Arith.Hieralchy.bexIn {ξ : Type u_1} {n : ℕ} {Γ : Polarity} {m : ℕ} (t : Semiterm ℒₒᵣ ξ n) (p : Semiformula ℒₒᵣ ξ (n + 1)) : Hierarchy Γ m (Arith.bexIn t p) ↔ Hierarchy Γ m p

def LO.FirstOrder.Arith.memRel : Sg0.Semisentence 3

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.memRel₃ : Sg0.Semisentence 4

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.memRelOpr : Semiformula.Operator ℒₒᵣ 3

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Arith.memRelOpr = { sentence := LO.FirstOrder.Arith.HierarchySymbol.Semiformula.val LO.FirstOrder.Arith.memRel }

def LO.FirstOrder.Arith.memRel₃Opr : Semiformula.Operator ℒₒᵣ 4

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Arith.memRel₃Opr = { sentence := LO.FirstOrder.Arith.HierarchySymbol.Semiformula.val LO.FirstOrder.Arith.memRel₃ }

def LO.FirstOrder.Arith.«firstOrderFormula∀_∈'_,_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.«firstOrderFormula∃_∈'_,_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.«firstOrderFormula_∼[_]_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.«firstOrderFormula_≁[_]_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.«firstOrderFormula:⟪_,_⟫:∈_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

def LO.FirstOrder.Arith.«firstOrderFormula:⟪_,_,_⟫:∈_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem LO.FirstOrder.Arith.Hierarchy.memRel {n : ℕ} {μ : Type u_2} {Γ : Polarity} {s : ℕ} {t₁ t₂ u : Semiterm ℒₒᵣ μ n} : Hierarchy Γ s (memRelOpr.operator ![u, t₁, t₂])

@[simp]

theorem LO.FirstOrder.Arith.Hierarchy.memRel₃ {n : ℕ} {μ : Type u_2} {Γ : Polarity} {s : ℕ} {t₁ t₂ t₃ u : Semiterm ℒₒᵣ μ n} : Hierarchy Γ s (memRel₃Opr.operator ![u, t₁, t₂, t₃])

theorem LO.FirstOrder.Arith.instMemORing_1 {V : Type u_2} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : Structure.Mem ℒₒᵣ V

@[simp]

theorem LO.FirstOrder.Arith.eval_ballIn {ξ : Type u_1} {n : ℕ} {V : Type u_2} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {t : Semiterm ℒₒᵣ ξ n} {p : Semiformula ℒₒᵣ ξ (n + 1)} {e : Fin n → V} {ε : ξ → V} : (Semiformula.Evalm V e ε) (ballIn t p) ↔ ∀ x ∈ Semiterm.valm V e ε t, (Semiformula.Evalm V (x :> e) ε) p

@[simp]

theorem LO.FirstOrder.Arith.eval_bexIn {ξ : Type u_1} {n : ℕ} {V : Type u_2} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {t : Semiterm ℒₒᵣ ξ n} {p : Semiformula ℒₒᵣ ξ (n + 1)} {e : Fin n → V} {ε : ξ → V} : (Semiformula.Evalm V e ε) (bexIn t p) ↔ ∃ x ∈ Semiterm.valm V e ε t, (Semiformula.Evalm V (x :> e) ε) p

theorem LO.FirstOrder.Arith.memRel_defined {V : Type u_2} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : Sg0-Relation₃ fun (r x y : V) => ⟪x, y⟫ ∈ r via memRel

theorem LO.FirstOrder.Arith.memRel₃_defined {V : Type u_2} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : Sg0-Relation₄ fun (r x y z : V) => ⟪x, ⟪y, z⟫⟫ ∈ r via memRel₃

@[simp]

theorem LO.FirstOrder.Arith.eval_memRel {V : Type u_2} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {x y r : V} : memRelOpr.val ![r, x, y] ↔ ⟪x, y⟫ ∈ r

@[simp]

theorem LO.FirstOrder.Arith.eval_memRel₃ {V : Type u_2} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {x y z r : V} : memRel₃Opr.val ![r, x, y, z] ↔ ⟪x, ⟪y, z⟫⟫ ∈ r

theorem LO.Arith.mem_iff_mul_exp_add_exp_add {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} : i ∈ a ↔ ∃ (k : V), ∃ r < exp i, a = k * exp (i + 1) + exp i + r

theorem LO.Arith.not_mem_iff_mul_exp_add {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} : i ∉ a ↔ ∃ (k : V), ∃ r < exp i, a = k * exp (i + 1) + r

@[implicit_reducible]

def LO.Arith.instEmptyCollectionV {V : Type u_1} [ORingStruc V] : EmptyCollection V

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.instEmptyCollectionV = { emptyCollection := 0 }

theorem LO.Arith.emptyset_def {V : Type u_1} [ORingStruc V] : ∅ = 0

@[simp]

theorem LO.Arith.not_mem_empty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i : V) : i ∉ ∅

@[simp]

theorem LO.Arith.not_mem_zero {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i : V) : i ∉ 0

@[implicit_reducible]

noncomputable def LO.Arith.instSingletonVV {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : Singleton V V

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.instSingletonVV = { singleton := fun (a : V) => exp a }

theorem LO.Arith.singleton_def {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (a : V) : {a} = exp a

noncomputable def LO.Arith.bitInsert {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i a : V) : V

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.bitInsert i a = if i ∈ a then a else a + exp i

noncomputable def LO.Arith.bitRemove {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i a : V) : V

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.bitRemove i a = if i ∈ a then a - exp i else a

@[implicit_reducible]

noncomputable def LO.Arith.instInsertVV {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : Insert V V

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.instInsertVV = { insert := LO.Arith.bitInsert }

theorem LO.Arith.insert_eq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} : insert i a = bitInsert i a

theorem LO.Arith.singleton_eq_insert {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i : V) : {i} = insert i ∅

instance LO.Arith.instLawfulSingleton_leanPool {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : LawfulSingleton V V

@[simp]

theorem LO.Arith.mem_bitInsert_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i j a : V} : i ∈ insert j a ↔ i = j ∨ i ∈ a

@[simp]

theorem LO.Arith.mem_bitRemove_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i j a : V} : i ∈ bitRemove j a ↔ i ≠ j ∧ i ∈ a

@[simp]

theorem LO.Arith.not_mem_bitRemove_self {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i a : V) : i ∉ bitRemove i a

theorem LO.Arith.insert_graph {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (b i a : V) : b = insert i a ↔ i ∈ a ∧ b = a ∨ i ∉ a ∧ ∃ e ≤ b, e = exp i ∧ b = a + e

def LO.FirstOrder.Arith.insertDef : Sg0.Semisentence 3

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

theorem LO.Arith.insert_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₂ insert via FirstOrder.Arith.insertDef

@[simp]

theorem LO.Arith.insert_defined_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (v : Fin 3 → V) : V ⊧/v (FirstOrder.Arith.HierarchySymbol.Semiformula.val FirstOrder.Arith.insertDef) ↔ v 0 = insert (v 1) (v 2)

instance LO.Arith.insert_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₂ insert

instance LO.Arith.insert_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (Γ : FirstOrder.Arith.HierarchySymbol) : Γ-Function₂ insert

theorem LO.Arith.insert_le_of_le_of_le {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i j a b : V} (hij : i ≤ j) (hab : a ≤ b) : insert i a ≤ b + exp j

theorem LO.Arith.one_eq_singleton {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : 1 = {∅}

@[simp]

theorem LO.Arith.mem_singleton_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i j : V} : i ∈ {j} ↔ i = j

theorem LO.Arith.bitRemove_lt_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : bitRemove i a < a

theorem LO.Arith.pos_of_nonempty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : 0 < a

@[simp]

theorem LO.Arith.mem_insert {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i a : V) : i ∈ insert i a

theorem LO.Arith.insert_eq_self_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : insert i a = a

theorem LO.Arith.log_mem_of_pos {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a : V} (h : 0 < a) : log a ∈ a

theorem LO.Arith.le_log_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : i ≤ log a

theorem LO.Arith.succ_mem_iff_mem_div_two {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} : i + 1 ∈ a ↔ i ∈ a / 2

theorem LO.Arith.lt_length_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : i < Length.length a

theorem LO.Arith.lt_exp_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a i : V} : a < exp i ↔ ∀ j ∈ a, j < i

@[implicit_reducible]

instance LO.Arith.instHasSubsetV {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : HasSubset V

Equations

• LO.Arith.instHasSubsetV = { Subset := fun (a b : V) => ∀ ⦃i : V⦄, i ∈ a → i ∈ b }

def LO.FirstOrder.Arith.bitSubsetDef : Sg0.Semisentence 2

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

theorem LO.Arith.bitSubset_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Relation fun (x1 x2 : V) => x1 ⊆ x2 via FirstOrder.Arith.bitSubsetDef

@[simp]

theorem LO.Arith.bitSubset_defined_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (v : Fin 2 → V) : V ⊧/v (FirstOrder.Arith.HierarchySymbol.Semiformula.val FirstOrder.Arith.bitSubsetDef) ↔ v 0 ⊆ v 1

instance LO.Arith.bitSubset_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Relation fun (x1 x2 : V) => x1 ⊆ x2

@[simp]

instance LO.Arith.bitSubset_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (ℌ : FirstOrder.Arith.HierarchySymbol) : ℌ-Relation fun (x1 x2 : V) => x1 ⊆ x2

theorem LO.Arith.subset_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a b : V} : a ⊆ b ↔ ∀ x ∈ a, x ∈ b

@[simp]

theorem LO.Arith.subset_refl {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (a : V) : a ⊆ a

theorem LO.Arith.subset_trans {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a b c : V} (hab : a ⊆ b) (hbc : b ⊆ c) : a ⊆ c

theorem LO.Arith.mem_exp_add_succ_sub_one {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i j : V) : i ∈ exp (i + j + 1) - 1

noncomputable def LO.Arith.under {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (a : V) : V

under a = {0, 1, 2, ..., a - 1}

Equations

• LO.Arith.under a = exp a - 1

@[simp]

theorem LO.Arith.le_under {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (a : V) : a ≤ under a

@[simp]

theorem LO.Arith.mem_under_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i j : V} : i ∈ under j ↔ i < j

@[simp]

theorem LO.Arith.not_mem_under_self {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i : V) : i ∉ under i

def LO.FirstOrder.Arith.underDef : Sg0.Semisentence 2

Imported declaration from the Incompleteness formalization.

Equations

• One or more equations did not get rendered due to their size.

theorem LO.Arith.under_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₁ under via FirstOrder.Arith.underDef

@[simp]

theorem LO.Arith.under_defined_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (v : Fin 2 → V) : V ⊧/v (FirstOrder.Arith.HierarchySymbol.Semiformula.val FirstOrder.Arith.underDef) ↔ v 0 = under (v 1)

instance LO.Arith.under_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₁ under

instance LO.Arith.under_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (Γ : FirstOrder.Arith.HierarchySymbol) : Γ-Function₁ under

theorem LO.Arith.eq_zero_of_subset_zero {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a : V} : a ⊆ 0 → a = 0

theorem LO.Arith.subset_div_two {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a b : V} : a ⊆ b → a / 2 ⊆ b / 2

theorem LO.Arith.zero_mem_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a : V} : 0 ∉ a ↔ 2 ∣ a

@[simp]

theorem LO.Arith.zero_not_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (a : V) : 0 ∉ 2 * a

@[simp]

theorem LO.Arith.zero_mem_double_add_one {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (a : V) : 0 ∈ 2 * a + 1

@[simp]

theorem LO.Arith.succ_mem_two_mul_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} : i + 1 ∈ 2 * a ↔ i ∈ a

@[simp]

theorem LO.Arith.succ_mem_two_mul_succ_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} : i + 1 ∈ 2 * a + 1 ↔ i ∈ a

theorem LO.Arith.le_of_subset {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a b : V} (h : a ⊆ b) : a ≤ b

theorem LO.Arith.mem_ext {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a b : V} (h : ∀ (i : V), i ∈ a ↔ i ∈ b) : a = b

theorem LO.Arith.pos_iff_nonempty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} : 0 < s ↔ s ≠ ∅

theorem LO.Arith.nonempty_of_pos {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a : V} (h : 0 < a) : ∃ (i : V), i ∈ a

theorem LO.Arith.eq_empty_or_nonempty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (a : V) : a = ∅ ∨ ∃ (i : V), i ∈ a

theorem LO.Arith.nonempty_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} : s ≠ ∅ ↔ ∃ (x : V), x ∈ s

theorem LO.Arith.isempty_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} : s = ∅ ↔ ∀ (x : V), x ∉ s

@[simp]

theorem LO.Arith.empty_subset {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s : V) : ∅ ⊆ s

theorem LO.Arith.lt_of_lt_log {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a b : V} (pos : 0 < b) (h : ∀ i ∈ a, i < log b) : a < b

@[simp]

theorem LO.Arith.under_inj {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i j : V} : under i = under j ↔ i = j

@[simp]

theorem LO.Arith.under_zero {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : under 0 = ∅

@[simp]

theorem LO.Arith.under_succ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (i : V) : under (i + 1) = insert i (under i)

theorem LO.Arith.insert_remove {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i a : V} (h : i ∈ a) : insert i (bitRemove i a) = a

theorem LO.Arith.finset_comprehension {V : Type u_1} [ORingStruc V] {m : ℕ} [Fact (1 ≤ m)] [V ⊧ₘ* 𝐈𝐍𝐃Sg m] {Γ : SigmaPiDelta} {P : V → Prop} (hP : { Γ := Γ, rank := m }-Predicate P) (a : V) : ∃ s < exp a, ∀ i < a, i ∈ s ↔ P i

theorem LO.Arith.finset_comprehension_exists_unique {V : Type u_1} [ORingStruc V] {m : ℕ} [Fact (1 ≤ m)] [V ⊧ₘ* 𝐈𝐍𝐃Sg m] {Γ : SigmaPiDelta} {P : V → Prop} (hP : { Γ := Γ, rank := m }-Predicate P) (a : V) : ∃! s : V, s < exp a ∧ ∀ i < a, i ∈ s ↔ P i

instance LO.Arith.instFactLeOfNat_leanPool : Fact (1 ≤ 1)

theorem LO.Arith.finset_comprehension₁ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {Γ : SigmaPiDelta} {P : V → Prop} (hP : { Γ := Γ, rank := 1 }-Predicate P) (a : V) : ∃ s < exp a, ∀ i < a, i ∈ s ↔ P i

theorem LO.Arith.finset_comprehension₁! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {Γ : SigmaPiDelta} {P : V → Prop} (hP : { Γ := Γ, rank := 1 }-Predicate P) (a : V) : ∃! s : V, s < exp a ∧ ∀ i < a, i ∈ s ↔ P i

theorem LO.Arith.finite_comprehension₁! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {Γ : SigmaPiDelta} {P : V → Prop} (hP : { Γ := Γ, rank := 1 }-Predicate P) (fin : ∃ (m : V), ∀ (i : V), P i → i < m) : ∃! s : V, ∀ (i : V), i ∈ s ↔ P i