[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem nom22 307
Description: Part of Lemma 3.3(14) from "Non-Orthomodular Models..." paper.
Assertion
Ref Expression
nom22 (a ==2 (a ^ b)) = (a ->1 b)

Proof of Theorem nom22
StepHypRef Expression
1 oran3 85 . . . . . . 7 (a_|_ v b_|_) = (a ^ b)_|_
21lor 66 . . . . . 6 (a v (a_|_ v b_|_)) = (a v (a ^ b)_|_)
32ax-r1 34 . . . . 5 (a v (a ^ b)_|_) = (a v (a_|_ v b_|_))
4 or12 73 . . . . 5 (a v (a_|_ v b_|_)) = (a_|_ v (a v b_|_))
53, 4ax-r2 35 . . . 4 (a v (a ^ b)_|_) = (a_|_ v (a v b_|_))
6 ax-a2 30 . . . . 5 ((a ^ b) v (a_|_ ^ (a ^ b)_|_)) = ((a_|_ ^ (a ^ b)_|_) v (a ^ b))
71lan 70 . . . . . . . 8 (a_|_ ^ (a_|_ v b_|_)) = (a_|_ ^ (a ^ b)_|_)
87ax-r1 34 . . . . . . 7 (a_|_ ^ (a ^ b)_|_) = (a_|_ ^ (a_|_ v b_|_))
9 a5c 113 . . . . . . 7 (a_|_ ^ (a_|_ v b_|_)) = a_|_
108, 9ax-r2 35 . . . . . 6 (a_|_ ^ (a ^ b)_|_) = a_|_
1110ax-r5 37 . . . . 5 ((a_|_ ^ (a ^ b)_|_) v (a ^ b)) = (a_|_ v (a ^ b))
126, 11ax-r2 35 . . . 4 ((a ^ b) v (a_|_ ^ (a ^ b)_|_)) = (a_|_ v (a ^ b))
135, 122an 72 . . 3 ((a v (a ^ b)_|_) ^ ((a ^ b) v (a_|_ ^ (a ^ b)_|_))) = ((a_|_ v (a v b_|_)) ^ (a_|_ v (a ^ b)))
14 ancom 68 . . 3 ((a_|_ v (a v b_|_)) ^ (a_|_ v (a ^ b))) = ((a_|_ v (a ^ b)) ^ (a_|_ v (a v b_|_)))
15 lea 152 . . . . . 6 (a ^ b) =< a
16 leo 150 . . . . . 6 a =< (a v b_|_)
1715, 16letr 129 . . . . 5 (a ^ b) =< (a v b_|_)
1817lelor 158 . . . 4 (a_|_ v (a ^ b)) =< (a_|_ v (a v b_|_))
1918df2le2 128 . . 3 ((a_|_ v (a ^ b)) ^ (a_|_ v (a v b_|_))) = (a_|_ v (a ^ b))
2013, 14, 193tr 62 . 2 ((a v (a ^ b)_|_) ^ ((a ^ b) v (a_|_ ^ (a ^ b)_|_))) = (a_|_ v (a ^ b))
21 df-id2 50 . 2 (a ==2 (a ^ b)) = ((a v (a ^ b)_|_) ^ ((a ^ b) v (a_|_ ^ (a ^ b)_|_)))
22 df-i1 43 . 2 (a ->1 b) = (a_|_ v (a ^ b))
2320, 21, 223tr1 60 1 (a ==2 (a ^ b)) = (a ->1 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13   ==2 wid2 20
This theorem is referenced by:  nom33 314  nom51 324
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-t 40  df-f 41  df-i1 43  df-id2 50  df-le1 122  df-le2 123
metamath.org