QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  lem4.6.6i0j1 Unicode version
Theorem lem4.6.6i0j1 1086
Description: Equation 4.14 of [MegPav2000] p. 23. The variable i in the paper is set to 0, and j is set to 1. (Contributed by Roy F. Longton, 3-Jul-05.)
Assertion
Ref Expression
lem4.6.6i0j1 ((a ->0 b) v (a ->1 b)) = (a ->0 b)
Proof of Theorem lem4.6.6i0j1
StepHypRef Expression
1 leid 148 . . . 4 (a' v b) =< (a' v b)
2 lear 161 . . . . 5 (a ^ b) =< b
32lelor 166 . . . 4 (a' v (a ^ b)) =< (a' v b)
41, 3lel2or 170 . . 3 ((a' v b) v (a' v (a ^ b))) =< (a' v b)
5 leo 158 . . 3 (a' v b) =< ((a' v b) v (a' v (a ^ b)))
64, 5lebi 145 . 2 ((a' v b) v (a' v (a ^ b))) = (a' v b)
7 df-i0 43 . . 3 (a ->0 b) = (a' v b)
8 df-i1 44 . . 3 (a ->1 b) = (a' v (a ^ b))
97, 82or 72 . 2 ((a ->0 b) v (a ->1 b)) = ((a' v b) v (a' v (a ^ b)))
106, 9, 73tr1 63 1 ((a ->0 b) v (a ->1 b)) = (a ->0 b)
Colors of variables: term
Syntax hints:   = wb 1  'wn 4   v wo 6   ^ wa 7   ->0 wi0 11   ->1 wi1 12
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
This theorem depends on definitions:  df-a 40  df-t 41  df-f 42  df-i0 43  df-i1 44  df-le1 130  df-le2 131
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator