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

Theorem ni32 484
Description: Equivalence for Kalmbach implication.
Assertion
Ref Expression
ni32 (a ->3 b)_|_ = ((a v b) ^ ((a ^ b_|_) v (a_|_ ^ (a v b_|_))))

Proof of Theorem ni32
StepHypRef Expression
1 df2i3 480 . . 3 (a ->3 b) = ((a_|_ ^ b_|_) v ((a_|_ v b) ^ (a v (a_|_ ^ b))))
2 oran 79 . . . 4 ((a_|_ ^ b_|_) v ((a_|_ v b) ^ (a v (a_|_ ^ b)))) = ((a_|_ ^ b_|_)_|_ ^ ((a_|_ v b) ^ (a v (a_|_ ^ b)))_|_)_|_
3 oran 79 . . . . . . 7 (a v b) = (a_|_ ^ b_|_)_|_
4 oran 79 . . . . . . . 8 ((a ^ b_|_) v (a_|_ ^ (a v b_|_))) = ((a ^ b_|_)_|_ ^ (a_|_ ^ (a v b_|_))_|_)_|_
5 anor1 80 . . . . . . . . . . . . 13 (a ^ b_|_) = (a_|_ v b)_|_
65con2 64 . . . . . . . . . . . 12 (a ^ b_|_)_|_ = (a_|_ v b)
76ax-r1 34 . . . . . . . . . . 11 (a_|_ v b) = (a ^ b_|_)_|_
8 oran 79 . . . . . . . . . . . 12 (a v (a_|_ ^ b)) = (a_|_ ^ (a_|_ ^ b)_|_)_|_
9 anor2 81 . . . . . . . . . . . . . . 15 (a_|_ ^ b) = (a v b_|_)_|_
109con2 64 . . . . . . . . . . . . . 14 (a_|_ ^ b)_|_ = (a v b_|_)
1110lan 70 . . . . . . . . . . . . 13 (a_|_ ^ (a_|_ ^ b)_|_) = (a_|_ ^ (a v b_|_))
1211ax-r4 36 . . . . . . . . . . . 12 (a_|_ ^ (a_|_ ^ b)_|_)_|_ = (a_|_ ^ (a v b_|_))_|_
138, 12ax-r2 35 . . . . . . . . . . 11 (a v (a_|_ ^ b)) = (a_|_ ^ (a v b_|_))_|_
147, 132an 72 . . . . . . . . . 10 ((a_|_ v b) ^ (a v (a_|_ ^ b))) = ((a ^ b_|_)_|_ ^ (a_|_ ^ (a v b_|_))_|_)
1514ax-r1 34 . . . . . . . . 9 ((a ^ b_|_)_|_ ^ (a_|_ ^ (a v b_|_))_|_) = ((a_|_ v b) ^ (a v (a_|_ ^ b)))
1615ax-r4 36 . . . . . . . 8 ((a ^ b_|_)_|_ ^ (a_|_ ^ (a v b_|_))_|_)_|_ = ((a_|_ v b) ^ (a v (a_|_ ^ b)))_|_
174, 16ax-r2 35 . . . . . . 7 ((a ^ b_|_) v (a_|_ ^ (a v b_|_))) = ((a_|_ v b) ^ (a v (a_|_ ^ b)))_|_
183, 172an 72 . . . . . 6 ((a v b) ^ ((a ^ b_|_) v (a_|_ ^ (a v b_|_)))) = ((a_|_ ^ b_|_)_|_ ^ ((a_|_ v b) ^ (a v (a_|_ ^ b)))_|_)
1918ax-r1 34 . . . . 5 ((a_|_ ^ b_|_)_|_ ^ ((a_|_ v b) ^ (a v (a_|_ ^ b)))_|_) = ((a v b) ^ ((a ^ b_|_) v (a_|_ ^ (a v b_|_))))
2019ax-r4 36 . . . 4 ((a_|_ ^ b_|_)_|_ ^ ((a_|_ v b) ^ (a v (a_|_ ^ b)))_|_)_|_ = ((a v b) ^ ((a ^ b_|_) v (a_|_ ^ (a v b_|_))))_|_
212, 20ax-r2 35 . . 3 ((a_|_ ^ b_|_) v ((a_|_ v b) ^ (a v (a_|_ ^ b)))) = ((a v b) ^ ((a ^ b_|_) v (a_|_ ^ (a v b_|_))))_|_
221, 21ax-r2 35 . 2 (a ->3 b) = ((a v b) ^ ((a ^ b_|_) v (a_|_ ^ (a v b_|_))))_|_
2322con2 64 1 (a ->3 b)_|_ = ((a v b) ^ ((a ^ b_|_) v (a_|_ ^ (a v b_|_))))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->3 wi3 15
This theorem is referenced by:  oi3ai3 485  i3con 533
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i3 45  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org