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

Theorem dp41lemg 1187
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
dp41lemg (((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)))))

Proof of Theorem dp41lemg
StepHypRef Expression
1 or32 82 . . . 4 ((a1 v a2) v (b1 ^ (a0 v a1))) = ((a1 v (b1 ^ (a0 v a1))) v a2)
2 ml3 1128 . . . . . 6 (a1 v (b1 ^ (a0 v a1))) = (a1 v (a0 ^ (b1 v a1)))
3 orcom 73 . . . . . . . 8 (b1 v a1) = (a1 v b1)
43lan 77 . . . . . . 7 (a0 ^ (b1 v a1)) = (a0 ^ (a1 v b1))
54lor 70 . . . . . 6 (a1 v (a0 ^ (b1 v a1))) = (a1 v (a0 ^ (a1 v b1)))
62, 5tr 62 . . . . 5 (a1 v (b1 ^ (a0 v a1))) = (a1 v (a0 ^ (a1 v b1)))
76ror 71 . . . 4 ((a1 v (b1 ^ (a0 v a1))) v a2) = ((a1 v (a0 ^ (a1 v b1))) v a2)
8 or32 82 . . . 4 ((a1 v (a0 ^ (a1 v b1))) v a2) = ((a1 v a2) v (a0 ^ (a1 v b1)))
91, 7, 83tr 65 . . 3 ((a1 v a2) v (b1 ^ (a0 v a1))) = ((a1 v a2) v (a0 ^ (a1 v b1)))
109lan 77 . 2 ((b1 v b2) ^ ((a1 v a2) v (b1 ^ (a0 v a1)))) = ((b1 v b2) ^ ((a1 v a2) v (a0 ^ (a1 v b1))))
11 or32 82 . . . 4 ((b0 v b2) v (a0 ^ (b0 v b1))) = ((b0 v (a0 ^ (b0 v b1))) v b2)
12 orcom 73 . . . . . . . 8 (b0 v b1) = (b1 v b0)
1312lan 77 . . . . . . 7 (a0 ^ (b0 v b1)) = (a0 ^ (b1 v b0))
1413lor 70 . . . . . 6 (b0 v (a0 ^ (b0 v b1))) = (b0 v (a0 ^ (b1 v b0)))
15 ml3 1128 . . . . . 6 (b0 v (a0 ^ (b1 v b0))) = (b0 v (b1 ^ (a0 v b0)))
1614, 15tr 62 . . . . 5 (b0 v (a0 ^ (b0 v b1))) = (b0 v (b1 ^ (a0 v b0)))
1716ror 71 . . . 4 ((b0 v (a0 ^ (b0 v b1))) v b2) = ((b0 v (b1 ^ (a0 v b0))) v b2)
18 or32 82 . . . 4 ((b0 v (b1 ^ (a0 v b0))) v b2) = ((b0 v b2) v (b1 ^ (a0 v b0)))
1911, 17, 183tr 65 . . 3 ((b0 v b2) v (a0 ^ (b0 v b1))) = ((b0 v b2) v (b1 ^ (a0 v b0)))
2019lan 77 . 2 ((a0 v a2) ^ ((b0 v b2) v (a0 ^ (b0 v b1)))) = ((a0 v a2) ^ ((b0 v b2) v (b1 ^ (a0 v b0))))
2110, 202or 72 1 (((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)))))
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-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-ml 1120
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:  dp41lemm  1192
  Copyright terms: Public domain W3C validator