Documentation

LeanPool.Incompleteness.Foundation.Modal.Subformulas

Subformulas #

Imported declaration from the Incompleteness formalization.

Equations
Instances For
    @[simp]
    theorem LO.Modal.Formula.subformulas.mem_imp {α : Type u_1} [DecidableEq α] {φ ψ χ : Formula α} (h : ψ ==> χ ∈ φ.subformulas) :
    theorem LO.Modal.Formula.subformulas.mem_imp₁ {α : Type u_1} [DecidableEq α] {φ ψ χ : Formula α} (h : ψ ==> χ ∈ φ.subformulas) :
    theorem LO.Modal.Formula.subformulas.mem_imp₂ {α : Type u_1} [DecidableEq α] {φ ψ χ : Formula α} (h : ψ ==> χ ∈ φ.subformulas) :

    Imported declaration from the Incompleteness formalization.

    Instances
      theorem LO.Modal.FormulaSet.SubformulaClosed.mem_imp₁ {α : Type u_1} {φ : Formula α} {P : FormulaSet α} [hP : P.SubformulaClosed] {ψ : Formula α} (h : φ ==> ψ ∈ P) :
      φ ∈ P
      theorem LO.Modal.FormulaSet.SubformulaClosed.mem_imp₂ {α : Type u_1} {φ : Formula α} {P : FormulaSet α} [hP : P.SubformulaClosed] {ψ : Formula α} (h : φ ==> ψ ∈ P) :
      ψ ∈ P
      theorem LO.Modal.FormulaSet.SubformulaClosed.mem_box {α : Type u_1} {φ : Formula α} {P : FormulaSet α} [hP : P.SubformulaClosed] (h : □φ ∈ P) :
      φ ∈ P