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

Theorem u5lem5 747
Description: Lemma for unified implication study.
Assertion
Ref Expression
u5lem5 (a ->5 (a ->5 b)) = (a_|_ v (a ^ b))

Proof of Theorem u5lem5
StepHypRef Expression
1 df-i5 47 . 2 (a ->5 (a ->5 b)) = (((a ^ (a ->5 b)) v (a_|_ ^ (a ->5 b))) v (a_|_ ^ (a ->5 b)_|_))
2 u5lemc1 666 . . . . . . . 8 a C (a ->5 b)
32comcom 435 . . . . . . 7 (a ->5 b) C a
43comcom2 175 . . . . . . 7 (a ->5 b) C a_|_
53, 4fh1r 455 . . . . . 6 ((a v a_|_) ^ (a ->5 b)) = ((a ^ (a ->5 b)) v (a_|_ ^ (a ->5 b)))
65ax-r1 34 . . . . 5 ((a ^ (a ->5 b)) v (a_|_ ^ (a ->5 b))) = ((a v a_|_) ^ (a ->5 b))
7 ancom 68 . . . . . 6 ((a v a_|_) ^ (a ->5 b)) = ((a ->5 b) ^ (a v a_|_))
8 df-t 40 . . . . . . . . 9 1 = (a v a_|_)
98ax-r1 34 . . . . . . . 8 (a v a_|_) = 1
109lan 70 . . . . . . 7 ((a ->5 b) ^ (a v a_|_)) = ((a ->5 b) ^ 1)
11 an1 98 . . . . . . 7 ((a ->5 b) ^ 1) = (a ->5 b)
1210, 11ax-r2 35 . . . . . 6 ((a ->5 b) ^ (a v a_|_)) = (a ->5 b)
137, 12ax-r2 35 . . . . 5 ((a v a_|_) ^ (a ->5 b)) = (a ->5 b)
146, 13ax-r2 35 . . . 4 ((a ^ (a ->5 b)) v (a_|_ ^ (a ->5 b))) = (a ->5 b)
1514ax-r5 37 . . 3 (((a ^ (a ->5 b)) v (a_|_ ^ (a ->5 b))) v (a_|_ ^ (a ->5 b)_|_)) = ((a ->5 b) v (a_|_ ^ (a ->5 b)_|_))
162comcom3 436 . . . . 5 a_|_ C (a ->5 b)
172comcom4 437 . . . . 5 a_|_ C (a ->5 b)_|_
1816, 17fh4 454 . . . 4 ((a ->5 b) v (a_|_ ^ (a ->5 b)_|_)) = (((a ->5 b) v a_|_) ^ ((a ->5 b) v (a ->5 b)_|_))
19 df-t 40 . . . . . . 7 1 = ((a ->5 b) v (a ->5 b)_|_)
2019ax-r1 34 . . . . . 6 ((a ->5 b) v (a ->5 b)_|_) = 1
2120lan 70 . . . . 5 (((a ->5 b) v a_|_) ^ ((a ->5 b) v (a ->5 b)_|_)) = (((a ->5 b) v a_|_) ^ 1)
22 an1 98 . . . . . 6 (((a ->5 b) v a_|_) ^ 1) = ((a ->5 b) v a_|_)
23 u5lemona 611 . . . . . 6 ((a ->5 b) v a_|_) = (a_|_ v (a ^ b))
2422, 23ax-r2 35 . . . . 5 (((a ->5 b) v a_|_) ^ 1) = (a_|_ v (a ^ b))
2521, 24ax-r2 35 . . . 4 (((a ->5 b) v a_|_) ^ ((a ->5 b) v (a ->5 b)_|_)) = (a_|_ v (a ^ b))
2618, 25ax-r2 35 . . 3 ((a ->5 b) v (a_|_ ^ (a ->5 b)_|_)) = (a_|_ v (a ^ b))
2715, 26ax-r2 35 . 2 (((a ^ (a ->5 b)) v (a_|_ ^ (a ->5 b))) v (a_|_ ^ (a ->5 b)_|_)) = (a_|_ v (a ^ b))
281, 27ax-r2 35 1 (a ->5 (a ->5 b)) = (a_|_ v (a ^ b))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9   ->5 wi5 17
This theorem is referenced by:  u5lem6 751
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i5 47  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org