[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem conb 114
Description: Contraposition law.
Assertion
Ref Expression
conb (a == b) = (a_|_ == b_|_)

Proof of Theorem conb
StepHypRef Expression
1 ax-a2 30 . . 3 ((a ^ b) v (a_|_ ^ b_|_)) = ((a_|_ ^ b_|_) v (a ^ b))
2 ax-a1 29 . . . . 5 a = a_|__|_
3 ax-a1 29 . . . . 5 b = b_|__|_
42, 32an 72 . . . 4 (a ^ b) = (a_|__|_ ^ b_|__|_)
54lor 66 . . 3 ((a_|_ ^ b_|_) v (a ^ b)) = ((a_|_ ^ b_|_) v (a_|__|_ ^ b_|__|_))
61, 5ax-r2 35 . 2 ((a ^ b) v (a_|_ ^ b_|_)) = ((a_|_ ^ b_|_) v (a_|__|_ ^ b_|__|_))
7 dfb 86 . 2 (a == b) = ((a ^ b) v (a_|_ ^ b_|_))
8 dfb 86 . 2 (a_|_ == b_|_) = ((a_|_ ^ b_|_) v (a_|__|_ ^ b_|__|_))
96, 7, 83tr1 60 1 (a == b) = (a_|_ == b_|_)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7
This theorem is referenced by:  di 118  wr4 191  wcon 194  wcon1 199  wcon2 200  wwfh3 210  wwfh4 211  ka4lem 221  ska3 224  nomcon5 298  nom55 328  wom2 416  u3lemax4 778  comanbn 855
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-b 38  df-a 39
metamath.org