| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addnqpru | Unicode version | ||
| Description: Lemma to prove upward closure in positive real addition. (Contributed by Jim Kingdon, 5-Dec-2019.) |
| Ref | Expression |
|---|---|
| addnqpru |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prop 7608 |
. . . . . 6
| |
| 2 | addnqprulem 7661 |
. . . . . 6
| |
| 3 | 1, 2 | sylanl1 402 |
. . . . 5
|
| 4 | 3 | adantlr 477 |
. . . 4
|
| 5 | prop 7608 |
. . . . . 6
| |
| 6 | addnqprulem 7661 |
. . . . . 6
| |
| 7 | 5, 6 | sylanl1 402 |
. . . . 5
|
| 8 | 7 | adantll 476 |
. . . 4
|
| 9 | 4, 8 | jcad 307 |
. . 3
|
| 10 | simpl 109 |
. . . 4
| |
| 11 | simpl 109 |
. . . . 5
| |
| 12 | simpl 109 |
. . . . 5
| |
| 13 | 11, 12 | anim12i 338 |
. . . 4
|
| 14 | df-iplp 7601 |
. . . . 5
| |
| 15 | addclnq 7508 |
. . . . 5
| |
| 16 | 14, 15 | genppreclu 7648 |
. . . 4
|
| 17 | 10, 13, 16 | 3syl 17 |
. . 3
|
| 18 | 9, 17 | syld 45 |
. 2
|
| 19 | simpr 110 |
. . . . 5
| |
| 20 | elprnqu 7615 |
. . . . . . . . 9
| |
| 21 | 1, 20 | sylan 283 |
. . . . . . . 8
|
| 22 | 21 | ad2antrr 488 |
. . . . . . 7
|
| 23 | elprnqu 7615 |
. . . . . . . . 9
| |
| 24 | 5, 23 | sylan 283 |
. . . . . . . 8
|
| 25 | 24 | ad2antlr 489 |
. . . . . . 7
|
| 26 | addclnq 7508 |
. . . . . . 7
| |
| 27 | 22, 25, 26 | syl2anc 411 |
. . . . . 6
|
| 28 | recclnq 7525 |
. . . . . 6
| |
| 29 | 27, 28 | syl 14 |
. . . . 5
|
| 30 | mulassnqg 7517 |
. . . . 5
| |
| 31 | 19, 29, 27, 30 | syl3anc 1250 |
. . . 4
|
| 32 | mulclnq 7509 |
. . . . . 6
| |
| 33 | 19, 29, 32 | syl2anc 411 |
. . . . 5
|
| 34 | distrnqg 7520 |
. . . . 5
| |
| 35 | 33, 22, 25, 34 | syl3anc 1250 |
. . . 4
|
| 36 | mulcomnqg 7516 |
. . . . . . . 8
| |
| 37 | 29, 27, 36 | syl2anc 411 |
. . . . . . 7
|
| 38 | recidnq 7526 |
. . . . . . . 8
| |
| 39 | 27, 38 | syl 14 |
. . . . . . 7
|
| 40 | 37, 39 | eqtrd 2239 |
. . . . . 6
|
| 41 | 40 | oveq2d 5973 |
. . . . 5
|
| 42 | mulidnq 7522 |
. . . . . 6
| |
| 43 | 42 | adantl 277 |
. . . . 5
|
| 44 | 41, 43 | eqtrd 2239 |
. . . 4
|
| 45 | 31, 35, 44 | 3eqtr3d 2247 |
. . 3
|
| 46 | 45 | eleq1d 2275 |
. 2
|
| 47 | 18, 46 | sylibd 149 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4167 ax-sep 4170 ax-nul 4178 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-iinf 4644 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3857 df-int 3892 df-iun 3935 df-br 4052 df-opab 4114 df-mpt 4115 df-tr 4151 df-eprel 4344 df-id 4348 df-iord 4421 df-on 4423 df-suc 4426 df-iom 4647 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-f1 5285 df-fo 5286 df-f1o 5287 df-fv 5288 df-ov 5960 df-oprab 5961 df-mpo 5962 df-1st 6239 df-2nd 6240 df-recs 6404 df-irdg 6469 df-1o 6515 df-oadd 6519 df-omul 6520 df-er 6633 df-ec 6635 df-qs 6639 df-ni 7437 df-pli 7438 df-mi 7439 df-lti 7440 df-plpq 7477 df-mpq 7478 df-enq 7480 df-nqqs 7481 df-plqqs 7482 df-mqqs 7483 df-1nqqs 7484 df-rq 7485 df-ltnqqs 7486 df-inp 7599 df-iplp 7601 |
| This theorem is referenced by: addlocprlemeq 7666 addlocprlemgt 7667 addclpr 7670 |
| Copyright terms: Public domain | W3C validator |