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

Theorem ud3lem3a 554
Description: Lemma for unified disjunction.
Assertion
Ref Expression
ud3lem3a ((a ->3 b)_|_ ^ (a v b)) = (a ->3 b)_|_

Proof of Theorem ud3lem3a
StepHypRef Expression
1 ud3lem0c 271 . . 3 (a ->3 b)_|_ = (((a v b_|_) ^ (a v b)) ^ (a_|_ v (a ^ b_|_)))
2 lea 152 . . . 4 (((a v b_|_) ^ (a v b)) ^ (a_|_ v (a ^ b_|_))) =< ((a v b_|_) ^ (a v b))
3 lear 153 . . . 4 ((a v b_|_) ^ (a v b)) =< (a v b)
42, 3letr 129 . . 3 (((a v b_|_) ^ (a v b)) ^ (a_|_ v (a ^ b_|_))) =< (a v b)
51, 4bltr 130 . 2 (a ->3 b)_|_ =< (a v b)
65df2le2 128 1 ((a ->3 b)_|_ ^ (a v b)) = (a ->3 b)_|_
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->3 wi3 15
This theorem is referenced by:  ud3lem3 558
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-i3 45  df-le1 122  df-le2 123
metamath.org