Equations
Instances For
Equations
- LO.Modal.Formula.«term_ᵀ» = Lean.ParserDescr.trailingNode `LO.Modal.Formula.«term_ᵀ» 75 75 (Lean.ParserDescr.symbol "ᵀ")
Instances For
@[simp]
@[simp]
Equations
Instances For
Equations
- LO.Modal.Formula.«term_ⱽ» = Lean.ParserDescr.trailingNode `LO.Modal.Formula.«term_ⱽ» 75 75 (Lean.ParserDescr.symbol "ⱽ")
Instances For
@[simp]
@[simp]
theorem
LO.Modal.Hilbert.provable_of_classical_provable
{α : Type u_1}
[DecidableEq α]
{mH : LO.Modal.Hilbert α}
{φ : LO.IntProp.Formula α}
:
LO.IntProp.Hilbert.Cl α ⊢! φ → mH ⊢! φᴹ
theorem
LO.Modal.Hilbert.Triv.iff_trivTranslated
{α : Type u_1}
[DecidableEq α]
{φ : LO.Modal.Formula α}
:
LO.Modal.Hilbert.Triv α ⊢! φ ⭤ φᵀ
theorem
LO.Modal.Hilbert.Triv.classical_reducible
{α : Type u_1}
[DecidableEq α]
{φ : LO.Modal.Formula α}
:
LO.Modal.Hilbert.Triv α ⊢! φ ↔ LO.IntProp.Hilbert.Cl α ⊢! (φᵀᴾ) ⋯
theorem
LO.Modal.Hilbert.Ver.iff_verTranslated
{α : Type u_1}
[DecidableEq α]
{φ : LO.Modal.Formula α}
:
LO.Modal.Hilbert.Ver α ⊢! φ ⭤ φⱽ
theorem
LO.Modal.Hilbert.Ver.classical_reducible
{α : Type u_1}
[DecidableEq α]
{φ : LO.Modal.Formula α}
:
LO.Modal.Hilbert.Ver α ⊢! φ ↔ LO.IntProp.Hilbert.Cl α ⊢! (φⱽᴾ) ⋯