PM ✱2·1:
ProvedPM.star2_1DRAFT — 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.
Principia Mathematica ✱2·1: Whitehead and Russell, Principia Mathematica, Vol. I (1910), Part I, Section A, p. 105. PM prints (Gutenberg #78050 transcription):
Formulas of PM's propositional calculus are built from propositional variables by negation and disjunction , PM's two primitive ideas (✱1). Implication, conjunction and equivalence are PM's definitions: is (✱1·01), (PM writes ) is (✱3·01), and is (✱4·01). A theorem of ✱1 is a formula derivable from the primitive propositions ✱1·2–✱1·6 by the rule of inference ✱1·1 (from and , infer ).
For every formula , the formula
is a theorem of ✱1.
It is one of the propositions of ✱2 from which PM builds the propositional calculus used throughout the work.
Formalization Note Deep embedding of PM ✱1: formulas are the inductive type PM.F (variables named by strings), the theorems of ✱1 are the inductive predicate PM.Thm, whose constructors are ✱1·1–✱1·6, and ✱1·01, ✱3·01, ✱4·01 are reducible definitions (F.imp, F.and, F.iff), so PM's definitions hold by definition. The statement formula is the definition PM.s2_1 of the bundle PM_core_statement_formulas. Brackets are written out in full here in place of PM's dots.
Lean/Mathlib counterpart: em' (Mathlib at 0df444a; its proof is classical). It states the same law for Lean's own propositions, connective for connective.
Source: PM.t2_1 in PM/Replay.lean at commit 2e43991fec42.
import Definitions.Def_PM_core_star1_system import Definitions.Def_PM_core_statement_formulas open PM open F
theorem PM.star2_1 (p : F) : Thm (s2_1 p) := by sorry