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

Theorem u2lemanb 598
Description: Lemma for Dishkant implication study.
Assertion
Ref Expression
u2lemanb ((a ->2 b) ^ b_|_) = (a_|_ ^ b_|_)

Proof of Theorem u2lemanb
StepHypRef Expression
1 df-i2 44 . . 3 (a ->2 b) = (b v (a_|_ ^ b_|_))
21ran 71 . 2 ((a ->2 b) ^ b_|_) = ((b v (a_|_ ^ b_|_)) ^ b_|_)
3 comid 179 . . . . 5 b C b
43comcom3 436 . . . 4 b_|_ C b
5 comanr2 447 . . . 4 b_|_ C (a_|_ ^ b_|_)
64, 5fh1r 455 . . 3 ((b v (a_|_ ^ b_|_)) ^ b_|_) = ((b ^ b_|_) v ((a_|_ ^ b_|_) ^ b_|_))
7 ax-a2 30 . . . 4 ((b ^ b_|_) v ((a_|_ ^ b_|_) ^ b_|_)) = (((a_|_ ^ b_|_) ^ b_|_) v (b ^ b_|_))
8 anass 69 . . . . . . 7 ((a_|_ ^ b_|_) ^ b_|_) = (a_|_ ^ (b_|_ ^ b_|_))
9 anidm 103 . . . . . . . 8 (b_|_ ^ b_|_) = b_|_
109lan 70 . . . . . . 7 (a_|_ ^ (b_|_ ^ b_|_)) = (a_|_ ^ b_|_)
118, 10ax-r2 35 . . . . . 6 ((a_|_ ^ b_|_) ^ b_|_) = (a_|_ ^ b_|_)
12 dff 93 . . . . . . 7 0 = (b ^ b_|_)
1312ax-r1 34 . . . . . 6 (b ^ b_|_) = 0
1411, 132or 67 . . . . 5 (((a_|_ ^ b_|_) ^ b_|_) v (b ^ b_|_)) = ((a_|_ ^ b_|_) v 0)
15 or0 94 . . . . 5 ((a_|_ ^ b_|_) v 0) = (a_|_ ^ b_|_)
1614, 15ax-r2 35 . . . 4 (((a_|_ ^ b_|_) ^ b_|_) v (b ^ b_|_)) = (a_|_ ^ b_|_)
177, 16ax-r2 35 . . 3 ((b ^ b_|_) v ((a_|_ ^ b_|_) ^ b_|_)) = (a_|_ ^ b_|_)
186, 17ax-r2 35 . 2 ((b v (a_|_ ^ b_|_)) ^ b_|_) = (a_|_ ^ b_|_)
192, 18ax-r2 35 1 ((a ->2 b) ^ b_|_) = (a_|_ ^ b_|_)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  0wf 10   ->2 wi2 14
This theorem is referenced by:  u2lemnob 653  u21lembi 709  bi3 821  bi4 822  imp3 823  oal42 915  oa23 916
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-i2 44  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org