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

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

Proof of Theorem nom40
StepHypRef Expression
1 nom10 299 . 2 (b_|_ ->0 (b_|_ ^ a_|_)) = (b_|_ ->1 a_|_)
2 ax-a2 30 . . . 4 ((a v b)_|_ v b) = (b v (a v b)_|_)
3 ax-a1 29 . . . . 5 b = b_|__|_
4 ancom 68 . . . . . . 7 (b_|_ ^ a_|_) = (a_|_ ^ b_|_)
5 anor3 82 . . . . . . 7 (a_|_ ^ b_|_) = (a v b)_|_
64, 5ax-r2 35 . . . . . 6 (b_|_ ^ a_|_) = (a v b)_|_
76ax-r1 34 . . . . 5 (a v b)_|_ = (b_|_ ^ a_|_)
83, 72or 67 . . . 4 (b v (a v b)_|_) = (b_|__|_ v (b_|_ ^ a_|_))
92, 8ax-r2 35 . . 3 ((a v b)_|_ v b) = (b_|__|_ v (b_|_ ^ a_|_))
10 df-i0 42 . . 3 ((a v b) ->0 b) = ((a v b)_|_ v b)
11 df-i0 42 . . 3 (b_|_ ->0 (b_|_ ^ a_|_)) = (b_|__|_ v (b_|_ ^ a_|_))
129, 10, 113tr1 60 . 2 ((a v b) ->0 b) = (b_|_ ->0 (b_|_ ^ a_|_))
13 i2i1 259 . 2 (a ->2 b) = (b_|_ ->1 a_|_)
141, 12, 133tr1 60 1 ((a v b) ->0 b) = (a ->2 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->0 wi0 12   ->1 wi1 13   ->2 wi2 14
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-i0 42  df-i1 43  df-i2 44
metamath.org