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

Theorem i3orlem8 541
Description: Lemma for Kalmbach implication OR builder.
Assertion
Ref Expression
i3orlem8 (((a v b) ^ (a v b_|_)) ^ a_|_) =< ((a ->3 b)_|_ v ((a v c) ->3 (b v c)))

Proof of Theorem i3orlem8
StepHypRef Expression
1 anass 69 . . . . . 6 (((a v b) ^ (a v b_|_)) ^ a_|_) = ((a v b) ^ ((a v b_|_) ^ a_|_))
2 ancom 68 . . . . . . 7 ((a v b_|_) ^ a_|_) = (a_|_ ^ (a v b_|_))
32lan 70 . . . . . 6 ((a v b) ^ ((a v b_|_) ^ a_|_)) = ((a v b) ^ (a_|_ ^ (a v b_|_)))
41, 3ax-r2 35 . . . . 5 (((a v b) ^ (a v b_|_)) ^ a_|_) = ((a v b) ^ (a_|_ ^ (a v b_|_)))
5 leor 151 . . . . 5 ((a v b) ^ (a_|_ ^ (a v b_|_))) =< (((a v b) ^ ((a ^ b_|_) v (a ^ b))) v ((a v b) ^ (a_|_ ^ (a v b_|_))))
64, 5bltr 130 . . . 4 (((a v b) ^ (a v b_|_)) ^ a_|_) =< (((a v b) ^ ((a ^ b_|_) v (a ^ b))) v ((a v b) ^ (a_|_ ^ (a v b_|_))))
7 i3n1 241 . . . . . . 7 (a_|_ ->3 b_|_) = (((a ^ b_|_) v (a ^ b)) v (a_|_ ^ (a v b_|_)))
87lan 70 . . . . . 6 ((a v b) ^ (a_|_ ->3 b_|_)) = ((a v b) ^ (((a ^ b_|_) v (a ^ b)) v (a_|_ ^ (a v b_|_))))
9 comor1 443 . . . . . . . . 9 (a v b) C a
10 comor2 444 . . . . . . . . . 10 (a v b) C b
1110comcom2 175 . . . . . . . . 9 (a v b) C b_|_
129, 11com2an 466 . . . . . . . 8 (a v b) C (a ^ b_|_)
139, 10com2an 466 . . . . . . . 8 (a v b) C (a ^ b)
1412, 13com2or 465 . . . . . . 7 (a v b) C ((a ^ b_|_) v (a ^ b))
159comcom2 175 . . . . . . . 8 (a v b) C a_|_
169, 11com2or 465 . . . . . . . 8 (a v b) C (a v b_|_)
1715, 16com2an 466 . . . . . . 7 (a v b) C (a_|_ ^ (a v b_|_))
1814, 17fh1 451 . . . . . 6 ((a v b) ^ (((a ^ b_|_) v (a ^ b)) v (a_|_ ^ (a v b_|_)))) = (((a v b) ^ ((a ^ b_|_) v (a ^ b))) v ((a v b) ^ (a_|_ ^ (a v b_|_))))
198, 18ax-r2 35 . . . . 5 ((a v b) ^ (a_|_ ->3 b_|_)) = (((a v b) ^ ((a ^ b_|_) v (a ^ b))) v ((a v b) ^ (a_|_ ^ (a v b_|_))))
2019ax-r1 34 . . . 4 (((a v b) ^ ((a ^ b_|_) v (a ^ b))) v ((a v b) ^ (a_|_ ^ (a v b_|_)))) = ((a v b) ^ (a_|_ ->3 b_|_))
216, 20lbtr 131 . . 3 (((a v b) ^ (a v b_|_)) ^ a_|_) =< ((a v b) ^ (a_|_ ->3 b_|_))
2221ler 141 . 2 (((a v b) ^ (a v b_|_)) ^ a_|_) =< (((a v b) ^ (a_|_ ->3 b_|_)) v ((a v c) ->3 (b v c)))
23 i3orlem6 539 . . 3 ((a ->3 b)_|_ v ((a v c) ->3 (b v c))) = (((a v b) ^ (a_|_ ->3 b_|_)) v ((a v c) ->3 (b v c)))
2423ax-r1 34 . 2 (((a v b) ^ (a_|_ ->3 b_|_)) v ((a v c) ->3 (b v c))) = ((a ->3 b)_|_ v ((a v c) ->3 (b v c)))
2522, 24lbtr 131 1 (((a v b) ^ (a v b_|_)) ^ a_|_) =< ((a ->3 b)_|_ v ((a v c) ->3 (b v c)))
Colors of variables: term
Syntax hints:   =< wle 2  _|_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