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

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

Proof of Theorem nom11
StepHypRef Expression
1 anass 69 . . . . 5 ((a ^ a) ^ b) = (a ^ (a ^ b))
21ax-r1 34 . . . 4 (a ^ (a ^ b)) = ((a ^ a) ^ b)
3 anidm 103 . . . . 5 (a ^ a) = a
43ran 71 . . . 4 ((a ^ a) ^ b) = (a ^ b)
52, 4ax-r2 35 . . 3 (a ^ (a ^ b)) = (a ^ b)
65lor 66 . 2 (a_|_ v (a ^ (a ^ b))) = (a_|_ v (a ^ b))
7 df-i1 43 . 2 (a ->1 (a ^ b)) = (a_|_ v (a ^ (a ^ b)))
8 df-i1 43 . 2 (a ->1 b) = (a_|_ v (a ^ b))
96, 7, 83tr1 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
This theorem is referenced by:  nom42 319
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
metamath.org