QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  nom50 Unicode version
Theorem nom50 331
Description: Part of Lemma 3.3(15) from "Non-Orthomodular Models..." paper.
Assertion
Ref Expression
nom50 ((a v b) ==0 b) = (a ->2 b)
Proof of Theorem nom50
StepHypRef Expression
1 ancom 74 . . . . . . . 8 (b' ^ a') = (a' ^ b')
2 anor3 90 . . . . . . . 8 (a' ^ b') = (a v b)'
31, 2ax-r2 36 . . . . . . 7 (b' ^ a') = (a v b)'
43lor 70 . . . . . 6 (b'' v (b' ^ a')) = (b'' v (a v b)')
53ax-r4 37 . . . . . . 7 (b' ^ a')' = (a v b)''
65ax-r5 38 . . . . . 6 ((b' ^ a')' v b') = ((a v b)'' v b')
74, 62an 79 . . . . 5 ((b'' v (b' ^ a')) ^ ((b' ^ a')' v b')) = ((b'' v (a v b)') ^ ((a v b)'' v b'))
87ax-r1 35 . . . 4 ((b'' v (a v b)') ^ ((a v b)'' v b')) = ((b'' v (b' ^ a')) ^ ((b' ^ a')' v b'))
9 df-id0 49 . . . 4 (b' ==0 (a v b)') = ((b'' v (a v b)') ^ ((a v b)'' v b'))
10 df-id0 49 . . . 4 (b' ==0 (b' ^ a')) = ((b'' v (b' ^ a')) ^ ((b' ^ a')' v b'))
118, 9, 103tr1 63 . . 3 (b' ==0 (a v b)') = (b' ==0 (b' ^ a'))
12 nom20 313 . . 3 (b' ==0 (b' ^ a')) = (b' ->1 a')
1311, 12ax-r2 36 . 2 (b' ==0 (a v b)') = (b' ->1 a')
14 nomcon0 301 . 2 ((a v b) ==0 b) = (b' ==0 (a v b)')
15 i2i1 267 . 2 (a ->2 b) = (b' ->1 a')
1613, 14, 153tr1 63 1 ((a v b) ==0 b) = (a ->2 b)
Colors of variables: term
Syntax hints:   = wb 1  'wn 4   v wo 6   ^ wa 7   ->1 wi1 12   ->2 wi2 13   ==0 wid0 17
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-i1 44  df-i2 45  df-id0 49  df-le1 130  df-le2 131
This theorem is referenced by:  nom60  337
  Copyright terms: Public domain W3C validator