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

Theorem nom42 319
Description: Part of Lemma 3.3(15) from "Non-Orthomodular Models..." paper.
Assertion
Ref Expression
nom42 ((a v b) ->2 b) = (a ->2 b)

Proof of Theorem nom42
StepHypRef Expression
1 ancom 68 . . . . . 6 (b_|_ ^ a_|_) = (a_|_ ^ b_|_)
2 anor3 82 . . . . . 6 (a_|_ ^ b_|_) = (a v b)_|_
31, 2ax-r2 35 . . . . 5 (b_|_ ^ a_|_) = (a v b)_|_
43ud1lem0a 247 . . . 4 (b_|_ ->1 (b_|_ ^ a_|_)) = (b_|_ ->1 (a v b)_|_)
54ax-r1 34 . . 3 (b_|_ ->1 (a v b)_|_) = (b_|_ ->1 (b_|_ ^ a_|_))
6 nom11 300 . . 3 (b_|_ ->1 (b_|_ ^ a_|_)) = (b_|_ ->1 a_|_)
75, 6ax-r2 35 . 2 (b_|_ ->1 (a v b)_|_) = (b_|_ ->1 a_|_)
8 i2i1 259 . 2 ((a v b) ->2 b) = (b_|_ ->1 (a v b)_|_)
9 i2i1 259 . 2 (a ->2 b) = (b_|_ ->1 a_|_)
107, 8, 93tr1 60 1 ((a v b) ->2 b) = (a ->2 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13   ->2 wi2 14
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-i2 44
metamath.org