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

Theorem mloa 998
Description: Mladen's OA
Assertion
Ref Expression
mloa ((a == b) ^ ((b == c) v ((b v (a == b)) ^ (c v (a == c))))) =< (c v (a == c))

Proof of Theorem mloa
StepHypRef Expression
1 lea 152 . . . 4 ((a ->2 b) ^ (b ->2 a)) =< (a ->2 b)
2 ax-a3 31 . . . . . 6 (((b ^ c) v (b_|_ ^ c_|_)) v ((a ->2 b) ^ (a ->2 c))) = ((b ^ c) v ((b_|_ ^ c_|_) v ((a ->2 b) ^ (a ->2 c))))
3 or12 73 . . . . . . 7 ((b ^ c) v ((b_|_ ^ c_|_) v ((a ->2 b) ^ (a ->2 c)))) = ((b_|_ ^ c_|_) v ((b ^ c) v ((a ->2 b) ^ (a ->2 c))))
4 anor3 82 . . . . . . . 8 (b_|_ ^ c_|_) = (b v c)_|_
54ax-r5 37 . . . . . . 7 ((b_|_ ^ c_|_) v ((b ^ c) v ((a ->2 b) ^ (a ->2 c)))) = ((b v c)_|_ v ((b ^ c) v ((a ->2 b) ^ (a ->2 c))))
63, 5ax-r2 35 . . . . . 6 ((b ^ c) v ((b_|_ ^ c_|_) v ((a ->2 b) ^ (a ->2 c)))) = ((b v c)_|_ v ((b ^ c) v ((a ->2 b) ^ (a ->2 c))))
72, 6ax-r2 35 . . . . 5 (((b ^ c) v (b_|_ ^ c_|_)) v ((a ->2 b) ^ (a ->2 c))) = ((b v c)_|_ v ((b ^ c) v ((a ->2 b) ^ (a ->2 c))))
8 leo 150 . . . . . . . . 9 b =< (b v (a_|_ ^ b_|_))
9 df-i2 44 . . . . . . . . . 10 (a ->2 b) = (b v (a_|_ ^ b_|_))
109ax-r1 34 . . . . . . . . 9 (b v (a_|_ ^ b_|_)) = (a ->2 b)
118, 10lbtr 131 . . . . . . . 8 b =< (a ->2 b)
12 leo 150 . . . . . . . . 9 c =< (c v (a_|_ ^ c_|_))
13 df-i2 44 . . . . . . . . . 10 (a ->2 c) = (c v (a_|_ ^ c_|_))
1413ax-r1 34 . . . . . . . . 9 (c v (a_|_ ^ c_|_)) = (a ->2 c)
1512, 14lbtr 131 . . . . . . . 8 c =< (a ->2 c)
1611, 15le2an 161 . . . . . . 7 (b ^ c) =< ((a ->2 b) ^ (a ->2 c))
17 id 58 . . . . . . . 8 ((a ->2 b) ^ (a ->2 c)) = ((a ->2 b) ^ (a ->2 c))
1817bile 134 . . . . . . 7 ((a ->2 b) ^ (a ->2 c)) =< ((a ->2 b) ^ (a ->2 c))
1916, 18lel2or 162 . . . . . 6 ((b ^ c) v ((a ->2 b) ^ (a ->2 c))) =< ((a ->2 b) ^ (a ->2 c))
2019lelor 158 . . . . 5 ((b v c)_|_ v ((b ^ c) v ((a ->2 b) ^ (a ->2 c)))) =< ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))
217, 20bltr 130 . . . 4 (((b ^ c) v (b_|_ ^ c_|_)) v ((a ->2 b) ^ (a ->2 c))) =< ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))
221, 21le2an 161 . . 3 (((a ->2 b) ^ (b ->2 a)) ^ (((b ^ c) v (b_|_ ^ c_|_)) v ((a ->2 b) ^ (a ->2 c)))) =< ((a ->2 b) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c))))
23 oal2 979 . . 3 ((a ->2 b) ^ ((b v c)_|_ v ((a ->2 b) ^ (a ->2 c)))) =< (a ->2 c)
2422, 23letr 129 . 2 (((a ->2 b) ^ (b ->2 a)) ^ (((b ^ c) v (b_|_ ^ c_|_)) v ((a ->2 b) ^ (a ->2 c)))) =< (a ->2 c)
25 u2lembi 703 . . 3 ((a ->2 b) ^ (b ->2 a)) = (a == b)
26 dfb 86 . . . . 5 (b == c) = ((b ^ c) v (b_|_ ^ c_|_))
2726ax-r1 34 . . . 4 ((b ^ c) v (b_|_ ^ c_|_)) = (b == c)
28 i2bi 704 . . . . 5 (a ->2 b) = (b v (a == b))
29 i2bi 704 . . . . 5 (a ->2 c) = (c v (a == c))
3028, 292an 72 . . . 4 ((a ->2 b) ^ (a ->2 c)) = ((b v (a == b)) ^ (c v (a == c)))
3127, 302or 67 . . 3 (((b ^ c) v (b_|_ ^ c_|_)) v ((a ->2 b) ^ (a ->2 c))) = ((b == c) v ((b v (a == b)) ^ (c v (a == c))))
3225, 312an 72 . 2 (((a ->2 b) ^ (b ->2 a)) ^ (((b ^ c) v (b_|_ ^ c_|_)) v ((a ->2 b) ^ (a ->2 c)))) = ((a == b) ^ ((b == c) v ((b v (a == b)) ^ (c v (a == c)))))
3324, 32, 29le3tr2 133 1 ((a == b) ^ ((b == c) v ((b v (a == b)) ^ (c v (a == c))))) =< (c v (a == c))
Colors of variables: term
Syntax hints:   =< wle 2  _|_wn 4   == tb 5   v wo 6   ^ wa 7   ->2 wi2 14
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  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  df-c1 124  df-c2 125
metamath.org