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

Theorem test2 785
Description: Part of an attempt to crack a potential Kalmbach axiom.
Assertion
Ref Expression
test2 (a v b) =< ((a == b)_|_ v ((c v (a ^ b)) ^ (c_|_ v (a ^ b))))

Proof of Theorem test2
StepHypRef Expression
1 dfnb 87 . . . . 5 (a == b)_|_ = ((a v b) ^ (a_|_ v b_|_))
2 anidm 103 . . . . 5 ((a ^ b) ^ (a ^ b)) = (a ^ b)
31, 22or 67 . . . 4 ((a == b)_|_ v ((a ^ b) ^ (a ^ b))) = (((a v b) ^ (a_|_ v b_|_)) v (a ^ b))
4 comor1 443 . . . . . . 7 (a v b) C a
5 comor2 444 . . . . . . 7 (a v b) C b
64, 5com2an 466 . . . . . 6 (a v b) C (a ^ b)
74comcom2 175 . . . . . . 7 (a v b) C a_|_
85comcom2 175 . . . . . . 7 (a v b) C b_|_
97, 8com2or 465 . . . . . 6 (a v b) C (a_|_ v b_|_)
106, 9fh4r 458 . . . . 5 (((a v b) ^ (a_|_ v b_|_)) v (a ^ b)) = (((a v b) v (a ^ b)) ^ ((a_|_ v b_|_) v (a ^ b)))
11 ax-a2 30 . . . . . . . 8 ((a v b) v (a ^ b)) = ((a ^ b) v (a v b))
12 lea 152 . . . . . . . . . 10 (a ^ b) =< a
13 leo 150 . . . . . . . . . 10 a =< (a v b)
1412, 13letr 129 . . . . . . . . 9 (a ^ b) =< (a v b)
1514df-le2 123 . . . . . . . 8 ((a ^ b) v (a v b)) = (a v b)
1611, 15ax-r2 35 . . . . . . 7 ((a v b) v (a ^ b)) = (a v b)
17 df-a 39 . . . . . . . . 9 (a ^ b) = (a_|_ v b_|_)_|_
1817lor 66 . . . . . . . 8 ((a_|_ v b_|_) v (a ^ b)) = ((a_|_ v b_|_) v (a_|_ v b_|_)_|_)
19 df-t 40 . . . . . . . . 9 1 = ((a_|_ v b_|_) v (a_|_ v b_|_)_|_)
2019ax-r1 34 . . . . . . . 8 ((a_|_ v b_|_) v (a_|_ v b_|_)_|_) = 1
2118, 20ax-r2 35 . . . . . . 7 ((a_|_ v b_|_) v (a ^ b)) = 1
2216, 212an 72 . . . . . 6 (((a v b) v (a ^ b)) ^ ((a_|_ v b_|_) v (a ^ b))) = ((a v b) ^ 1)
23 an1 98 . . . . . 6 ((a v b) ^ 1) = (a v b)
2422, 23ax-r2 35 . . . . 5 (((a v b) v (a ^ b)) ^ ((a_|_ v b_|_) v (a ^ b))) = (a v b)
2510, 24ax-r2 35 . . . 4 (((a v b) ^ (a_|_ v b_|_)) v (a ^ b)) = (a v b)
263, 25ax-r2 35 . . 3 ((a == b)_|_ v ((a ^ b) ^ (a ^ b))) = (a v b)
2726ax-r1 34 . 2 (a v b) = ((a == b)_|_ v ((a ^ b) ^ (a ^ b)))
28 leor 151 . . . 4 (a ^ b) =< (c v (a ^ b))
29 leor 151 . . . 4 (a ^ b) =< (c_|_ v (a ^ b))
3028, 29le2an 161 . . 3 ((a ^ b) ^ (a ^ b)) =< ((c v (a ^ b)) ^ (c_|_ v (a ^ b)))
3130lelor 158 . 2 ((a == b)_|_ v ((a ^ b) ^ (a ^ b))) =< ((a == b)_|_ v ((c v (a ^ b)) ^ (c_|_ v (a ^ b))))
3227, 31bltr 130 1 (a v b) =< ((a == b)_|_ v ((c v (a ^ b)) ^ (c_|_ v (a ^ b))))
Colors of variables: term
Syntax hints:   =< wle 2  _|_wn 4   == tb 5   v wo 6   ^ wa 7  1wt 9
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-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org