PM ✱1 (about the system): soundness of ✱1 for two-valued truth tables
ProvedPM.meta_soundDRAFT — part of an in-progress public formalization of Principia Mathematica; it may still change, and every change is dated in the project's change log.
Soundness of the primitive system ✱1 of Principia Mathematica.
Let be a formula of PM's propositional calculus (built from propositional variables by and ; , , are PM's definitions ✱1·01, ✱3·01, ✱4·01). A valuation assigns a truth value to every propositional variable; is the truth value of computed by the usual tables ( is negation, is inclusive or). If is a theorem of ✱1 (derivable from ✱1·2–✱1·6 by ✱1·1), then
This is not a proposition of PM; it is a result about PM's system. It turns a falsifying valuation into a proof that a formula is not a theorem, which is how transcription errors in the source text are detected (the card PM.meta_perm_variant_not_thm).
Formalization Note PM.F.eval v φ : Bool is the truth-table value; valuations are functions from variable names (strings) to Bool.
Source: PM.sound.
import Definitions.Def_PM_core_star1_system open PM
theorem PM.meta_sound {p : F} (h : Thm p) : ∀ v, p.eval v = true := by sorry