def LO.Modal.Standard.Formula.complement {α : Type u_1} : LO.Modal.Standard.Formula α → LO.Modal.Standard.Formula α

Equations

• -x = match x with | p.imp LO.Modal.Standard.Formula.falsum => p | p => ~p

def LO.Modal.Standard.Formula.«term-_» : Lean.ParserDescr

Equations

• LO.Modal.Standard.Formula.«term-_» = Lean.ParserDescr.node `LO.Modal.Standard.Formula.term-_ 80 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "-") (Lean.ParserDescr.cat `term 80))

@[simp]

theorem LO.Modal.Standard.Formula.complement.neg_def {α : Type u_1} {p : LO.Modal.Standard.Formula α} : -(~p) = p

@[simp]

theorem LO.Modal.Standard.Formula.complement.bot_def {α : Type u_1} : -⊥ = ~⊥

@[simp]

theorem LO.Modal.Standard.Formula.complement.box_def {α : Type u_1} {p : LO.Modal.Standard.Formula α} : -(□p) = ~□p

theorem LO.Modal.Standard.Formula.complement.imp_def₁ {α : Type u_1} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} (hq : q ≠ ⊥) : -(p ⟶ q) = ~(p ⟶ q)

theorem LO.Modal.Standard.Formula.complement.imp_def₂ {α : Type u_1} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} (hq : q = ⊥) : -(p ⟶ q) = p

theorem LO.Modal.Standard.Formula.complement.resort_box {α : Type u_1} {p : LO.Modal.Standard.Formula α} {q : LO.Modal.Standard.Formula α} (h : -p = □q) : p = ~□q

theorem LO.Modal.Standard.Formula.complement.or {α : Type u_1} [DecidableEq α] (p : LO.Modal.Standard.Formula α) : -p = ~p ∨ ∃ (q : LO.Modal.Standard.Formula α), ~q = p

theorem LO.Modal.Standard.complement_derive_bot {α : Type u_1} {S : Type u_2} [DecidableEq α] [LO.System (LO.Modal.Standard.Formula α) S] {𝓢 : S} [LO.System.ModusPonens 𝓢] {p : LO.Modal.Standard.Formula α} (hp : 𝓢 ⊢! p) (hcp : 𝓢 ⊢! -p) : 𝓢 ⊢! ⊥

theorem LO.Modal.Standard.neg_complement_derive_bot {α : Type u_1} {S : Type u_2} [DecidableEq α] [LO.System (LO.Modal.Standard.Formula α) S] {𝓢 : S} [LO.System.ModusPonens 𝓢] {p : LO.Modal.Standard.Formula α} (hp : 𝓢 ⊢! ~p) (hcp : 𝓢 ⊢! ~-p) : 𝓢 ⊢! ⊥

def LO.Modal.Standard.Formulae.complementary {α : Type u_1} [DecidableEq α] (P : LO.Modal.Standard.Formulae α) : LO.Modal.Standard.Formulae α

Equations

• P⁻ = P ∪ Finset.image LO.Modal.Standard.Formula.complement P

def LO.Modal.Standard.Formulae.«term_⁻» : Lean.TrailingParserDescr

Equations

• LO.Modal.Standard.Formulae.«term_⁻» = Lean.ParserDescr.trailingNode `LO.Modal.Standard.Formulae.term_⁻ 80 80 (Lean.ParserDescr.symbol "⁻")

theorem LO.Modal.Standard.Formulae.complementary_mem {α : Type u_1} [DecidableEq α] {P : LO.Modal.Standard.Formulae α} {p : LO.Modal.Standard.Formula α} (h : p ∈ P) : p ∈ P⁻

theorem LO.Modal.Standard.Formulae.complementary_comp {α : Type u_1} [DecidableEq α] {P : LO.Modal.Standard.Formulae α} {p : LO.Modal.Standard.Formula α} (h : p ∈ P) : -p ∈ P⁻

theorem LO.Modal.Standard.Formulae.complementary_mem_box {α : Type u_1} [DecidableEq α] {P : LO.Modal.Standard.Formulae α} {p : LO.Modal.Standard.Formula α} (hi : autoParam (∀ {q r : LO.Modal.Standard.Formula α}, q ⟶ r ∈ P → q ∈ P) _auto✝) : □p ∈ P⁻ → □p ∈ P

class LO.Modal.Standard.Formulae.ComplementaryClosed {α : Type u_1} [DecidableEq α] (P : LO.Modal.Standard.Formulae α) (S : LO.Modal.Standard.Formulae α) : Prop

• subset : P ⊆ S⁻
• either : ∀ p ∈ S, p ∈ P ∨ -p ∈ P

theorem LO.Modal.Standard.Formulae.ComplementaryClosed.subset {α : Type u_1} [DecidableEq α] {P : LO.Modal.Standard.Formulae α} {S : LO.Modal.Standard.Formulae α} [self : P.ComplementaryClosed S] : P ⊆ S⁻

theorem LO.Modal.Standard.Formulae.ComplementaryClosed.either {α : Type u_1} [DecidableEq α] {P : LO.Modal.Standard.Formulae α} {S : LO.Modal.Standard.Formulae α} [self : P.ComplementaryClosed S] (p : LO.Modal.Standard.Formula α) : p ∈ S → p ∈ P ∨ -p ∈ P

def LO.Modal.Standard.Formulae.SubformulaeComplementaryClosed {α : Type u_1} [DecidableEq α] (P : LO.Modal.Standard.Formulae α) (p : LO.Modal.Standard.Formula α) : Prop

Equations

• P.SubformulaeComplementaryClosed p = P.ComplementaryClosed (𝒮 p)

def LO.Modal.Standard.Formulae.Consistent {α : Type u_1} (Λ : LO.Modal.Standard.DeductionParameter α) (P : LO.Modal.Standard.Formulae α) : Prop

Equations

• LO.Modal.Standard.Formulae.Consistent Λ P = ↑P *⊬[Λ]! ⊥

@[simp]

theorem LO.Modal.Standard.Formulae.iff_theory_consistent_formulae_consistent {α : Type u_1} {Λ : LO.Modal.Standard.DeductionParameter α} {P : LO.Modal.Standard.Formulae α} : (Λ)-Consistent ↑P ↔ LO.Modal.Standard.Formulae.Consistent Λ P

theorem LO.Modal.Standard.Formulae.provable_iff_insert_neg_not_consistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {P : LO.Modal.Standard.Formulae α} {p : LO.Modal.Standard.Formula α} : ↑P *⊢[Λ]! p ↔ ¬LO.Modal.Standard.Formulae.Consistent Λ (insert (~p) P)

theorem LO.Modal.Standard.Formulae.neg_provable_iff_insert_not_consistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {P : LO.Modal.Standard.Formulae α} {p : LO.Modal.Standard.Formula α} : ↑P *⊢[Λ]! ~p ↔ ¬LO.Modal.Standard.Formulae.Consistent Λ (insert p P)

theorem LO.Modal.Standard.Formulae.unprovable_iff_singleton_neg_consistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {p : LO.Modal.Standard.Formula α} : Λ ⊬! p ↔ LO.Modal.Standard.Formulae.Consistent Λ {~p}

theorem LO.Modal.Standard.Formulae.unprovable_iff_singleton_compl_consistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {p : LO.Modal.Standard.Formula α} : Λ ⊬! p ↔ LO.Modal.Standard.Formulae.Consistent Λ {-p}

theorem LO.Modal.Standard.Formulae.provable_iff_singleton_compl_inconsistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {p : LO.Modal.Standard.Formula α} : Λ ⊢! p ↔ ¬LO.Modal.Standard.Formulae.Consistent Λ {-p}

theorem LO.Modal.Standard.Formulae.intro_union_consistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {P₁ : LO.Modal.Standard.Formulae α} {P₂ : LO.Modal.Standard.Formulae α} (h : ∀ {Γ₁ Γ₂ : List (LO.Modal.Standard.Formula α)}, ((∀ p ∈ Γ₁, p ∈ P₁) ∧ ∀ p ∈ Γ₂, p ∈ P₂) → Λ ⊬! ⋀Γ₁ ⋏ ⋀Γ₂ ⟶ ⊥) : LO.Modal.Standard.Formulae.Consistent Λ (P₁ ∪ P₂)

theorem LO.Modal.Standard.Formulae.intro_triunion_consistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {P₁ : LO.Modal.Standard.Formulae α} {P₂ : LO.Modal.Standard.Formulae α} {P₃ : LO.Modal.Standard.Formulae α} (h : ∀ {Γ₁ Γ₂ Γ₃ : List (LO.Modal.Standard.Formula α)}, ((∀ p ∈ Γ₁, p ∈ P₁) ∧ (∀ p ∈ Γ₂, p ∈ P₂) ∧ ∀ p ∈ Γ₃, p ∈ P₃) → Λ ⊬! ⋀Γ₁ ⋏ ⋀Γ₂ ⋏ ⋀Γ₃ ⟶ ⊥) : LO.Modal.Standard.Formulae.Consistent Λ (P₁ ∪ P₂ ∪ P₃)

@[simp]

theorem LO.Modal.Standard.Formulae.empty_conisistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} [LO.System.Consistent Λ] : LO.Modal.Standard.Formulae.Consistent Λ ∅

noncomputable def LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.next {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) (p : LO.Modal.Standard.Formula α) (P : LO.Modal.Standard.Formulae α) : LO.Modal.Standard.Formulae α

Equations

• LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.next Λ p P = if LO.Modal.Standard.Formulae.Consistent Λ (insert p P) then insert p P else insert (-p) P

noncomputable def LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) (P : LO.Modal.Standard.Formulae α) : List (LO.Modal.Standard.Formula α) → LO.Modal.Standard.Formulae α

Equations

• One or more equations did not get rendered due to their size.
• LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P [] = P

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.next_consistent {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) {P : LO.Modal.Standard.Formulae α} (P_consis : LO.Modal.Standard.Formulae.Consistent Λ P) (p : LO.Modal.Standard.Formula α) : LO.Modal.Standard.Formulae.Consistent Λ (LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.next Λ p P)

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum_consistent {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) {P : LO.Modal.Standard.Formulae α} (P_consis : LO.Modal.Standard.Formulae.Consistent Λ P) {l : List (LO.Modal.Standard.Formula α)} : LO.Modal.Standard.Formulae.Consistent Λ (LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P l)

@[simp]

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum_nil {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) {P : LO.Modal.Standard.Formulae α} : LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P [] = P

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum_subset_step {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) {P : LO.Modal.Standard.Formulae α} {q : LO.Modal.Standard.Formula α} {l : List (LO.Modal.Standard.Formula α)} : LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P l ⊆ LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P (q :: l)

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum_subset {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) {P : LO.Modal.Standard.Formulae α} {l : List (LO.Modal.Standard.Formula α)} : P ⊆ LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P l

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.either {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) {P : LO.Modal.Standard.Formulae α} {p : LO.Modal.Standard.Formula α} {l : List (LO.Modal.Standard.Formula α)} (hp : p ∈ l) : p ∈ LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P l ∨ -p ∈ LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P l

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.subset {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) {P : LO.Modal.Standard.Formulae α} {l : List (LO.Modal.Standard.Formula α)} {p : LO.Modal.Standard.Formula α} (h : p ∈ LO.Modal.Standard.Formulae.exists_consistent_complementary_closed.enum Λ P l) : p ∈ P ∨ p ∈ l ∨ ∃ q ∈ l, -q = p

theorem LO.Modal.Standard.Formulae.exists_consistent_complementary_closed {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {P : LO.Modal.Standard.Formulae α} (S : LO.Modal.Standard.Formulae α) (h_sub : P ⊆ S⁻) (P_consis : LO.Modal.Standard.Formulae.Consistent Λ P) : ∃ (P' : LO.Modal.Standard.Formulae α), P ⊆ P' ∧ LO.Modal.Standard.Formulae.Consistent Λ P' ∧ P'.ComplementaryClosed S

structure LO.Modal.Standard.ComplementaryClosedConsistentFormulae {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) (S : LO.Modal.Standard.Formulae α) : Type u_1

• formulae : LO.Modal.Standard.Formulae α
• consistent : LO.Modal.Standard.Formulae.Consistent Λ self.formulae
• closed : self.formulae.ComplementaryClosed S

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.consistent {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} (self : LO.Modal.Standard.ComplementaryClosedConsistentFormulae Λ S) : LO.Modal.Standard.Formulae.Consistent Λ self.formulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.closed {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} (self : LO.Modal.Standard.ComplementaryClosedConsistentFormulae Λ S) : self.formulae.ComplementaryClosed S

def LO.Modal.Standard.CCF {α : Type u_1} [DecidableEq α] (Λ : LO.Modal.Standard.DeductionParameter α) (S : LO.Modal.Standard.Formulae α) : Type u_1

Alias of LO.Modal.Standard.ComplementaryClosedConsistentFormulae.

Equations

• @LO.Modal.Standard.CCF = @LO.Modal.Standard.ComplementaryClosedConsistentFormulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.lindenbaum {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} (S : LO.Modal.Standard.Formulae α) {X : LO.Modal.Standard.Formulae α} (X_sub : X ⊆ S⁻) (X_consis : LO.Modal.Standard.Formulae.Consistent Λ X) : ∃ (X' : LO.Modal.Standard.CCF Λ S), X ⊆ X'.formulae

noncomputable instance LO.Modal.Standard.ComplementaryClosedConsistentFormulae.instInhabitedCCFOfConsistentFormulaDeductionParameter {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} [LO.System.Consistent Λ] : Inhabited (LO.Modal.Standard.CCF Λ S)

Equations

• LO.Modal.Standard.ComplementaryClosedConsistentFormulae.instInhabitedCCFOfConsistentFormulaDeductionParameter = { default := ⋯.choose }

@[simp]

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.unprovable_falsum {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} : ↑X.formulae *⊬[Λ]! ⊥

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.mem_compl_of_not_mem {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} {q : LO.Modal.Standard.Formula α} (hs : q ∈ S) : q ∉ X.formulae → -q ∈ X.formulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.mem_of_not_mem_compl {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} {q : LO.Modal.Standard.Formula α} (hs : q ∈ S) : -q ∉ X.formulae → q ∈ X.formulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.membership_iff {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} {q : LO.Modal.Standard.Formula α} (hq_sub : q ∈ S) : q ∈ X.formulae ↔ ↑X.formulae *⊢[Λ]! q

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.mem_verum {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} (h : ⊤ ∈ S) : ⊤ ∈ X.formulae

@[simp]

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.mem_falsum {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} : ⊥ ∉ X.formulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.iff_mem_compl {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} {q : LO.Modal.Standard.Formula α} (hq_sub : q ∈ S) : q ∈ X.formulae ↔ -q ∉ X.formulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.iff_mem_imp {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} {q : LO.Modal.Standard.Formula α} {r : LO.Modal.Standard.Formula α} (hsub_qr : q ⟶ r ∈ S) (hsub_q : autoParam (q ∈ S) _auto✝) (hsub_r : autoParam (r ∈ S) _auto✝) : q ⟶ r ∈ X.formulae ↔ q ∈ X.formulae → -r ∉ X.formulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.iff_not_mem_imp {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X : LO.Modal.Standard.CCF Λ S} {q : LO.Modal.Standard.Formula α} {r : LO.Modal.Standard.Formula α} (hsub_qr : q ⟶ r ∈ S) (hsub_q : autoParam (q ∈ S) _auto✝) (hsub_r : autoParam (r ∈ S) _auto✝) : q ⟶ r ∉ X.formulae ↔ q ∈ X.formulae ∧ -r ∈ X.formulae

theorem LO.Modal.Standard.ComplementaryClosedConsistentFormulae.equality_def {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} {X₁ : LO.Modal.Standard.CCF Λ S} {X₂ : LO.Modal.Standard.CCF Λ S} : X₁ = X₂ ↔ X₁.formulae = X₂.formulae

instance LO.Modal.Standard.ComplementaryClosedConsistentFormulae.instFiniteCCF {α : Type u_1} [DecidableEq α] {Λ : LO.Modal.Standard.DeductionParameter α} {S : LO.Modal.Standard.Formulae α} : Finite (LO.Modal.Standard.CCF Λ S)

Equations

• ⋯ = ⋯