| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpaddcl | Structured version Visualization version GIF version | ||
| Description: Closure law for addition of positive reals. Part of Axiom 7 of [Apostol] p. 20. (Contributed by NM, 27-Oct-2007.) |
| Ref | Expression |
|---|---|
| rpaddcl | ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ+) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rpre 13025 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ) | |
| 2 | rpre 13025 | . . 3 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
| 3 | readdcl 11183 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 4 | 1, 2, 3 | syl2an 607 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ) |
| 5 | elrp 13018 | . . 3 ⊢ (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) | |
| 6 | elrp 13018 | . . 3 ⊢ (𝐵 ∈ ℝ+ ↔ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) | |
| 7 | addgt0 11700 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 < 𝐴 ∧ 0 < 𝐵)) → 0 < (𝐴 + 𝐵)) | |
| 8 | 7 | an4s 672 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) → 0 < (𝐴 + 𝐵)) |
| 9 | 5, 6, 8 | syl2anb 609 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → 0 < (𝐴 + 𝐵)) |
| 10 | elrp 13018 | . 2 ⊢ ((𝐴 + 𝐵) ∈ ℝ+ ↔ ((𝐴 + 𝐵) ∈ ℝ ∧ 0 < (𝐴 + 𝐵))) | |
| 11 | 4, 9, 10 | sylanbrc 594 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ+) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2149 class class class wbr 5111 (class class class)co 7411 ℝcr 11099 0cc0 11100 + caddc 11103 < clt 11243 ℝ+crp 13016 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5557 df-po 5570 df-so 5571 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-rp 13017 |
| This theorem is referenced by: rpaddcld 13075 fsumrpcl 15788 logcnlem2 26774 logcnlem3 26775 logcnlem4 26776 loglesqrt 26892 ang180lem2 26941 cxp2limlem 27106 logdifbnd 27124 emcllem4 27129 emcllem5 27130 emcllem6 27131 selberg2lem 27680 chpdifbndlem2 27684 pntpbnd1a 27715 pntpbnd1 27716 pntpbnd2 27717 pntpbnd 27718 pntibndlem1 27719 pntibndlem2 27721 pntibnd 27723 pntlemd 27724 pntlemq 27731 pntlemr 27732 pntlemj 27733 pntlemp 27740 pntleml 27741 smcnlem 30990 qdiff 37894 hoidmvlelem3 47238 amgmwlem 50511 |
| Copyright terms: Public domain | W3C validator |