Formulas of first-order logic

This file defines the formulas of first-order logic.

φ : Semiformula L ξ n is a (semi-)formula of language L with bounded variables of Fin n and free variables of ξ. The quantification is represented by de Bruijn index.

inductive FFL.FirstOrder.Semiformula (L : Language) (ξ : Type u_1) : ℕ → Type (max u_1 u_2)

A semiformula of language L. Free variables are of type ξ, and bound variables are implemented as de Bruijn indices, of a type Fin n separate from free variables.

• verum {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ n
• falsum {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ n
• rel {L : Language} {ξ : Type u_1} {n arity : ℕ} : L.Rel arity → (Fin arity → Semiterm L ξ n) → Semiformula L ξ n
• nrel {L : Language} {ξ : Type u_1} {n arity : ℕ} : L.Rel arity → (Fin arity → Semiterm L ξ n) → Semiformula L ξ n
• and {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ n → Semiformula L ξ n → Semiformula L ξ n
• or {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ n → Semiformula L ξ n → Semiformula L ξ n
• all {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ (n + 1) → Semiformula L ξ n
• exs {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ (n + 1) → Semiformula L ξ n

@[reducible, inline]

abbrev FFL.FirstOrder.Formula (L : Language) (ξ : Type u_1) : Type (max u_1 u_2)

Equations

• FFL.FirstOrder.Formula L ξ = FFL.FirstOrder.Semiformula L ξ 0

@[reducible, inline]

abbrev FFL.FirstOrder.Sentence (L : Language) : Type u_1

Equations

• FFL.FirstOrder.Sentence L = FFL.FirstOrder.Formula L Empty

@[reducible, inline]

abbrev FFL.FirstOrder.Semisentence (L : Language) (n : ℕ) : Type u_1

Equations

• FFL.FirstOrder.Semisentence L n = FFL.FirstOrder.Semiformula L Empty n

@[reducible, inline]

abbrev FFL.FirstOrder.Semiproposition (L : Language) (n : ℕ) : Type u_1

Equations

• FFL.FirstOrder.Semiproposition L n = FFL.FirstOrder.Semiformula L ℕ n

@[reducible, inline]

abbrev FFL.FirstOrder.Proposition (L : Language) : Type u_1

Equations

• FFL.FirstOrder.Proposition L = FFL.FirstOrder.Semiproposition L 0

def FFL.FirstOrder.Semiformula.neg {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ n → Semiformula L ξ n

Equations

• FFL.FirstOrder.Semiformula.verum.neg = FFL.FirstOrder.Semiformula.falsum
• FFL.FirstOrder.Semiformula.falsum.neg = FFL.FirstOrder.Semiformula.verum
• (FFL.FirstOrder.Semiformula.rel r v).neg = FFL.FirstOrder.Semiformula.nrel r v
• (FFL.FirstOrder.Semiformula.nrel r v).neg = FFL.FirstOrder.Semiformula.rel r v
• (φ.and ψ).neg = φ.neg.or ψ.neg
• (φ.or ψ).neg = φ.neg.and ψ.neg
• φ.all.neg = φ.neg.exs
• φ.exs.neg = φ.neg.all

theorem FFL.FirstOrder.Semiformula.neg_neg {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ n) : φ.neg.neg = φ

@[instance_reducible]

instance FFL.FirstOrder.Semiformula.instLogicalConnective {L : Language} {ξ : Type u_1} {n : ℕ} : LogicalConnective (Semiformula L ξ n)

Equations

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

@[instance_reducible]

instance FFL.FirstOrder.Semiformula.instLogicalNeutral {L : Language} {ξ : Type u_1} {n : ℕ} : LogicalNeutral (Semiformula L ξ n)

Equations

• FFL.FirstOrder.Semiformula.instLogicalNeutral = { top := FFL.FirstOrder.Semiformula.verum, bot := FFL.FirstOrder.Semiformula.falsum }

instance FFL.FirstOrder.Semiformula.instTildeInvolutive {L : Language} {ξ : Type u_1} {n : ℕ} : TildeInvolutive (Semiformula L ξ n)

instance FFL.FirstOrder.Semiformula.instDeMorgan {L : Language} {ξ : Type u_1} {n : ℕ} : LogicalConnective.DeMorgan (Semiformula L ξ n)

instance FFL.FirstOrder.Semiformula.instDeMorgan_1 {L : Language} {ξ : Type u_1} {n : ℕ} : LogicalNeutral.DeMorgan (Semiformula L ξ n)

@[instance_reducible]

instance FFL.FirstOrder.Semiformula.instQuantifier {L : Language} {ξ : Type u_1} : Quantifier (Semiformula L ξ)

Equations

• FFL.FirstOrder.Semiformula.instQuantifier = { all := fun {n : ℕ} => FFL.FirstOrder.Semiformula.all, exs := fun {n : ℕ} => FFL.FirstOrder.Semiformula.exs }

def FFL.FirstOrder.Semiformula.toStr {L : Language} {ξ : Type u_1} [(k : ℕ) → ToString (L.Func k)] [(k : ℕ) → ToString (L.Rel k)] [ToString ξ] {n : ℕ} : Semiformula L ξ n → String

Equations

• FFL.FirstOrder.Semiformula.verum.toStr = "\\top"
• FFL.FirstOrder.Semiformula.falsum.toStr = "\\bot"
• (FFL.FirstOrder.Semiformula.rel r a).toStr = "{" ++ toString r ++ "}"
• (FFL.FirstOrder.Semiformula.rel r v).toStr = ("{" ++ toString r ++ "} \\left(" ++ String.vecToStr fun (i : Fin (n_1 + 1)) => toString (v i)) ++ "\\right)"
• (FFL.FirstOrder.Semiformula.nrel r a).toStr = "\\lnot {" ++ toString r ++ "}"
• (FFL.FirstOrder.Semiformula.nrel r v).toStr = ("\\lnot {" ++ toString r ++ "} \\left(" ++ String.vecToStr fun (i : Fin (n_1 + 1)) => toString (v i)) ++ "\\right)"
• (φ.and ψ).toStr = "\\left(" ++ φ.toStr ++ " \\land " ++ ψ.toStr ++ "\\right)"
• (φ.or ψ).toStr = "\\left(" ++ φ.toStr ++ " \\lor " ++ ψ.toStr ++ "\\right)"
• φ.all.toStr = "(\\forall x_{" ++ toString n ++ "}) " ++ φ.toStr
• φ.exs.toStr = "(\\exists x_{" ++ toString n ++ "}) " ++ φ.toStr

@[instance_reducible]

instance FFL.FirstOrder.Semiformula.instRepr {L : Language} {ξ : Type u_1} {n : ℕ} [(k : ℕ) → ToString (L.Func k)] [(k : ℕ) → ToString (L.Rel k)] [ToString ξ] : Repr (Semiformula L ξ n)

Equations

• FFL.FirstOrder.Semiformula.instRepr = { reprPrec := fun (t : FFL.FirstOrder.Semiformula L ξ n) (x : ℕ) => Std.Format.text t.toStr }

@[instance_reducible]

instance FFL.FirstOrder.Semiformula.instToString {L : Language} {ξ : Type u_1} {n : ℕ} [(k : ℕ) → ToString (L.Func k)] [(k : ℕ) → ToString (L.Rel k)] [ToString ξ] : ToString (Semiformula L ξ n)

Equations

• FFL.FirstOrder.Semiformula.instToString = { toString := FFL.FirstOrder.Semiformula.toStr }

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_rel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : ∼rel r v = nrel r v

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_nrel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : ∼nrel r v = rel r v

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_all {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : ∼(∀¹ φ) = ∃¹ ∼φ

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_ex {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : ∼(∃¹ φ) = ∀¹ ∼φ

@[reducible, inline]

abbrev FFL.FirstOrder.Semiformula.toPrenex {L : Language} {ξ : Type u_1} {n : ℕ} (Γ : Polarity) (s : ℕ) (φ : Semiformula L ξ (n + s)) : Semiformula L ξ n

φ.toPrenex Γ s prefixes φ with s alternating quantifiers, the outermost one being Γ.

Equations

• FFL.FirstOrder.Semiformula.toPrenex Γ s φ = Γ.quantItr s φ

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_quant {L : Language} {ξ : Type u_1} {n : ℕ} (Γ : Polarity) (φ : Semiformula L ξ (n + 1)) : ∼Γ.quant φ = Γ.alt.quant (∼φ)

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_toPrenex {L : Language} {ξ : Type u_1} {n : ℕ} (Γ : Polarity) (s : ℕ) (φ : Semiformula L ξ (n + s)) : ∼toPrenex Γ s φ = toPrenex Γ.alt s (∼φ)

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_inj {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : ∼φ = ∼ψ ↔ φ = ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_allClosure {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ n) : ∼(∀¹* φ) = ∃¹* ∼φ

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_exsClosure {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ n) : ∼(∃¹* φ) = ∀¹* ∼φ

theorem FFL.FirstOrder.Semiformula.neg_eq {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ n) : ∼φ = φ.neg

theorem FFL.FirstOrder.Semiformula.imp_eq {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : φ 🡒 ψ = ∼φ ⋎ ψ

theorem FFL.FirstOrder.Semiformula.iff_eq {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : φ 🡘 ψ = (∼φ ⋎ ψ) ⋏ (∼ψ ⋎ φ)

theorem FFL.FirstOrder.Semiformula.ball_eq {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ (n + 1)) : (∀¹[φ] ψ) = ∀¹ (φ 🡒 ψ)

theorem FFL.FirstOrder.Semiformula.bexs_eq {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ (n + 1)) : (∃¹[φ] ψ) = ∃¹ φ ⋏ ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_ball {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ (n + 1)) : ∼(∀¹[φ] ψ) = ∃¹[φ] ∼ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.neg_bexs {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ (n + 1)) : ∼(∃¹[φ] ψ) = ∀¹[φ] ∼ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.and_inj {L : Language} {ξ : Type u_1} {n : ℕ} (φ₁ ψ₁ φ₂ ψ₂ : Semiformula L ξ n) : φ₁ ⋏ φ₂ = ψ₁ ⋏ ψ₂ ↔ φ₁ = ψ₁ ∧ φ₂ = ψ₂

@[simp]

theorem FFL.FirstOrder.Semiformula.or_inj {L : Language} {ξ : Type u_1} {n : ℕ} (φ₁ ψ₁ φ₂ ψ₂ : Semiformula L ξ n) : φ₁ ⋎ φ₂ = ψ₁ ⋎ ψ₂ ↔ φ₁ = ψ₁ ∧ φ₂ = ψ₂

@[simp]

theorem FFL.FirstOrder.Semiformula.all_inj {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ (n + 1)) : ∀¹ φ = ∀¹ ψ ↔ φ = ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.exs_inj {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ (n + 1)) : ∃¹ φ = ∃¹ ψ ↔ φ = ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.allClosure_inj {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : ∀¹* φ = ∀¹* ψ ↔ φ = ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.exsClosure_inj {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : ∃¹* φ = ∃¹* ψ ↔ φ = ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.allItr_inj {L : Language} {ξ : Type u_1} {n k : ℕ} (φ ψ : Semiformula L ξ (n + k)) : ∀¹^[k] φ = ∀¹^[k] ψ ↔ φ = ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.exsItr_inj {L : Language} {ξ : Type u_1} {n k : ℕ} (φ ψ : Semiformula L ξ (n + k)) : ∃¹^[k] φ = ∃¹^[k] ψ ↔ φ = ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.imp_inj {L : Language} {ξ : Type u_1} {n : ℕ} {φ₁ φ₂ ψ₁ ψ₂ : Semiformula L ξ n} : φ₁ 🡒 φ₂ = ψ₁ 🡒 ψ₂ ↔ φ₁ = ψ₁ ∧ φ₂ = ψ₂

@[reducible, inline]

abbrev FFL.FirstOrder.Semiformula.rel! {ξ : Type u_1} {n : ℕ} (L : Language) (k : ℕ) (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : Semiformula L ξ n

Equations

• FFL.FirstOrder.Semiformula.rel! L k r v = FFL.FirstOrder.Semiformula.rel r v

@[reducible, inline]

abbrev FFL.FirstOrder.Semiformula.nrel! {ξ : Type u_1} {n : ℕ} (L : Language) (k : ℕ) (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : Semiformula L ξ n

Equations

• FFL.FirstOrder.Semiformula.nrel! L k r v = FFL.FirstOrder.Semiformula.nrel r v

def FFL.FirstOrder.Semiformula.complexity {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ n → ℕ

The complexity of a semiformula, taking max at logical connectives.

Equations

• FFL.FirstOrder.Semiformula.verum.complexity = 0
• FFL.FirstOrder.Semiformula.falsum.complexity = 0
• (FFL.FirstOrder.Semiformula.rel r v).complexity = 0
• (FFL.FirstOrder.Semiformula.nrel r v).complexity = 0
• (φ.and ψ).complexity = max φ.complexity ψ.complexity + 1
• (φ.or ψ).complexity = max φ.complexity ψ.complexity + 1
• φ.all.complexity = φ.complexity + 1
• φ.exs.complexity = φ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_top {L : Language} {ξ : Type u_1} {n : ℕ} : ⊤.complexity = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_bot {L : Language} {ξ : Type u_1} {n : ℕ} : ⊥.complexity = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_rel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (rel r v).complexity = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_nrel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (nrel r v).complexity = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_and {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ ⋏ ψ).complexity = max φ.complexity ψ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_and' {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ.and ψ).complexity = max φ.complexity ψ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_or {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ ⋎ ψ).complexity = max φ.complexity ψ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_or' {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ.or ψ).complexity = max φ.complexity ψ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_all {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : (∀¹ φ).complexity = φ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_all' {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : φ.all.complexity = φ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_exs {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : (∃¹ φ).complexity = φ.complexity + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_exs' {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : φ.exs.complexity = φ.complexity + 1

def FFL.FirstOrder.Semiformula.cases' {L : Language} {ξ : Type u_1} {C : (n : ℕ) → Semiformula L ξ n → Sort w} (hverum : {n : ℕ} → C n ⊤) (hfalsum : {n : ℕ} → C n ⊥) (hrel : {n k : ℕ} → (r : L.Rel k) → (v : Fin k → Semiterm L ξ n) → C n (rel r v)) (hnrel : {n k : ℕ} → (r : L.Rel k) → (v : Fin k → Semiterm L ξ n) → C n (nrel r v)) (hand : {n : ℕ} → (φ ψ : Semiformula L ξ n) → C n (φ ⋏ ψ)) (hor : {n : ℕ} → (φ ψ : Semiformula L ξ n) → C n (φ ⋎ ψ)) (hall : {n : ℕ} → (φ : Semiformula L ξ (n + 1)) → C n (∀¹ φ)) (hexs : {n : ℕ} → (φ : Semiformula L ξ (n + 1)) → C n (∃¹ φ)) {n : ℕ} (φ : Semiformula L ξ n) : C n φ

Equations

• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs FFL.FirstOrder.Semiformula.verum = hverum
• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs FFL.FirstOrder.Semiformula.falsum = hfalsum
• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs (FFL.FirstOrder.Semiformula.rel r v) = hrel r v
• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs (FFL.FirstOrder.Semiformula.nrel r v) = hnrel r v
• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs (φ.and ψ) = hand φ ψ
• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs (φ.or ψ) = hor φ ψ
• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs φ.all = hall φ
• FFL.FirstOrder.Semiformula.cases' hverum hfalsum hrel hnrel hand hor hall hexs φ.exs = hexs φ

def FFL.FirstOrder.Semiformula.rec' {L : Language} {ξ : Type u_1} {C : (n : ℕ) → Semiformula L ξ n → Sort w} (hverum : {n : ℕ} → C n ⊤) (hfalsum : {n : ℕ} → C n ⊥) (hrel : {n k : ℕ} → (r : L.Rel k) → (v : Fin k → Semiterm L ξ n) → C n (rel r v)) (hnrel : {n k : ℕ} → (r : L.Rel k) → (v : Fin k → Semiterm L ξ n) → C n (nrel r v)) (hand : {n : ℕ} → (φ ψ : Semiformula L ξ n) → C n φ → C n ψ → C n (φ ⋏ ψ)) (hor : {n : ℕ} → (φ ψ : Semiformula L ξ n) → C n φ → C n ψ → C n (φ ⋎ ψ)) (hall : {n : ℕ} → (φ : Semiformula L ξ (n + 1)) → C (n + 1) φ → C n (∀¹ φ)) (hexs : {n : ℕ} → (φ : Semiformula L ξ (n + 1)) → C (n + 1) φ → C n (∃¹ φ)) {n : ℕ} (φ : Semiformula L ξ n) : C n φ

Equations

• One or more equations did not get rendered due to their size.
• FFL.FirstOrder.Semiformula.rec' hverum hfalsum hrel hnrel hand hor hall hexs FFL.FirstOrder.Semiformula.verum = hverum
• FFL.FirstOrder.Semiformula.rec' hverum hfalsum hrel hnrel hand hor hall hexs FFL.FirstOrder.Semiformula.falsum = hfalsum
• FFL.FirstOrder.Semiformula.rec' hverum hfalsum hrel hnrel hand hor hall hexs (FFL.FirstOrder.Semiformula.rel r v) = hrel r v
• FFL.FirstOrder.Semiformula.rec' hverum hfalsum hrel hnrel hand hor hall hexs (FFL.FirstOrder.Semiformula.nrel r v) = hnrel r v

@[simp]

theorem FFL.FirstOrder.Semiformula.complexity_neg {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ n) : (∼φ).complexity = φ.complexity

def FFL.FirstOrder.Semiformula.hasDecEq {L : Language} {ξ : Type u_1} [L.DecidableEq] [DecidableEq ξ] {n : ℕ} (φ ψ : Semiformula L ξ n) : Decidable (φ = ψ)

Equations

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

@[instance_reducible]

instance FFL.FirstOrder.Semiformula.instDecidableEq {L : Language} {ξ : Type u_1} {n : ℕ} [L.DecidableEq] [DecidableEq ξ] : DecidableEq (Semiformula L ξ n)

Equations

• FFL.FirstOrder.Semiformula.instDecidableEq = FFL.FirstOrder.Semiformula.hasDecEq

Quantifier rank

def FFL.FirstOrder.Semiformula.qr {L : Language} {ξ : Type u_1} {n : ℕ} : Semiformula L ξ n → ℕ

Equations

• FFL.FirstOrder.Semiformula.verum.qr = 0
• FFL.FirstOrder.Semiformula.falsum.qr = 0
• (FFL.FirstOrder.Semiformula.rel r v).qr = 0
• (FFL.FirstOrder.Semiformula.nrel r v).qr = 0
• (φ.and ψ).qr = max φ.qr ψ.qr
• (φ.or ψ).qr = max φ.qr ψ.qr
• φ.all.qr = φ.qr + 1
• φ.exs.qr = φ.qr + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_top {L : Language} {ξ : Type u_1} {n : ℕ} : ⊤.qr = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_bot {L : Language} {ξ : Type u_1} {n : ℕ} : ⊥.qr = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_rel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (rel r v).qr = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_nrel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (nrel r v).qr = 0

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_and {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ ⋏ ψ).qr = max φ.qr ψ.qr

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_or {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ ⋎ ψ).qr = max φ.qr ψ.qr

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_all {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : (∀¹ φ).qr = φ.qr + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_exs {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ (n + 1)) : (∃¹ φ).qr = φ.qr + 1

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_neg {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ n) : (∼φ).qr = φ.qr

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_imply {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ 🡒 ψ).qr = max φ.qr ψ.qr

@[simp]

theorem FFL.FirstOrder.Semiformula.qr_iff {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : (φ 🡘 ψ).qr = max φ.qr ψ.qr

Open (Semi-)Formula

def FFL.FirstOrder.Semiformula.Open {L : Language} {ξ : Type u_1} {n : ℕ} (φ : Semiformula L ξ n) : Prop

Equations

• φ.Open = (φ.qr = 0)

@[simp]

theorem FFL.FirstOrder.Semiformula.open_top {L : Language} {ξ : Type u_1} {n : ℕ} : ⊤.Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_bot {L : Language} {ξ : Type u_1} {n : ℕ} : ⊥.Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_rel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (rel r v).Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_nrel {L : Language} {ξ : Type u_1} {n k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (nrel r v).Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_and {L : Language} {ξ : Type u_1} {n : ℕ} {φ ψ : Semiformula L ξ n} : (φ ⋏ ψ).Open ↔ φ.Open ∧ ψ.Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_or {L : Language} {ξ : Type u_1} {n : ℕ} {φ ψ : Semiformula L ξ n} : (φ ⋎ ψ).Open ↔ φ.Open ∧ ψ.Open

@[simp]

theorem FFL.FirstOrder.Semiformula.not_open_all {L : Language} {ξ : Type u_1} {n : ℕ} {φ : Semiformula L ξ (n + 1)} : ¬(∀¹ φ).Open

@[simp]

theorem FFL.FirstOrder.Semiformula.not_open_exs {L : Language} {ξ : Type u_1} {n : ℕ} {φ : Semiformula L ξ (n + 1)} : ¬(∃¹ φ).Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_neg {L : Language} {ξ : Type u_1} {n : ℕ} {φ : Semiformula L ξ n} : (∼φ).Open ↔ φ.Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_imply {L : Language} {ξ : Type u_1} {n : ℕ} {φ ψ : Semiformula L ξ n} : (φ 🡒 ψ).Open ↔ φ.Open ∧ ψ.Open

@[simp]

theorem FFL.FirstOrder.Semiformula.open_iff {L : Language} {ξ : Type u_1} {n : ℕ} {φ ψ : Semiformula L ξ n} : (φ 🡘 ψ).Open ↔ φ.Open ∧ ψ.Open

Free Variables

def FFL.FirstOrder.Semiformula.freeVariables {L : Language} {ξ : Type u_1} [DecidableEq ξ] {n : ℕ} : Semiformula L ξ n → Finset ξ

Equations

• (FFL.FirstOrder.Semiformula.rel a v).freeVariables = Finset.univ.biUnion fun (i : Fin arity) => (v i).freeVariables
• (FFL.FirstOrder.Semiformula.nrel a v).freeVariables = Finset.univ.biUnion fun (i : Fin arity) => (v i).freeVariables
• FFL.FirstOrder.Semiformula.verum.freeVariables = ∅
• FFL.FirstOrder.Semiformula.falsum.freeVariables = ∅
• (φ.and ψ).freeVariables = φ.freeVariables ∪ ψ.freeVariables
• (φ.or ψ).freeVariables = φ.freeVariables ∪ ψ.freeVariables
• φ.all.freeVariables = φ.freeVariables
• φ.exs.freeVariables = φ.freeVariables

theorem FFL.FirstOrder.Semiformula.freeVariables_rel {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] {k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (rel r v).freeVariables = Finset.univ.biUnion fun (i : Fin k) => (v i).freeVariables

theorem FFL.FirstOrder.Semiformula.freeVariables_nrel {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] {k : ℕ} (r : L.Rel k) (v : Fin k → Semiterm L ξ n) : (nrel r v).freeVariables = Finset.univ.biUnion fun (i : Fin k) => (v i).freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_verum {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] : ⊤.freeVariables = ∅

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_falsum {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] : ⊥.freeVariables = ∅

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_and {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ ψ : Semiformula L ξ n) : (φ ⋏ ψ).freeVariables = φ.freeVariables ∪ ψ.freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_or {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ ψ : Semiformula L ξ n) : (φ ⋎ ψ).freeVariables = φ.freeVariables ∪ ψ.freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_all {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ : Semiformula L ξ (n + 1)) : (∀¹ φ).freeVariables = φ.freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_exs {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ : Semiformula L ξ (n + 1)) : (∃¹ φ).freeVariables = φ.freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_not {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ : Semiformula L ξ n) : (∼φ).freeVariables = φ.freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_imp {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ ψ : Semiformula L ξ n) : (φ 🡒 ψ).freeVariables = φ.freeVariables ∪ ψ.freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_allClosure {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ : Semiformula L ξ n) : (∀¹* φ).freeVariables = φ.freeVariables

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_sentence {L : Language} {n : ℕ} {ο : Type u_5} [IsEmpty ο] (φ : Semiformula L ο n) : φ.freeVariables = ∅

@[reducible, inline]

abbrev FFL.FirstOrder.Semiformula.FVar? {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (φ : Semiformula L ξ n) (x : ξ) : Prop

Equations

• φ.FVar? x = (x ∈ φ.freeVariables)

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_rel {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] {x : ξ} {k : ℕ} {R : L.Rel k} {v : Fin k → Semiterm L ξ n} : (rel R v).FVar? x ↔ ∃ (i : Fin k), (v i).FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_nrel {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] {x : ξ} {k : ℕ} {R : L.Rel k} {v : Fin k → Semiterm L ξ n} : (nrel R v).FVar? x ↔ ∃ (i : Fin k), (v i).FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_top {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (x : ξ) : ¬⊤.FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_falsum {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (x : ξ) : ¬⊥.FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_and {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (x : ξ) (φ ψ : Semiformula L ξ n) : (φ ⋏ ψ).FVar? x ↔ φ.FVar? x ∨ ψ.FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_or {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (x : ξ) (φ ψ : Semiformula L ξ n) : (φ ⋎ ψ).FVar? x ↔ φ.FVar? x ∨ ψ.FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_all {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (x : ξ) (φ : Semiformula L ξ (n + 1)) : (∀¹ φ).FVar? x ↔ φ.FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_exs {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (x : ξ) (φ : Semiformula L ξ (n + 1)) : (∃¹ φ).FVar? x ↔ φ.FVar? x

@[simp]

theorem FFL.FirstOrder.Semiformula.fvar?_allClosure {L : Language} {ξ : Type u_1} {n : ℕ} [DecidableEq ξ] (x : ξ) (φ : Semiformula L ξ n) : (∀¹* φ).FVar? x ↔ φ.FVar? x

def FFL.FirstOrder.Semiformula.fvSup {L : Language} {n : ℕ} (φ : Semiproposition L n) : ℕ

Equations

• FFL.FirstOrder.Semiformula.fvSup φ = WithBot.recBotCoe 0 Nat.succ (FFL.FirstOrder.Semiformula.freeVariables φ).max

theorem FFL.FirstOrder.Semiformula.lt_fvSup_of_fvar? {L : Language} {n m : ℕ} {φ : Semiproposition L n} : FVar? φ m → m < fvSup φ

theorem FFL.FirstOrder.Semiformula.not_fvar?_of_lt_fvSup {L : Language} {n m : ℕ} (φ : Semiproposition L n) (h : fvSup φ ≤ m) : ¬FVar? φ m

@[simp]

theorem FFL.FirstOrder.Semiformula.not_fvar?_fvSup {L : Language} {n : ℕ} (φ : Semiproposition L n) : ¬FVar? φ (fvSup φ)

theorem FFL.FirstOrder.Semiformula.List.maximam?_some_of_not_nil {α : Type u_5} [LinearOrder α] {l : List α} (h : l ≠ []) : l.max?.isSome = true

theorem FFL.FirstOrder.Semiformula.List.maximam?_eq_some {α : Type u_5} [LinearOrder α] [Std.LawfulOrderSup α] {l : List α} {a : α} (h : l.max? = some a) (x : α) : x ∈ l → x ≤ a

theorem FFL.FirstOrder.Semiformula.ne_of_ne_complexity {L : Language} {ξ : Type u_1} {n : ℕ} {φ ψ : Semiformula L ξ n} (h : φ.complexity ≠ ψ.complexity) : φ ≠ ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.ne_or_left {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : φ ≠ φ ⋎ ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.ne_or_right {L : Language} {ξ : Type u_1} {n : ℕ} (φ ψ : Semiformula L ξ n) : ψ ≠ φ ⋎ ψ

def FFL.FirstOrder.Semiformula.lMapAux {L₁ : Language} {L₂ : Language} {ξ : Type u_5} (Φ : L₁.Hom L₂) {n : ℕ} : Semiformula L₁ ξ n → Semiformula L₂ ξ n

Equations

• FFL.FirstOrder.Semiformula.lMapAux Φ FFL.FirstOrder.Semiformula.verum = ⊤
• FFL.FirstOrder.Semiformula.lMapAux Φ FFL.FirstOrder.Semiformula.falsum = ⊥
• FFL.FirstOrder.Semiformula.lMapAux Φ (FFL.FirstOrder.Semiformula.rel r v) = FFL.FirstOrder.Semiformula.rel (Φ.rel r) (FFL.FirstOrder.Semiterm.lMap Φ ∘ v)
• FFL.FirstOrder.Semiformula.lMapAux Φ (FFL.FirstOrder.Semiformula.nrel r v) = FFL.FirstOrder.Semiformula.nrel (Φ.rel r) (FFL.FirstOrder.Semiterm.lMap Φ ∘ v)
• FFL.FirstOrder.Semiformula.lMapAux Φ (φ.and ψ) = FFL.FirstOrder.Semiformula.lMapAux Φ φ ⋏ FFL.FirstOrder.Semiformula.lMapAux Φ ψ
• FFL.FirstOrder.Semiformula.lMapAux Φ (φ.or ψ) = FFL.FirstOrder.Semiformula.lMapAux Φ φ ⋎ FFL.FirstOrder.Semiformula.lMapAux Φ ψ
• FFL.FirstOrder.Semiformula.lMapAux Φ φ.all = ∀¹ FFL.FirstOrder.Semiformula.lMapAux Φ φ
• FFL.FirstOrder.Semiformula.lMapAux Φ φ.exs = ∃¹ FFL.FirstOrder.Semiformula.lMapAux Φ φ

theorem FFL.FirstOrder.Semiformula.lMapAux_neg {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} {n : ℕ} (φ : Semiformula L₁ ξ n) : lMapAux Φ (∼φ) = ∼lMapAux Φ φ

def FFL.FirstOrder.Semiformula.lMap {L₁ : Language} {L₂ : Language} {ξ : Type u_5} (Φ : L₁.Hom L₂) {n : ℕ} : Semiformula L₁ ξ n →ˡᶜ Semiformula L₂ ξ n

The map on semiformulas induced by a homomorphism between languages.

Equations

• FFL.FirstOrder.Semiformula.lMap Φ = { toTr := FFL.FirstOrder.Semiformula.lMapAux Φ, map_top' := ⋯, map_bot' := ⋯, map_neg' := ⋯, map_imply' := ⋯, map_and' := ⋯, map_or' := ⋯ }

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_rel {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} {k : ℕ} (r : L₁.Rel k) (v : Fin k → Semiterm L₁ ξ n) : (lMap Φ) (rel r v) = rel (Φ.rel r) (Semiterm.lMap Φ ∘ v)

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_nrel {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} {k : ℕ} (r : L₁.Rel k) (v : Fin k → Semiterm L₁ ξ n) : (lMap Φ) (nrel r v) = nrel (Φ.rel r) (Semiterm.lMap Φ ∘ v)

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_all {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} (φ : Semiformula L₁ ξ (n + 1)) : (lMap Φ) (∀¹ φ) = ∀¹ (lMap Φ) φ

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_exs {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} (φ : Semiformula L₁ ξ (n + 1)) : (lMap Φ) (∃¹ φ) = ∃¹ (lMap Φ) φ

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_ball {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} (φ ψ : Semiformula L₁ ξ (n + 1)) : (lMap Φ) (∀¹[φ] ψ) = ∀¹[(lMap Φ) φ] (lMap Φ) ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_bexs {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} (φ ψ : Semiformula L₁ ξ (n + 1)) : (lMap Φ) (∃¹[φ] ψ) = ∃¹[(lMap Φ) φ] (lMap Φ) ψ

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_allClosure {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} (φ : Semiformula L₁ ξ n) : (lMap Φ) (∀¹* φ) = ∀¹* (lMap Φ) φ

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_exsClosure {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} (φ : Semiformula L₁ ξ n) : (lMap Φ) (∃¹* φ) = ∃¹* (lMap Φ) φ

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_allItr {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} {k : ℕ} (φ : Semiformula L₁ ξ (n + k)) : (lMap Φ) (∀¹^[k] φ) = ∀¹^[k] (lMap Φ) φ

@[simp]

theorem FFL.FirstOrder.Semiformula.lMap_exsItr {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} {Φ : L₁.Hom L₂} {k : ℕ} (φ : Semiformula L₁ ξ (n + k)) : (lMap Φ) (∃¹^[k] φ) = ∃¹^[k] (lMap Φ) φ

@[simp]

theorem FFL.FirstOrder.Semiformula.freeVariables_lMap {n : ℕ} {L₁ : Language} {L₂ : Language} {ξ : Type u_5} [DecidableEq ξ] (Φ : L₁.Hom L₂) (φ : Semiformula L₁ ξ n) : ((lMap Φ) φ).freeVariables = φ.freeVariables

def FFL.FirstOrder.Semiformula.fvarList {L : Language} {ξ : Type u_5} {n : ℕ} : Semiformula L ξ n → List ξ

Equations

• FFL.FirstOrder.Semiformula.verum.fvarList = []
• FFL.FirstOrder.Semiformula.falsum.fvarList = []
• (FFL.FirstOrder.Semiformula.rel r v).fvarList = (Matrix.toList fun (i : Fin arity) => (v i).fvarList).flatten
• (FFL.FirstOrder.Semiformula.nrel r v).fvarList = (Matrix.toList fun (i : Fin arity) => (v i).fvarList).flatten
• (φ.and ψ).fvarList = φ.fvarList ++ ψ.fvarList
• (φ.or ψ).fvarList = φ.fvarList ++ ψ.fvarList
• φ.all.fvarList = φ.fvarList
• φ.exs.fvarList = φ.fvarList

def FFL.FirstOrder.Semiformula.idxOfFVar {n : ℕ} {L : Language} {ξ : Type u_5} [DecidableEq ξ] (φ : Semiformula L ξ n) : ξ → ℕ

Equations

• φ.idxOfFVar a = List.idxOf a φ.fvarList

def FFL.FirstOrder.Semiformula.enumerateFVar {n : ℕ} {L : Language} {ξ : Type u_5} [Inhabited ξ] (φ : Semiformula L ξ n) : ℕ → ξ

Equations

• φ.enumerateFVar i = if hi : i < φ.fvarList.length then φ.fvarList.get ⟨i, hi⟩ else default

theorem FFL.FirstOrder.Semiformula.enumerateFVar_idxOfFVar {n : ℕ} {L : Language} {ξ : Type u_5} [DecidableEq ξ] [Inhabited ξ] {φ : Semiformula L ξ n} {x : ξ} (hx : x ∈ φ.fvarList) : φ.enumerateFVar (φ.idxOfFVar x) = x

theorem FFL.FirstOrder.Semiformula.mem_fvarList_iff_fvar? {n : ℕ} {L : Language} {ξ : Type u_5} {x : ξ} [DecidableEq ξ] {φ : Semiformula L ξ n} : x ∈ φ.fvarList ↔ φ.FVar? x

@[reducible, inline]

abbrev FFL.FirstOrder.Theory (L : Language) : Type u_1

Equations

• FFL.FirstOrder.Theory L = Set (FFL.FirstOrder.Sentence L)

def FFL.FirstOrder.Theory.lMap {L₁ : Language} {L₂ : Language} (Φ : L₁.Hom L₂) (T : Theory L₁) : Theory L₂

Equations

• FFL.FirstOrder.Theory.lMap Φ T = ⇑(FFL.FirstOrder.Semiformula.lMap Φ) '' T