Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  peirce Unicode version

Theorem peirce 174
 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 5 through ax-3 7. A curious fact about this theorem is that it requires ax-3 7 for its proof even though the result has no negation connectives in it. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 9-Oct-2012.)
Assertion
Ref Expression
peirce

Proof of Theorem peirce
StepHypRef Expression
1 simplim 145 . 2
2 id 20 . 2
31, 2ja 155 1
 Colors of variables: wff set class Syntax hints:   wi 4 This theorem is referenced by:  looinv  175  tbw-ax3  1473  exmoeu  2296  tb-ax3  26034 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
 Copyright terms: Public domain W3C validator