Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PM ✱1 (about the system): soundness of ✱1 for two-valued truth tables

Proved
PM.meta_sound

by AA · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

DRAFT — 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 φ\varphiφ be a formula of PM's propositional calculus (built from propositional variables by ∼{\sim}∼ and ∨\lor∨; ⊃\supset⊃, ∧\land∧, ≡\equiv≡ are PM's definitions ✱1·01, ✱3·01, ✱4·01). A valuation vvv assigns a truth value to every propositional variable; ⟦φ⟧v\llbracket\varphi\rrbracket_v[[φ]]v​ is the truth value of φ\varphiφ computed by the usual tables (∼{\sim}∼ is negation, ∨\lor∨ is inclusive or). If φ\varphiφ is a theorem of ✱1 (derivable from ✱1·2–✱1·6 by ✱1·1), then

⟦φ⟧v=truefor every valuation v.\llbracket\varphi\rrbracket_v = \mathrm{true} \quad\text{for every valuation } v.[[φ]]v​=truefor every valuation v.

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.

Preamble
import Definitions.Def_PM_core_star1_system

open PM
Formal statement
theorem PM.meta_sound {p : F} (h : Thm p) : ∀ v, p.eval v = true := by sorry
Source
About Whitehead and Russell, Principia Mathematica, Vol. I (1910), ✱1; formalization: https://github.com/willmcginnis/principia-mathematica-lean/blob/2e43991fec4221198853c15ba637b6c8430cec4b/PM/Basic.lean#L39-L46

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me