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

Theorem biao 781
Description: Equivalence to biconditional.
Assertion
Ref Expression
biao (a == b) = ((a ^ b) == (a v b))

Proof of Theorem biao
StepHypRef Expression
1 leao1 154 . . . . 5 (a ^ b) =< (a v b)
21df2le2 128 . . . 4 ((a ^ b) ^ (a v b)) = (a ^ b)
32ax-r1 34 . . 3 (a ^ b) = ((a ^ b) ^ (a v b))
4 anor3 82 . . . 4 (a_|_ ^ b_|_) = (a v b)_|_
51lecon 146 . . . . . 6 (a v b)_|_ =< (a ^ b)_|_
6 oridm 102 . . . . . . 7 ((a v b)_|_ v (a v b)_|_) = (a v b)_|_
76df-le1 122 . . . . . 6 (a v b)_|_ =< (a v b)_|_
85, 7ler2an 165 . . . . 5 (a v b)_|_ =< ((a ^ b)_|_ ^ (a v b)_|_)
9 lear 153 . . . . . . 7 ((a ^ b)_|_ ^ (a v b)_|_) =< (a v b)_|_
109df-le2 123 . . . . . 6 (((a ^ b)_|_ ^ (a v b)_|_) v (a v b)_|_) = (a v b)_|_
1110df-le1 122 . . . . 5 ((a ^ b)_|_ ^ (a v b)_|_) =< (a v b)_|_
128, 11lebi 137 . . . 4 (a v b)_|_ = ((a ^ b)_|_ ^ (a v b)_|_)
134, 12ax-r2 35 . . 3 (a_|_ ^ b_|_) = ((a ^ b)_|_ ^ (a v b)_|_)
143, 132or 67 . 2 ((a ^ b) v (a_|_ ^ b_|_)) = (((a ^ b) ^ (a v b)) v ((a ^ b)_|_ ^ (a v b)_|_))
15 dfb 86 . 2 (a == b) = ((a ^ b) v (a_|_ ^ b_|_))
16 dfb 86 . 2 ((a ^ b) == (a v b)) = (((a ^ b) ^ (a v b)) v ((a ^ b)_|_ ^ (a v b)_|_))
1714, 15, 163tr1 60 1 (a == b) = ((a ^ b) == (a v b))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7
This theorem is referenced by:  mlaconj4 826
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-le1 122  df-le2 123
metamath.org