structure LO.Modal.Standard.PLoN.Frame (α : Type u_2) : Type (max (u_1 + 1) u_2)

• World : Type u_1
• World_inhabited : Inhabited self.World
• Rel : LO.Modal.Standard.Formula α → self.World → self.World → Prop

@[reducible, inline]

abbrev LO.Modal.Standard.PLoN.Frame.default {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} : F.World

Equations

• LO.Modal.Standard.PLoN.Frame.default = default

def LO.Modal.Standard.PLoN.«term﹫» : Lean.ParserDescr

Equations

• LO.Modal.Standard.PLoN.«term﹫» = Lean.ParserDescr.node `LO.Modal.Standard.PLoN.term﹫ 1024 (Lean.ParserDescr.symbol "﹫")

instance LO.Modal.Standard.PLoN.instCoeFunFrameForallFormulaForallWorldForallProp {α : Type u_1} : CoeFun (LO.Modal.Standard.PLoN.Frame α) fun (F : LO.Modal.Standard.PLoN.Frame α) => LO.Modal.Standard.Formula α → F.World → F.World → Prop

Equations

• LO.Modal.Standard.PLoN.instCoeFunFrameForallFormulaForallWorldForallProp = { coe := LO.Modal.Standard.PLoN.Frame.Rel }

@[reducible, inline]

abbrev LO.Modal.Standard.PLoN.Frame.Rel' {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} (p : LO.Modal.Standard.Formula α) (x : F.World) (y : F.World) : Prop

Equations

• LO.Modal.Standard.PLoN.Frame.Rel' p x y = F.Rel p x y

def LO.Modal.Standard.PLoN.«term_≺[_]_» : Lean.TrailingParserDescr

Equations

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

structure LO.Modal.Standard.PLoN.FiniteFrame (α : Type u_1) extends LO.Modal.Standard.PLoN.Frame : Type (max u_1 (u_2 + 1))

• World : Type u_2
• World_inhabited : Inhabited self.World
• Rel : LO.Modal.Standard.Formula α → self.World → self.World → Prop
• World_finite : Finite self.World

theorem LO.Modal.Standard.PLoN.FiniteFrame.World_finite {α : Type u_1} (self : LO.Modal.Standard.PLoN.FiniteFrame α) : Finite self.World

instance LO.Modal.Standard.PLoN.instCoeFiniteFrameFrame {α : Type u_1} : Coe (LO.Modal.Standard.PLoN.FiniteFrame α) (LO.Modal.Standard.PLoN.Frame α)

Equations

• LO.Modal.Standard.PLoN.instCoeFiniteFrameFrame = { coe := fun (F : LO.Modal.Standard.PLoN.FiniteFrame α) => F.toFrame }

@[reducible, inline]

abbrev LO.Modal.Standard.PLoN.terminalFrame (α : Type u_1) : LO.Modal.Standard.PLoN.FiniteFrame α

Equations

• LO.Modal.Standard.PLoN.terminalFrame α = LO.Modal.Standard.PLoN.FiniteFrame.mk (LO.Modal.Standard.PLoN.Frame.mk Unit fun (x : LO.Modal.Standard.Formula α) (x x : Unit) => True)

@[reducible, inline]

abbrev LO.Modal.Standard.PLoN.FrameClass (α : Type u_1) : Type (max u_1 (u_2 + 1))

Equations

• LO.Modal.Standard.PLoN.FrameClass α = Set (LO.Modal.Standard.PLoN.Frame α)

@[reducible, inline]

abbrev LO.Modal.Standard.PLoN.Valuation {α : Type u_2} (F : LO.Modal.Standard.PLoN.Frame α✝) (α : Type u_1) : Type (max u_1 u_3)

Equations

• LO.Modal.Standard.PLoN.Valuation F α = (F.World → α → Prop)

structure LO.Modal.Standard.PLoN.Model (α : Type u_1) : Type (max u_1 (u_2 + 1))

• Frame : LO.Modal.Standard.PLoN.Frame α
• Valuation : LO.Modal.Standard.PLoN.Valuation self.Frame α

@[reducible, inline]

abbrev LO.Modal.Standard.PLoN.Model.World {α : Type u_1} (M : LO.Modal.Standard.PLoN.Model α) : Type u_2

Equations

• M.World = M.Frame.World

instance LO.Modal.Standard.PLoN.instCoeSortModelType {α : Type u_1} : CoeSort (LO.Modal.Standard.PLoN.Model α) (Type u_2)

Equations

• LO.Modal.Standard.PLoN.instCoeSortModelType = { coe := LO.Modal.Standard.PLoN.Model.World }

def LO.Modal.Standard.Formula.PLoN.Satisfies {α : Type u_1} (M : LO.Modal.Standard.PLoN.Model α) (w : M.World) : LO.Modal.Standard.Formula α → Prop

Equations

• LO.Modal.Standard.Formula.PLoN.Satisfies M w (LO.Modal.Standard.Formula.atom a) = M.Valuation w a
• LO.Modal.Standard.Formula.PLoN.Satisfies M w LO.Modal.Standard.Formula.falsum = False
• LO.Modal.Standard.Formula.PLoN.Satisfies M w (p.imp q) = (LO.Modal.Standard.Formula.PLoN.Satisfies M w p → LO.Modal.Standard.Formula.PLoN.Satisfies M w q)
• LO.Modal.Standard.Formula.PLoN.Satisfies M w p.box = ∀ {w' : M.Frame.World}, LO.Modal.Standard.PLoN.Frame.Rel' p w w' → LO.Modal.Standard.Formula.PLoN.Satisfies M w' p

instance LO.Modal.Standard.Formula.PLoN.Satisfies.semantics {α : Type u_1} (M : LO.Modal.Standard.PLoN.Model α) : LO.Semantics (LO.Modal.Standard.Formula α) M.World

Equations

• LO.Modal.Standard.Formula.PLoN.Satisfies.semantics M = { Realize := fun (w : M.World) => LO.Modal.Standard.Formula.PLoN.Satisfies M w }

@[simp]

theorem LO.Modal.Standard.Formula.PLoN.Satisfies.iff_models {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {x : M.World} {p : LO.Modal.Standard.Formula α} : x ⊧ p ↔ LO.Modal.Standard.Formula.PLoN.Satisfies M x p

theorem LO.Modal.Standard.Formula.PLoN.Satisfies.box_def {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {x : M.World} {p : LO.Modal.Standard.Formula α} : x ⊧ □p ↔ ∀ (y : M.Frame.World), LO.Modal.Standard.PLoN.Frame.Rel' p x y → y ⊧ p

theorem LO.Modal.Standard.Formula.PLoN.Satisfies.not_def {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {x : M.World} {p : LO.Modal.Standard.Formula α} : x ⊧ ~p ↔ ¬x ⊧ p

instance LO.Modal.Standard.Formula.PLoN.Satisfies.instNotWorld {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} : LO.Semantics.Not M.World

Equations

• LO.Modal.Standard.Formula.PLoN.Satisfies.instNotWorld = { realize_not := ⋯ }

theorem LO.Modal.Standard.Formula.PLoN.Satisfies.imp_def {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {x : M.World} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : x ⊧ p ⟶ q ↔ x ⊧ p → x ⊧ q

instance LO.Modal.Standard.Formula.PLoN.Satisfies.instImpWorld {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} : LO.Semantics.Imp M.World

Equations

• LO.Modal.Standard.Formula.PLoN.Satisfies.instImpWorld = { realize_imp := ⋯ }

theorem LO.Modal.Standard.Formula.PLoN.Satisfies.or_def {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {x : M.World} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : x ⊧ p ⋎ q ↔ x ⊧ p ∨ x ⊧ q

instance LO.Modal.Standard.Formula.PLoN.Satisfies.instOrWorld {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} : LO.Semantics.Or M.World

Equations

• LO.Modal.Standard.Formula.PLoN.Satisfies.instOrWorld = { realize_or := ⋯ }

theorem LO.Modal.Standard.Formula.PLoN.Satisfies.and_def {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {x : M.World} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : x ⊧ p ⋏ q ↔ x ⊧ p ∧ x ⊧ q

instance LO.Modal.Standard.Formula.PLoN.Satisfies.instAndWorld {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} : LO.Semantics.And M.World

Equations

• LO.Modal.Standard.Formula.PLoN.Satisfies.instAndWorld = { realize_and := ⋯ }

instance LO.Modal.Standard.Formula.PLoN.Satisfies.instTarskiWorld {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} : LO.Semantics.Tarski M.World

Equations

• LO.Modal.Standard.Formula.PLoN.Satisfies.instTarskiWorld = LO.Semantics.Tarski.mk

def LO.Modal.Standard.Formula.PLoN.ValidOnModel {α : Type u_1} (M : LO.Modal.Standard.PLoN.Model α) (p : LO.Modal.Standard.Formula α) : Prop

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnModel M p = ∀ (w : M.World), w ⊧ p

instance LO.Modal.Standard.Formula.PLoN.ValidOnModel.instSemanticsModel {α : Type u_1} : LO.Semantics (LO.Modal.Standard.Formula α) (LO.Modal.Standard.PLoN.Model α)

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnModel.instSemanticsModel = { Realize := fun (M : LO.Modal.Standard.PLoN.Model α) => LO.Modal.Standard.Formula.PLoN.ValidOnModel M }

@[simp]

theorem LO.Modal.Standard.Formula.PLoN.ValidOnModel.iff_models {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {p : LO.Modal.Standard.Formula α} : M ⊧ p ↔ LO.Modal.Standard.Formula.PLoN.ValidOnModel M p

instance LO.Modal.Standard.Formula.PLoN.ValidOnModel.instBotModel {α : Type u_1} : LO.Semantics.Bot (LO.Modal.Standard.PLoN.Model α)

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnModel.instBotModel = { realize_bot := ⋯ }

theorem LO.Modal.Standard.Formula.PLoN.ValidOnModel.imply₁ {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : M ⊧ LO.Axioms.Imply₁ p q

theorem LO.Modal.Standard.Formula.PLoN.ValidOnModel.imply₂ {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} {r : LO.Modal.Standard.Formula α} : M ⊧ LO.Axioms.Imply₂ p q r

theorem LO.Modal.Standard.Formula.PLoN.ValidOnModel.elim_contra {α : Type u_1} {M : LO.Modal.Standard.PLoN.Model α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : M ⊧ LO.Axioms.ElimContra p q

def LO.Modal.Standard.Formula.PLoN.ValidOnFrame {α : Type u_1} (F : LO.Modal.Standard.PLoN.Frame α) (p : LO.Modal.Standard.Formula α) : Prop

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnFrame F p = ∀ (V : LO.Modal.Standard.PLoN.Valuation F α), { Frame := F, Valuation := V } ⊧ p

instance LO.Modal.Standard.Formula.PLoN.ValidOnFrame.instSemanticsFrame {α : Type u_1} : LO.Semantics (LO.Modal.Standard.Formula α) (LO.Modal.Standard.PLoN.Frame α)

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnFrame.instSemanticsFrame = { Realize := fun (F : LO.Modal.Standard.PLoN.Frame α) => LO.Modal.Standard.Formula.PLoN.ValidOnFrame F }

@[simp]

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrame.iff_models {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} {p : LO.Modal.Standard.Formula α} : F ⊧ p ↔ LO.Modal.Standard.Formula.PLoN.ValidOnFrame F p

instance LO.Modal.Standard.Formula.PLoN.ValidOnFrame.instBotFrame {α : Type u_1} : LO.Semantics.Bot (LO.Modal.Standard.PLoN.Frame α)

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnFrame.instBotFrame = { realize_bot := ⋯ }

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrame.nec {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} {p : LO.Modal.Standard.Formula α} (h : F ⊧ p) : F ⊧ □p

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrame.mdp {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} (hpq : F ⊧ p ⟶ q) (hp : F ⊧ p) : F ⊧ q

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrame.imply₁ {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : F ⊧ LO.Axioms.Imply₁ p q

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrame.imply₂ {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} {r : LO.Modal.Standard.Formula α} : F ⊧ LO.Axioms.Imply₂ p q r

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrame.elim_contra {α : Type u_1} {F : LO.Modal.Standard.PLoN.Frame α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : F ⊧ LO.Axioms.ElimContra p q

def LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass {α : Type u_1} (𝔽 : LO.Modal.Standard.PLoN.FrameClass α) (p : LO.Modal.Standard.Formula α) : Prop

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass 𝔽 p = ∀ {F : LO.Modal.Standard.PLoN.Frame α}, F ∈ 𝔽 → F ⊧ p

instance LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.instSemanticsFrameClass {α : Type u_1} : LO.Semantics (LO.Modal.Standard.Formula α) (LO.Modal.Standard.PLoN.FrameClass α)

Equations

• LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.instSemanticsFrameClass = { Realize := fun (𝔽 : LO.Modal.Standard.PLoN.FrameClass α) => LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass 𝔽 }

@[simp]

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.iff_models {α : Type u_1} {𝔽 : LO.Modal.Standard.PLoN.FrameClass α} {p : LO.Modal.Standard.Formula α} : 𝔽 ⊧ p ↔ LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass 𝔽 p

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.nec {α : Type u_1} {𝔽 : LO.Modal.Standard.PLoN.FrameClass α} {p : LO.Modal.Standard.Formula α} (h : 𝔽 ⊧ p) : 𝔽 ⊧ □p

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.mdp {α : Type u_1} {𝔽 : LO.Modal.Standard.PLoN.FrameClass α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} (hpq : 𝔽 ⊧ p ⟶ q) (hp : 𝔽 ⊧ p) : 𝔽 ⊧ q

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.imply₁ {α : Type u_1} {𝔽 : LO.Modal.Standard.PLoN.FrameClass α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : 𝔽 ⊧ LO.Axioms.Imply₁ p q

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.imply₂ {α : Type u_1} {𝔽 : LO.Modal.Standard.PLoN.FrameClass α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} {r : LO.Modal.Standard.Formula α} : 𝔽 ⊧ LO.Axioms.Imply₂ p q r

theorem LO.Modal.Standard.Formula.PLoN.ValidOnFrameClass.elim_contra {α : Type u_1} {𝔽 : LO.Modal.Standard.PLoN.FrameClass α} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} : 𝔽 ⊧ LO.Axioms.ElimContra p q

def LO.Modal.Standard.DeductionParameter.DefinesPLoNFrameClass {α : Type u_1} (𝓓 : LO.Modal.Standard.DeductionParameter α) (𝔽 : LO.Modal.Standard.PLoN.FrameClass α) : Prop

Equations

• 𝓓.DefinesPLoNFrameClass 𝔽 = ∀ {F : LO.Modal.Standard.PLoN.Frame α}, F ⊧* 𝓓.theory ↔ F ∈ 𝔽

@[reducible, inline]

abbrev LO.Modal.Standard.PLoN.AllFrameClass (α : Type u_2) : LO.Modal.Standard.PLoN.FrameClass α

Equations

• LO.Modal.Standard.PLoN.AllFrameClass α = Set.univ

theorem LO.Modal.Standard.PLoN.AllFrameClass.nonempty {α : Type u_1} : Set.Nonempty (LO.Modal.Standard.PLoN.AllFrameClass α)

theorem LO.Modal.Standard.PLoN.N_defines {α : Type u_1} : 𝐍.DefinesPLoNFrameClass (LO.Modal.Standard.PLoN.AllFrameClass α)