Language of first-order logic

This file defines the language of first-order logic.

• LO.FirstOrder.Language.empty is the empty language.
• LO.FirstOrder.Language.constant C is a language with only constants of the element C.
• LO.FirstOrder.Language.oRing, ℒₒᵣ is the language of ordered ring.

structure LO.FirstOrder.Language : Type (u + 1)

Imported declaration from the Incompleteness formalization.

• Func : ℕ → Type u

  Imported declaration from the Incompleteness formalization.

• Rel : ℕ → Type u

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.IsRelational (L : Language) : Prop

Imported declaration from the Incompleteness formalization.

• func_empty (k : ℕ) : IsEmpty (L.Func (k + 1))

class LO.FirstOrder.Language.IsConstant (L : Language) extends L.IsRelational : Prop

Imported declaration from the Incompleteness formalization.

• func_empty (k : ℕ) : IsEmpty (L.Func (k + 1))
• rel_empty (k : ℕ) : IsEmpty (L.Rel k)

class LO.FirstOrder.Language.ConstantInhabited (L : Language) extends Inhabited (L.Func 0) : Type u_1

Imported declaration from the Incompleteness formalization.

• default : L.Func 0

@[implicit_reducible]

instance LO.FirstOrder.Language.instInhabitedFuncOfNatNatOfConstantInhabited {L : Language} [L.ConstantInhabited] : Inhabited (L.Func 0)

Equations

• LO.FirstOrder.Language.instInhabitedFuncOfNatNatOfConstantInhabited = inferInstance

def LO.FirstOrder.Language.empty : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.empty = { Func := fun (x : ℕ) => PEmpty.{?u.1 + 1}, Rel := fun (x : ℕ) => PEmpty.{?u.1 + 1} }

@[implicit_reducible]

instance LO.FirstOrder.Language.instInhabited : Inhabited Language

Equations

• LO.FirstOrder.Language.instInhabited = { default := LO.FirstOrder.Language.empty }

inductive LO.FirstOrder.Language.GraphFunc : ℕ → Type

Imported declaration from the Incompleteness formalization.

• start : GraphFunc 0
• terminal : GraphFunc 0

inductive LO.FirstOrder.Language.GraphRel : ℕ → Type

Imported declaration from the Incompleteness formalization.

• equal : GraphRel 2
• le : GraphRel 2

def LO.FirstOrder.Language.graph : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.graph = { Func := LO.FirstOrder.Language.GraphFunc, Rel := LO.FirstOrder.Language.GraphRel }

inductive LO.FirstOrder.Language.BinaryRel : ℕ → Type

Imported declaration from the Incompleteness formalization.

• isone : BinaryRel 1
• equal : BinaryRel 2
• le : BinaryRel 2

def LO.FirstOrder.Language.binary : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.binary = { Func := fun (x : ℕ) => Empty, Rel := LO.FirstOrder.Language.BinaryRel }

inductive LO.FirstOrder.Language.EqRel : ℕ → Type

Imported declaration from the Incompleteness formalization.

• equal : EqRel 2

@[reducible]

def LO.FirstOrder.Language.equal : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.equal = { Func := fun (x : ℕ) => Empty, Rel := LO.FirstOrder.Language.EqRel }

@[implicit_reducible]

instance LO.FirstOrder.Language.instToStringFuncEqual (k : ℕ) : ToString (equal.Func k)

Equations

• LO.FirstOrder.Language.instToStringFuncEqual k = { toString := fun (x : LO.FirstOrder.Language.equal.Func k) => "" }

@[implicit_reducible]

instance LO.FirstOrder.Language.instToStringRelEqual (k : ℕ) : ToString (equal.Rel k)

Equations

• LO.FirstOrder.Language.instToStringRelEqual k = { toString := fun (x : LO.FirstOrder.Language.equal.Rel k) => "\\mathrm{Eq}" }

@[implicit_reducible]

instance LO.FirstOrder.Language.instDecidableEqFuncEqual (k : ℕ) : DecidableEq (equal.Func k)

Equations

• LO.FirstOrder.Language.instDecidableEqFuncEqual k a b = Empty.casesOn (fun (x : LO.FirstOrder.Language.equal.Func k) => Decidable (x = b)) a

@[implicit_reducible]

instance LO.FirstOrder.Language.instDecidableEqRelEqual (k : ℕ) : DecidableEq (equal.Rel k)

Equations

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

@[implicit_reducible]

instance LO.FirstOrder.Language.instEncodableFuncEqual (k : ℕ) : Encodable (equal.Func k)

Equations

• LO.FirstOrder.Language.instEncodableFuncEqual k = IsEmpty.toEncodable

inductive LO.FirstOrder.Language.ORing.Func : ℕ → Type

Imported declaration from the Incompleteness formalization.

• zero : Func 0
• one : Func 0
• add : Func 2
• mul : Func 2

inductive LO.FirstOrder.Language.ORing.Rel : ℕ → Type

Imported declaration from the Incompleteness formalization.

• eq : Rel 2
• lt : Rel 2

@[reducible]

def LO.FirstOrder.Language.oRing : Language

Imported declaration from the Incompleteness formalization.

Equations

• ℒₒᵣ = { Func := LO.FirstOrder.Language.ORing.Func, Rel := LO.FirstOrder.Language.ORing.Rel }

def LO.FirstOrder.Language.termℒₒᵣ : Lean.ParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.termℒₒᵣ = Lean.ParserDescr.node `LO.FirstOrder.Language.termℒₒᵣ 1024 (Lean.ParserDescr.symbol "ℒₒᵣ")

@[implicit_reducible]

instance LO.FirstOrder.Language.ORing.instToStringFuncORing (k : ℕ) : ToString (ℒₒᵣ.Func k)

Equations

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

@[implicit_reducible]

instance LO.FirstOrder.Language.ORing.instToStringRelORing (k : ℕ) : ToString (ℒₒᵣ.Rel k)

Equations

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

@[implicit_reducible]

instance LO.FirstOrder.Language.ORing.instDecidableEqFuncORing (k : ℕ) : DecidableEq (ℒₒᵣ.Func k)

Equations

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

@[implicit_reducible]

instance LO.FirstOrder.Language.ORing.instDecidableEqRelORing (k : ℕ) : DecidableEq (ℒₒᵣ.Rel k)

Equations

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

@[implicit_reducible]

instance LO.FirstOrder.Language.ORing.instEncodableFuncORing (k : ℕ) : Encodable (ℒₒᵣ.Func k)

Equations

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

instance LO.FirstOrder.Language.ORing.Func1IsEmpty : IsEmpty (ℒₒᵣ.Func 1)

theorem LO.FirstOrder.Language.ORing.FuncGe3IsEmpty (k : ℕ) : k ≥ 3 → IsEmpty (ℒₒᵣ.Func k)

Imported declaration from the Incompleteness formalization.

@[implicit_reducible]

instance LO.FirstOrder.Language.ORing.instEncodableRelORing (k : ℕ) : Encodable (ℒₒᵣ.Rel k)

Equations

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

def LO.FirstOrder.Language.ORing.funcEquivFinFour : (k : ℕ) × ℒₒᵣ.Func k ≃ Fin 4

Imported declaration from the Incompleteness formalization.

Equations

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

def LO.FirstOrder.Language.ORing.relEquivFinTwo : (k : ℕ) × ℒₒᵣ.Rel k ≃ Fin 2

Imported declaration from the Incompleteness formalization.

Equations

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

inductive LO.FirstOrder.Language.Constant.Func (C : Type u_1) : ℕ → Type u_1

Imported declaration from the Incompleteness formalization.

• const {C : Type u_1} (c : C) : Func C 0

def LO.FirstOrder.Language.constLang (C : Type u_1) : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.constLang C = { Func := LO.FirstOrder.Language.Constant.Func C, Rel := fun (x : ℕ) => PEmpty.{?u.1 + 1} }

@[implicit_reducible]

instance LO.FirstOrder.Language.instCoeFuncConstLangOfNatNat (C : Type u_1) : Coe C ((constLang C).Func 0)

Equations

• LO.FirstOrder.Language.instCoeFuncConstLangOfNatNat C = { coe := LO.FirstOrder.Language.Constant.Func.const }

instance LO.FirstOrder.Language.instIsConstantConstLang (C : Type u_1) : (constLang C).IsConstant

@[reducible, inline]

abbrev LO.FirstOrder.Language.unit : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.unit = LO.FirstOrder.Language.constLang PUnit.{?u.1 + 1}

def LO.FirstOrder.Language.ofFunc (F : ℕ → Type v) : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.ofFunc F = { Func := F, Rel := fun (x : ℕ) => PEmpty.{?u.1 + 1} }

def LO.FirstOrder.Language.add (L₁ : Language) (L₂ : Language) : Language

Imported declaration from the Incompleteness formalization.

Equations

• L₁.add L₂ = { Func := fun (k : ℕ) => L₁.Func k ⊕ L₂.Func k, Rel := fun (k : ℕ) => L₁.Rel k ⊕ L₂.Rel k }

@[implicit_reducible]

instance LO.FirstOrder.Language.instAdd : Add Language

Equations

• LO.FirstOrder.Language.instAdd = { add := LO.FirstOrder.Language.add }

def LO.FirstOrder.Language.sigma {ι : Type u_1} (L : ι → Language) : Language

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.sigma L = { Func := fun (k : ℕ) => (i : ι) × (L i).Func k, Rel := fun (k : ℕ) => (i : ι) × (L i).Rel k }

class LO.FirstOrder.Language.Eq (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• eq : L.Rel 2

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.LT (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• lt : L.Rel 2

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.Zero (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• zero : L.Func 0

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.One (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• one : L.Func 0

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.Add (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• add : L.Func 2

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.Mul (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• mul : L.Func 2

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.Pow (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• pow : L.Func 2

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.Exp (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• exp : L.Func 1

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.Pairing (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• pair : L.Func 2

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.Star (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• star : L.Func 0

  Imported declaration from the Incompleteness formalization.

class LO.FirstOrder.Language.ORing (L : Language) extends L.Eq, L.LT, L.Zero, L.One, L.Add, L.Mul : Type u_1

Imported declaration from the Incompleteness formalization.

• eq : L.Rel 2
• lt : L.Rel 2
• zero : L.Func 0
• one : L.Func 0
• add : L.Func 2
• mul : L.Func 2

@[implicit_reducible]

instance LO.FirstOrder.Language.instORingORing : ℒₒᵣ.ORing

Equations

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

@[implicit_reducible]

instance LO.FirstOrder.Language.instConstantInhabitedORing : ℒₒᵣ.ConstantInhabited

Equations

• LO.FirstOrder.Language.instConstantInhabitedORing = { default := LO.FirstOrder.Language.Zero.zero }

@[implicit_reducible]

instance LO.FirstOrder.Language.instStarUnit : unit.Star

Equations

• LO.FirstOrder.Language.instStarUnit = { star := LO.FirstOrder.Language.Constant.Func.const () }

@[implicit_reducible]

instance LO.FirstOrder.Language.instStarAdd (L : Language) (S : Language) [S.Star] : (L.add S).Star

Equations

• L.instStarAdd S = { star := Sum.inr LO.FirstOrder.Language.Star.star }

@[implicit_reducible]

instance LO.FirstOrder.Language.instZeroAdd (L : Language) (S : Language) [L.Zero] : (L.add S).Zero

Equations

• L.instZeroAdd S = { zero := Sum.inl LO.FirstOrder.Language.Zero.zero }

@[implicit_reducible]

instance LO.FirstOrder.Language.instOneAdd (L : Language) (S : Language) [L.One] : (L.add S).One

Equations

• L.instOneAdd S = { one := Sum.inl LO.FirstOrder.Language.One.one }

@[implicit_reducible]

instance LO.FirstOrder.Language.instAddAdd (L : Language) (S : Language) [L.Add] : (L.add S).Add

Equations

• L.instAddAdd S = { add := Sum.inl LO.FirstOrder.Language.Add.add }

@[implicit_reducible]

instance LO.FirstOrder.Language.instMulAdd (L : Language) (S : Language) [L.Mul] : (L.add S).Mul

Equations

• L.instMulAdd S = { mul := Sum.inl LO.FirstOrder.Language.Mul.mul }

@[implicit_reducible]

instance LO.FirstOrder.Language.instEqAdd (L : Language) (S : Language) [L.Eq] : (L.add S).Eq

Equations

• L.instEqAdd S = { eq := Sum.inl LO.FirstOrder.Language.Eq.eq }

@[implicit_reducible]

instance LO.FirstOrder.Language.instLTAdd (L : Language) (S : Language) [L.LT] : (L.add S).LT

Equations

• L.instLTAdd S = { lt := Sum.inl LO.FirstOrder.Language.LT.lt }

structure LO.FirstOrder.Language.Hom (L₁ : Language) (L₂ : Language) : Type (max u_1 u_2)

Imported declaration from the Incompleteness formalization.

• func {k : ℕ} : L₁.Func k → L₂.Func k

  Imported declaration from the Incompleteness formalization.

• rel {k : ℕ} : L₁.Rel k → L₂.Rel k

  Imported declaration from the Incompleteness formalization.

theorem LO.FirstOrder.Language.Hom.ext {L₁ : Language} {L₂ : Language} {x y : L₁.Hom L₂} (func : @func L₁ L₂ x = @func L₁ L₂ y) (rel : @rel L₁ L₂ x = @rel L₁ L₂ y) : x = y

theorem LO.FirstOrder.Language.Hom.ext_iff {L₁ : Language} {L₂ : Language} {x y : L₁.Hom L₂} : x = y ↔ @func L₁ L₂ x = @func L₁ L₂ y ∧ @rel L₁ L₂ x = @rel L₁ L₂ y

def LO.FirstOrder.«term_→ᵥ_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.«term_→ᵥ_» = Lean.ParserDescr.trailingNode `LO.FirstOrder.«term_→ᵥ_» 25 26 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " →ᵥ ") (Lean.ParserDescr.cat `term 26))

def LO.FirstOrder.Language.Hom.id (L : Language) : L.Hom L

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.Hom.id L = { func := fun {k : ℕ} => id, rel := fun {k : ℕ} => id }

def LO.FirstOrder.Language.Hom.comp {L₁ : Language} {L₂ : Language} {L₃ : Language} (Ψ : L₂.Hom L₃) (Φ : L₁.Hom L₂) : L₁.Hom L₃

Imported declaration from the Incompleteness formalization.

Equations

• Ψ.comp Φ = { func := fun {k : ℕ} => Ψ.func ∘ Φ.func, rel := fun {k : ℕ} => Ψ.rel ∘ Φ.rel }

def LO.FirstOrder.Language.Hom.add₁ (L₁ : Language) (L₂ : Language) : L₁.Hom (L₁.add L₂)

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.Hom.add₁ L₁ L₂ = { func := fun {k : ℕ} => Sum.inl, rel := fun {k : ℕ} => Sum.inl }

def LO.FirstOrder.Language.Hom.add₂ (L₁ : Language) (L₂ : Language) : L₂.Hom (L₁.add L₂)

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.Hom.add₂ L₁ L₂ = { func := fun {k : ℕ} => Sum.inr, rel := fun {k : ℕ} => Sum.inr }

theorem LO.FirstOrder.Language.Hom.func_add₁ {k : ℕ} (L₁ : Language) (L₂ : Language) (f : L₁.Func k) : (add₁ L₁ L₂).func f = Sum.inl f

Imported declaration from the Incompleteness formalization.

theorem LO.FirstOrder.Language.Hom.rel_add₁ {k : ℕ} (L₁ : Language) (L₂ : Language) (r : L₁.Rel k) : (add₁ L₁ L₂).rel r = Sum.inl r

theorem LO.FirstOrder.Language.Hom.func_add₂ {k : ℕ} (L₁ : Language) (L₂ : Language) (f : L₂.Func k) : (add₂ L₁ L₂).func f = Sum.inr f

theorem LO.FirstOrder.Language.Hom.rel_add₂ {k : ℕ} (L₁ : Language) (L₂ : Language) (r : L₂.Rel k) : (add₂ L₁ L₂).rel r = Sum.inr r

@[simp]

theorem LO.FirstOrder.Language.Hom.add₂_star (L₁ : Language) (L₂ : Language) [L₂.Star] : (add₂ L₁ L₂).func Star.star = Star.star

@[simp]

theorem LO.FirstOrder.Language.Hom.add₁_zero (L₁ : Language) (L₂ : Language) [L₁.Zero] : (add₁ L₁ L₂).func Zero.zero = Zero.zero

@[simp]

theorem LO.FirstOrder.Language.Hom.add₁_one (L₁ : Language) (L₂ : Language) [L₁.One] : (add₁ L₁ L₂).func One.one = One.one

@[simp]

theorem LO.FirstOrder.Language.Hom.add₁_add (L₁ : Language) (L₂ : Language) [L₁.Add] : (add₁ L₁ L₂).func Add.add = Add.add

@[simp]

theorem LO.FirstOrder.Language.Hom.add₁_mul (L₁ : Language) (L₂ : Language) [L₁.Mul] : (add₁ L₁ L₂).func Mul.mul = Mul.mul

@[simp]

theorem LO.FirstOrder.Language.Hom.add₁_eq (L₁ : Language) (L₂ : Language) [L₁.Eq] : (add₁ L₁ L₂).rel Eq.eq = Eq.eq

@[simp]

theorem LO.FirstOrder.Language.Hom.add₁_lt (L₁ : Language) (L₂ : Language) [L₁.LT] : (add₁ L₁ L₂).rel LT.lt = LT.lt

def LO.FirstOrder.Language.Hom.sigma {ι : Type u_1} (L : ι → Language) (i : ι) : (L i).Hom (Language.sigma L)

Imported declaration from the Incompleteness formalization.

Equations

• LO.FirstOrder.Language.Hom.sigma L i = { func := fun {k : ℕ} (f : (L i).Func k) => ⟨i, f⟩, rel := fun {k : ℕ} (r : (L i).Rel k) => ⟨i, r⟩ }

theorem LO.FirstOrder.Language.Hom.func_sigma {ι : Type u_1} {k : ℕ} (L : ι → Language) (i : ι) (f : (L i).Func k) : (sigma L i).func f = ⟨i, f⟩

theorem LO.FirstOrder.Language.Hom.rel_sigma {ι : Type u_1} {k : ℕ} (L : ι → Language) (i : ι) (r : (L i).Rel k) : (sigma L i).rel r = ⟨i, r⟩

def LO.FirstOrder.Language.ORing.embedding (L : Language) [L.ORing] : ℒₒᵣ.Hom L

Imported declaration from the Incompleteness formalization.

Equations

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

class LO.FirstOrder.Language.DecidableEq (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• func (k : ℕ) : DecidableEq (L.Func k)

  Imported declaration from the Incompleteness formalization.

• rel (k : ℕ) : DecidableEq (L.Rel k)

  Imported declaration from the Incompleteness formalization.

@[implicit_reducible]

instance LO.FirstOrder.instDecidableEqOfFuncOfDecidableEqRel (L : Language) [(k : ℕ) → DecidableEq (L.Func k)] [(k : ℕ) → DecidableEq (L.Rel k)] : L.DecidableEq

Equations

• LO.FirstOrder.instDecidableEqOfFuncOfDecidableEqRel L = { func := fun (x : ℕ) => inferInstance, rel := fun (x : ℕ) => inferInstance }

@[implicit_reducible]

instance LO.FirstOrder.instDecidableEqFuncOfDecidableEq (L : Language) [L.DecidableEq] (k : ℕ) : DecidableEq (L.Func k)

Equations

• LO.FirstOrder.instDecidableEqFuncOfDecidableEq L k = LO.FirstOrder.Language.DecidableEq.func k

@[implicit_reducible]

instance LO.FirstOrder.instDecidableEqRelOfDecidableEq (L : Language) [L.DecidableEq] (k : ℕ) : DecidableEq (L.Rel k)

Equations

• LO.FirstOrder.instDecidableEqRelOfDecidableEq L k = LO.FirstOrder.Language.DecidableEq.rel k

@[implicit_reducible]

instance LO.FirstOrder.instDecidableEqRelOfDecidableEq_1 (L : Language) [L.DecidableEq] (k : ℕ) : DecidableEq (L.Rel k)

Equations

• LO.FirstOrder.instDecidableEqRelOfDecidableEq_1 L k = LO.FirstOrder.Language.DecidableEq.rel k

class LO.FirstOrder.Language.Finite (L : Language) : Type u_1

Imported declaration from the Incompleteness formalization.

• func : Fintype ((k : ℕ) × L.Func k)

  Imported declaration from the Incompleteness formalization.

• rel : Fintype ((k : ℕ) × L.Rel k)

  Imported declaration from the Incompleteness formalization.

@[implicit_reducible]

instance LO.FirstOrder.instFiniteORing : ℒₒᵣ.Finite

Equations

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