| 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 7832 |
. . . . . 6
| |
| 2 | addnqprulem 7885 |
. . . . . 6
| |
| 3 | 1, 2 | sylanl1 406 |
. . . . 5
|
| 4 | 3 | adantlr 481 |
. . . 4
|
| 5 | prop 7832 |
. . . . . 6
| |
| 6 | addnqprulem 7885 |
. . . . . 6
| |
| 7 | 5, 6 | sylanl1 406 |
. . . . 5
|
| 8 | 7 | adantll 480 |
. . . 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 7825 |
. . . . 5
| |
| 15 | addclnq 7732 |
. . . . 5
| |
| 16 | 14, 15 | genppreclu 7872 |
. . . 4
|
| 17 | 10, 13, 16 | 3syl 17 |
. . 3
|
| 18 | 9, 17 | syld 45 |
. 2
|
| 19 | simpr 110 |
. . . . 5
| |
| 20 | elprnqu 7839 |
. . . . . . . . 9
| |
| 21 | 1, 20 | sylan 283 |
. . . . . . . 8
|
| 22 | 21 | ad2antrr 492 |
. . . . . . 7
|
| 23 | elprnqu 7839 |
. . . . . . . . 9
| |
| 24 | 5, 23 | sylan 283 |
. . . . . . . 8
|
| 25 | 24 | ad2antlr 493 |
. . . . . . 7
|
| 26 | addclnq 7732 |
. . . . . . 7
| |
| 27 | 22, 25, 26 | syl2anc 415 |
. . . . . 6
|
| 28 | recclnq 7749 |
. . . . . 6
| |
| 29 | 27, 28 | syl 14 |
. . . . 5
|
| 30 | mulassnqg 7741 |
. . . . 5
| |
| 31 | 19, 29, 27, 30 | syl3anc 1278 |
. . . 4
|
| 32 | mulclnq 7733 |
. . . . . 6
| |
| 33 | 19, 29, 32 | syl2anc 415 |
. . . . 5
|
| 34 | distrnqg 7744 |
. . . . 5
| |
| 35 | 33, 22, 25, 34 | syl3anc 1278 |
. . . 4
|
| 36 | mulcomnqg 7740 |
. . . . . . . 8
| |
| 37 | 29, 27, 36 | syl2anc 415 |
. . . . . . 7
|
| 38 | recidnq 7750 |
. . . . . . . 8
| |
| 39 | 27, 38 | syl 14 |
. . . . . . 7
|
| 40 | 37, 39 | eqtrd 2271 |
. . . . . 6
|
| 41 | 40 | oveq2d 6091 |
. . . . 5
|
| 42 | mulidnq 7746 |
. . . . . 6
| |
| 43 | 42 | adantl 277 |
. . . . 5
|
| 44 | 41, 43 | eqtrd 2271 |
. . . 4
|
| 45 | 31, 35, 44 | 3eqtr3d 2279 |
. . 3
|
| 46 | 45 | eleq1d 2307 |
. 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-eprel 4429 df-id 4433 df-iord 4506 df-on 4508 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-irdg 6631 df-1o 6677 df-oadd 6681 df-omul 6682 df-er 6797 df-ec 6799 df-qs 6803 df-ni 7661 df-pli 7662 df-mi 7663 df-lti 7664 df-plpq 7701 df-mpq 7702 df-enq 7704 df-nqqs 7705 df-plqqs 7706 df-mqqs 7707 df-1nqqs 7708 df-rq 7709 df-ltnqqs 7710 df-inp 7823 df-iplp 7825 |
| This theorem is referenced by: addlocprlemeq 7890 addlocprlemgt 7891 addclpr 7894 |
| Copyright terms: Public domain | W3C validator |