Quantum Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > QLE Home > Th. List > u4lem1 | Unicode version |
Description: Lemma for unified implication study. |
Ref | Expression |
---|---|
u4lem1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-i4 47 | . 2 | |
2 | u4lemaa 603 | . . . . 5 | |
3 | u4lemnaa 643 | . . . . 5 | |
4 | 2, 3 | 2or 72 | . . . 4 |
5 | u4lemnoa 663 | . . . . 5 | |
6 | 5 | ran 78 | . . . 4 |
7 | 4, 6 | 2or 72 | . . 3 |
8 | ancom 74 | . . . . 5 | |
9 | 8 | lor 70 | . . . 4 |
10 | comanr1 464 | . . . . . . . 8 | |
11 | comanr1 464 | . . . . . . . 8 | |
12 | 10, 11 | com2or 483 | . . . . . . 7 |
13 | 12 | comcom3 454 | . . . . . 6 |
14 | comorr 184 | . . . . . . . 8 | |
15 | comorr 184 | . . . . . . . 8 | |
16 | 14, 15 | com2an 484 | . . . . . . 7 |
17 | 16 | comcom3 454 | . . . . . 6 |
18 | 13, 17 | fh4 472 | . . . . 5 |
19 | comor1 461 | . . . . . . . . . . 11 | |
20 | comor2 462 | . . . . . . . . . . 11 | |
21 | 19, 20 | com2an 484 | . . . . . . . . . 10 |
22 | 20 | comcom2 183 | . . . . . . . . . . 11 |
23 | 19, 22 | com2an 484 | . . . . . . . . . 10 |
24 | 21, 23 | com2or 483 | . . . . . . . . 9 |
25 | 19, 22 | com2or 483 | . . . . . . . . 9 |
26 | 24, 25 | fh4 472 | . . . . . . . 8 |
27 | lea 160 | . . . . . . . . . . . 12 | |
28 | lea 160 | . . . . . . . . . . . 12 | |
29 | 27, 28 | lel2or 170 | . . . . . . . . . . 11 |
30 | leo 158 | . . . . . . . . . . 11 | |
31 | 29, 30 | letr 137 | . . . . . . . . . 10 |
32 | 31 | df-le2 131 | . . . . . . . . 9 |
33 | leo 158 | . . . . . . . . . . 11 | |
34 | 29, 33 | letr 137 | . . . . . . . . . 10 |
35 | 34 | df-le2 131 | . . . . . . . . 9 |
36 | 32, 35 | 2an 79 | . . . . . . . 8 |
37 | 26, 36 | ax-r2 36 | . . . . . . 7 |
38 | 37 | lan 77 | . . . . . 6 |
39 | id 59 | . . . . . 6 | |
40 | 38, 39 | ax-r2 36 | . . . . 5 |
41 | 18, 40 | ax-r2 36 | . . . 4 |
42 | 9, 41 | ax-r2 36 | . . 3 |
43 | 7, 42 | ax-r2 36 | . 2 |
44 | 1, 43 | ax-r2 36 | 1 |
Colors of variables: term |
Syntax hints: wb 1 wn 4 wo 6 wa 7 wi4 15 |
This theorem was proved from axioms: ax-a1 30 ax-a2 31 ax-a3 32 ax-a4 33 ax-a5 34 ax-r1 35 ax-r2 36 ax-r4 37 ax-r5 38 ax-r3 439 |
This theorem depends on definitions: df-b 39 df-a 40 df-t 41 df-f 42 df-i4 47 df-le1 130 df-le2 131 df-c1 132 df-c2 133 |
This theorem is referenced by: u4lem1n 742 |
Copyright terms: Public domain | W3C validator |