Completeness Proof (Section 6.4) #
theorem strmg (X : Sequent) (s : Strategy tableauGame Builder) (h : winning s (startPos X)) :
∃ (WS : Finset (Finset Formula)) (x : ModelGraph WS), ∃ Z ∈ WS, X.toFinset ⊆ Z
Theorem 6.21: If Builder has a winning strategy then there is a model graph.
Uses BuildTree.toModel.
theorem modelExistence {X : Sequent} :
consistent X → ∃ (WS : Finset (Finset Formula)) (x : ModelGraph WS) (W : ↥WS), X.toFinset ⊆ ↑W
Helper for completeness. Uses gameP and strmg.