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

Theorem ud4lem3a 565
Description: Lemma for unified disjunction.
Assertion
Ref Expression
ud4lem3a ((a ->4 b)_|_ ^ (a v b)) = (a ->4 b)_|_

Proof of Theorem ud4lem3a
StepHypRef Expression
1 anass 69 . . 3 ((((a_|_ v b_|_) ^ (a v b_|_)) ^ ((a ^ b_|_) v b)) ^ (a v b)) = (((a_|_ v b_|_) ^ (a v b_|_)) ^ (((a ^ b_|_) v b) ^ (a v b)))
2 lea 152 . . . . . 6 (a ^ b_|_) =< a
32leror 144 . . . . 5 ((a ^ b_|_) v b) =< (a v b)
43df2le2 128 . . . 4 (((a ^ b_|_) v b) ^ (a v b)) = ((a ^ b_|_) v b)
54lan 70 . . 3 (((a_|_ v b_|_) ^ (a v b_|_)) ^ (((a ^ b_|_) v b) ^ (a v b))) = (((a_|_ v b_|_) ^ (a v b_|_)) ^ ((a ^ b_|_) v b))
61, 5ax-r2 35 . 2 ((((a_|_ v b_|_) ^ (a v b_|_)) ^ ((a ^ b_|_) v b)) ^ (a v b)) = (((a_|_ v b_|_) ^ (a v b_|_)) ^ ((a ^ b_|_) v b))
7 ud4lem0c 272 . . 3 (a ->4 b)_|_ = (((a_|_ v b_|_) ^ (a v b_|_)) ^ ((a ^ b_|_) v b))
87ran 71 . 2 ((a ->4 b)_|_ ^ (a v b)) = ((((a_|_ v b_|_) ^ (a v b_|_)) ^ ((a ^ b_|_) v b)) ^ (a v b))
96, 8, 73tr1 60 1 ((a ->4 b)_|_ ^ (a v b)) = (a ->4 b)_|_
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->4 wi4 16
This theorem is referenced by:  ud4lem3 567
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-i4 46  df-le1 122  df-le2 123
metamath.org