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

Theorem dp35lemb 1174
Description: Part of proof (3)=>(5) in Day/Pickering 1982.
Hypotheses
Ref Expression
dp35lem.1 c0 = ((a1 v a2) ^ (b1 v b2))
dp35lem.2 c1 = ((a0 v a2) ^ (b0 v b2))
dp35lem.3 c2 = ((a0 v a1) ^ (b0 v b1))
dp35lem.4 p0 = ((a1 v b1) ^ (a2 v b2))
dp35lem.5 p = (((a0 v b0) ^ (a1 v b1)) ^ (a2 v b2))
Assertion
Ref Expression
dp35lemb (b0 ^ (b1 v (c2 ^ (c0 v c1)))) = (b0 ^ (b1 v ((a0 v a1) ^ (c0 v c1))))

Proof of Theorem dp35lemb
StepHypRef Expression
1 dp35lem.3 . . . . . . 7 c2 = ((a0 v a1) ^ (b0 v b1))
21ran 78 . . . . . 6 (c2 ^ (c0 v c1)) = (((a0 v a1) ^ (b0 v b1)) ^ (c0 v c1))
3 an32 83 . . . . . 6 (((a0 v a1) ^ (b0 v b1)) ^ (c0 v c1)) = (((a0 v a1) ^ (c0 v c1)) ^ (b0 v b1))
42, 3tr 62 . . . . 5 (c2 ^ (c0 v c1)) = (((a0 v a1) ^ (c0 v c1)) ^ (b0 v b1))
54lor 70 . . . 4 (b1 v (c2 ^ (c0 v c1))) = (b1 v (((a0 v a1) ^ (c0 v c1)) ^ (b0 v b1)))
6 leor 159 . . . . 5 b1 =< (b0 v b1)
76ml2i 1123 . . . 4 (b1 v (((a0 v a1) ^ (c0 v c1)) ^ (b0 v b1))) = ((b1 v ((a0 v a1) ^ (c0 v c1))) ^ (b0 v b1))
8 ancom 74 . . . 4 ((b1 v ((a0 v a1) ^ (c0 v c1))) ^ (b0 v b1)) = ((b0 v b1) ^ (b1 v ((a0 v a1) ^ (c0 v c1))))
95, 7, 83tr 65 . . 3 (b1 v (c2 ^ (c0 v c1))) = ((b0 v b1) ^ (b1 v ((a0 v a1) ^ (c0 v c1))))
109lan 77 . 2 (b0 ^ (b1 v (c2 ^ (c0 v c1)))) = (b0 ^ ((b0 v b1) ^ (b1 v ((a0 v a1) ^ (c0 v c1)))))
11 anass 76 . . 3 ((b0 ^ (b0 v b1)) ^ (b1 v ((a0 v a1) ^ (c0 v c1)))) = (b0 ^ ((b0 v b1) ^ (b1 v ((a0 v a1) ^ (c0 v c1)))))
1211cm 61 . 2 (b0 ^ ((b0 v b1) ^ (b1 v ((a0 v a1) ^ (c0 v c1))))) = ((b0 ^ (b0 v b1)) ^ (b1 v ((a0 v a1) ^ (c0 v c1))))
13 anabs 121 . . 3 (b0 ^ (b0 v b1)) = b0
1413ran 78 . 2 ((b0 ^ (b0 v b1)) ^ (b1 v ((a0 v a1) ^ (c0 v c1)))) = (b0 ^ (b1 v ((a0 v a1) ^ (c0 v c1))))
1510, 12, 143tr 65 1 (b0 ^ (b1 v (c2 ^ (c0 v c1)))) = (b0 ^ (b1 v ((a0 v a1) ^ (c0 v c1))))
Colors of variables: term
Syntax hints:   = wb 1   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:  dp35lembb  1175
  Copyright terms: Public domain W3C validator