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

Theorem bijust 126
Description: Theorem used to justify definition of biconditional df-bi 128. (The proof was shortened by Josh Purinton, 29-Dec-00.)
Assertion
Ref Expression
bijust |- -. ((ph -> ph) -> -. (ph -> ph))

Proof of Theorem bijust
StepHypRef Expression
1 id 9 . 2 |- (ph -> ph)
2 pm2.01 80 . 2 |- (((ph -> ph) -> -. (ph -> ph)) -> -. (ph -> ph))
31, 2mt2 96 1 |- -. ((ph -> ph) -> -. (ph -> ph))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org