Typed Formalized Tait-Calculus

@[reducible, inline]

noncomputable abbrev LO.Arith.Language.Semiformula.substs₁ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Semiformula (0 + 1)) (t : L.Term) : L.Formula

Imported declaration from the Incompleteness formalization.

Equations

• p.substs₁ t = p^/[LO.Arith.Language.Semiterm.sing t]

@[reducible, inline]

noncomputable abbrev LO.Arith.Language.Semiformula.free {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Semiformula (0 + 1)) : L.Formula

Imported declaration from the Incompleteness formalization.

Equations

• p.free = p.shift.substs₁ (L.fvar 0)

@[simp]

theorem LO.Arith.Language.Semiformula.val_substs₁ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Semiformula (0 + 1)) (t : L.Term) : (p.substs₁ t).val = L.substs ?[t.val] p.val

theorem LO.Arith.Language.Semiformula.val_free {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Semiformula (0 + 1)) : p.free.val = L.substs ?[qqFvar 0] (L.shift p.val)

@[simp]

theorem LO.Arith.substs₁_neg {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Semiformula (0 + 1)) (t : L.Term) : (∼p).substs₁ t = ∼p.substs₁ t

@[simp]

theorem LO.Arith.substs₁_all {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Semiformula (0 + 1 + 1)) (t : L.Term) : p.all.substs₁ t = p^/[(Language.Semiterm.sing t).q].all

@[simp]

theorem LO.Arith.substs₁_ex {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Semiformula (0 + 1 + 1)) (t : L.Term) : p.ex.substs₁ t = p^/[(Language.Semiterm.sing t).q].ex

@[reducible, inline]

abbrev LO.Arith.Language.Theory.tmem {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Formula) (T : L.Theory) : Prop

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.tmem p T = (p.val ∈ T)

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

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.«term_∈'_» = Lean.ParserDescr.trailingNode `LO.Arith.«term_∈'_» 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∈' ") (Lean.ParserDescr.cat `term 51))

structure LO.Arith.Language.Sequent {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] (L : Arith.Language V) {pL : FirstOrder.Arith.LDef} [L.Defined pL] : Type u_1

Imported declaration from the Incompleteness formalization.

• val : V

  Imported declaration from the Incompleteness formalization.

• val_formulaSet : L.IsFormulaSet self.val

@[implicit_reducible]

instance LO.Arith.instEmptyCollectionSequent {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : EmptyCollection L.Sequent

Equations

• LO.Arith.instEmptyCollectionSequent = { emptyCollection := { val := ∅, val_formulaSet := ⋯ } }

@[implicit_reducible]

noncomputable instance LO.Arith.instSingletonFormulaSequent {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : Singleton L.Formula L.Sequent

Equations

• LO.Arith.instSingletonFormulaSequent = { singleton := fun (p : L.Formula) => { val := {p.val}, val_formulaSet := ⋯ } }

@[implicit_reducible]

noncomputable instance LO.Arith.instInsertFormulaSequent {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : Insert L.Formula L.Sequent

Equations

• LO.Arith.instInsertFormulaSequent = { insert := fun (p : L.Formula) (Γ : L.Sequent) => { val := insert p.val Γ.val, val_formulaSet := ⋯ } }

@[implicit_reducible]

noncomputable instance LO.Arith.instUnionSequent {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : Union L.Sequent

Equations

• LO.Arith.instUnionSequent = { union := fun (Γ Δ : L.Sequent) => { val := Γ.val ∪ Δ.val, val_formulaSet := ⋯ } }

@[implicit_reducible]

instance LO.Arith.instMembershipFormulaSequent {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : Membership L.Formula L.Sequent

Equations

• LO.Arith.instMembershipFormulaSequent = { mem := fun (Γ : L.Sequent) (p : L.Formula) => p.val ∈ Γ.val }

@[implicit_reducible]

instance LO.Arith.instHasSubsetSequent {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : HasSubset L.Sequent

Equations

• LO.Arith.instHasSubsetSequent = { Subset := fun (x1 x2 : L.Sequent) => x1.val ⊆ x2.val }

def LO.Arith.«term_:+>_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.«term_:+>_» = Lean.ParserDescr.trailingNode `LO.Arith.«term_:+>_» 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " :+> ") (Lean.ParserDescr.cat `term 50))

theorem LO.Arith.Language.Sequent.mem_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ : L.Sequent} {p : L.Formula} : p ∈ Γ ↔ p.val ∈ Γ.val

theorem LO.Arith.Language.Sequent.subset_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ Δ : L.Sequent} : Γ ⊆ Δ ↔ Γ.val ⊆ Δ.val

@[simp]

theorem LO.Arith.Language.Sequent.val_empty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : ∅.val = ∅

@[simp]

theorem LO.Arith.Language.Sequent.val_singleton {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Formula) : {p}.val = {p.val}

@[simp]

theorem LO.Arith.Language.Sequent.val_insert {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Formula) (Γ : L.Sequent) : (insert p Γ).val = insert p.val Γ.val

@[simp]

theorem LO.Arith.Language.Sequent.val_union {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (Γ Δ : L.Sequent) : (Γ ∪ Δ).val = Γ.val ∪ Δ.val

@[simp]

theorem LO.Arith.Language.Sequent.not_mem_empty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (p : L.Formula) : p ∉ ∅

@[simp]

theorem LO.Arith.Language.Sequent.mem_singleton_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {p q : L.Formula} : p ∈ {q} ↔ p = q

@[simp]

theorem LO.Arith.Language.Sequent.mem_insert_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ : L.Sequent} {p q : L.Formula} : p ∈ insert q Γ ↔ p = q ∨ p ∈ Γ

@[simp]

theorem LO.Arith.Language.Sequent.mem_union_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ Δ : L.Sequent} {p : L.Formula} : p ∈ Γ ∪ Δ ↔ p ∈ Γ ∨ p ∈ Δ

theorem LO.Arith.Language.Sequent.ext {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ Δ : L.Sequent} (h : ∀ (x : L.Formula), x ∈ Γ ↔ x ∈ Δ) : Γ = Δ

theorem LO.Arith.Language.Sequent.ext_iff {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ Δ : L.Sequent} : Γ = Δ ↔ ∀ (x : L.Formula), x ∈ Γ ↔ x ∈ Δ

theorem LO.Arith.Language.Sequent.ext' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ Δ : L.Sequent} (h : Γ.val = Δ.val) : Γ = Δ

noncomputable def LO.Arith.Language.Sequent.shift {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (s : L.Sequent) : L.Sequent

Imported declaration from the Incompleteness formalization.

Equations

• s.shift = { val := L.setShift s.val, val_formulaSet := ⋯ }

@[simp]

theorem LO.Arith.Language.Sequent.shift_empty {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : ∅.shift = ∅

@[simp]

theorem LO.Arith.Language.Sequent.shift_insert {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {Γ : L.Sequent} {p : L.Formula} : (insert p Γ).shift = insert (Semiformula.shift p) Γ.shift

structure LO.Arith.Language.TTheory {V : Type u_1} [ORingStruc V] (L : Arith.Language V) {pL : FirstOrder.Arith.LDef} [L.Defined pL] : Type u_1

Imported declaration from the Incompleteness formalization.

• thy : L.Theory

  Imported declaration from the Incompleteness formalization.

• pthy : pL.TDef

  Imported declaration from the Incompleteness formalization.

• defined : self.thy.Defined self.pthy

instance LO.Arith.instDefinedThyPthy {V : Type u_1} [ORingStruc V] (L : Arith.Language V) {pL : FirstOrder.Arith.LDef} [L.Defined pL] (T : L.TTheory) : T.thy.Defined T.pthy

structure LO.Arith.Language.Theory.TDerivation {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (T : L.TTheory) (Γ : L.Sequent) : Type u_1

Imported declaration from the Incompleteness formalization.

• derivation : V

  Imported declaration from the Incompleteness formalization.

• derivationOf : T.thy.DerivationOf self.derivation Γ.val

def LO.Arith.«term_⊢¹_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.«term_⊢¹_» = Lean.ParserDescr.trailingNode `LO.Arith.«term_⊢¹_» 45 46 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊢¹ ") (Lean.ParserDescr.cat `term 46))

def LO.Arith.Language.Theory.TProof {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (T : L.TTheory) (p : L.Formula) : Type u_1

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof T p = LO.Arith.Language.Theory.TDerivation T (insert p ∅)

@[implicit_reducible]

instance LO.Arith.instEntailmentFormulaTTheory {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : Entailment L.Formula L.TTheory

Equations

• LO.Arith.instEntailmentFormulaTTheory = { Prf := LO.Arith.Language.Theory.TProof }

@[implicit_reducible]

instance LO.Arith.instHasSubsetTTheory {V : Type u_1} [ORingStruc V] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] : HasSubset L.TTheory

Equations

• LO.Arith.instHasSubsetTTheory = { Subset := fun (T U : L.TTheory) => T.thy ⊆ U.thy }

noncomputable def LO.Arith.Language.Theory.Derivable.toTDerivation {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (Γ : L.Sequent) (h : T.thy.Derivable Γ.val) : TDerivation T Γ

Imported declaration from the Incompleteness formalization.

Equations

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

theorem LO.Arith.Language.Theory.TDerivation.toDerivable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} (d : TDerivation T Γ) : T.thy.Derivable Γ.val

theorem LO.Arith.Language.Theory.TProvable.iff_provable {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {σ : L.Formula} : T ⊢! σ ↔ T.thy.Provable σ.val

def LO.Arith.Language.Theory.TDerivation.toTProof {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Formula} (d : TDerivation T (insert p ∅)) : T ⊢ p

Imported declaration from the Incompleteness formalization.

Equations

• d.toTProof = d

def LO.Arith.Language.Theory.TProof.toTDerivation {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Formula} (d : T ⊢ p) : TDerivation T (insert p ∅)

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.toTDerivation d = d

noncomputable def LO.Arith.Language.Theory.TDerivation.byAxm {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} (p : L.Formula) (h : tmem p T.thy) (hΓ : p ∈ Γ) : TDerivation T Γ

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TDerivation.byAxm p h hΓ = LO.Arith.Language.Theory.Derivable.toTDerivation Γ ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.em {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} (p : L.Formula) (h : p ∈ Γ := by simp) (hn : ∼p ∈ Γ := by simp) : TDerivation T Γ

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TDerivation.em p h hn = LO.Arith.Language.Theory.Derivable.toTDerivation Γ ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.verum {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} (h : ⊤ ∈ Γ := by simp) : TDerivation T Γ

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TDerivation.verum h = LO.Arith.Language.Theory.Derivable.toTDerivation Γ ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.and {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p q : L.Formula} (dp : TDerivation T (insert p Γ)) (dq : TDerivation T (insert q Γ)) : TDerivation T (insert (p ⋏ q) Γ)

Imported declaration from the Incompleteness formalization.

Equations

• dp.and dq = LO.Arith.Language.Theory.Derivable.toTDerivation (insert (p ⋏ q) Γ) ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.or {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p q : L.Formula} (dpq : TDerivation T (insert p (insert q Γ))) : TDerivation T (insert (p ⋎ q) Γ)

Imported declaration from the Incompleteness formalization.

Equations

• dpq.or = LO.Arith.Language.Theory.Derivable.toTDerivation (insert (p ⋎ q) Γ) ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.all {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p : L.Semiformula (0 + 1)} (dp : TDerivation T (insert p.free Γ.shift)) : TDerivation T (insert p.all Γ)

Imported declaration from the Incompleteness formalization.

Equations

• dp.all = LO.Arith.Language.Theory.Derivable.toTDerivation (insert p.all Γ) ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.ex {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p : L.Semiformula (0 + 1)} (t : L.Term) (dp : TDerivation T (insert (p.substs₁ t) Γ)) : TDerivation T (insert p.ex Γ)

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TDerivation.ex t dp = LO.Arith.Language.Theory.Derivable.toTDerivation (insert p.ex Γ) ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.wk {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ Δ : L.Sequent} (d : TDerivation T Δ) (h : Δ ⊆ Γ) : TDerivation T Γ

Imported declaration from the Incompleteness formalization.

Equations

• d.wk h = LO.Arith.Language.Theory.Derivable.toTDerivation Γ ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.shift {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} (d : TDerivation T Γ) : TDerivation T Γ.shift

Imported declaration from the Incompleteness formalization.

Equations

• d.shift = LO.Arith.Language.Theory.Derivable.toTDerivation Γ.shift ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.cut {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p : L.Formula} (d₁ : TDerivation T (insert p Γ)) (d₂ : TDerivation T (insert (∼p) Γ)) : TDerivation T Γ

Imported declaration from the Incompleteness formalization.

Equations

• d₁.cut d₂ = LO.Arith.Language.Theory.Derivable.toTDerivation Γ ⋯

def LO.Arith.Language.Theory.TDerivation.ofSubset {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T U : L.TTheory} {Γ : L.Sequent} (h : T ⊆ U) (d : TDerivation T Γ) : TDerivation U Γ

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TDerivation.ofSubset h d = { derivation := d.derivation, derivationOf := ⋯ }

noncomputable def LO.Arith.Language.Theory.TDerivation.cut' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ Δ : L.Sequent} {p : L.Formula} (d₁ : TDerivation T (insert p Γ)) (d₂ : TDerivation T (insert (∼p) Δ)) : TDerivation T (Γ ∪ Δ)

Imported declaration from the Incompleteness formalization.

Equations

• d₁.cut' d₂ = (d₁.wk ⋯).cut (d₂.wk ⋯)

noncomputable def LO.Arith.Language.Theory.TDerivation.conj {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} (ps : SemiformulaVec 0) (ds : (i : V) → (hi : i < len ps.val) → TDerivation T (insert (ps.nth i hi) Γ)) : TDerivation T (insert ps.conj Γ)

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TDerivation.conj ps ds = LO.Arith.Language.Theory.Derivable.toTDerivation (insert ps.conj Γ) ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.disj {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} (ps : SemiformulaVec 0) {i : V} (hi : i < len ps.val) (d : TDerivation T (insert (ps.nth i hi) Γ)) : TDerivation T (insert ps.disj Γ)

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TDerivation.disj ps hi d = LO.Arith.Language.Theory.Derivable.toTDerivation (insert ps.disj Γ) ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.modusPonens {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p q : L.Formula} (dpq : TDerivation T (insert (p ==> q) Γ)) (dp : TDerivation T (insert p Γ)) : TDerivation T (insert q Γ)

Imported declaration from the Incompleteness formalization.

Equations

• dpq.modusPonens dp = (dpq.wk ⋯).cut (⋯.mpr ((dp.wk ⋯).and (LO.Arith.Language.Theory.TDerivation.em q ⋯ ⋯)))

def LO.Arith.Language.Theory.TDerivation.ofEq {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ Δ : L.Sequent} (d : TDerivation T Γ) (h : Γ = Δ) : TDerivation T Δ

Imported declaration from the Incompleteness formalization.

Equations

• d.ofEq h = h ▸ d

noncomputable def LO.Arith.Language.Theory.TDerivation.rotate₁ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p₀ p₁ : L.Formula} (d : TDerivation T (insert p₀ (insert p₁ Γ))) : TDerivation T (insert p₁ (insert p₀ Γ))

Imported declaration from the Incompleteness formalization.

Equations

• d.rotate₁ = d.ofEq ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.rotate₂ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p₀ p₁ p₂ : L.Formula} (d : TDerivation T (insert p₀ (insert p₁ (insert p₂ Γ)))) : TDerivation T (insert p₂ (insert p₁ (insert p₀ Γ)))

Imported declaration from the Incompleteness formalization.

Equations

• d.rotate₂ = d.ofEq ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.rotate₃ {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p₀ p₁ p₂ p₃ : L.Formula} (d : TDerivation T (insert p₀ (insert p₁ (insert p₂ (insert p₃ Γ))))) : TDerivation T (insert p₃ (insert p₁ (insert p₂ (insert p₀ Γ))))

Imported declaration from the Incompleteness formalization.

Equations

• d.rotate₃ = d.ofEq ⋯

noncomputable def LO.Arith.Language.Theory.TDerivation.orInv {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p q : L.Formula} (d : TDerivation T (insert (p ⋎ q) Γ)) : TDerivation T (insert p (insert q Γ))

Imported declaration from the Incompleteness formalization.

Equations

• d.orInv = (d.wk ⋯).cut (⋯.mpr ((LO.Arith.Language.Theory.TDerivation.em p ⋯ ⋯).and (LO.Arith.Language.Theory.TDerivation.em q ⋯ ⋯)))

noncomputable def LO.Arith.Language.Theory.TDerivation.specialize {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : L.Sequent} {p : L.Semiformula (0 + 1)} (b : TDerivation T (insert p.all Γ)) (t : L.Term) : TDerivation T (insert (p.substs₁ t) Γ)

Imported declaration from the Incompleteness formalization.

Equations

• b.specialize t = (b.wk ⋯).cut (⋯.mpr (LO.Arith.Language.Theory.TDerivation.ex t (LO.Arith.Language.Theory.TDerivation.em (p.substs₁ t) ⋯ ⋯)))

noncomputable def LO.Arith.Language.Theory.TProof.modusPonens {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p q : L.Formula} (d : T ⊢ p ==> q) (b : T ⊢ p) : T ⊢ q

Condition D2

Equations

• LO.Arith.Language.Theory.TProof.modusPonens d b = LO.Arith.Language.Theory.TDerivation.modusPonens d b

noncomputable def LO.Arith.Language.Theory.TProof.byAxm {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Formula} (h : tmem p T.thy) : T ⊢ p

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.byAxm h = LO.Arith.Language.Theory.TDerivation.byAxm p h ⋯

noncomputable def LO.Arith.Language.Theory.TProof.ofSubset {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T U : L.TTheory} (h : T ⊆ U) {p : L.Formula} : T ⊢ p → U ⊢ p

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.ofSubset h = LO.Arith.Language.Theory.TDerivation.ofSubset h

theorem LO.Arith.Language.Theory.TProof.of_subset {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T U : L.TTheory} (h : T ⊆ U) {p : L.Formula} : T ⊢! p → U ⊢! p

@[implicit_reducible]

noncomputable instance LO.Arith.Language.Theory.TProof.instModusPonensTTheoryFormula {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} : Entailment.ModusPonens T

Equations

• LO.Arith.Language.Theory.TProof.instModusPonensTTheoryFormula = { mdp := fun {φ ψ : L.Formula} => LO.Arith.Language.Theory.TProof.modusPonens }

@[implicit_reducible]

noncomputable instance LO.Arith.Language.Theory.TProof.instNegationEquivTTheoryFormula {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} : Entailment.NegationEquiv T

Equations

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

@[implicit_reducible]

noncomputable instance LO.Arith.Language.Theory.TProof.instMinimalTTheoryFormula {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} : Entailment.Minimal T

Equations

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

@[implicit_reducible]

noncomputable instance LO.Arith.Language.Theory.TProof.instClassicalTTheoryFormula {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} : Entailment.Classical T

Equations

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

noncomputable def LO.Arith.Language.Theory.TProof.exIntro {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (p : L.Semiformula (0 + 1)) (t : L.Term) (b : T ⊢ p.substs₁ t) : T ⊢ p.ex

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.exIntro p t b = LO.Arith.Language.Theory.TDerivation.ex t b

theorem LO.Arith.Language.Theory.TProof.ex_intro! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (p : L.Semiformula (0 + 1)) (t : L.Term) (b : T ⊢! p.substs₁ t) : T ⊢! p.ex

noncomputable def LO.Arith.Language.Theory.TProof.specialize {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Semiformula (0 + 1)} (b : T ⊢ p.all) (t : L.Term) : T ⊢ p.substs₁ t

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.specialize b t = LO.Arith.Language.Theory.TDerivation.specialize b t

theorem LO.Arith.Language.Theory.TProof.specialize! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Semiformula (0 + 1)} (b : T ⊢! p.all) (t : L.Term) : T ⊢! p.substs₁ t

noncomputable def LO.Arith.Language.Theory.TProof.conj {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (ps : SemiformulaVec 0) (ds : (i : V) → (hi : i < len ps.val) → T ⊢ ps.nth i hi) : T ⊢ ps.conj

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.conj ps ds = LO.Arith.Language.Theory.TDerivation.conj ps ds

theorem LO.Arith.Language.Theory.TProof.conj! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (ps : SemiformulaVec 0) (ds : ∀ (i : V) (hi : i < len ps.val), T ⊢! ps.nth i hi) : T ⊢! ps.conj

noncomputable def LO.Arith.Language.Theory.TProof.conj' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (ps : SemiformulaVec 0) (ds : (i : V) → (hi : i < len ps.val) → T ⊢ ps.nth (len ps.val - (i + 1)) ⋯) : T ⊢ ps.conj

Imported declaration from the Incompleteness formalization.

Equations

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

noncomputable def LO.Arith.Language.Theory.TProof.conjOr' {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (ps : SemiformulaVec 0) (q : L.Semiformula 0) (ds : (i : V) → (hi : i < len ps.val) → T ⊢ ps.nth (len ps.val - (i + 1)) ⋯ ⋎ q) : T ⊢ ps.conj ⋎ q

Imported declaration from the Incompleteness formalization.

Equations

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

noncomputable def LO.Arith.Language.Theory.TProof.disj {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} (ps : SemiformulaVec 0) {i : V} (hi : i < len ps.val) (d : T ⊢ ps.nth i hi) : T ⊢ ps.disj

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.disj ps hi d = LO.Arith.Language.Theory.TDerivation.disj ps hi d

noncomputable def LO.Arith.Language.Theory.TProof.shift {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Formula} (d : T ⊢ p) : T ⊢ Semiformula.shift p

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.shift d = ⋯.mp (LO.Arith.Language.Theory.TDerivation.shift d)

theorem LO.Arith.Language.Theory.TProof.shift! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Formula} (d : T ⊢! p) : T ⊢! Semiformula.shift p

noncomputable def LO.Arith.Language.Theory.TProof.all {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Semiformula (0 + 1)} (dp : T ⊢ p.free) : T ⊢ p.all

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.all dp = (⋯.mpr dp).all

theorem LO.Arith.Language.Theory.TProof.all! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Semiformula (0 + 1)} (dp : T ⊢! p.free) : T ⊢! p.all

noncomputable def LO.Arith.Language.Theory.TProof.generalizeAux {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {C : L.Formula} {p : L.Semiformula (0 + 1)} (dp : T ⊢ Semiformula.shift C ==> p.free) : T ⊢ C ==> p.all

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.generalizeAux dp = ⋯.mpr ((LO.Arith.Language.Theory.TDerivation.orInv (⋯.mp dp)).wk ⋯).all.rotate₁.or

theorem LO.Arith.Language.Theory.TProof.conj_shift {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (Γ : List L.Formula) : Semiformula.shift (⋀Γ) = ⋀List.map Semiformula.shift Γ

noncomputable def LO.Arith.Language.Theory.TProof.generalize {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : List (L.Semiformula 0)} {p : L.Semiformula (0 + 1)} (d : List.map Semiformula.shift Γ ⊢[T] p.free) : Γ ⊢[T] p.all

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.generalize d = LO.Entailment.FiniteContext.ofDef (LO.Arith.Language.Theory.TProof.generalizeAux (⋯.mpr (LO.Entailment.FiniteContext.toDef d)))

theorem LO.Arith.Language.Theory.TProof.generalize! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : List (L.Semiformula 0)} {p : L.Semiformula (0 + 1)} (d : List.map Semiformula.shift Γ ⊢[T]! p.free) : Γ ⊢[T]! p.all

noncomputable def LO.Arith.Language.Theory.TProof.specializeWithCtxAux {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {C : L.Formula} {p : L.Semiformula (0 + 1)} (d : T ⊢ C ==> p.all) (t : L.Term) : T ⊢ C ==> p.substs₁ t

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.specializeWithCtxAux d t = ⋯.mpr (((LO.Arith.Language.Theory.TDerivation.orInv (⋯.mp d)).wk ⋯).specialize t).rotate₁.or

noncomputable def LO.Arith.Language.Theory.TProof.specializeWithCtx {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : List (L.Semiformula 0)} {p : L.Semiformula (0 + 1)} (d : Γ ⊢[T] p.all) (t : L.Term) : Γ ⊢[T] p.substs₁ t

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.specializeWithCtx d t = LO.Arith.Language.Theory.TProof.specializeWithCtxAux d t

theorem LO.Arith.Language.Theory.TProof.specialize_with_ctx! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {Γ : List (L.Semiformula 0)} {p : L.Semiformula (0 + 1)} (d : Γ ⊢[T]! p.all) (t : L.Term) : Γ ⊢[T]! p.substs₁ t

noncomputable def LO.Arith.Language.Theory.TProof.ex {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Semiformula (0 + 1)} (t : L.Term) (dp : T ⊢ p.substs₁ t) : T ⊢ p.ex

Imported declaration from the Incompleteness formalization.

Equations

• LO.Arith.Language.Theory.TProof.ex t dp = LO.Arith.Language.Theory.TDerivation.ex t dp

theorem LO.Arith.Language.Theory.TProof.ex! {V : Type u_1} [ORingStruc V] [V ⊧ₘ* 𝐈Sg1] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.TTheory} {p : L.Semiformula (0 + 1)} (t : L.Term) (dp : T ⊢! p.substs₁ t) : T ⊢! p.ex