| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addnqprl | Unicode version | ||
| Description: Lemma to prove downward closure in positive real addition. (Contributed by Jim Kingdon, 5-Dec-2019.) |
| Ref | Expression |
|---|---|
| addnqprl |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prop 7738 |
. . . . . 6
| |
| 2 | addnqprllem 7790 |
. . . . . 6
| |
| 3 | 1, 2 | sylanl1 402 |
. . . . 5
|
| 4 | 3 | adantlr 477 |
. . . 4
|
| 5 | prop 7738 |
. . . . . 6
| |
| 6 | addnqprllem 7790 |
. . . . . 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 7731 |
. . . . 5
| |
| 15 | addclnq 7638 |
. . . . 5
| |
| 16 | 14, 15 | genpprecll 7777 |
. . . 4
|
| 17 | 10, 13, 16 | 3syl 17 |
. . 3
|
| 18 | 9, 17 | syld 45 |
. 2
|
| 19 | simpr 110 |
. . . . 5
| |
| 20 | elprnql 7744 |
. . . . . . . . 9
| |
| 21 | 1, 20 | sylan 283 |
. . . . . . . 8
|
| 22 | 21 | ad2antrr 488 |
. . . . . . 7
|
| 23 | elprnql 7744 |
. . . . . . . . 9
| |
| 24 | 5, 23 | sylan 283 |
. . . . . . . 8
|
| 25 | 24 | ad2antlr 489 |
. . . . . . 7
|
| 26 | addclnq 7638 |
. . . . . . 7
| |
| 27 | 22, 25, 26 | syl2anc 411 |
. . . . . 6
|
| 28 | recclnq 7655 |
. . . . . 6
| |
| 29 | 27, 28 | syl 14 |
. . . . 5
|
| 30 | mulassnqg 7647 |
. . . . 5
| |
| 31 | 19, 29, 27, 30 | syl3anc 1274 |
. . . 4
|
| 32 | mulclnq 7639 |
. . . . . 6
| |
| 33 | 19, 29, 32 | syl2anc 411 |
. . . . 5
|
| 34 | distrnqg 7650 |
. . . . 5
| |
| 35 | 33, 22, 25, 34 | syl3anc 1274 |
. . . 4
|
| 36 | mulcomnqg 7646 |
. . . . . . . 8
| |
| 37 | 29, 27, 36 | syl2anc 411 |
. . . . . . 7
|
| 38 | recidnq 7656 |
. . . . . . . 8
| |
| 39 | 27, 38 | syl 14 |
. . . . . . 7
|
| 40 | 37, 39 | eqtrd 2264 |
. . . . . 6
|
| 41 | 40 | oveq2d 6044 |
. . . . 5
|
| 42 | mulidnq 7652 |
. . . . . 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-eprel 4392 df-id 4396 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-1o 6625 df-oadd 6629 df-omul 6630 df-er 6745 df-ec 6747 df-qs 6751 df-ni 7567 df-pli 7568 df-mi 7569 df-lti 7570 df-plpq 7607 df-mpq 7608 df-enq 7610 df-nqqs 7611 df-plqqs 7612 df-mqqs 7613 df-1nqqs 7614 df-rq 7615 df-ltnqqs 7616 df-inp 7729 df-iplp 7731 |
| This theorem is referenced by: addlocprlemlt 7794 addclpr 7800 |
| Copyright terms: Public domain | W3C validator |