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

Theorem nomcon3 296
Description: Lemma for "Non-Orthomodular Models..." paper.
Assertion
Ref Expression
nomcon3 (a ==3 b) = (b_|_ ==4 a_|_)

Proof of Theorem nomcon3
StepHypRef Expression
1 nomcon2 295 . 2 (b ==2 a) = (a_|_ ==1 b_|_)
2 nomb32 292 . 2 (a ==3 b) = (b ==2 a)
3 nomb41 291 . 2 (b_|_ ==4 a_|_) = (a_|_ ==1 b_|_)
41, 2, 33tr1 60 1 (a ==3 b) = (b_|_ ==4 a_|_)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   ==1 wid1 19   ==2 wid2 20   ==3 wid3 21   ==4 wid4 22
This theorem is referenced by:  nom53 326
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-id1 49  df-id2 50  df-id3 51  df-id4 52
metamath.org