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

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

Proof of Theorem nom23
StepHypRef Expression
1 le1 138 . . . 4 (a_|_ v (a ^ b)) =< 1
2 df-t 40 . . . . 5 1 = (a v a_|_)
3 a5c 113 . . . . . . . 8 (a_|_ ^ (a_|_ v b_|_)) = a_|_
43ax-r1 34 . . . . . . 7 a_|_ = (a_|_ ^ (a_|_ v b_|_))
5 oran3 85 . . . . . . . 8 (a_|_ v b_|_) = (a ^ b)_|_
65lan 70 . . . . . . 7 (a_|_ ^ (a_|_ v b_|_)) = (a_|_ ^ (a ^ b)_|_)
74, 6ax-r2 35 . . . . . 6 a_|_ = (a_|_ ^ (a ^ b)_|_)
87lor 66 . . . . 5 (a v a_|_) = (a v (a_|_ ^ (a ^ b)_|_))
92, 8ax-r2 35 . . . 4 1 = (a v (a_|_ ^ (a ^ b)_|_))
101, 9lbtr 131 . . 3 (a_|_ v (a ^ b)) =< (a v (a_|_ ^ (a ^ b)_|_))
1110df2le2 128 . 2 ((a_|_ v (a ^ b)) ^ (a v (a_|_ ^ (a ^ b)_|_))) = (a_|_ v (a ^ b))
12 df-id3 51 . 2 (a ==3 (a ^ b)) = ((a_|_ v (a ^ b)) ^ (a v (a_|_ ^ (a ^ b)_|_)))
13 df-i1 43 . 2 (a ->1 b) = (a_|_ v (a ^ b))
1411, 12, 133tr1 60 1 (a ==3 (a ^ b)) = (a ->1 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9   ->1 wi1 13   ==3 wid3 21
This theorem is referenced by:  nom32 313  nom54 327
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a4 32  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-i1 43  df-id3 51  df-le1 122  df-le2 123
metamath.org