Documentation

Foundation.Modal.Kripke.Grz.Completeness

@[reducible, inline]
noncomputable abbrev LO.Modal.Formula.subformulaeGrz {α : Type u} [DecidableEq α] (φ : Formula α) :
Equations
Instances For
    @[simp]
    theorem LO.Modal.Formula.subformulaeGrz.mem_self {φ : Formula ℕ} :
    φ ∈ φ.subformulaeGrz
    theorem LO.Modal.Formula.subformulaeGrz.mem_boximpbox {φ ψ : Formula ℕ} (h : ψ ∈ Finset.prebox φ.subformulae) :
    □(ψ ➝ □ψ) ∈ φ.subformulaeGrz
    theorem LO.Modal.Formula.subformulaeGrz.mem_origin {φ ψ : Formula ℕ} (h : ψ ∈ φ.subformulae) :
    ψ ∈ φ.subformulaeGrz
    theorem LO.Modal.Formula.subformulaeGrz.mem_imp {φ ψ χ : Formula ℕ} (h : ψ ➝ χ ∈ φ.subformulaeGrz) :
    ψ ∈ φ.subformulaeGrz ∧ χ ∈ φ.subformulaeGrz
    theorem LO.Modal.Formula.subformulaeGrz.mem_imp₁ {φ ψ χ : Formula ℕ} (h : ψ ➝ χ ∈ φ.subformulaeGrz) :
    ψ ∈ φ.subformulaeGrz
    theorem LO.Modal.Formula.subformulaeGrz.mem_imp₂ {φ ψ χ : Formula ℕ} (h : ψ ➝ χ ∈ φ.subformulaeGrz) :
    χ ∈ φ.subformulaeGrz
    @[reducible, inline]
    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      @[reducible, inline]
      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem LO.Modal.Hilbert.Grz.Kripke.truthlemma.lemma1 {φ ψ : Formula ℕ} {X : CCF (Hilbert.Grz ℕ) φ.subformulaeGrz} (hq : □ψ ∈ φ.subformulae) :
        (Finset.prebox X.formulae).box ∪ {□(ψ ➝ □ψ), -ψ} ⊆ φ.subformulaeGrz⁻
        theorem LO.Modal.Hilbert.Grz.Kripke.truthlemma.lemma2 {φ ψ : Formula ℕ} {X : CCF (Hilbert.Grz ℕ) φ.subformulaeGrz} (hq₁ : □ψ ∈ φ.subformulae) (hq₂ : □ψ ∉ X.formulae) :
        Formulae.Consistent (Hilbert.Grz ℕ) ((Finset.prebox X.formulae).box ∪ {□(ψ ➝ □ψ), -ψ})
        theorem LO.Modal.Hilbert.Grz.Kripke.truthlemma {φ ψ : Formula ℕ} {X : (miniCanonicalModel φ).World} (q_sub : ψ ∈ φ.subformulae) :