Sequence

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

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Seq s = (LO.Arith.IsMapping s ∧ ∃ (l : V), LO.Arith.domain s = LO.Arith.under l)

theorem LO.Arith.Seq.isMapping {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) : IsMapping s

Imported declaration from the Incompleteness formalization.

def LO.FirstOrder.Arith.seqDef : Sg0.Semisentence 1

Imported declaration from the Incompleteness formalization.

Equations

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

theorem LO.Arith.seq_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Predicate Seq via FirstOrder.Arith.seqDef

@[simp]

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

instance LO.Arith.seq_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Predicate Seq

instance LO.Arith.seq_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (ℌ : FirstOrder.Arith.HierarchySymbol) : ℌ-Predicate Seq

def LO.Arith.«firstOrderFormula:Seq_» : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

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

theorem LO.Arith.lh_exists_uniq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s : V) : ∃! l : V, (Seq s → domain s = under l) ∧ (¬Seq s → l = 0)

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

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.lh s = Classical.choose! ⋯

theorem LO.Arith.lh_prop {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s : V) : (Seq s → domain s = under (lh s)) ∧ (¬Seq s → lh s = 0)

theorem LO.Arith.lh_prop_of_not_seq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : ¬Seq s) : lh s = 0

theorem LO.Arith.Seq.domain_eq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) : domain s = under (lh s)

@[simp]

theorem LO.Arith.lh_bound {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s : V) : lh s ≤ 2 * s

def LO.FirstOrder.Arith.lhDef : 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.lh_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₁ lh via FirstOrder.Arith.lhDef

@[simp]

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

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

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

instance LO.Arith.instBounded₁Lh {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Bounded₁ lh

theorem LO.Arith.Seq.exists {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {x : V} (hx : x < lh s) : ∃ (y : V), ⟪x, y⟫ ∈ s

theorem LO.Arith.Seq.nth_exists_uniq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {x : V} (hx : x < lh s) : ∃! y : V, ⟪x, y⟫ ∈ s

noncomputable def LO.Arith.Seq.nth {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {x : V} (hx : x < lh s) : V

Imported declaration from the Incompleteness formalization.

Equations

• h.nth hx = Classical.choose! ⋯

@[simp]

theorem LO.Arith.Seq.nth_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {x : V} (hx : x < lh s) : ⟪x, h.nth hx⟫ ∈ s

theorem LO.Arith.Seq.nth_uniq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {x y : V} (hx : x < lh s) (hy : ⟪x, y⟫ ∈ s) : y = h.nth hx

@[simp]

theorem LO.Arith.Seq.nth_lt {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {x : V} (hx : x < lh s) : h.nth hx < s

theorem LO.Arith.Seq.lh_eq_of {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (H : Seq s) {l : V} (h : domain s = under l) : lh s = l

theorem LO.Arith.Seq.lt_lh_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {i : V} : i < lh s ↔ i ∈ domain s

theorem LO.Arith.Seq.lt_lh_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) {i x : V} (hix : ⟪i, x⟫ ∈ s) : i < lh s

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

Imported declaration from the Incompleteness formalization.

Equations

• s ⁀' x = insert ⟪LO.Arith.lh s, x⟫ s

theorem LO.Arith.znth_existsUnique {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s i : V) : ∃! x : V, (Seq s ∧ i < lh s → ⟪i, x⟫ ∈ s) ∧ (¬(Seq s ∧ i < lh s) → x = 0)

Imported declaration from the Incompleteness formalization.

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

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.znth s i = Classical.choose! ⋯

theorem LO.Arith.Seq.znth {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s i : V} (h : Seq s) (hi : i < lh s) : ⟪i, znth s i⟫ ∈ s

theorem LO.Arith.Seq.znth_eq_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {x s i : V} (h : Seq s) (hi : ⟪i, x⟫ ∈ s) : znth s i = x

theorem LO.Arith.znth_prop_not {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s i : V} (h : ¬Seq s ∨ lh s ≤ i) : znth s i = 0

def LO.FirstOrder.Arith.znthDef : 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.znth_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₂ znth via FirstOrder.Arith.znthDef

@[simp]

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

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

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

def LO.Arith.«term_⁀'_» : Lean.TrailingParserDescr

Imported notation from the Incompleteness formalization.

Equations

• LO.Arith.«term_⁀'_» = Lean.ParserDescr.trailingNode `LO.Arith.«term_⁀'_» 67 68 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⁀' ") (Lean.ParserDescr.cat `term 67))

@[simp]

theorem LO.Arith.seq_empty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : Seq ∅

@[simp]

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

theorem LO.Arith.Seq.isempty_of_lh_eq_zero {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (Hs : Seq s) (h : lh s = 0) : s = ∅

Imported declaration from the Incompleteness formalization.

@[simp]

theorem LO.Arith.Seq.subset_seqCons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s x : V) : s ⊆ s ⁀' x

theorem LO.Arith.Seq.lt_seqCons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (hs : Seq s) (x : V) : s < s ⁀' x

theorem LO.Arith.Seq.mem_seqCons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s x : V) : ⟪lh s, x⟫ ∈ s ⁀' x

theorem LO.Arith.Seq.seqCons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (h : Seq s) (x : V) : Seq (s ⁀' x)

@[simp]

theorem LO.Arith.Seq.lh_seqCons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (x : V) {s : V} (h : Seq s) : lh (s ⁀' x) = lh s + 1

theorem LO.Arith.mem_seqCons_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i x z s : V} : ⟪i, x⟫ ∈ s ⁀' z ↔ i = lh s ∧ x = z ∨ ⟪i, x⟫ ∈ s

@[simp]

theorem LO.Arith.lh_mem_seqCons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s z : V) : ⟪lh s, z⟫ ∈ s ⁀' z

@[simp]

theorem LO.Arith.lh_mem_seqCons_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s x z : V} (H : Seq s) : ⟪lh s, x⟫ ∈ s ⁀' z ↔ x = z

theorem LO.Arith.Seq.mem_seqCons_iff_of_lt {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {i s x z : V} (hi : i < lh s) : ⟪i, x⟫ ∈ s ⁀' z ↔ ⟪i, x⟫ ∈ s

@[simp]

theorem LO.Arith.lh_not_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (Ss : Seq s) (x : V) : ⟪lh s, x⟫ ∉ s

theorem LO.Arith.seqCons_graph {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (t x s : V) : t = s ⁀' x ↔ ∃ l ≤ 2 * s, l = lh s ∧ ∃ p ≤ (2 * s + x + 1) ^ 2, p = ⟪l, x⟫ ∧ t = insert p s

def LO.FirstOrder.Arith.seqConsDef : 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.seqCons_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₂ seqCons via FirstOrder.Arith.seqConsDef

@[simp]

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

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

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

@[simp]

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

theorem LO.Arith.seqCons_absolute {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (s a : ℕ) : ↑(s ⁀' a) = ↑s ⁀' ↑a

theorem LO.Arith.Seq.restr {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (H : Seq s) {i : V} (hi : i ≤ lh s) : Seq (Arith.restr s (under i))

theorem LO.Arith.Seq.restr_lh {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} (H : Seq s) {i : V} (hi : i ≤ lh s) : lh (Arith.restr s (under i)) = i

theorem LO.Arith.domain_bitRemove_of_isMapping_of_mem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {x y s : V} (hs : IsMapping s) (hxy : ⟪x, y⟫ ∈ s) : domain (bitRemove ⟪x, y⟫ s) = bitRemove x (domain s)

theorem LO.Arith.Seq.eq_of_eq_of_subset {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s₁ s₂ : V} (H₁ : Seq s₁) (H₂ : Seq s₂) (hl : lh s₁ = lh s₂) (h : s₁ ⊆ s₂) : s₁ = s₂

theorem LO.Arith.subset_pair {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s t : V} (h : ∀ (i x : V), ⟪i, x⟫ ∈ s → ⟪i, x⟫ ∈ t) : s ⊆ t

theorem LO.Arith.Seq.lh_ext {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s₁ s₂ : V} (H₁ : Seq s₁) (H₂ : Seq s₂) (h : lh s₁ = lh s₂) (H : ∀ (i x₁ x₂ : V), ⟪i, x₁⟫ ∈ s₁ → ⟪i, x₂⟫ ∈ s₂ → x₁ = x₂) : s₁ = s₂

@[simp]

theorem LO.Arith.Seq.seqCons_ext {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a₁ a₂ s₁ s₂ : V} (H₁ : Seq s₁) (H₂ : Seq s₂) : s₁ ⁀' a₁ = s₂ ⁀' a₂ ↔ a₁ = a₂ ∧ s₁ = s₂

theorem LO.Arith.ne_zero_iff_one_le {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {a : V} : a ≠ 0 ↔ 1 ≤ a

TODO: move to Lemmata.lean

theorem LO.Arith.Seq.cases_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} : Seq s ↔ s = ∅ ∨ ∃ (x : V) (s' : V), Seq s' ∧ s = s' ⁀' x

theorem LO.Arith.Seq.cases {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {s : V} : Seq s → s = ∅ ∨ ∃ (x : V) (s' : V), Seq s' ∧ s = s' ⁀' x

Alias of the forward direction of LO.Arith.Seq.cases_iff.

theorem LO.Arith.seq_induction {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (Γ : SigmaPiDelta) {P : V → Prop} (hP : { Γ := Γ, rank := 1 }-Predicate P) (hnil : P ∅) (hcons : ∀ (s x : V), Seq s → P s → P (s ⁀' x)) {s : V} : Seq s → P s

def LO.Arith.«term!⟦_⟧» : Lean.ParserDescr

!⟦x, y, z, ...⟧ notation for Seq

Equations

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

def LO.Arith.vecConsUnexpander : Lean.PrettyPrinter.Unexpander

Imported declaration from the Incompleteness formalization.

Equations

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

@[simp]

theorem LO.Arith.singleton_seq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (x : V) : Seq !⟦x⟧

@[simp]

theorem LO.Arith.doubleton_seq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (x y : V) : Seq !⟦x, y⟧

@[simp]

theorem LO.Arith.mem_singleton_seq_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (x y : V) : ⟪0, x⟫ ∈ !⟦y⟧ ↔ x = y

def LO.FirstOrder.Arith.mkSeq₁Def : 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.mkSeq₁_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₁ fun (x : V) => !⟦x⟧ via FirstOrder.Arith.mkSeq₁Def

@[simp]

theorem LO.Arith.eval_mkSeq₁Def {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (v : Fin 2 → V) : V ⊧/v (FirstOrder.Arith.HierarchySymbol.Semiformula.val FirstOrder.Arith.mkSeq₁Def) ↔ v 0 = !⟦v 1⟧

instance LO.Arith.mkSeq₁_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg0-Function₁ fun (x : V) => !⟦x⟧

instance LO.Arith.mkSeq₁_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (Γ : FirstOrder.Arith.HierarchySymbol) : Γ-Function₁ fun (x : V) => !⟦x⟧

def LO.FirstOrder.Arith.mkSeq₂Def : Sg1.Semisentence 3

Imported declaration from the Incompleteness formalization.

Equations

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

theorem LO.Arith.mkSeq₂_defined {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg1-Function₂ fun (x y : V) => !⟦x, y⟧ via FirstOrder.Arith.mkSeq₂Def

@[simp]

theorem LO.Arith.eval_mkSeq₂Def {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (v : Fin 3 → V) : V ⊧/v (FirstOrder.Arith.HierarchySymbol.Semiformula.val FirstOrder.Arith.mkSeq₂Def) ↔ v 0 = !⟦v 1, v 2⟧

instance LO.Arith.mkSeq₂_definable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] : FirstOrder.Arith.Sg1-Function₂ fun (x y : V) => !⟦x, y⟧

instance LO.Arith.mkSeq₂_definable' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (Γ : SigmaPiDelta) (m : ℕ) : { Γ := Γ, rank := m + 1 }-Function₂ fun (x y : V) => !⟦x, y⟧

theorem LO.Arith.sigmaOne_skolem_seq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {R : V → V → Prop} (hP : FirstOrder.Arith.Sg1-Relation R) {l : V} (H : ∀ x < l, ∃ (y : V), R x y) : ∃ (s : V), Seq s ∧ lh s = l ∧ ∀ (i x : V), ⟪i, x⟫ ∈ s → R i x

theorem LO.Arith.sigmaOne_skolem_seq! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {R : V → V → Prop} (hP : FirstOrder.Arith.Sg1-Relation R) {l : V} (H : ∀ x < l, ∃! y : V, R x y) : ∃! s : V, Seq s ∧ lh s = l ∧ ∀ (i x : V), ⟪i, x⟫ ∈ s → R i x

def LO.Arith.vecToSeq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {n : ℕ} : (Fin n → V) → V

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.vecToSeq x_2 = ∅
• LO.Arith.vecToSeq v = (LO.Arith.vecToSeq fun (x : Fin n) => v x.castSucc) ⁀' v (Fin.last n)

@[simp]

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

@[simp]

theorem LO.Arith.vecToSeq_vecCons {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {n : ℕ} (v : Fin n → V) (a : V) : vecToSeq (v <: a) = vecToSeq v ⁀' a

@[simp]

theorem LO.Arith.vecToSeq_seq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {n : ℕ} (v : Fin n → V) : Seq (vecToSeq v)

@[simp]

theorem LO.Arith.lh_vecToSeq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {n : ℕ} (v : Fin n → V) : lh (vecToSeq v) = ↑n

theorem LO.Arith.mem_vectoSeq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {n : ℕ} (v : Fin n → V) (i : Fin n) : ⟪↑↑i, v i⟫ ∈ vecToSeq v

theorem LO.Arith.order_ball_induction_sigma1 {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {f : V → V → V} (hf : FirstOrder.Arith.Sg1-Function₂ f) {P : V → V → Prop} (hP : FirstOrder.Arith.Sg1-Relation P) (ind : ∀ (x y : V), (∀ x' < x, ∀ y' ≤ f x y, P x' y') → P x y) (x y : V) : P x y

theorem LO.Arith.order_ball_induction_sigma1' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {f : V → V} (hf : FirstOrder.Arith.Sg1-Function₁ f) {P : V → V → Prop} (hP : FirstOrder.Arith.Sg1-Relation P) (ind : ∀ (x y : V), (∀ x' < x, ∀ y' ≤ f y, P x' y') → P x y) (x y : V) : P x y

theorem LO.Arith.order_ball_induction₂_sigma1 {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {fy fz : V → V → V → V} (hfy : FirstOrder.Arith.Sg1-Function₃ fy) (hfz : FirstOrder.Arith.Sg1-Function₃ fz) {P : V → V → V → Prop} (hP : FirstOrder.Arith.Sg1-Relation₃ P) (ind : ∀ (x y z : V), (∀ x' < x, ∀ y' ≤ fy x y z, ∀ z' ≤ fz x y z, P x' y' z') → P x y z) (x y z : V) : P x y z

theorem LO.Arith.order_ball_induction₃_sigma1 {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {fy fz fw : V → V → V → V → V} (hfy : FirstOrder.Arith.Sg1-Function₄ fy) (hfz : FirstOrder.Arith.Sg1-Function₄ fz) (hfw : FirstOrder.Arith.Sg1-Function₄ fw) {P : V → V → V → V → Prop} (hP : FirstOrder.Arith.Sg1-Relation₄ P) (ind : ∀ (x y z w : V), (∀ x' < x, ∀ y' ≤ fy x y z w, ∀ z' ≤ fz x y z w, ∀ w' ≤ fw x y z w, P x' y' z' w') → P x y z w) (x y z w : V) : P x y z w