HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem peirce 82
Description: Peirce's axiom. This odd-looking theorem is the "difference" between an intuitionistic system of propositional calculus and a classical system and is not accepted by intuitionists. When Peirce's axiom is added to an intuitionistic system, the system becomes equivalent to our classical system ax-1 4 through ax-3 6. A curious fact about this theorem is that it requires ax-3 6 for its proof even though the result has no negation connectives in it.
Assertion
Ref Expression
peirce |- (((ph -> ps) -> ph) -> ph)

Proof of Theorem peirce
StepHypRef Expression
1 pm2.21 76 . . 3 |- (-. ph -> (ph -> ps))
21imim1i 16 . 2 |- (((ph -> ps) -> ph) -> (-. ph -> ph))
3 pm2.18 81 . 2 |- ((-. ph -> ph) -> ph)
42, 3syl 10 1 |- (((ph -> ps) -> ph) -> ph)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3
This theorem is referenced by:  looinv 83  exmoeu 1390
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
Copyright terms: Public domain