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

Theorem negantlem9 841
Description: Negated antecedent identity.
Hypothesis
Ref Expression
negant.1 (a ->1 c) = (b ->1 c)
Assertion
Ref Expression
negantlem9 (a ->3 c) =< (b ->3 c)

Proof of Theorem negantlem9
StepHypRef Expression
1 leao4 157 . . . . 5 (a_|_ ^ c) =< (b_|_ v c)
2 leor 151 . . . . . 6 (a_|_ ^ c) =< (a v (a_|_ ^ c))
3 negant.1 . . . . . . . . 9 (a ->1 c) = (b ->1 c)
43sac 817 . . . . . . . 8 (a_|_ ->1 c) = (b_|_ ->1 c)
5 df-i1 43 . . . . . . . . 9 (a_|_ ->1 c) = (a_|__|_ v (a_|_ ^ c))
6 ax-a1 29 . . . . . . . . . . 11 a = a_|__|_
76ax-r5 37 . . . . . . . . . 10 (a v (a_|_ ^ c)) = (a_|__|_ v (a_|_ ^ c))
87ax-r1 34 . . . . . . . . 9 (a_|__|_ v (a_|_ ^ c)) = (a v (a_|_ ^ c))
95, 8ax-r2 35 . . . . . . . 8 (a_|_ ->1 c) = (a v (a_|_ ^ c))
10 df-i1 43 . . . . . . . . 9 (b_|_ ->1 c) = (b_|__|_ v (b_|_ ^ c))
11 ax-a1 29 . . . . . . . . . . 11 b = b_|__|_
1211ax-r5 37 . . . . . . . . . 10 (b v (b_|_ ^ c)) = (b_|__|_ v (b_|_ ^ c))
1312ax-r1 34 . . . . . . . . 9 (b_|__|_ v (b_|_ ^ c)) = (b v (b_|_ ^ c))
1410, 13ax-r2 35 . . . . . . . 8 (b_|_ ->1 c) = (b v (b_|_ ^ c))
154, 9, 143tr2 61 . . . . . . 7 (a v (a_|_ ^ c)) = (b v (b_|_ ^ c))
16 leo 150 . . . . . . . 8 b =< (b v (b_|_ ^ c_|_))
1716leror 144 . . . . . . 7 (b v (b_|_ ^ c)) =< ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c))
1815, 17bltr 130 . . . . . 6 (a v (a_|_ ^ c)) =< ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c))
192, 18letr 129 . . . . 5 (a_|_ ^ c) =< ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c))
201, 19ler2an 165 . . . 4 (a_|_ ^ c) =< ((b_|_ v c) ^ ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c)))
21 leao1 154 . . . . . 6 (a_|_ ^ c_|_) =< (a_|_ v c)
223negantlem8 838 . . . . . 6 (a_|_ v c) = (b_|_ v c)
2321, 22lbtr 131 . . . . 5 (a_|_ ^ c_|_) =< (b_|_ v c)
243negantlem5 835 . . . . . 6 (a_|_ ^ c_|_) = (b_|_ ^ c_|_)
25 leor 151 . . . . . . 7 (b_|_ ^ c_|_) =< (b v (b_|_ ^ c_|_))
2625ler 141 . . . . . 6 (b_|_ ^ c_|_) =< ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c))
2724, 26bltr 130 . . . . 5 (a_|_ ^ c_|_) =< ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c))
2823, 27ler2an 165 . . . 4 (a_|_ ^ c_|_) =< ((b_|_ v c) ^ ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c)))
2920, 28lel2or 162 . . 3 ((a_|_ ^ c) v (a_|_ ^ c_|_)) =< ((b_|_ v c) ^ ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c)))
30 lear 153 . . . . 5 (a ^ (a_|_ v c)) =< (a_|_ v c)
3130, 22lbtr 131 . . . 4 (a ^ (a_|_ v c)) =< (b_|_ v c)
32 leo 150 . . . . . . 7 a =< (a v (a_|_ ^ c))
3332, 15lbtr 131 . . . . . 6 a =< (b v (b_|_ ^ c))
3433, 17letr 129 . . . . 5 a =< ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c))
3534lel 143 . . . 4 (a ^ (a_|_ v c)) =< ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c))
3631, 35ler2an 165 . . 3 (a ^ (a_|_ v c)) =< ((b_|_ v c) ^ ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c)))
3729, 36lel2or 162 . 2 (((a_|_ ^ c) v (a_|_ ^ c_|_)) v (a ^ (a_|_ v c))) =< ((b_|_ v c) ^ ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c)))
38 df-i3 45 . 2 (a ->3 c) = (((a_|_ ^ c) v (a_|_ ^ c_|_)) v (a ^ (a_|_ v c)))
39 dfi3b 481 . 2 (b ->3 c) = ((b_|_ v c) ^ ((b v (b_|_ ^ c_|_)) v (b_|_ ^ c)))
4037, 38, 39le3tr1 132 1 (a ->3 c) =< (b ->3 c)
Colors of variables: term
Syntax hints:   = wb 1   =< wle 2  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13   ->3 wi3 15
This theorem is referenced by:  negant3 842
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-i1 43  df-i3 45  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org