QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  dp41lemm Unicode version

Theorem dp41lemm 1192
Description: Part of proof (4)=>(1) in Day/Pickering 1982.
Hypotheses
Ref Expression
dp41lem.1 c0 = ((a1 v a2) ^ (b1 v b2))
dp41lem.2 c1 = ((a0 v a2) ^ (b0 v b2))
dp41lem.3 c2 = ((a0 v a1) ^ (b0 v b1))
dp41lem.4 p = (((a0 v b0) ^ (a1 v b1)) ^ (a2 v b2))
dp41lem.5 p2 = ((a0 v b0) ^ (a1 v b1))
dp41lem.6 p2 =< (a2 v b2)
Assertion
Ref Expression
dp41lemm c2 =< (c0 v c1)

Proof of Theorem dp41lemm
StepHypRef Expression
1 dp41lem.1 . . . . . . . 8 c0 = ((a1 v a2) ^ (b1 v b2))
2 dp41lem.2 . . . . . . . 8 c1 = ((a0 v a2) ^ (b0 v b2))
3 dp41lem.3 . . . . . . . 8 c2 = ((a0 v a1) ^ (b0 v b1))
4 dp41lem.4 . . . . . . . 8 p = (((a0 v b0) ^ (a1 v b1)) ^ (a2 v b2))
5 dp41lem.5 . . . . . . . 8 p2 = ((a0 v b0) ^ (a1 v b1))
6 dp41lem.6 . . . . . . . 8 p2 =< (a2 v b2)
71, 2, 3, 4, 5, 6dp41lemb 1181 . . . . . . 7 c2 = ((c2 ^ ((a0 v b0) v b1)) ^ ((a0 v a1) v b1))
81, 2, 3, 4, 5, 6dp41lemc 1183 . . . . . . 7 ((c2 ^ ((a0 v b0) v b1)) ^ ((a0 v a1) v b1)) =< (c2 ^ ((a0 v b1) v (c2 ^ (c0 v c1))))
97, 8bltr 138 . . . . . 6 c2 =< (c2 ^ ((a0 v b1) v (c2 ^ (c0 v c1))))
101, 2, 3, 4, 5, 6dp41lemd 1184 . . . . . 6 (c2 ^ ((a0 v b1) v (c2 ^ (c0 v c1)))) = (c2 ^ ((c0 v c1) v (c2 ^ (a0 v b1))))
119, 10lbtr 139 . . . . 5 c2 =< (c2 ^ ((c0 v c1) v (c2 ^ (a0 v b1))))
121, 2, 3, 4, 5, 6dp41leme 1185 . . . . 5 (c2 ^ ((c0 v c1) v (c2 ^ (a0 v b1)))) =< ((c0 v c1) v ((a0 ^ (b0 v b1)) v (b1 ^ (a0 v a1))))
1311, 12letr 137 . . . 4 c2 =< ((c0 v c1) v ((a0 ^ (b0 v b1)) v (b1 ^ (a0 v a1))))
141, 2, 3, 4, 5, 6dp41lemf 1186 . . . . 5 ((c0 v c1) v ((a0 ^ (b0 v b1)) v (b1 ^ (a0 v a1)))) = (((b1 v b2) ^ ((a1 v a2) v (b1 ^ (a0 v a1)))) v ((a0 v a2) ^ ((b0 v b2) v (a0 ^ (b0 v b1)))))
151, 2, 3, 4, 5, 6dp41lemg 1187 . . . . 5 (((b1 v b2) ^ ((a1 v a2) v (b1 ^ (a0 v a1)))) v ((a0 v a2) ^ ((b0 v b2) v (a0 ^ (b0 v b1))))) = (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a1 v b1)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a0 v b0)))))
1614, 15tr 62 . . . 4 ((c0 v c1) v ((a0 ^ (b0 v b1)) v (b1 ^ (a0 v a1)))) = (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a1 v b1)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a0 v b0)))))
1713, 16lbtr 139 . . 3 c2 =< (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a1 v b1)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a0 v b0)))))
181, 2, 3, 4, 5, 6dp41lemh 1188 . . 3 (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a1 v b1)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a0 v b0))))) =< (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a2 v b2)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a2 v b2)))))
1917, 18letr 137 . 2 c2 =< (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a2 v b2)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a2 v b2)))))
201, 2, 3, 4, 5, 6dp41lemj 1189 . . 3 (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a2 v b2)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a2 v b2))))) = (((b1 v b2) ^ ((a1 v a2) v (b2 ^ (a0 v a2)))) v ((a0 v a2) ^ ((b0 v b2) v (a2 ^ (b1 v b2)))))
211, 2, 3, 4, 5, 6dp41lemk 1190 . . 3 (((b1 v b2) ^ ((a1 v a2) v (b2 ^ (a0 v a2)))) v ((a0 v a2) ^ ((b0 v b2) v (a2 ^ (b1 v b2))))) = ((c0 v (b2 ^ (a0 v a2))) v (c1 v (a2 ^ (b1 v b2))))
221, 2, 3, 4, 5, 6dp41leml 1191 . . 3 ((c0 v (b2 ^ (a0 v a2))) v (c1 v (a2 ^ (b1 v b2)))) = (c0 v c1)
2320, 21, 223tr 65 . 2 (((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a2 v b2)))) v ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a2 v b2))))) = (c0 v c1)
2419, 23lbtr 139 1 c2 =< (c0 v c1)
Colors of variables: term
Syntax hints:   = wb 1   =< wle 2   v wo 6   ^ wa 7
This theorem was proved from axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a4 33  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-ml 1120  ax-arg 1151
This theorem depends on definitions:  df-a 40  df-t 41  df-f 42  df-le1 130  df-le2 131
This theorem is referenced by:  dp41  1193
  Copyright terms: Public domain W3C validator