Completeness theorem

Generic filters

def FFL.FirstOrder.LK.Derivation.Canonical.decidablePoints {K : Language} (φ : Proposition K) : Order.DenseSet (ConsistentSequent K)

Equations

• FFL.FirstOrder.LK.Derivation.Canonical.decidablePoints φ = { set := {p : FFL.FirstOrder.LK.Derivation.Canonical.ConsistentSequent K | p ⊩ᶜ φ ∨ p ⊩ᶜ ∼φ}, is_dense := ⋯ }

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.mem_decidablePoints_def {K : Language} (p : ConsistentSequent K) (φ : Proposition K) : p ∈ decidablePoints φ ↔ p ⊩ᶜ φ ∨ p ⊩ᶜ ∼φ

def FFL.FirstOrder.LK.Derivation.Canonical.henkinPoints {K : Language} (φ : Semiproposition K 1) : Order.DenseSet (ConsistentSequent K)

Equations

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

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.mem_henkinPoints_def {K : Language} (p : ConsistentSequent K) (φ : Semiproposition K 1) : p ∈ henkinPoints φ ↔ ∀ q ≤ p, q ⊩ᶜ ∃¹ φ → ∃ (t : Semiterm K ℕ 0), q ⊩ᶜ φ/[t]

@[reducible, inline]

abbrev FFL.FirstOrder.LK.Derivation.Canonical.denseSets {K : Language} : Set (Order.DenseSet (ConsistentSequent K))

Equations

• FFL.FirstOrder.LK.Derivation.Canonical.denseSets = Set.range FFL.FirstOrder.LK.Derivation.Canonical.decidablePoints ∪ Set.range FFL.FirstOrder.LK.Derivation.Canonical.henkinPoints

theorem FFL.FirstOrder.LK.Derivation.Canonical.exists_genericFilter {K : Language} [K.Encodable] (p : ConsistentSequent K) : ∃ (G : Order.PFilter (ConsistentSequent K)), G.IsGeneric denseSets ∧ p ∈ G

noncomputable def FFL.FirstOrder.LK.Derivation.Canonical.genericFilter {K : Language} [K.Encodable] (p : ConsistentSequent K) : Order.PFilter (ConsistentSequent K)

Equations

• FFL.FirstOrder.LK.Derivation.Canonical.genericFilter p = Classical.choose ⋯

instance FFL.FirstOrder.LK.Derivation.Canonical.genericFilter_isGeneric {K : Language} [K.Encodable] (p : ConsistentSequent K) : (genericFilter p).IsGeneric denseSets

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.mem_genericFilter {K : Language} [K.Encodable] (p : ConsistentSequent K) : p ∈ genericFilter p

def FFL.FirstOrder.LK.Derivation.Canonical.GenericForces {K : Language} [K.Encodable] (p : ConsistentSequent K) (φ : Proposition K) : Prop

Equations

• FFL.FirstOrder.LK.Derivation.Canonical.GenericForces p φ = ∃ q ∈ FFL.FirstOrder.LK.Derivation.Canonical.genericFilter p, q ⊩ᶜ φ

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.em {K : Language} [K.Encodable] (p : ConsistentSequent K) (φ : Proposition K) : GenericForces p φ ∨ GenericForces p (∼φ)

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.neg {K : Language} [K.Encodable] {p : ConsistentSequent K} {φ : Proposition K} : GenericForces p (∼φ) ↔ ¬GenericForces p φ

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.verum {K : Language} [K.Encodable] (p : ConsistentSequent K) : GenericForces p ⊤

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.not_falsum {K : Language} [K.Encodable] (p : ConsistentSequent K) : ¬GenericForces p ⊥

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.nrel {K : Language} [K.Encodable] {a✝ : ℕ} {R : K.Rel a✝} {v : Fin a✝ → Semiterm K ℕ 0} {p : ConsistentSequent K} : GenericForces p (Semiformula.nrel R v) ↔ ¬GenericForces p (Semiformula.rel R v)

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.henkin {K : Language} [K.Encodable] {p : ConsistentSequent K} {φ : Semiproposition K 1} : GenericForces p (∃¹ φ) → ∃ (t : Semiterm K ℕ 0), GenericForces p (φ/[t])

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.exs {K : Language} [K.Encodable] {φ : Semiproposition K (0 + 1)} {p : ConsistentSequent K} : GenericForces p (∃¹ φ) ↔ ∃ (t : Semiterm K ℕ 0), GenericForces p (φ/[t])

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.fal {K : Language} [K.Encodable] {φ : Semiproposition K (0 + 1)} {p : ConsistentSequent K} : GenericForces p (∀¹ φ) ↔ ∀ (t : Semiterm K ℕ 0), GenericForces p (φ/[t])

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.and {K : Language} [K.Encodable] {p : ConsistentSequent K} {φ ψ : Proposition K} : GenericForces p (φ ⋏ ψ) ↔ GenericForces p φ ∧ GenericForces p ψ

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.GenericForces.or {K : Language} [K.Encodable] {p : ConsistentSequent K} {φ ψ : Proposition K} : GenericForces p (φ ⋎ ψ) ↔ GenericForces p φ ∨ GenericForces p ψ

@[reducible, inline]

abbrev FFL.FirstOrder.LK.Derivation.Canonical.termModelOf {K : Language} [K.Encodable] (p : ConsistentSequent K) : Tarski.Structure K (Term K ℕ)

Equations

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

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.termModel_func_def {K : Language} [K.Encodable] {k : ℕ} {p : ConsistentSequent K} (f : K.Func k) (v : Fin k → Term K ℕ) : Tarski.Structure.func f v = Semiterm.func f v

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.termModel_rel_def {K : Language} [K.Encodable] {k : ℕ} {p : ConsistentSequent K} (R : K.Rel k) (v : Fin k → Term K ℕ) : Tarski.Structure.rel R v ↔ GenericForces p (Semiformula.rel R v)

@[simp]

theorem FFL.FirstOrder.LK.Derivation.Canonical.termModel_val_eq {K : Language} [K.Encodable] {ξ : Type u_1} {n : ℕ} {p : ConsistentSequent K} (t : Semiterm K ξ n) (fv : ξ → Term K ℕ) (bv : Fin n → Term K ℕ) : Semiterm.val bv fv t = (Rew.bind bv fv) t

theorem FFL.FirstOrder.LK.Derivation.Canonical.forcing_lemma {K : Language} [K.Encodable] {ξ : Type u_1} {n : ℕ} {p : ConsistentSequent K} (φ : Semiformula K ξ n) {fv : ξ → Term K ℕ} {bv : Fin n → Term K ℕ} : (Semiformula.Eval bv fv) φ ↔ GenericForces p ((Rewriting.app (Rew.bind bv fv)) φ)

theorem FFL.FirstOrder.LK.Derivation.Canonical.refl {K : Language} [K.Encodable] (φ : Proposition K) (h : 𝐋𝐊¹ ⊬ ∼φ) : (Semiformula.Evalf fun (x : ℕ) => Semiterm.fvar x) φ

Completeness theorem

theorem FFL.FirstOrder.LK.satisfiable_of_irrefutable {L : Language} (σ : Sentence L) (h : 𝐋𝐊¹ ⊬ ∼Rewriting.emb σ) : Satisfiable {σ}

theorem FFL.FirstOrder.Theory.small_satisfiable_of_consistent {L : Language} {T : Theory L} : Entailment.Consistent T → Satisfiable T

Completeness theorem (I)

theorem FFL.FirstOrder.Theory.satisfiable_iff_consistent {L : Language} {T : Theory L} : Semantics.Satisfiable (Tarski.Struc L) T ↔ Entailment.Consistent T

theorem FFL.FirstOrder.Theory.Proof.complete {L : Language} {T : Theory L} {φ : Sentence L} : T ⊨[Tarski.Struc L] φ → T ⊢ φ

Completeness theorem (II)

theorem FFL.FirstOrder.Theory.Proof.small_complete {L : Language} {T : Theory L} {φ : Sentence L} : Consequence T φ → T ⊢ φ

theorem FFL.FirstOrder.Theory.Proof.complete_iff {L : Language} {T : Theory L} {φ : Sentence L} : Consequence T φ ↔ T ⊢ φ

instance FFL.FirstOrder.Theory.Proof.isComplete {L : Language} (T : Theory L) : Complete T (Semantics.models (Tarski.Struc L) T)

theorem FFL.FirstOrder.Theory.satisfiable_iff_satisfiable {L : Language} {T : Theory L} : Semantics.Satisfiable (Tarski.Struc L) T ↔ Satisfiable T

theorem FFL.FirstOrder.Theory.consequence_iff_consequence {L : Language} {T : Theory L} {φ : Sentence L} : T ⊨[Tarski.Struc L] φ ↔ Consequence T φ

Corollaries

theorem FFL.FirstOrder.ModelsTheory.of_provably_subtheory {L : Language} (M : Type w) [Nonempty M] [Tarski.Structure L M] (T U : Theory L) [le : T ⪯ U] (h : M↓[L] ⊧* U) : M↓[L] ⊧* T

theorem FFL.FirstOrder.ModelsTheory.of_add_left {L : Language} (M : Type w) [Nonempty M] [Tarski.Structure L M] (T U : Theory L) [M↓[L] ⊧* T ∪ U] : M↓[L] ⊧* T

theorem FFL.FirstOrder.ModelsTheory.of_add_right {L : Language} (M : Type w) [Nonempty M] [Tarski.Structure L M] (T U : Theory L) [M↓[L] ⊧* T ∪ U] : M↓[L] ⊧* U

theorem FFL.FirstOrder.Theory.Proof.complete_on_eq_models {L : Language} [L.Eq] {T : Theory L} [𝗘𝗤 L ⪯ T] (φ : Sentence L) (H : ∀ (M : Type (max u v)) [inst : Nonempty M] [inst_1 : Tarski.Structure L M] [Tarski.Structure.Eq L M] [M↓[L] ⊧* T], M↓[L] ⊧ φ) : T ⊢ φ