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

Theorem nomb32 292
Description: Lemma for "Non-Orthomodular Models..." paper.
Assertion
Ref Expression
nomb32 (a ==3 b) = (b ==2 a)

Proof of Theorem nomb32
StepHypRef Expression
1 ax-a2 30 . . 3 (a_|_ v b) = (b v a_|_)
2 ancom 68 . . . 4 (a_|_ ^ b_|_) = (b_|_ ^ a_|_)
32lor 66 . . 3 (a v (a_|_ ^ b_|_)) = (a v (b_|_ ^ a_|_))
41, 32an 72 . 2 ((a_|_ v b) ^ (a v (a_|_ ^ b_|_))) = ((b v a_|_) ^ (a v (b_|_ ^ a_|_)))
5 df-id3 51 . 2 (a ==3 b) = ((a_|_ v b) ^ (a v (a_|_ ^ b_|_)))
6 df-id2 50 . 2 (b ==2 a) = ((b v a_|_) ^ (a v (b_|_ ^ a_|_)))
74, 5, 63tr1 60 1 (a ==3 b) = (b ==2 a)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ==2 wid2 20   ==3 wid3 21
This theorem is referenced by:  nomcon3 296  nomcon4 297  nom32 313  nom33 314  nom62 331  nom63 332
This theorem was proved from axioms:  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-id2 50  df-id3 51
metamath.org