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

Theorem had0 1393
Description: If the first parameter is false, the half adder is equivalent to the XOR of the other two inputs. (Contributed by Mario Carneiro, 4-Sep-2016.)
Assertion
Ref Expression
had0  |-  ( -. 
ph  ->  (hadd ( ph ,  ps ,  ch )  <->  ( ps \/_ ch )
) )

Proof of Theorem had0
StepHypRef Expression
1 had1 1392 . . 3  |-  ( -. 
ph  ->  (hadd ( -. 
ph ,  -.  ps ,  -.  ch )  <->  ( -.  ps 
<->  -.  ch ) ) )
2 hadnot 1383 . . 3  |-  ( -. hadd
( ph ,  ps ,  ch )  <-> hadd ( -.  ph ,  -.  ps ,  -.  ch ) )
3 df-xor 1296 . . . . 5  |-  ( ( -.  ps \/_  -.  ch )  <->  -.  ( -.  ps 
<->  -.  ch ) )
4 xorneg 1304 . . . . 5  |-  ( ( -.  ps \/_  -.  ch )  <->  ( ps \/_ ch ) )
53, 4bitr3i 242 . . . 4  |-  ( -.  ( -.  ps  <->  -.  ch )  <->  ( ps \/_ ch )
)
65con1bii 321 . . 3  |-  ( -.  ( ps \/_ ch ) 
<->  ( -.  ps  <->  -.  ch )
)
71, 2, 63bitr4g 279 . 2  |-  ( -. 
ph  ->  ( -. hadd ( ph ,  ps ,  ch ) 
<->  -.  ( ps \/_ ch ) ) )
87con4bid 284 1  |-  ( -. 
ph  ->  (hadd ( ph ,  ps ,  ch )  <->  ( ps \/_ ch )
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176   \/_wxo 1295  haddwhad 1368
This theorem is referenced by:  sadadd2lem2  12641  saddisjlem  12655
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 177  df-xor 1296  df-had 1370
  Copyright terms: Public domain W3C validator