| 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 7694 |
. . . . . 6
| |
| 2 | addnqprulem 7747 |
. . . . . 6
| |
| 3 | 1, 2 | sylanl1 402 |
. . . . 5
|
| 4 | 3 | adantlr 477 |
. . . 4
|
| 5 | prop 7694 |
. . . . . 6
| |
| 6 | addnqprulem 7747 |
. . . . . 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 7687 |
. . . . 5
| |
| 15 | addclnq 7594 |
. . . . 5
| |
| 16 | 14, 15 | genppreclu 7734 |
. . . 4
|
| 17 | 10, 13, 16 | 3syl 17 |
. . 3
|
| 18 | 9, 17 | syld 45 |
. 2
|
| 19 | simpr 110 |
. . . . 5
| |
| 20 | elprnqu 7701 |
. . . . . . . . 9
| |
| 21 | 1, 20 | sylan 283 |
. . . . . . . 8
|
| 22 | 21 | ad2antrr 488 |
. . . . . . 7
|
| 23 | elprnqu 7701 |
. . . . . . . . 9
| |
| 24 | 5, 23 | sylan 283 |
. . . . . . . 8
|
| 25 | 24 | ad2antlr 489 |
. . . . . . 7
|
| 26 | addclnq 7594 |
. . . . . . 7
| |
| 27 | 22, 25, 26 | syl2anc 411 |
. . . . . 6
|
| 28 | recclnq 7611 |
. . . . . 6
| |
| 29 | 27, 28 | syl 14 |
. . . . 5
|
| 30 | mulassnqg 7603 |
. . . . 5
| |
| 31 | 19, 29, 27, 30 | syl3anc 1273 |
. . . 4
|
| 32 | mulclnq 7595 |
. . . . . 6
| |
| 33 | 19, 29, 32 | syl2anc 411 |
. . . . 5
|
| 34 | distrnqg 7606 |
. . . . 5
| |
| 35 | 33, 22, 25, 34 | syl3anc 1273 |
. . . 4
|
| 36 | mulcomnqg 7602 |
. . . . . . . 8
| |
| 37 | 29, 27, 36 | syl2anc 411 |
. . . . . . 7
|
| 38 | recidnq 7612 |
. . . . . . . 8
| |
| 39 | 27, 38 | syl 14 |
. . . . . . 7
|
| 40 | 37, 39 | eqtrd 2264 |
. . . . . 6
|
| 41 | 40 | oveq2d 6033 |
. . . . 5
|
| 42 | mulidnq 7608 |
. . . . . 6
| |
| 43 | 42 | adantl 277 |
. . . . 5
|
| 44 | 41, 43 | eqtrd 2264 |
. . . 4
|
| 45 | 31, 35, 44 | 3eqtr3d 2272 |
. . 3
|
| 46 | 45 | eleq1d 2300 |
. 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-eprel 4386 df-id 4390 df-iord 4463 df-on 4465 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-irdg 6535 df-1o 6581 df-oadd 6585 df-omul 6586 df-er 6701 df-ec 6703 df-qs 6707 df-ni 7523 df-pli 7524 df-mi 7525 df-lti 7526 df-plpq 7563 df-mpq 7564 df-enq 7566 df-nqqs 7567 df-plqqs 7568 df-mqqs 7569 df-1nqqs 7570 df-rq 7571 df-ltnqqs 7572 df-inp 7685 df-iplp 7687 |
| This theorem is referenced by: addlocprlemeq 7752 addlocprlemgt 7753 addclpr 7756 |
| Copyright terms: Public domain | W3C validator |