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

Theorem u1lem4 739
Description: Lemma for unified implication study.
Assertion
Ref Expression
u1lem4 (a ->1 (a ->1 (b ->1 a))) = (a ->1 (b ->1 a))

Proof of Theorem u1lem4
StepHypRef Expression
1 df-i1 43 . 2 (a ->1 (a ->1 (b ->1 a))) = (a_|_ v (a ^ (a ->1 (b ->1 a))))
2 comid 179 . . . . 5 a C a
32comcom2 175 . . . 4 a C a_|_
4 u1lemc1 662 . . . 4 a C (a ->1 (b ->1 a))
53, 4fh4 454 . . 3 (a_|_ v (a ^ (a ->1 (b ->1 a)))) = ((a_|_ v a) ^ (a_|_ v (a ->1 (b ->1 a))))
6 ax-a2 30 . . . . . 6 (a_|_ v a) = (a v a_|_)
7 df-t 40 . . . . . . 7 1 = (a v a_|_)
87ax-r1 34 . . . . . 6 (a v a_|_) = 1
96, 8ax-r2 35 . . . . 5 (a_|_ v a) = 1
10 ax-a2 30 . . . . . 6 (a_|_ v (a ->1 (b ->1 a))) = ((a ->1 (b ->1 a)) v a_|_)
11 u1lemona 607 . . . . . . 7 ((a ->1 (b ->1 a)) v a_|_) = (a_|_ v (a ^ (b ->1 a)))
12 df-i1 43 . . . . . . . . . . 11 (b ->1 a) = (b_|_ v (b ^ a))
13 ancom 68 . . . . . . . . . . . 12 (b ^ a) = (a ^ b)
1413lor 66 . . . . . . . . . . 11 (b_|_ v (b ^ a)) = (b_|_ v (a ^ b))
1512, 14ax-r2 35 . . . . . . . . . 10 (b ->1 a) = (b_|_ v (a ^ b))
1615lan 70 . . . . . . . . 9 (a ^ (b ->1 a)) = (a ^ (b_|_ v (a ^ b)))
1716lor 66 . . . . . . . 8 (a_|_ v (a ^ (b ->1 a))) = (a_|_ v (a ^ (b_|_ v (a ^ b))))
18 u1lem3 731 . . . . . . . . . 10 (a ->1 (b ->1 a)) = (a_|_ v ((a ^ b) v (a ^ b_|_)))
19 ax-a2 30 . . . . . . . . . . . . . 14 (b_|_ v (a ^ b)) = ((a ^ b) v b_|_)
2019lan 70 . . . . . . . . . . . . 13 (a ^ (b_|_ v (a ^ b))) = (a ^ ((a ^ b) v b_|_))
21 coman1 177 . . . . . . . . . . . . . . 15 (a ^ b) C a
22 coman2 178 . . . . . . . . . . . . . . . 16 (a ^ b) C b
2322comcom2 175 . . . . . . . . . . . . . . 15 (a ^ b) C b_|_
2421, 23fh2 452 . . . . . . . . . . . . . 14 (a ^ ((a ^ b) v b_|_)) = ((a ^ (a ^ b)) v (a ^ b_|_))
25 anass 69 . . . . . . . . . . . . . . . . 17 ((a ^ a) ^ b) = (a ^ (a ^ b))
2625ax-r1 34 . . . . . . . . . . . . . . . 16 (a ^ (a ^ b)) = ((a ^ a) ^ b)
27 anidm 103 . . . . . . . . . . . . . . . . 17 (a ^ a) = a
2827ran 71 . . . . . . . . . . . . . . . 16 ((a ^ a) ^ b) = (a ^ b)
2926, 28ax-r2 35 . . . . . . . . . . . . . . 15 (a ^ (a ^ b)) = (a ^ b)
3029ax-r5 37 . . . . . . . . . . . . . 14 ((a ^ (a ^ b)) v (a ^ b_|_)) = ((a ^ b) v (a ^ b_|_))
3124, 30ax-r2 35 . . . . . . . . . . . . 13 (a ^ ((a ^ b) v b_|_)) = ((a ^ b) v (a ^ b_|_))
3220, 31ax-r2 35 . . . . . . . . . . . 12 (a ^ (b_|_ v (a ^ b))) = ((a ^ b) v (a ^ b_|_))
3332ax-r1 34 . . . . . . . . . . 11 ((a ^ b) v (a ^ b_|_)) = (a ^ (b_|_ v (a ^ b)))
3433lor 66 . . . . . . . . . 10 (a_|_ v ((a ^ b) v (a ^ b_|_))) = (a_|_ v (a ^ (b_|_ v (a ^ b))))
3518, 34ax-r2 35 . . . . . . . . 9 (a ->1 (b ->1 a)) = (a_|_ v (a ^ (b_|_ v (a ^ b))))
3635ax-r1 34 . . . . . . . 8 (a_|_ v (a ^ (b_|_ v (a ^ b)))) = (a ->1 (b ->1 a))
3717, 36ax-r2 35 . . . . . . 7 (a_|_ v (a ^ (b ->1 a))) = (a ->1 (b ->1 a))
3811, 37ax-r2 35 . . . . . 6 ((a ->1 (b ->1 a)) v a_|_) = (a ->1 (b ->1 a))
3910, 38ax-r2 35 . . . . 5 (a_|_ v (a ->1 (b ->1 a))) = (a ->1 (b ->1 a))
409, 392an 72 . . . 4 ((a_|_ v a) ^ (a_|_ v (a ->1 (b ->1 a)))) = (1 ^ (a ->1 (b ->1 a)))
41 ancom 68 . . . . 5 (1 ^ (a ->1 (b ->1 a))) = ((a ->1 (b ->1 a)) ^ 1)
42 an1 98 . . . . 5 ((a ->1 (b ->1 a)) ^ 1) = (a ->1 (b ->1 a))
4341, 42ax-r2 35 . . . 4 (1 ^ (a ->1 (b ->1 a))) = (a ->1 (b ->1 a))
4440, 43ax-r2 35 . . 3 ((a_|_ v a) ^ (a_|_ v (a ->1 (b ->1 a)))) = (a ->1 (b ->1 a))
455, 44ax-r2 35 . 2 (a_|_ v (a ^ (a ->1 (b ->1 a)))) = (a ->1 (b ->1 a))
461, 45ax-r2 35 1 (a ->1 (a ->1 (b ->1 a))) = (a ->1 (b ->1 a))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9   ->1 wi1 13
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-i1 43  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org