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

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

Proof of Theorem i3n2
StepHypRef Expression
1 df2i3 480 . 2 (a_|_ ->3 b_|_) = ((a_|__|_ ^ b_|__|_) v ((a_|__|_ v b_|_) ^ (a_|_ 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_|__|_)
52ax-r5 37 . . . . 5 (a v b_|_) = (a_|__|_ v b_|_)
62ran 71 . . . . . 6 (a ^ b_|_) = (a_|__|_ ^ b_|_)
76lor 66 . . . . 5 (a_|_ v (a ^ b_|_)) = (a_|_ v (a_|__|_ ^ b_|_))
85, 72an 72 . . . 4 ((a v b_|_) ^ (a_|_ v (a ^ b_|_))) = ((a_|__|_ v b_|_) ^ (a_|_ v (a_|__|_ ^ b_|_)))
94, 82or 67 . . 3 ((a ^ b) v ((a v b_|_) ^ (a_|_ v (a ^ b_|_)))) = ((a_|__|_ ^ b_|__|_) v ((a_|__|_ v b_|_) ^ (a_|_ v (a_|__|_ ^ b_|_))))
109ax-r1 34 . 2 ((a_|__|_ ^ b_|__|_) v ((a_|__|_ v b_|_) ^ (a_|_ v (a_|__|_ ^ b_|_)))) = ((a ^ b) v ((a v b_|_) ^ (a_|_ v (a ^ b_|_))))
111, 10ax-r2 35 1 (a_|_ ->3 b_|_) = ((a ^ b) v ((a v b_|_) ^ (a_|_ v (a ^ b_|_))))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->3 wi3 15
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