Preservation

structure LO.Modal.Kripke.Model.Bisimulation (M₁ M₂ : Model) : Type

Imported declaration from the Incompleteness formalization.

• toRel : Rel M₁.World M₂.World

  Imported declaration from the Incompleteness formalization.

• atomic {x₁ : M₁.World} {x₂ : M₂.World} {a : ℕ} : self.toRel x₁ x₂ → (M₁.Val x₁ a ↔ M₂.Val x₂ a)
• forth {x₁ y₁ : M₁.World} {x₂ : M₂.World} : self.toRel x₁ x₂ → x₁ ≺ y₁ → ∃ (y₂ : M₂.World), self.toRel y₁ y₂ ∧ x₂ ≺ y₂
• back {x₁ : M₁.World} {x₂ y₂ : M₂.World} : self.toRel x₁ x₂ → x₂ ≺ y₂ → ∃ (y₁ : M₁.World), self.toRel y₁ y₂ ∧ x₁ ≺ y₁

def LO.Modal.Kripke.«term_⇄_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.«term_⇄_» = Lean.ParserDescr.trailingNode `LO.Modal.Kripke.«term_⇄_» 80 81 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⇄ ") (Lean.ParserDescr.cat `term 81))

@[implicit_reducible]

instance LO.Modal.Kripke.instCoeFunBisimulationForallWorldForallProp {M₁ M₂ : Model} : CoeFun (M₁ ⇄ M₂) fun (x : M₁ ⇄ M₂) => M₁.World → M₂.World → Prop

Equations

• LO.Modal.Kripke.instCoeFunBisimulationForallWorldForallProp = { coe := fun (bi : M₁ ⇄ M₂) => bi.toRel }

def LO.Modal.Kripke.ModalEquivalent {M₁ M₂ : Model} (w₁ : M₁.World) (w₂ : M₂.World) : Prop

Imported declaration from the Incompleteness formalization.

Equations

• (w₁ ↭ w₂) = ∀ {φ : LO.Modal.Formula ℕ}, w₁ ⊧ φ ↔ w₂ ⊧ φ

def LO.Modal.Kripke.«term_↭_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.«term_↭_» = Lean.ParserDescr.trailingNode `LO.Modal.Kripke.«term_↭_» 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ↭ ") (Lean.ParserDescr.cat `term 51))

theorem LO.Modal.Kripke.modal_equivalent_of_bisimilar {M₁ M₂ : Model} {x₁ : M₁.World} {x₂ : M₂.World} (Bi : M₁ ⇄ M₂) (bisx : Bi.toRel x₁ x₂) : x₁ ↭ x₂

structure LO.Modal.Kripke.Frame.PseudoEpimorphism (F₁ F₂ : Frame) : Type

Imported declaration from the Incompleteness formalization.

• toFun : F₁.World → F₂.World

  Imported declaration from the Incompleteness formalization.

• forth {x y : F₁.World} : x ≺ y → self.toFun x ≺ self.toFun y
• back {w : F₁.World} {v : F₂.World} : self.toFun w ≺ v → ∃ (u : F₁.World), self.toFun u = v ∧ w ≺ u

def LO.Modal.Kripke.«term_→ₚ_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.«term_→ₚ_» = Lean.ParserDescr.trailingNode `LO.Modal.Kripke.«term_→ₚ_» 80 81 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " →ₚ ") (Lean.ParserDescr.cat `term 81))

@[implicit_reducible]

instance LO.Modal.Kripke.instCoeFunPseudoEpimorphismForallWorld {F₁ F₂ : Frame} : CoeFun (F₁ →ₚ F₂) fun (x : F₁ →ₚ F₂) => F₁.World → F₂.World

Equations

• LO.Modal.Kripke.instCoeFunPseudoEpimorphismForallWorld = { coe := fun (f : F₁ →ₚ F₂) => f.toFun }

def LO.Modal.Kripke.Frame.PseudoEpimorphism.id {F : Frame} : F →ₚ F

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.Frame.PseudoEpimorphism.id = { toFun := id, forth := ⋯, back := ⋯ }

def LO.Modal.Kripke.Frame.PseudoEpimorphism.TransitiveClosure {F₁ F₂ : Frame} (f : F₁ →ₚ F₂) (F₂_trans : IsTrans F₂.World F₂.Rel) : F₁^+ →ₚ F₂

Imported declaration from the Incompleteness formalization.

Equations

• f.TransitiveClosure F₂_trans = { toFun := f.toFun, forth := ⋯, back := ⋯ }

def LO.Modal.Kripke.Frame.PseudoEpimorphism.comp {F₁ F₂ F₃ : Frame} (f : F₁ →ₚ F₂) (g : F₂ →ₚ F₃) : F₁ →ₚ F₃

Imported declaration from the Incompleteness formalization.

Equations

• f.comp g = { toFun := g.toFun ∘ f.toFun, forth := ⋯, back := ⋯ }

structure LO.Modal.Kripke.Model.PseudoEpimorphism (M₁ M₂ : Model) extends M₁.toFrame →ₚ M₂.toFrame : Type

Imported declaration from the Incompleteness formalization.

• toFun : M₁.World → M₂.World
• forth {x y : M₁.World} : x ≺ y → self.toFun x ≺ self.toFun y
• back {w : M₁.World} {v : M₂.World} : self.toFun w ≺ v → ∃ (u : M₁.World), self.toFun u = v ∧ w ≺ u
• atomic {a : ℕ} {w : M₁.World} : M₁.Val w a ↔ M₂.Val (self.toFun w) a

def LO.Modal.Kripke.«term_→ₚ__1» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

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

@[implicit_reducible]

instance LO.Modal.Kripke.instCoeFunPseudoEpimorphismForallWorld_1 {M₁ M₂ : Model} : CoeFun (M₁ →ₚ M₂) fun (x : M₁ →ₚ M₂) => M₁.World → M₂.World

Equations

• LO.Modal.Kripke.instCoeFunPseudoEpimorphismForallWorld_1 = { coe := fun (f : M₁ →ₚ M₂) => f.toFun }

def LO.Modal.Kripke.Model.PseudoEpimorphism.id {M : Model} : M →ₚ M

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.Model.PseudoEpimorphism.id = { toFun := id, forth := ⋯, back := ⋯, atomic := ⋯ }

def LO.Modal.Kripke.Model.PseudoEpimorphism.ofAtomic {M₁ M₂ : Model} (f : M₁.toFrame →ₚ M₂.toFrame) (atomic : ∀ {w : M₁.World} {a : ℕ}, M₁.Val w a ↔ M₂.Val (f.toFun w) a) : M₁ →ₚ M₂

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.Model.PseudoEpimorphism.ofAtomic f atomic = { toFun := f.toFun, forth := ⋯, back := ⋯, atomic := ⋯ }

def LO.Modal.Kripke.Model.PseudoEpimorphism.comp {M₁ M₂ M₃ : Model} (f : M₁ →ₚ M₂) (g : M₂ →ₚ M₃) : M₁ →ₚ M₃

Imported declaration from the Incompleteness formalization.

Equations

• f.comp g = LO.Modal.Kripke.Model.PseudoEpimorphism.ofAtomic (f.comp g.toPseudoEpimorphism) ⋯

def LO.Modal.Kripke.Model.PseudoEpimorphism.bisimulation {M₁ M₂ : Model} (f : M₁ →ₚ M₂) : M₁ ⇄ M₂

Imported declaration from the Incompleteness formalization.

Equations

• f.bisimulation = { toRel := fun (x₁ : M₁.World) (x₂ : M₂.World) => f.toFun x₁ = x₂, atomic := ⋯, forth := ⋯, back := ⋯ }

theorem LO.Modal.Kripke.Model.PseudoEpimorphism.modal_equivalence {M₁ M₂ : Model} (f : M₁ →ₚ M₂) (w : M₁.World) : w ↭ f.toFun w

theorem LO.Modal.Kripke.validOnFrame_of_surjective_pseudoMorphism {F₁ F₂ : Frame} {φ : Formula ℕ} (f : F₁ →ₚ F₂) (f_surjective : Function.Surjective f.toFun) : F₁ ⊧ φ → F₂ ⊧ φ

theorem LO.Modal.Kripke.theory_ValidOnFrame_of_surjective_pseudoMorphism {F₁ F₂ : Frame} {T : Set (Formula ℕ)} (f : F₁ →ₚ F₂) (f_surjective : Function.Surjective f.toFun) : F₁ ⊧* T → F₂ ⊧* T

def LO.Modal.Kripke.Frame.isRooted (F : Frame) (r : F.World) : Prop

Imported declaration from the Incompleteness formalization.

Equations

• F.isRooted r = ∀ (w : F.World), w ≠ r → r ≺ w

structure LO.Modal.Kripke.RootedFrameextends LO.Modal.Kripke.Frame : Type 1

Imported declaration from the Incompleteness formalization.

• World : Type
• Rel : _root_.Rel self.World self.World
• world_nonempty : Nonempty self.World
• root : self.World

  Imported declaration from the Incompleteness formalization.

• root_rooted : self.isRooted self.root
• default : self.World

  Imported declaration from the Incompleteness formalization.

def LO.Modal.Kripke.Frame.PointGenerated (F : Frame) (r : F.World) : RootedFrame

Imported declaration from the Incompleteness formalization.

Equations

• F↾r = { World := ↑{w : F.World | w = r ∨ r ≺ w}, Rel := fun (x y : ↑{w : F.World | w = r ∨ r ≺ w}) => ↑x ≺ ↑y, world_nonempty := ⋯, root := ⟨r, ⋯⟩, root_rooted := ⋯ }

def LO.Modal.Kripke.«term_↾_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.«term_↾_» = Lean.ParserDescr.trailingNode `LO.Modal.Kripke.«term_↾_» 100 101 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "↾") (Lean.ParserDescr.cat `term 101))

theorem LO.Modal.Kripke.Frame.PointGenerated.rel_transitive {F : Frame} {r : F.World} (F_trans : IsTrans F.World F.Rel) : IsTrans (F↾r).World (F↾r).Rel

theorem LO.Modal.Kripke.Frame.PointGenerated.rel_irreflexive {F : Frame} {r : F.World} (F_irrefl : Std.Irrefl F.Rel) : Std.Irrefl (F↾r).Rel

theorem LO.Modal.Kripke.Frame.PointGenerated.rel_universal {F : Frame} {r : F.World} (F_refl : Std.Refl F.Rel) (F_eucl : Euclidean F.Rel) : Universal (F↾r).Rel

instance LO.Modal.Kripke.Frame.PointGenerated.instFiniteWorld {F : Frame} {r : F.World} [Finite F.World] : Finite (F↾r).World

@[implicit_reducible]

instance LO.Modal.Kripke.Frame.PointGenerated.instDecidableEqWorld {F : Frame} {r : F.World} [DecidableEq F.World] : DecidableEq (F↾r).World

Equations

• LO.Modal.Kripke.Frame.PointGenerated.instDecidableEqWorld = Subtype.instDecidableEq

structure LO.Modal.Kripke.RootedModelextends LO.Modal.Kripke.Model, LO.Modal.Kripke.RootedFrame : Type 1

Imported declaration from the Incompleteness formalization.

• World : Type
• Rel : _root_.Rel self.World self.World
• world_nonempty : Nonempty self.World
• Val : Valuation self.toFrame
• root : self.World
• root_rooted : self.isRooted self.root
• default : self.World

def LO.Modal.Kripke.Model.PointGenerated (M : Model) (r : M.World) : RootedModel

Imported declaration from the Incompleteness formalization.

Equations

• M↾r = { toFrame := (M.toFrame↾r).toFrame, Val := fun (w : (M.toFrame↾r).World) (a : ℕ) => M.Val (↑w) a, root := (M.toFrame↾r).root, root_rooted := ⋯, default := (M.toFrame↾r).root }

def LO.Modal.Kripke.«term_↾__1» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

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

def LO.Modal.Kripke.Model.PointGenerated.bisimulationOfTrans {M : Model} (M_trans : IsTrans M.World M.Rel) (r : M.World) : (M↾r).toModel ⇄ M

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.Model.PointGenerated.bisimulationOfTrans M_trans r = { toRel := fun (x : (M↾r).World) (y : M.World) => ↑x = y, atomic := ⋯, forth := ⋯, back := ⋯ }

theorem LO.Modal.Kripke.Model.PointGenerated.modal_equivalent_at_root {M : Model} (M_trans : IsTrans M.World M.Rel) (r : M.World) : ⟨r, ⋯⟩ ↭ r

structure LO.Modal.Kripke.Frame.GeneratedSub (F₁ F₂ : Frame) extends F₁ →ₚ F₂ : Type

Imported declaration from the Incompleteness formalization.

• toFun : F₁.World → F₂.World
• forth {x y : F₁.World} : x ≺ y → self.toFun x ≺ self.toFun y
• back {w : F₁.World} {v : F₂.World} : self.toFun w ≺ v → ∃ (u : F₁.World), self.toFun u = v ∧ w ≺ u
• monic : Function.Injective self.toFun

def LO.Modal.Kripke.«term_⊆ₚ_» : Lean.TrailingParserDescr

Imported declaration from the Incompleteness formalization.

Equations

• LO.Modal.Kripke.«term_⊆ₚ_» = Lean.ParserDescr.trailingNode `LO.Modal.Kripke.«term_⊆ₚ_» 80 81 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊆ₚ ") (Lean.ParserDescr.cat `term 81))