Iteration

def LO.FirstOrder.Semiformula.replicate {L : Language} {ξ : Type u_1} {n : ℕ} (p : Semiformula L ξ n) : ℕ → Semiformula L ξ n

Imported declaration from the Incompleteness formalization.

Equations

• p.replicate 0 = p
• p.replicate k.succ = p ⋏ p.replicate k

theorem LO.FirstOrder.Semiformula.replicate_zero {L : Language} {ξ : Type u_1} {n : ℕ} (p : Semiformula L ξ n) : p.replicate 0 = p

theorem LO.FirstOrder.Semiformula.replicate_succ {L : Language} {ξ : Type u_1} {n : ℕ} (p : Semiformula L ξ n) (k : ℕ) : p.replicate (k + 1) = p ⋏ p.replicate k

def LO.FirstOrder.Semiformula.weight {L : Language} {ξ : Type u_1} {n : ℕ} (k : ℕ) : Semiformula L ξ n

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Semiformula.weight k = (List.replicate k ⊤).conj

def LO.Arith.QQConj.blueprint : VecRec.Blueprint 0

Imported declaration from the Incompleteness formalization.

Equations

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

noncomputable def LO.Arith.QQConj.construction {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : VecRec.Construction V blueprint

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.QQConj.construction = { nil := fun (x : Fin 0 → V) => LO.Arith.qqVerum, cons := fun (x : Fin 0 → V) (p x_1 ih : V) => LO.Arith.qqAnd p ih, nil_defined := ⋯, cons_defined := ⋯ }

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

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.qqConj ps = LO.Arith.QQConj.construction.result ![] ps

def LO.Arith.«term^⋀_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.«term^⋀_» = Lean.ParserDescr.node `LO.Arith.«term^⋀_» 65 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "^⋀ ") (Lean.ParserDescr.cat `term 66))

@[simp]

theorem LO.Arith.qqConj_nil {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : qqConj 0 = qqVerum

@[simp]

theorem LO.Arith.qqConj_cons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (p ps : V) : qqConj (cons p ps) = qqAnd p (qqConj ps)

def LO.FirstOrder.Arith.qqConjDef : Sg1.Semisentence 2

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Arith.qqConjDef = LO.Arith.QQConj.blueprint.resultDef

theorem LO.Arith.qqConj_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg1-Function₁ qqConj via FirstOrder.Arith.qqConjDef

@[simp]

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

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

instance LO.Arith.qqConj_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {Γ : SigmaPiDelta} {m : ℕ} : { Γ := Γ, rank := m + 1 }-Function₁ qqConj

@[simp]

theorem LO.Arith.qqConj_semiformula {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {n ps : V} : L.IsSemiformula n (qqConj ps) ↔ ∀ i < len ps, L.IsSemiformula n (nth ps i)

@[simp]

theorem LO.Arith.len_le_conj {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (ps : V) : len ps ≤ qqConj ps

def LO.Arith.QQDisj.blueprint : VecRec.Blueprint 0

Imported declaration from the Incompleteness formalization.

Equations

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

noncomputable def LO.Arith.QQDisj.construction {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : VecRec.Construction V blueprint

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.QQDisj.construction = { nil := fun (x : Fin 0 → V) => LO.Arith.qqFalsum, cons := fun (x : Fin 0 → V) (p x_1 ih : V) => LO.Arith.qqOr p ih, nil_defined := ⋯, cons_defined := ⋯ }

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

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.qqDisj ps = LO.Arith.QQDisj.construction.result ![] ps

def LO.Arith.«term^⋁_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.«term^⋁_» = Lean.ParserDescr.node `LO.Arith.«term^⋁_» 65 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "^⋁ ") (Lean.ParserDescr.cat `term 66))

@[simp]

theorem LO.Arith.qqDisj_nil {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : qqDisj 0 = qqFalsum

@[simp]

theorem LO.Arith.qqDisj_cons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (p ps : V) : qqDisj (cons p ps) = qqOr p (qqDisj ps)

def LO.FirstOrder.Arith.qqDisjDef : Sg1.Semisentence 2

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Arith.qqDisjDef = LO.Arith.QQDisj.blueprint.resultDef

theorem LO.Arith.qqDisj_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg1-Function₁ qqDisj via FirstOrder.Arith.qqDisjDef

@[simp]

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

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

instance LO.Arith.qqDisj_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {m : ℕ} (Γ : SigmaPiDelta) : { Γ := Γ, rank := m + 1 }-Function₁ qqDisj

@[simp]

theorem LO.Arith.qqDisj_semiformula {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {n ps : V} : L.IsSemiformula n (qqDisj ps) ↔ ∀ i < len ps, L.IsSemiformula n (nth ps i)

noncomputable def LO.Arith.Formalized.SubstItr.blueprint : PR.Blueprint 2

Imported declaration from the Incompleteness formalization.

Equations

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

noncomputable def LO.Arith.Formalized.SubstItr.construction {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : PR.Construction V blueprint

Imported declaration from the Incompleteness formalization.

Equations

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

noncomputable def LO.Arith.Formalized.substItr {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (w p k : V) : V

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Formalized.substItr w p k = LO.Arith.Formalized.SubstItr.construction.result ![w, p] k

@[simp]

theorem LO.Arith.Formalized.substItr_zero {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (w p : V) : substItr w p 0 = 0

@[simp]

theorem LO.Arith.Formalized.substItr_succ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (w p k : V) : substItr w p (k + 1) = cons (⌜ℒₒᵣ⌝.substs (cons (numeral k) w) p) (substItr w p k)

noncomputable def LO.FirstOrder.Arith.substItrDef : Sg1.Semisentence 4

Imported declaration from the Incompleteness formalization.

Equations

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

theorem LO.Arith.Formalized.substItr_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg1-Function₃ substItr via FirstOrder.Arith.substItrDef

@[simp]

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

instance LO.Arith.Formalized.substItr_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg1-Function₃ substItr

instance LO.Arith.Formalized.substItr_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {Γ : SigmaPiDelta} {m : ℕ} : { Γ := Γ, rank := m + 1 }-Function₃ substItr

@[simp]

theorem LO.Arith.Formalized.len_substItr {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (w p k : V) : len (substItr w p k) = k

@[simp]

theorem LO.Arith.Formalized.substItr_nth {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (w p k : V) {i : V} (hi : i < k) : nth (substItr w p k) i = ⌜ℒₒᵣ⌝.substs (cons (numeral (k - (i + 1))) w) p

theorem LO.Arith.Formalized.neg_conj_substItr {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {m n w p k : V} (hp : ⌜ℒₒᵣ⌝.IsSemiformula (n + 1) p) (hw : ⌜ℒₒᵣ⌝.IsSemitermVec n m w) : ⌜ℒₒᵣ⌝.neg (qqConj (substItr w p k)) = qqDisj (substItr w (⌜ℒₒᵣ⌝.neg p) k)

theorem LO.Arith.Formalized.neg_disj_substItr {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {m n w p k : V} (hp : ⌜ℒₒᵣ⌝.IsSemiformula (n + 1) p) (hw : ⌜ℒₒᵣ⌝.IsSemitermVec n m w) : ⌜ℒₒᵣ⌝.neg (qqDisj (substItr w p k)) = qqConj (substItr w (⌜ℒₒᵣ⌝.neg p) k)

theorem LO.Arith.Formalized.substs_conj_substItr {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {v n m l w p k : V} (hp : ⌜ℒₒᵣ⌝.IsSemiformula (n + 1) p) (hw : ⌜ℒₒᵣ⌝.IsSemitermVec n m w) (hv : ⌜ℒₒᵣ⌝.IsSemitermVec m l v) : ⌜ℒₒᵣ⌝.substs v (qqConj (substItr w p k)) = qqConj (substItr (⌜ℒₒᵣ⌝.termSubstVec n v w) p k)

theorem LO.Arith.Formalized.substs_disj_substItr {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {v n m l w p k : V} (hp : ⌜ℒₒᵣ⌝.IsSemiformula (n + 1) p) (hw : ⌜ℒₒᵣ⌝.IsSemitermVec n m w) (hv : ⌜ℒₒᵣ⌝.IsSemitermVec m l v) : ⌜ℒₒᵣ⌝.substs v (qqDisj (substItr w p k)) = qqDisj (substItr (⌜ℒₒᵣ⌝.termSubstVec n v w) p k)

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

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.qqVerums k = LO.Arith.qqConj (LO.Arith.repeatVec LO.Arith.qqVerum k)

@[simp]

theorem LO.Arith.le_qqVerums {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (k : V) : k ≤ qqVerums k

def LO.FirstOrder.Arith.qqVerumsDef : Sg1.Semisentence 2

Imported declaration from the Incompleteness formalization.

Equations

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

theorem LO.Arith.qqVerums_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg1-Function₁ qqVerums via FirstOrder.Arith.qqVerumsDef

@[simp]

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

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

instance LO.Arith.qqVerums_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {Γ : SigmaPiDelta} {m : ℕ} : { Γ := Γ, rank := m + 1 }-Function₁ qqVerums

@[simp]

theorem LO.Arith.Language.IsSemiformula.qqVerums {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {n : V} (k : V) : L.IsSemiformula n (qqVerums k)

@[simp]

theorem LO.Arith.qqVerums_zero {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : qqVerums 0 = qqVerum

@[simp]

theorem LO.Arith.qqVerums_succ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (k : V) : qqVerums (k + 1) = qqAnd qqVerum (qqVerums k)