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

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

Proof of Theorem nom21
StepHypRef Expression
1 ancom 68 . . 3 ((a_|_ v (a v b_|_)) ^ (a_|_ v (a ^ b))) = ((a_|_ v (a ^ b)) ^ (a_|_ v (a v b_|_)))
2 or12 73 . . . . 5 (a_|_ v (a v b_|_)) = (a v (a_|_ v b_|_))
3 oran3 85 . . . . . 6 (a_|_ v b_|_) = (a ^ b)_|_
43lor 66 . . . . 5 (a v (a_|_ v b_|_)) = (a v (a ^ b)_|_)
52, 4ax-r2 35 . . . 4 (a_|_ v (a v b_|_)) = (a v (a ^ b)_|_)
6 anidm 103 . . . . . . . 8 (a ^ a) = a
76ran 71 . . . . . . 7 ((a ^ a) ^ b) = (a ^ b)
87ax-r1 34 . . . . . 6 (a ^ b) = ((a ^ a) ^ b)
9 anass 69 . . . . . 6 ((a ^ a) ^ b) = (a ^ (a ^ b))
108, 9ax-r2 35 . . . . 5 (a ^ b) = (a ^ (a ^ b))
1110lor 66 . . . 4 (a_|_ v (a ^ b)) = (a_|_ v (a ^ (a ^ b)))
125, 112an 72 . . 3 ((a_|_ v (a v b_|_)) ^ (a_|_ v (a ^ b))) = ((a v (a ^ b)_|_) ^ (a_|_ v (a ^ (a ^ b))))
13 lea 152 . . . . . 6 (a ^ b) =< a
14 leo 150 . . . . . 6 a =< (a v b_|_)
1513, 14letr 129 . . . . 5 (a ^ b) =< (a v b_|_)
1615lelor 158 . . . 4 (a_|_ v (a ^ b)) =< (a_|_ v (a v b_|_))
1716df2le2 128 . . 3 ((a_|_ v (a ^ b)) ^ (a_|_ v (a v b_|_))) = (a_|_ v (a ^ b))
181, 12, 173tr2 61 . 2 ((a v (a ^ b)_|_) ^ (a_|_ v (a ^ (a ^ b)))) = (a_|_ v (a ^ b))
19 df-id1 49 . 2 (a ==1 (a ^ b)) = ((a v (a ^ b)_|_) ^ (a_|_ v (a ^ (a ^ b))))
20 df-i1 43 . 2 (a ->1 b) = (a_|_ v (a ^ b))
2118, 19, 203tr1 60 1 (a ==1 (a ^ b)) = (a ->1 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13   ==1 wid1 19
This theorem is referenced by:  nom34 315  nom52 325
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-id1 49  df-le1 122  df-le2 123
metamath.org