| 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 7570 |
. . . . . 6
| |
| 2 | addnqprulem 7623 |
. . . . . 6
| |
| 3 | 1, 2 | sylanl1 402 |
. . . . 5
|
| 4 | 3 | adantlr 477 |
. . . 4
|
| 5 | prop 7570 |
. . . . . 6
| |
| 6 | addnqprulem 7623 |
. . . . . 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 7563 |
. . . . 5
| |
| 15 | addclnq 7470 |
. . . . 5
| |
| 16 | 14, 15 | genppreclu 7610 |
. . . 4
|
| 17 | 10, 13, 16 | 3syl 17 |
. . 3
|
| 18 | 9, 17 | syld 45 |
. 2
|
| 19 | simpr 110 |
. . . . 5
| |
| 20 | elprnqu 7577 |
. . . . . . . . 9
| |
| 21 | 1, 20 | sylan 283 |
. . . . . . . 8
|
| 22 | 21 | ad2antrr 488 |
. . . . . . 7
|
| 23 | elprnqu 7577 |
. . . . . . . . 9
| |
| 24 | 5, 23 | sylan 283 |
. . . . . . . 8
|
| 25 | 24 | ad2antlr 489 |
. . . . . . 7
|
| 26 | addclnq 7470 |
. . . . . . 7
| |
| 27 | 22, 25, 26 | syl2anc 411 |
. . . . . 6
|
| 28 | recclnq 7487 |
. . . . . 6
| |
| 29 | 27, 28 | syl 14 |
. . . . 5
|
| 30 | mulassnqg 7479 |
. . . . 5
| |
| 31 | 19, 29, 27, 30 | syl3anc 1249 |
. . . 4
|
| 32 | mulclnq 7471 |
. . . . . 6
| |
| 33 | 19, 29, 32 | syl2anc 411 |
. . . . 5
|
| 34 | distrnqg 7482 |
. . . . 5
| |
| 35 | 33, 22, 25, 34 | syl3anc 1249 |
. . . 4
|
| 36 | mulcomnqg 7478 |
. . . . . . . 8
| |
| 37 | 29, 27, 36 | syl2anc 411 |
. . . . . . 7
|
| 38 | recidnq 7488 |
. . . . . . . 8
| |
| 39 | 27, 38 | syl 14 |
. . . . . . 7
|
| 40 | 37, 39 | eqtrd 2237 |
. . . . . 6
|
| 41 | 40 | oveq2d 5950 |
. . . . 5
|
| 42 | mulidnq 7484 |
. . . . . 6
| |
| 43 | 42 | adantl 277 |
. . . . 5
|
| 44 | 41, 43 | eqtrd 2237 |
. . . 4
|
| 45 | 31, 35, 44 | 3eqtr3d 2245 |
. . 3
|
| 46 | 45 | eleq1d 2273 |
. 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-nul 4169 ax-pow 4217 ax-pr 4252 ax-un 4478 ax-setind 4583 ax-iinf 4634 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-ral 2488 df-rex 2489 df-reu 2490 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-nul 3460 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-tr 4142 df-eprel 4334 df-id 4338 df-iord 4411 df-on 4413 df-suc 4416 df-iom 4637 df-xp 4679 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-rn 4684 df-res 4685 df-ima 4686 df-iota 5229 df-fun 5270 df-fn 5271 df-f 5272 df-f1 5273 df-fo 5274 df-f1o 5275 df-fv 5276 df-ov 5937 df-oprab 5938 df-mpo 5939 df-1st 6216 df-2nd 6217 df-recs 6381 df-irdg 6446 df-1o 6492 df-oadd 6496 df-omul 6497 df-er 6610 df-ec 6612 df-qs 6616 df-ni 7399 df-pli 7400 df-mi 7401 df-lti 7402 df-plpq 7439 df-mpq 7440 df-enq 7442 df-nqqs 7443 df-plqqs 7444 df-mqqs 7445 df-1nqqs 7446 df-rq 7447 df-ltnqqs 7448 df-inp 7561 df-iplp 7563 |
| This theorem is referenced by: addlocprlemeq 7628 addlocprlemgt 7629 addclpr 7632 |
| Copyright terms: Public domain | W3C validator |