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

Theorem nannan 1451
Description: Lemma for handling nested 'nand's. (Contributed by Jeff Hoffman, 19-Nov-2007.) (Proof shortened by Wolf Lammen, 7-Mar-2020.)
Assertion
Ref Expression
nannan  |-  ( (
ph  -/\  ( ch  -/\  ps ) )  <->  ( ph  ->  ( ch  /\  ps ) ) )

Proof of Theorem nannan
StepHypRef Expression
1 imnan 438 . 2  |-  ( (
ph  ->  -.  ( ch  -/\ 
ps ) )  <->  -.  ( ph  /\  ( ch  -/\  ps ) ) )
2 nanan 1449 . . 3  |-  ( ( ch  /\  ps )  <->  -.  ( ch  -/\  ps )
)
32imbi2i 326 . 2  |-  ( (
ph  ->  ( ch  /\  ps ) )  <->  ( ph  ->  -.  ( ch  -/\  ps ) ) )
4 df-nan 1448 . 2  |-  ( (
ph  -/\  ( ch  -/\  ps ) )  <->  -.  ( ph  /\  ( ch  -/\  ps ) ) )
51, 3, 43bitr4ri 293 1  |-  ( (
ph  -/\  ( ch  -/\  ps ) )  <->  ( ph  ->  ( ch  /\  ps ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 196    /\ wa 384    -/\ wnan 1447
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 197  df-an 386  df-nan 1448
This theorem is referenced by:  nanim  1452  nanbi  1454  nic-mp  1596  nic-ax  1598  waj-ax  32413  lukshef-ax2  32414  arg-ax  32415  rp-fakenanass  37860
  Copyright terms: Public domain W3C validator