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

Theorem ud2lem0c 270
Description: Lemma for unified disjunction.
Assertion
Ref Expression
ud2lem0c (a ->2 b)_|_ = (b_|_ ^ (a v b))

Proof of Theorem ud2lem0c
StepHypRef Expression
1 df-i2 44 . . 3 (a ->2 b) = (b v (a_|_ ^ b_|_))
2 oran 79 . . . 4 (b v (a_|_ ^ b_|_)) = (b_|_ ^ (a_|_ ^ b_|_)_|_)_|_
3 oran 79 . . . . . . 7 (a v b) = (a_|_ ^ b_|_)_|_
43ax-r1 34 . . . . . 6 (a_|_ ^ b_|_)_|_ = (a v b)
54lan 70 . . . . 5 (b_|_ ^ (a_|_ ^ b_|_)_|_) = (b_|_ ^ (a v b))
65ax-r4 36 . . . 4 (b_|_ ^ (a_|_ ^ b_|_)_|_)_|_ = (b_|_ ^ (a v b))_|_
72, 6ax-r2 35 . . 3 (b v (a_|_ ^ b_|_)) = (b_|_ ^ (a v b))_|_
81, 7ax-r2 35 . 2 (a ->2 b) = (b_|_ ^ (a v b))_|_
98con2 64 1 (a ->2 b)_|_ = (b_|_ ^ (a v b))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->2 wi2 14
This theorem is referenced by:  wql2lem5 284  ud2lem1 545  ud2lem3 547  u2lem1 717  3vth9 794  2oalem1 807  oa43v 1008  oa63v 1011
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-i2 44
metamath.org