| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Lemma to prove downward closure in positive real addition. Part of proof of Proposition 9-3.5 of [Gleason] p. 123. |
| Ref | Expression |
|---|---|
| addclprlem2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addclprlem1 5183 |
. . . . 5
| |
| 2 | 1 | adantlr 402 |
. . . 4
|
| 3 | addclprlem1 5183 |
. . . . . 6
| |
| 4 | visset 1860 |
. . . . . . . 8
| |
| 5 | visset 1860 |
. . . . . . . 8
| |
| 6 | 4, 5 | addcompq 5127 |
. . . . . . 7
|
| 7 | 6 | breq2i 2682 |
. . . . . 6
|
| 8 | 6 | fveq2i 3784 |
. . . . . . . . 9
|
| 9 | 8 | opreq2i 4030 |
. . . . . . . 8
|
| 10 | 9 | opreq1i 4029 |
. . . . . . 7
|
| 11 | 10 | eleq1i 1584 |
. . . . . 6
|
| 12 | 3, 7, 11 | 3imtr4g 564 |
. . . . 5
|
| 13 | 12 | adantll 401 |
. . . 4
|
| 14 | 2, 13 | jcad 611 |
. . 3
|
| 15 | pm3.26 326 |
. . . 4
| |
| 16 | pm3.26 326 |
. . . . 5
| |
| 17 | pm3.26 326 |
. . . . 5
| |
| 18 | 16, 17 | anim12i 340 |
. . . 4
|
| 19 | df-plp 5153 |
. . . . 5
| |
| 20 | 19 | genpprecl 5169 |
. . . 4
|
| 21 | 15, 18, 20 | 3syl 20 |
. . 3
|
| 22 | 14, 21 | syld 27 |
. 2
|
| 23 | elprpq 5160 |
. . . . . . . . 9
| |
| 24 | elprpq 5160 |
. . . . . . . . 9
| |
| 25 | 23, 24 | anim12i 340 |
. . . . . . . 8
|
| 26 | addclpq 5123 |
. . . . . . . 8
| |
| 27 | recidpq 5136 |
. . . . . . . 8
| |
| 28 | 25, 26, 27 | 3syl 20 |
. . . . . . 7
|
| 29 | fvex 3789 |
. . . . . . . 8
| |
| 30 | oprex 4041 |
. . . . . . . 8
| |
| 31 | 29, 30 | mulcompq 5129 |
. . . . . . 7
|
| 32 | 28, 31 | syl5eq 1566 |
. . . . . 6
|
| 33 | 32 | opreq2d 4034 |
. . . . 5
|
| 34 | mulidpq 5134 |
. . . . 5
| |
| 35 | 33, 34 | sylan9eq 1574 |
. . . 4
|
| 36 | 4, 5 | distrpq 5132 |
. . . . 5
|
| 37 | 29, 30 | mulasspq 5130 |
. . . . 5
|
| 38 | 36, 37 | eqtr3i 1544 |
. . . 4
|
| 39 | 35, 38 | syl5eq 1566 |
. . 3
|
| 40 | 39 | eleq1d 1587 |
. 2
|
| 41 | 22, 40 | sylibd 209 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: addclpr 5185 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1003 ax-gen 1004 ax-8 1005 ax-9 1006 ax-10 1007 ax-11 1008 ax-12 1009 ax-13 1010 ax-14 1011 ax-17 1012 ax-4 1014 ax-5o 1016 ax-6o 1019 ax-9o 1164 ax-10o 1182 ax-16 1252 ax-11o 1260 ax-ext 1504 ax-rep 2748 ax-sep 2758 ax-nul 2765 ax-pow 2798 ax-pr 2835 ax-un 2922 ax-inf2 4687 |
| This theorem depends on definitions: df-bi 154 df-or 231 df-an 232 df-3or 788 df-3an 789 df-ex 1022 df-sb 1214 df-eu 1424 df-mo 1425 df-clab 1510 df-cleq 1515 df-clel 1518 df-ne 1634 df-ral 1696 df-rex 1697 df-reu 1698 df-rab 1699 df-v 1859 df-sbc 1989 df-csb 2052 df-dif 2100 df-un 2101 df-in 2102 df-ss 2104 df-pss 2106 df-nul 2332 df-if 2414 df-pw 2454 df-sn 2464 df-pr 2465 df-tp 2467 df-op 2468 df-uni 2558 df-int 2588 df-iun 2622 df-br 2675 df-opab 2722 df-tr 2736 df-eprel 2888 df-id 2891 df-po 2896 df-so 2906 df-fr 2974 df-we 2991 df-ord 3008 df-on 3009 df-lim 3010 df-suc 3011 df-om 3189 df-xp 3241 df-rel 3242 df-cnv 3243 df-co 3244 df-dm 3245 df-rn 3246 df-res 3247 df-ima 3248 df-fun 3249 df-fn 3250 df-f 3251 df-fv 3255 df-rdg 3990 df-opr 4023 df-oprab 4024 df-1st 4137 df-2nd 4138 df-1o 4191 df-oadd 4193 df-omul 4194 df-er 4319 df-ec 4321 df-qs 4324 df-ni 5065 df-pli 5066 df-mi 5067 df-lti 5068 df-plpq 5100 df-mpq 5101 df-enq 5102 df-nq 5103 df-plq 5104 df-mq 5105 df-rq 5106 df-ltq 5107 df-1q 5108 df-np 5151 df-plp 5153 |