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

Theorem u4lemoa 605
Description: Lemma for non-tollens implication study.
Assertion
Ref Expression
u4lemoa ((a ->4 b) v a) = 1

Proof of Theorem u4lemoa
StepHypRef Expression
1 df-i4 46 . . 3 (a ->4 b) = (((a ^ b) v (a_|_ ^ b)) v ((a_|_ v b) ^ b_|_))
21ax-r5 37 . 2 ((a ->4 b) v a) = ((((a ^ b) v (a_|_ ^ b)) v ((a_|_ v b) ^ b_|_)) v a)
3 ax-a3 31 . . 3 ((((a ^ b) v (a_|_ ^ b)) v ((a_|_ v b) ^ b_|_)) v a) = (((a ^ b) v (a_|_ ^ b)) v (((a_|_ v b) ^ b_|_) v a))
4 comor1 443 . . . . . . . 8 (a_|_ v b) C a_|_
54comcom7 442 . . . . . . 7 (a_|_ v b) C a
6 comor2 444 . . . . . . . 8 (a_|_ v b) C b
76comcom2 175 . . . . . . 7 (a_|_ v b) C b_|_
85, 7fh4r 458 . . . . . 6 (((a_|_ v b) ^ b_|_) v a) = (((a_|_ v b) v a) ^ (b_|_ v a))
9 or32 75 . . . . . . . . 9 ((a_|_ v b) v a) = ((a_|_ v a) v b)
10 ax-a2 30 . . . . . . . . . 10 ((a_|_ v a) v b) = (b v (a_|_ v a))
11 df-t 40 . . . . . . . . . . . . . 14 1 = (a v a_|_)
12 ax-a2 30 . . . . . . . . . . . . . 14 (a v a_|_) = (a_|_ v a)
1311, 12ax-r2 35 . . . . . . . . . . . . 13 1 = (a_|_ v a)
1413lor 66 . . . . . . . . . . . 12 (b v 1) = (b v (a_|_ v a))
1514ax-r1 34 . . . . . . . . . . 11 (b v (a_|_ v a)) = (b v 1)
16 or1 96 . . . . . . . . . . 11 (b v 1) = 1
1715, 16ax-r2 35 . . . . . . . . . 10 (b v (a_|_ v a)) = 1
1810, 17ax-r2 35 . . . . . . . . 9 ((a_|_ v a) v b) = 1
199, 18ax-r2 35 . . . . . . . 8 ((a_|_ v b) v a) = 1
2019ran 71 . . . . . . 7 (((a_|_ v b) v a) ^ (b_|_ v a)) = (1 ^ (b_|_ v a))
21 ancom 68 . . . . . . . 8 (1 ^ (b_|_ v a)) = ((b_|_ v a) ^ 1)
22 an1 98 . . . . . . . 8 ((b_|_ v a) ^ 1) = (b_|_ v a)
2321, 22ax-r2 35 . . . . . . 7 (1 ^ (b_|_ v a)) = (b_|_ v a)
2420, 23ax-r2 35 . . . . . 6 (((a_|_ v b) v a) ^ (b_|_ v a)) = (b_|_ v a)
258, 24ax-r2 35 . . . . 5 (((a_|_ v b) ^ b_|_) v a) = (b_|_ v a)
2625lor 66 . . . 4 (((a ^ b) v (a_|_ ^ b)) v (((a_|_ v b) ^ b_|_) v a)) = (((a ^ b) v (a_|_ ^ b)) v (b_|_ v a))
27 ax-a3 31 . . . . 5 (((a ^ b) v (a_|_ ^ b)) v (b_|_ v a)) = ((a ^ b) v ((a_|_ ^ b) v (b_|_ v a)))
28 ax-a2 30 . . . . . . . 8 ((a_|_ ^ b) v (b_|_ v a)) = ((b_|_ v a) v (a_|_ ^ b))
29 ancom 68 . . . . . . . . . . 11 (a_|_ ^ b) = (b ^ a_|_)
30 anor1 80 . . . . . . . . . . 11 (b ^ a_|_) = (b_|_ v a)_|_
3129, 30ax-r2 35 . . . . . . . . . 10 (a_|_ ^ b) = (b_|_ v a)_|_
3231lor 66 . . . . . . . . 9 ((b_|_ v a) v (a_|_ ^ b)) = ((b_|_ v a) v (b_|_ v a)_|_)
33 df-t 40 . . . . . . . . . 10 1 = ((b_|_ v a) v (b_|_ v a)_|_)
3433ax-r1 34 . . . . . . . . 9 ((b_|_ v a) v (b_|_ v a)_|_) = 1
3532, 34ax-r2 35 . . . . . . . 8 ((b_|_ v a) v (a_|_ ^ b)) = 1
3628, 35ax-r2 35 . . . . . . 7 ((a_|_ ^ b) v (b_|_ v a)) = 1
3736lor 66 . . . . . 6 ((a ^ b) v ((a_|_ ^ b) v (b_|_ v a))) = ((a ^ b) v 1)
38 or1 96 . . . . . 6 ((a ^ b) v 1) = 1
3937, 38ax-r2 35 . . . . 5 ((a ^ b) v ((a_|_ ^ b) v (b_|_ v a))) = 1
4027, 39ax-r2 35 . . . 4 (((a ^ b) v (a_|_ ^ b)) v (b_|_ v a)) = 1
4126, 40ax-r2 35 . . 3 (((a ^ b) v (a_|_ ^ b)) v (((a_|_ v b) ^ b_|_) v a)) = 1
423, 41ax-r2 35 . 2 ((((a ^ b) v (a_|_ ^ b)) v ((a_|_ v b) ^ b_|_)) v a) = 1
432, 42ax-r2 35 1 ((a ->4 b) v a) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9   ->4 wi4 16
This theorem is referenced by:  u4lemnana 630
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-i4 46  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org