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

Theorem oalem1 985
Description: Lemma
Assertion
Ref Expression
oalem1 ((b v c) v ((b v c)_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c))))))) =< (a ->2 (b v c))

Proof of Theorem oalem1
StepHypRef Expression
1 anidm 103 . . . . . . . . 9 (b_|_ ^ b_|_) = b_|_
21ran 71 . . . . . . . 8 ((b_|_ ^ b_|_) ^ c_|_) = (b_|_ ^ c_|_)
32ax-r1 34 . . . . . . 7 (b_|_ ^ c_|_) = ((b_|_ ^ b_|_) ^ c_|_)
4 anor3 82 . . . . . . 7 (b_|_ ^ c_|_) = (b v c)_|_
5 an32 76 . . . . . . . 8 ((b_|_ ^ b_|_) ^ c_|_) = ((b_|_ ^ c_|_) ^ b_|_)
64ran 71 . . . . . . . 8 ((b_|_ ^ c_|_) ^ b_|_) = ((b v c)_|_ ^ b_|_)
75, 6ax-r2 35 . . . . . . 7 ((b_|_ ^ b_|_) ^ c_|_) = ((b v c)_|_ ^ b_|_)
83, 4, 73tr2 61 . . . . . 6 (b v c)_|_ = ((b v c)_|_ ^ b_|_)
98ran 71 . . . . 5 ((b v c)_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))))) = (((b v c)_|_ ^ b_|_) ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c))))))
10 anass 69 . . . . . 6 (((b v c)_|_ ^ b_|_) ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))))) = ((b v c)_|_ ^ (b_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))))))
11 oalii 982 . . . . . . 7 (b_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))))) =< a_|_
1211lelan 159 . . . . . 6 ((b v c)_|_ ^ (b_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c))))))) =< ((b v c)_|_ ^ a_|_)
1310, 12bltr 130 . . . . 5 (((b v c)_|_ ^ b_|_) ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))))) =< ((b v c)_|_ ^ a_|_)
149, 13bltr 130 . . . 4 ((b v c)_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))))) =< ((b v c)_|_ ^ a_|_)
15 ancom 68 . . . 4 ((b v c)_|_ ^ a_|_) = (a_|_ ^ (b v c)_|_)
1614, 15lbtr 131 . . 3 ((b v c)_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))))) =< (a_|_ ^ (b v c)_|_)
1716lelor 158 . 2 ((b v c) v ((b v c)_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c))))))) =< ((b v c) v (a_|_ ^ (b v c)_|_))
18 df-i2 44 . . 3 (a ->2 (b v c)) = ((b v c) v (a_|_ ^ (b v c)_|_))
1918ax-r1 34 . 2 ((b v c) v (a_|_ ^ (b v c)_|_)) = (a ->2 (b v c))
2017, 19lbtr 131 1 ((b v c) v ((b v c)_|_ ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c))))))) =< (a ->2 (b v c))
Colors of variables: term
Syntax hints:   =< wle 2  _|_wn 4   v wo 6   ^ wa 7   ->2 wi2 14
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  ax-r3 421  ax-3oa 978
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-le1 122  df-le2 123
metamath.org