% Options for packages loaded elsewhere
\PassOptionsToPackage{unicode}{hyperref}
\PassOptionsToPackage{hyphens}{url}
\documentclass[
]{article}
\usepackage{xcolor}
\usepackage{amsmath,amssymb}
\setcounter{secnumdepth}{-\maxdimen} % remove section numbering
\usepackage{iftex}
\ifPDFTeX
  \usepackage[T1]{fontenc}
  \usepackage[utf8]{inputenc}
  \usepackage{textcomp} % provide euro and other symbols
\else % if luatex or xetex
  \usepackage{unicode-math} % this also loads fontspec
  \defaultfontfeatures{Scale=MatchLowercase}
  \defaultfontfeatures[\rmfamily]{Ligatures=TeX,Scale=1}
\fi
\usepackage{lmodern}
\ifPDFTeX\else
  % xetex/luatex font selection
\fi
% Use upquote if available, for straight quotes in verbatim environments
\IfFileExists{upquote.sty}{\usepackage{upquote}}{}
\IfFileExists{microtype.sty}{% use microtype if available
  \usepackage[]{microtype}
  \UseMicrotypeSet[protrusion]{basicmath} % disable protrusion for tt fonts
}{}
\makeatletter
\@ifundefined{KOMAClassName}{% if non-KOMA class
  \IfFileExists{parskip.sty}{%
    \usepackage{parskip}
  }{% else
    \setlength{\parindent}{0pt}
    \setlength{\parskip}{6pt plus 2pt minus 1pt}}
}{% if KOMA class
  \KOMAoptions{parskip=half}}
\makeatother
\setlength{\emergencystretch}{3em} % prevent overfull lines
\providecommand{\tightlist}{%
  \setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}
\usepackage{bookmark}
\IfFileExists{xurl.sty}{\usepackage{xurl}}{} % add URL line breaks if available
\urlstyle{same}
\hypersetup{
  pdftitle={The Trinity as a Necessary Structure of a Monistic Modal Ontology},
  pdfauthor={Paul Koop},
  hidelinks,
  pdfcreator={LaTeX via pandoc}}

\title{The Trinity as a Necessary Structure of a Monistic Modal
Ontology}
\usepackage{etoolbox}
\makeatletter
\providecommand{\subtitle}[1]{% add subtitle to \maketitle
  \apptocmd{\@title}{\par {\large #1 \par}}{}{}
}
\makeatother
\subtitle{A Proof in the Style of a Chess Journalist --- Modal 5, Steps
1--14}
\author{Paul Koop}
\date{}

\begin{document}
\maketitle

\section{Preliminary Note: How to Read This
File}\label{preliminary-note-how-to-read-this-file}

This file explains the proof from Modal 5 the way a chess journalist
explains a chess game: move by move, with symbol explanation at every
step, with plain language for every statement. You can read this file
without being able to play chess --- pardon: without being able to do
modal logic yourself. At the end, you will \textbf{understand} the
proof, even if you could not \textbf{conduct} it yourself. That is the
goal.

The file is divided into \textbf{three parts}:

\begin{itemize}
\tightlist
\item
  \textbf{Part I:} The basic concepts (S5, tableaux, axioms, limit
  values, superposition).
\item
  \textbf{Part II:} The proof move by move (non-derivability in S5,
  derivability in S5+SP).
\item
  \textbf{Part III:} The metalogical consequence (minimality,
  non-uniqueness, topology).
\end{itemize}

Every move is explained in \textbf{six lines}:

\begin{verbatim}
BOARD      What is currently on the board (in the tableau)?
MOVE       Which rule is applied?
SYMBOLS    What do the signs in this move mean?
WHY        Why this rule and no other?
PLAIN      What does this mean in everyday language?
NEW        What is new in the tableau?
\end{verbatim}

\begin{center}\rule{0.5\linewidth}{0.5pt}\end{center}

\section{Part I --- The Basic Concepts}\label{part-i-the-basic-concepts}

\subsection{1. What is S5?}\label{what-is-s5}

\textbf{S5} is a modal-logical system. It extends classical logic by two
operators:

\begin{verbatim}
□p    "necessarily p"
◇p    "possibly p"

◇p := ¬□¬p
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{□} (Box): ``necessarily'' --- the statement holds in all
  accessible worlds.
\item
  \texttt{◇} (Diamond): ``possibly'' --- the statement holds in at least
  one accessible world.
\item
  \texttt{¬} (Negation): ``not''.
\item
  \texttt{:=} (Definition): ``is defined as''.
\end{itemize}

\textbf{In plain language:} ``Possibly p'' means: ``It is not necessary
that p does not hold.'' This sounds cumbersome but is the precise
formulation.

\textbf{A Kripke model} is a triple M = (W, R, I):

\begin{verbatim}
W   set of worlds
R   accessibility relation (subset of W × W)
I   interpretation function
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{W}: set of possible worlds.
\item
  \texttt{R}: relation ``is accessible from'' between worlds.
\item
  \texttt{I}: assigns truth values to each world.
\item
  \texttt{×}: Cartesian product (set of all pairs).
\end{itemize}

\textbf{Truth conditions:}

\begin{verbatim}
□p @w  holds iff  ∀v (w R v → p @v)
◇p @w  holds iff  ∃v (w R v ∧ p @v)
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{@w}: ``holds in world w'' (world index).
\item
  \texttt{∀v}: ``for all worlds v'' (universal quantifier).
\item
  \texttt{∃v}: ``there is a world v'' (existential quantifier).
\item
  \texttt{→}: ``if \ldots{} then \ldots{}'' (implication).
\item
  \texttt{∧}: ``and'' (conjunction).
\item
  \texttt{iff}: ``if and only if'' (equivalence in the metalanguage).
\end{itemize}

\textbf{In plain language:} \texttt{□p} holds in w if p holds in
\textbf{all} worlds accessible from w. \texttt{◇p} holds in w if p holds
in \textbf{at least one} world accessible from w.

\textbf{The axioms of S5:}

\begin{verbatim}
K    □(p → q) → (□p → □q)
T    □p → p
4    □p → □□p
5    ◇p → □◇p
\end{verbatim}

\textbf{Symbol explanation:} \texttt{→} is implication. \texttt{K},
\texttt{T}, \texttt{4}, \texttt{5} are the names of the axioms (after
their traditional designations).

\textbf{In plain language:}

\begin{itemize}
\tightlist
\item
  \textbf{K:} If ``from p follows q'' is necessary, then from
  ``necessarily p'' follows ``necessarily q''.
\item
  \textbf{T:} What is necessary is real.
\item
  \textbf{4:} What is necessary is itself necessary.
\item
  \textbf{5:} What is possible is necessarily possible.
\end{itemize}

\textbf{Semantic consequence:} In S5, R is an \textbf{equivalence
relation} (reflexive, symmetric, transitive). All worlds are mutually
accessible.

\textbf{In plain language:} There is no ``perspectival'' restriction
anymore. What is possible is possible everywhere. What is necessary is
necessary everywhere.

\textbf{Inference rules:}

\begin{verbatim}
Modus Ponens:  from p and p → q follows q
Necessitation: from ⊢ p follows ⊢ □p
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{⊢}: ``is derivable'' (theorem sign).
\item
  \texttt{Modus\ Ponens}: the basic rule of inference.
\end{itemize}

\textbf{In plain language:} Modus Ponens is the rule ``If p holds and
from p follows q, then q holds''. Necessitation is the rule ``If p is a
theorem, then □p is also a theorem''.

\textbf{Important:} Necessitation holds \textbf{only} for theorems, not
for assumptions in a proof. Otherwise one could derive the necessity of
any assumption --- a classical mistake.

\subsection{2. Tableau Rules --- What Is
That?}\label{tableau-rules-what-is-that}

A \textbf{tableau} is a proof procedure by \textbf{refutation}. One
assumes the \textbf{negation} of the formula to be proved and decomposes
it systematically. If all branches \textbf{close} (contradiction), the
negation is unsatisfiable --- so the formula is \textbf{proved}.

\textbf{The idea in plain language:} One tries to \textbf{refute} the
formula. If that fails, it is proved. It is like chess: One tries to
checkmate the opponent. If that fails, the position is a draw --- or one
has lost.

\textbf{Alpha rules (no branching):}

\begin{verbatim}
~~A          →  A
A ∧ B        →  A, B
¬(A ∨ B)     →  ¬A, ¬B
¬(A → B)     →  A, ¬B
¬□A          →  ◇¬A
□A @w        →  A @v   for every existing world v
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{\textasciitilde{}} or \texttt{¬}: negation.
\item
  \texttt{∧}: conjunction.
\item
  \texttt{∨}: disjunction.
\item
  \texttt{→}: implication.
\item
  \texttt{□}, \texttt{◇}: necessity, possibility.
\item
  \texttt{@w}, \texttt{@v}: world indices.
\end{itemize}

\textbf{Beta rules (branching):}

\begin{verbatim}
A ∨ B        →  A | B
A → B        →  ¬A | B
¬(A ∧ B)     →  ¬A | ¬B
◇A           →  A @w_new   (new world)
\end{verbatim}

\textbf{Symbol explanation:} \texttt{\textbar{}} means ``branching'' ---
the tableau splits into two branches.

\textbf{The decisive S5 rule --- the □-rule:}

\begin{verbatim}
□A @w  →  A @v   for every already existing world v
\end{verbatim}

\textbf{In plain language:} If \texttt{□A} holds in a world w, then A
holds in \textbf{every} already existing world v --- not only in those
accessible from w. In S5, R is universal, so \texttt{□A} ``infects'' all
worlds.

\textbf{Metatheorem (Smullyan, Fitting):} A set of formulas Σ is
\textbf{satisfiable} in an S5 model iff the tableau for Σ has an
\textbf{open branch}.

\textbf{In plain language:}

\begin{itemize}
\tightlist
\item
  \textbf{Tableau closes} (all branches ⊥) → Σ unsatisfiable → target
  formula is a theorem.
\item
  \textbf{Tableau open} (at least one branch without ⊥) → Σ satisfiable
  → countermodel → target formula is not a theorem.
\end{itemize}

\textbf{Symbol explanation:} \texttt{⊥} is falsum --- the contradiction.

\subsection{3. The Axioms A1--A10}\label{the-axioms-a1a10}

\textbf{Family A: Monism and Realism}

\begin{verbatim}
A1   □¬∃x∃y FundamentallySeparated(x,y)
A2   ∀p(Cons(p) → ◇Realized(p)) ∧ ∀p(◇p → ∃w Realized(w,p))
A3   □(N → ¬◇World)
A4   ◇∃w World(w)
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{∃x∃y}: ``there is x and there is y''.
\item
  \texttt{FundamentallySeparated(x,y)}: predicate ``x and y are
  fundamentally separated''.
\item
  \texttt{Cons(p)}: ``p is consistent''.
\item
  \texttt{Realized(p)}: ``p is realized''.
\item
  \texttt{N}: absolute nothingness.
\item
  \texttt{World(w)}: ``w is a world''.
\end{itemize}

\textbf{In plain language:}

\begin{itemize}
\tightlist
\item
  \textbf{A1:} There are no fundamentally separated realms.
\item
  \textbf{A2:} Every consistent possibility is realized somewhere.
\item
  \textbf{A3:} Absolute nothingness produces no world.
\item
  \textbf{A4:} The modal universe is not empty.
\end{itemize}

\textbf{Family B: Consciousness and Knowledge}

\begin{verbatim}
A5   ◇C
A7   □(C → ◇V_T)
A8   □(V_T(x) → V_T(V_T(x)))
A9   □(V_T(x) → T)
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{C}: consciousness.
\item
  \texttt{V\_T}: complete knowledge of T.
\item
  \texttt{T}: totality.
\end{itemize}

\textbf{In plain language:}

\begin{itemize}
\tightlist
\item
  \textbf{A5:} Consciousness is possible.
\item
  \textbf{A7:} Consciousness → complete knowledge possible.
\item
  \textbf{A8:} Complete knowledge knows itself.
\item
  \textbf{A9:} Knowledge of T presupposes T.
\end{itemize}

\textbf{Family C: Grounding}

\begin{verbatim}
A6   □(¬Nec(p) → ∃g Ground(g,p))
A10  □¬∃ infinite chain(g1, g2, ...)
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{Nec(p)}: ``p is necessary''.
\item
  \texttt{Ground(g,p)}: ``g is the ground of p''.
\item
  \texttt{infinite\ chain}: a sequence of grounds without end.
\end{itemize}

\textbf{In plain language:}

\begin{itemize}
\tightlist
\item
  \textbf{A6:} Contingent things need a ground.
\item
  \textbf{A10:} No infinite regress.
\end{itemize}

\subsection{4. The Limit Structure (U, T,
S)}\label{the-limit-structure-u-t-s}

\textbf{Informal definitions:}

\begin{verbatim}
T   := { x | U < x < S }
U   := lim_{x → inf} T
S   := lim_{x → sup} T
Tr  := U ∧ T ∧ S
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{\{\ x\ \textbar{}\ ...\ \}}: ``the set of all x for which:
  \ldots{}''.
\item
  \texttt{\textless{}}: ``less than'' (order relation).
\item
  \texttt{lim}: ``limit''.
\item
  \texttt{inf}, \texttt{sup}: infimum (lower limit), supremum (upper
  limit).
\end{itemize}

\textbf{In plain language:}

\begin{itemize}
\tightlist
\item
  \textbf{T} is the open interval between U and S.
\item
  \textbf{U} is the lower limit.
\item
  \textbf{S} is the upper limit.
\item
  \textbf{Tr} is the conjunction of the three.
\end{itemize}

\textbf{The picture:} (0,1) contains 0.1; 0.5; 0.999 --- but not 0 and
not 1. 0 is the infimum, 1 is the supremum. Both do not belong to the
interval.

\subsection{5. The Superposition Axioms
(ASP1--ASP5)}\label{the-superposition-axioms-asp1asp5}

\begin{verbatim}
ASP1   C @w_super
ASP2   ∀v (w_super R v → (C @v ↔ v = w_super))
ASP3   ∀x Tr(x) @w_super
ASP4   ∀v (w_super R v → ∀x Tr(x) @v)
ASP5   ∀v (v ≠ w_super → w_super R v)
\end{verbatim}

\textbf{Symbol explanation:}

\begin{itemize}
\tightlist
\item
  \texttt{w\_super}: the distinguished world (superposition).
\item
  \texttt{R}: the accessibility relation.
\item
  \texttt{@w\_super}, \texttt{@v}: world indices.
\item
  \texttt{↔}: equivalence (``if and only if'').
\item
  \texttt{=}: identity.
\item
  \texttt{≠}: negation of identity.
\end{itemize}

\textbf{In plain language:}

\begin{itemize}
\tightlist
\item
  \textbf{ASP1:} Consciousness holds in w\_super.
\item
  \textbf{ASP2:} Consciousness holds only in w\_super.
\item
  \textbf{ASP3:} In w\_super, the Trinity holds for all x.
\item
  \textbf{ASP4:} What holds in w\_super holds in all accessible worlds.
\item
  \textbf{ASP5:} Every other world is accessible from w\_super.
\end{itemize}

\begin{center}\rule{0.5\linewidth}{0.5pt}\end{center}

\section{Part II --- The Proof Move by
Move}\label{part-ii-the-proof-move-by-move}

\subsection{Move by Move: Proof A --- S5 ⊬ □∀x
Tr(x)}\label{move-by-move-proof-a-s5-x-trx}

\textbf{Goal:} Show that the tableau for ¬□∀x Tr(x) remains
\textbf{open}. An open branch means: There is an S5 model in which the
axioms hold, but the Trinity does not. So the Trinity is \textbf{not} a
theorem of S5 alone.

\subsubsection{Move 1}\label{move-1}

\begin{verbatim}
BOARD       (empty — the tableau begins)
MOVE        Assumption: ¬□∀x Tr(x)
SYMBOLS     ¬ = not; □ = necessary; ∀x = for all x; Tr = Trinity
WHY         This is the negation of the target formula. We want to show
            that it is untenable — so we assume it is tenable.
PLAIN       "It is not necessary that all x satisfy the Trinity."
NEW         Line 1: ¬□∀x Tr(x)
\end{verbatim}

\subsubsection{Move 2}\label{move-2}

\begin{verbatim}
BOARD       Line 1: ¬□∀x Tr(x)
MOVE        Apply ¬□-rule
SYMBOLS     ¬□A → ◇¬A  (rule)
            ◇ = possible
WHY         The formula has the form ¬□A. The only applicable rule is
            the ¬□-rule. It says: ¬□A becomes ◇¬A.
PLAIN       "It is possible that not all x satisfy the Trinity."
NEW         Line 2: ◇¬∀x Tr(x)
\end{verbatim}

\subsubsection{Move 3}\label{move-3}

\begin{verbatim}
BOARD       Line 2: ◇¬∀x Tr(x)
MOVE        Apply ◇-rule
SYMBOLS     ◇A → A @w_new  (rule)
            @w_new = in a new world
WHY         The formula has the form ◇A. The only applicable rule is
            the ◇-rule. It creates a new world w0.
PLAIN       "In a new world w0: not all x satisfy the Trinity."
NEW         Line 3: ¬∀x Tr(x) @w0
\end{verbatim}

\subsubsection{Move 4}\label{move-4}

\begin{verbatim}
BOARD       Line 3: ¬∀x Tr(x) @w0
MOVE        Apply ¬∀-rule
SYMBOLS     ¬∀x A → ∃x ¬A  (rule)
            ∃x = there is an x
WHY         The formula has the form ¬∀x A. The only applicable rule
            is the ¬∀-rule.
PLAIN       "There is an x that does not satisfy the Trinity — in w0."
NEW         Line 4: ∃x ¬Tr(x) @w0
\end{verbatim}

\subsubsection{Move 5}\label{move-5}

\begin{verbatim}
BOARD       Line 4: ∃x ¬Tr(x) @w0
MOVE        Apply ∃-rule
SYMBOLS     ∃x A → A[a/x]  (rule)
            a = a new individual
WHY         The formula has the form ∃x A. The only applicable rule
            is the ∃-rule. It introduces a new individual a.
PLAIN       "For a particular individual a, in w0: a does not satisfy
            the Trinity."
NEW         Line 5: ¬Tr(a) @w0
\end{verbatim}

\subsubsection{Move 6}\label{move-6}

\begin{verbatim}
BOARD       Line 5: ¬Tr(a) @w0
MOVE        Insert definition Tr
SYMBOLS     Tr := U ∧ T ∧ S  (definition)
            ∧ = and
WHY         The formula contains Tr. Tr is defined as U ∧ T ∧ S.
            So the definition may be inserted.
PLAIN       "It is not the case that a simultaneously satisfies U, T,
            and S."
NEW         Line 6: ¬(T(a) ∧ U(a) ∧ S(a)) @w0
\end{verbatim}

\subsubsection{Move 7}\label{move-7}

\begin{verbatim}
BOARD       Line 6: ¬(T(a) ∧ U(a) ∧ S(a)) @w0
MOVE        Apply ¬∧-rule
SYMBOLS     ¬(A ∧ B) → ¬A | ¬B  (rule)
            | = branching
WHY         The formula has the form ¬(A ∧ B). The ¬∧-rule branches
            into three branches (because three conjuncts).
PLAIN       "Either a does not satisfy T, or a does not satisfy U,
            or a does not satisfy S."
NEW         Three branches:
            6a: ¬T(a) @w0
            6b: ¬U(a) @w0
            6c: ¬S(a) @w0
\end{verbatim}

\subsubsection{Move 8 (Branch 6a)}\label{move-8-branch-6a}

\begin{verbatim}
BOARD       Branch 6a: ¬T(a) @w0
MOVE        Apply A15 (□-rule, then ∀-rule, then →-rule)
SYMBOLS     A15 := □∀x (S(x) → T(x))
            □-rule: □A @w → A @v
            ∀-rule: ∀x A → A[a/x]
            →-rule: A → B → ¬A | B
WHY         A15 is available as a □-formula. The □-rule makes it
            ∀x (S(x) → T(x)) @w0. The ∀-rule makes it
            S(a) → T(a) @w0. The →-rule branches into ¬S(a) | T(a).
PLAIN       "From A15: If a satisfies S, then a satisfies T.
            So: Either a does not satisfy S, or a satisfies T."
NEW         Branching:
            8a: ¬S(a) @w0
            8b: T(a) @w0  ← contradiction with 6a (¬T(a))
            Branch 8b closes (⊥).
            We stay with 8a: ¬S(a) @w0.
\end{verbatim}

\subsubsection{Move 9 (Branch 6a,
continuation)}\label{move-9-branch-6a-continuation}

\begin{verbatim}
BOARD       Branch 6a: ¬T(a) @w0, ¬S(a) @w0
MOVE        Apply A13 (□-rule, then ∀-rule, then →-rule)
SYMBOLS     A13 := □∀x (T(x) → U(x))
WHY         A13 is available as a □-formula. The □-rule makes it
            ∀x (T(x) → U(x)) @w0. The ∀-rule makes it
            T(a) → U(a) @w0. The →-rule branches into ¬T(a) | U(a).
PLAIN       "From A13: If a satisfies T, then a satisfies U.
            So: Either a does not satisfy T, or a satisfies U."
NEW         Branching:
            9a: ¬T(a) @w0  ← already in 6a
            9b: U(a) @w0
            We choose 9a (consistent with 6a).
\end{verbatim}

\subsubsection{Move 10 (Branch 6a,
continuation)}\label{move-10-branch-6a-continuation}

\begin{verbatim}
BOARD       Branch 6a: ¬T(a), ¬S(a), ¬T(a) @w0
MOVE        Apply A14 (□-rule, then ∀-rule, then →-rule)
SYMBOLS     A14 := □∀x (U(x) → S(x))
WHY         A14 is available as a □-formula. The □-rule makes it
            ∀x (U(x) → S(x)) @w0. The ∀-rule makes it
            U(a) → S(a) @w0. The →-rule branches into ¬U(a) | S(a).
PLAIN       "From A14: If a satisfies U, then a satisfies S.
            So: Either a does not satisfy U, or a satisfies S."
NEW         Branching:
            10a: ¬U(a) @w0
            10b: S(a) @w0  ← contradiction with 8a (¬S(a))
            Branch 10b closes (⊥).
            We stay with 10a: ¬U(a) @w0.
\end{verbatim}

\subsubsection{Result of Branch 6a}\label{result-of-branch-6a}

\begin{verbatim}
BOARD       Branch 6a: ¬T(a), ¬S(a), ¬U(a) @w0
            → consistent, no contradiction.
PLAIN       "It is possible that a satisfies neither T nor U nor S."
\end{verbatim}

\subsubsection{Move 11 (Branch 6b)}\label{move-11-branch-6b}

\begin{verbatim}
BOARD       Branch 6b: ¬U(a) @w0
MOVE        Apply A13
SYMBOLS     A13 := □∀x (T(x) → U(x))
WHY         As in Move 9.
PLAIN       "From A13: If a satisfies T, then a satisfies U.
            So: Either a does not satisfy T, or a satisfies U."
NEW         Branching:
            11a: ¬T(a) @w0
            11b: U(a) @w0  ← contradiction with 6b (¬U(a))
            Branch 11b closes (⊥).
            We stay with 11a: ¬T(a) @w0.
\end{verbatim}

\subsubsection{Move 12 (Branch 6b,
continuation)}\label{move-12-branch-6b-continuation}

\begin{verbatim}
BOARD       Branch 6b: ¬U(a), ¬T(a) @w0
MOVE        Apply A15
SYMBOLS     A15 := □∀x (S(x) → T(x))
WHY         As in Move 8.
PLAIN       "From A15: If a satisfies S, then a satisfies T.
            So: Either a does not satisfy S, or a satisfies T."
NEW         Branching:
            12a: ¬S(a) @w0
            12b: T(a) @w0  ← contradiction with 11a (¬T(a))
            Branch 12b closes (⊥).
            We stay with 12a: ¬S(a) @w0.
\end{verbatim}

\subsubsection{Move 13 (Branch 6b,
continuation)}\label{move-13-branch-6b-continuation}

\begin{verbatim}
BOARD       Branch 6b: ¬U(a), ¬T(a), ¬S(a) @w0
MOVE        Apply A14
SYMBOLS     A14 := □∀x (U(x) → S(x))
WHY         As in Move 10.
PLAIN       "From A14: If a satisfies U, then a satisfies S.
            So: Either a does not satisfy U, or a satisfies S."
NEW         Branching:
            13a: ¬U(a) @w0  ← already in 6b
            13b: S(a) @w0  ← contradiction with 12a (¬S(a))
            Branch 13b closes (⊥).
            We stay with 13a: ¬U(a) @w0.
\end{verbatim}

\subsubsection{Result of Branch 6b}\label{result-of-branch-6b}

\begin{verbatim}
BOARD       Branch 6b: ¬U(a), ¬T(a), ¬S(a) @w0
            → consistent, no contradiction.
\end{verbatim}

\subsubsection{Move 14 (Branch 6c)}\label{move-14-branch-6c}

\begin{verbatim}
BOARD       Branch 6c: ¬S(a) @w0
MOVE        Apply A15
SYMBOLS     A15 := □∀x (S(x) → T(x))
WHY         As in Move 8.
PLAIN       "From A15: If a satisfies S, then a satisfies T.
            So: Either a does not satisfy S, or a satisfies T."
NEW         Branching:
            14a: ¬S(a) @w0  ← already in 6c
            14b: T(a) @w0
            Both branches possible.
\end{verbatim}

\subsubsection{Move 15 (Branch 6c,
continuation)}\label{move-15-branch-6c-continuation}

\begin{verbatim}
BOARD       Branch 6c: ¬S(a), T(a) @w0
MOVE        Apply A13
SYMBOLS     A13 := □∀x (T(x) → U(x))
WHY         As in Move 9.
PLAIN       "From A13: If a satisfies T, then a satisfies U.
            So: Either a does not satisfy T, or a satisfies U."
NEW         Branching:
            15a: ¬T(a) @w0
            15b: U(a) @w0
\end{verbatim}

\subsubsection{Move 16 (Branch 6c,
continuation)}\label{move-16-branch-6c-continuation}

\begin{verbatim}
BOARD       Branch 6c: ¬S(a), T(a), U(a) @w0 (if 15b chosen)
MOVE        Apply A14
SYMBOLS     A14 := □∀x (U(x) → S(x))
WHY         As in Move 10.
PLAIN       "From A14: If a satisfies U, then a satisfies S.
            So: Either a does not satisfy U, or a satisfies S."
NEW         Branching:
            16a: ¬U(a) @w0  ← contradiction with 15b (U(a))
            16b: S(a) @w0  ← contradiction with 6c (¬S(a))
            Both close (⊥).
            So 15a must hold: ¬T(a) @w0.
\end{verbatim}

\subsubsection{Result of Branch 6c}\label{result-of-branch-6c}

\begin{verbatim}
BOARD       Branch 6c: ¬S(a), ¬T(a), ¬U(a) @w0
            → consistent, no contradiction.
\end{verbatim}

\subsubsection{Final Result of Proof A}\label{final-result-of-proof-a}

\begin{verbatim}
BOARD       All three branches (6a, 6b, 6c) remain open.
            No branch closes.
PLAIN       There is an S5 model with an individual a for which
            ¬T(a), ¬U(a), ¬S(a) hold.
            In this model, the Trinity is false.
RESULT      ¬□∀x Tr(x) is satisfiable.
            So □∀x Tr(x) is not a theorem of S5.
FORMAL      S5 ⊬ □∀x Tr(x)
\end{verbatim}

\begin{center}\rule{0.5\linewidth}{0.5pt}\end{center}

\subsection{Move by Move: Proof B --- S5+SP ⊢ □∀x
Tr(x)}\label{move-by-move-proof-b-s5sp-x-trx}

\textbf{Goal:} Show that the tableau for ¬□∀x Tr(x) \textbf{closes} when
the superposition axioms ASP3--ASP5 are added.

\subsubsection{Moves 1--5 (identical to Proof
A)}\label{moves-15-identical-to-proof-a}

\begin{verbatim}
1.  ¬□∀x Tr(x)                    Assumption
2.  ◇¬∀x Tr(x)                    1, ¬□-rule
3.  ¬∀x Tr(x) @w0                 2, ◇-rule
4.  ∃x ¬Tr(x) @w0                 3, ¬∀-rule
5.  ¬Tr(a) @w0                    4, ∃-rule
\end{verbatim}

\subsubsection{Move 6 --- The decisive case
distinction}\label{move-6-the-decisive-case-distinction}

\begin{verbatim}
BOARD       Line 5: ¬Tr(a) @w0
MOVE        Case distinction: w0 = w_super ∨ w0 ≠ w_super
SYMBOLS     ∨ = or; = = equal; ≠ = not equal
WHY         Every world is either w_super or not. This is a classical
            logical law (tertium non datur).
PLAIN       "Either w0 is the superposition world, or it is not."
NEW         Two branches:
            A: w0 = w_super
            B: w0 ≠ w_super
\end{verbatim}

\subsubsection{Move 7 (Branch A)}\label{move-7-branch-a}

\begin{verbatim}
BOARD       Branch A: w0 = w_super
MOVE        Substitution: replace w0 by w_super
SYMBOLS     = (identity)
WHY         From w0 = w_super follows that everything that holds in w0
            also holds in w_super.
PLAIN       "In w_super: ¬Tr(a)."
NEW         Line 7: ¬Tr(a) @w_super
\end{verbatim}

\subsubsection{Move 8 (Branch A,
continuation)}\label{move-8-branch-a-continuation}

\begin{verbatim}
BOARD       Branch A: ¬Tr(a) @w_super
MOVE        Apply ASP3
SYMBOLS     ASP3 := ∀x Tr(x) @w_super
            ∀-rule: ∀x A → A[a/x]
WHY         ASP3 is available as a formula. The ∀-rule makes it
            Tr(a) @w_super.
PLAIN       "In w_super: a satisfies the Trinity."
NEW         Line 8: Tr(a) @w_super
\end{verbatim}

\subsubsection{Move 9 (Branch A,
closure)}\label{move-9-branch-a-closure}

\begin{verbatim}
BOARD       Branch A: ¬Tr(a) @w_super, Tr(a) @w_super
MOVE        Detect contradiction
SYMBOLS     ⊥ = contradiction
WHY         ¬Tr(a) and Tr(a) cannot hold simultaneously.
PLAIN       "Contradiction: a satisfies the Trinity and does not
            satisfy it."
NEW         ⊥ — Branch A closes.
\end{verbatim}

\subsubsection{Move 10 (Branch B)}\label{move-10-branch-b}

\begin{verbatim}
BOARD       Branch B: w0 ≠ w_super
MOVE        Apply ASP5
SYMBOLS     ASP5 := ∀v (v ≠ w_super → w_super R v)
            ∀-rule: ∀v A → A[w0/v]
            →-rule (Modus Ponens): from A and A → B follows B
WHY         ASP5 is available as a formula. The ∀-rule makes it
            (w0 ≠ w_super → w_super R w0). With w0 ≠ w_super follows
            w_super R w0 (Modus Ponens).
PLAIN       "Because w0 is not w_super, w0 is accessible from w_super."
NEW         Line 10: w_super R w0
\end{verbatim}

\subsubsection{Move 11 (Branch B,
continuation)}\label{move-11-branch-b-continuation}

\begin{verbatim}
BOARD       Branch B: w_super R w0
MOVE        Apply ASP4
SYMBOLS     ASP4 := ∀v (w_super R v → ∀x Tr(x) @v)
            ∀-rule: ∀v A → A[w0/v]
            →-rule (Modus Ponens): from A and A → B follows B
WHY         ASP4 is available as a formula. The ∀-rule makes it
            (w_super R w0 → ∀x Tr(x) @w0). With w_super R w0 follows
            ∀x Tr(x) @w0 (Modus Ponens).
PLAIN       "Because w0 is accessible from w_super, in w0:
            for all x the Trinity."
NEW         Line 11: ∀x Tr(x) @w0
\end{verbatim}

\subsubsection{Move 12 (Branch B,
continuation)}\label{move-12-branch-b-continuation}

\begin{verbatim}
BOARD       Branch B: ∀x Tr(x) @w0
MOVE        Apply ∀-rule
SYMBOLS     ∀-rule: ∀x A → A[a/x]
WHY         The formula has the form ∀x A. The ∀-rule makes it
            Tr(a) @w0.
PLAIN       "In w0: a satisfies the Trinity."
NEW         Line 12: Tr(a) @w0
\end{verbatim}

\subsubsection{Move 13 (Branch B,
closure)}\label{move-13-branch-b-closure}

\begin{verbatim}
BOARD       Branch B: Tr(a) @w0, ¬Tr(a) @w0 (from Move 5)
MOVE        Detect contradiction
SYMBOLS     ⊥ = contradiction
WHY         Tr(a) and ¬Tr(a) cannot hold simultaneously.
PLAIN       "Contradiction: a satisfies the Trinity and does not
            satisfy it."
NEW         ⊥ — Branch B closes.
\end{verbatim}

\subsubsection{Final Result of Proof B}\label{final-result-of-proof-b}

\begin{verbatim}
BOARD       Both branches (A and B) close.
PLAIN       The assumption ¬□∀x Tr(x) is untenable.
RESULT      □∀x Tr(x) is derivable.
FORMAL      S5+SP ⊢ □∀x Tr(x)
\end{verbatim}

\begin{center}\rule{0.5\linewidth}{0.5pt}\end{center}

\section{Part III --- The Metalogical
Consequence}\label{part-iii-the-metalogical-consequence}

\subsection{1. What Remains, What Falls}\label{what-remains-what-falls}

\begin{verbatim}
S5 ⊬ □∀x Tr(x)          (Proof A, open tableau)
S5+SP ⊢ □∀x Tr(x)        (Proof B, closed tableau)
\end{verbatim}

\textbf{The decisive formulation:}

\begin{quote}
The bridge from the \textbf{existence} of the Trinity in \textbf{one}
world (w\_super) to the \textbf{necessity} of the Trinity in
\textbf{all} worlds is \textbf{not a theorem of S5}. It must be
introduced as an \textbf{additional metaphysical assumption} --- in the
form of the superposition axioms ASP3--ASP5.
\end{quote}

\textbf{What this does not mean:}

\begin{itemize}
\tightlist
\item
  It does \textbf{not} mean that the Trinity is false.
\item
  It does \textbf{not} mean that the superposition axioms are true.
\item
  It does \textbf{not} mean that S5 is incomplete (S5 is complete).
\end{itemize}

\textbf{What this means:}

\begin{itemize}
\tightlist
\item
  It means: The axioms A1--A15 are too weak.
\item
  It means: One needs additional assumptions.
\item
  It means: These assumptions are metaphysical, not logical.
\end{itemize}

\subsection{2. Minimality (Modal 6)}\label{minimality-modal-6}

\textbf{ASP1 is redundant} --- it follows from ASP2 in S5. \textbf{Proof
in plain language:} ASP2 says: ``Consciousness exists only in
w\_super.'' If one applies this to w\_super itself, it follows:
Consciousness exists in w\_super. That is ASP1.

\textbf{ASP3, ASP4, ASP5 are indispensable} --- without one of them, the
Trinity is not derivable. Modal 6 constructs a countermodel for each of
the three.

\textbf{The minimal subset for the Trinity:} \{ASP3, ASP4, ASP5\}.
\textbf{The minimal subset for the superposition intuition:} \{ASP1,
\ldots, ASP5\}.

\subsection{3. Non-Uniqueness (Modal 7)}\label{non-uniqueness-modal-7}

There are \textbf{at least four} systematically different extensions
that all derive the Trinity:

\begin{enumerate}
\def\labelenumi{\arabic{enumi}.}
\tightlist
\item
  \textbf{Superposition} (ASP1--ASP5).
\item
  \textbf{Topology} (TOP1--TOP5) --- limit axioms.
\item
  \textbf{Temporality} (T1--T4) --- time modes.
\item
  \textbf{Mereology} (MER1--MER5) --- part-whole axioms.
\end{enumerate}

The Trinity is \textbf{axiom-invariant}. The choice of extension is a
metaphysical, physical, or hermeneutic question --- not a metalogical
one.

\subsection{4. Topology (Modal 8) --- the L1--L7
Axioms}\label{topology-modal-8-the-l1l7-axioms}

\textbf{The picture:} An observer in the middle, neighborhoods as
circles around him, the horizon as limit far outside.

\begin{itemize}
\tightlist
\item
  \textbf{L1, L2:} What appears at the horizon is at least possible.
\item
  \textbf{L3, L4:} The horizon inherits the logical structure.
\item
  \textbf{L5, L6:} What appears at the horizon also appears in the
  circles.
\item
  \textbf{L7:} What appears in the circles also appears to the observer.
\end{itemize}

\textbf{Formally:} L1--L7 govern the operator L (L\_inf, L\_sup). With
them: S5+SP+L ⊢ □∀x Tr(x). The topological extension adds \textbf{no new
metaphysical assumptions} --- it only refines the language.

\begin{center}\rule{0.5\linewidth}{0.5pt}\end{center}

\section{Afterword}\label{afterword}

You have read this file. You have followed the proof move by move, with
symbol explanation at every step and plain language for every statement.
Perhaps you can now \textbf{understand} the proof, even if you could not
\textbf{conduct} it yourself. That is the goal of this file.

What remains is the insight: The Trinity does not follow from S5 alone.
It follows from S5 plus superposition axioms. The bridge from existence
to necessity is not a theorem of S5 --- it is a metaphysical assumption.

The further topics (Modal 8 complete, Modal 9--17) will be delivered in
the same form as md files.

\emph{This file was written in the spirit of strict modal logic, yet in
the language of a chess journalist --- for the proof requires both: the
precision of the formula and the vividness of the move.}

\end{document}
