QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  wdwom Unicode version
Theorem wdwom 1104
Description: Prove 2-variable WOML rule in WDOL. This will make all WOML theorems available to us. The proof does not use ax-r3 439 or ax-wom 361. Since this is the same as ax-wom 361, from here on we will freely use those theorems invoking ax-wom 361.
Hypothesis
Ref Expression
wdwom.1 (a' v (a ^ b)) = 1
Assertion
Ref Expression
wdwom (b v (a' ^ b')) = 1
Proof of Theorem wdwom
StepHypRef Expression
1 df-i2 45 . . 3 (a ->2 b) = (b v (a' ^ b'))
21ax-r1 35 . 2 (b v (a' ^ b')) = (a ->2 b)
3 le1 146 . . 3 (a ->2 b) =< 1
4 df-i5 48 . . . . . 6 (a ->5 b) = (((a ^ b) v (a' ^ b)) v (a' ^ b'))
5 df-i1 44 . . . . . . . . 9 (a ->1 b) = (a' v (a ^ b))
6 wdwom.1 . . . . . . . . 9 (a' v (a ^ b)) = 1
75, 6ax-r2 36 . . . . . . . 8 (a ->1 b) = 1
87wql1lem 287 . . . . . . 7 (a' v b) = 1
9 or4 84 . . . . . . . . . 10 (((a ^ b) v (a' ^ b)) v ((a' v b)' v (a' ^ b'))) = (((a ^ b) v (a' v b)') v ((a' ^ b) v (a' ^ b')))
10 anor1 88 . . . . . . . . . . . . 13 (a ^ b') = (a' v b)'
1110ax-r1 35 . . . . . . . . . . . 12 (a' v b)' = (a ^ b')
1211lor 70 . . . . . . . . . . 11 ((a ^ b) v (a' v b)') = ((a ^ b) v (a ^ b'))
1312ax-r5 38 . . . . . . . . . 10 (((a ^ b) v (a' v b)') v ((a' ^ b) v (a' ^ b'))) = (((a ^ b) v (a ^ b')) v ((a' ^ b) v (a' ^ b')))
149, 13ax-r2 36 . . . . . . . . 9 (((a ^ b) v (a' ^ b)) v ((a' v b)' v (a' ^ b'))) = (((a ^ b) v (a ^ b')) v ((a' ^ b) v (a' ^ b')))
15 or12 80 . . . . . . . . 9 ((a' v b)' v (((a ^ b) v (a' ^ b)) v (a' ^ b'))) = (((a ^ b) v (a' ^ b)) v ((a' v b)' v (a' ^ b')))
16 df-cmtr 134 . . . . . . . . 9 C (a, b) = (((a ^ b) v (a ^ b')) v ((a' ^ b) v (a' ^ b')))
1714, 15, 163tr1 63 . . . . . . . 8 ((a' v b)' v (((a ^ b) v (a' ^ b)) v (a' ^ b'))) = C (a, b)
18 wdcom 1103 . . . . . . . 8 C (a, b) = 1
1917, 18ax-r2 36 . . . . . . 7 ((a' v b)' v (((a ^ b) v (a' ^ b)) v (a' ^ b'))) = 1
208, 19skr0 242 . . . . . 6 (((a ^ b) v (a' ^ b)) v (a' ^ b')) = 1
214, 20ax-r2 36 . . . . 5 (a ->5 b) = 1
2221ax-r1 35 . . . 4 1 = (a ->5 b)
23 i5lei2 348 . . . 4 (a ->5 b) =< (a ->2 b)
2422, 23bltr 138 . . 3 1 =< (a ->2 b)
253, 24lebi 145 . 2 (a ->2 b) = 1
262, 25ax-r2 36 1 (b v (a' ^ b')) = 1
Colors of variables: term
Syntax hints:   = wb 1  'wn 4   v wo 6   ^ wa 7  1wt 8   ->1 wi1 12   ->2 wi2 13   ->5 wi5 16   C wcmtr 29
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-wdol 1102
This theorem depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i1 44  df-i2 45  df-i5 48  df-le1 130  df-le2 131  df-cmtr 134
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator