| 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 12918 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ) | |
| 2 | rpre 12918 | . . 3 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
| 3 | readdcl 11113 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 4 | 1, 2, 3 | syl2an 597 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ) |
| 5 | elrp 12911 | . . 3 ⊢ (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) | |
| 6 | elrp 12911 | . . 3 ⊢ (𝐵 ∈ ℝ+ ↔ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) | |
| 7 | addgt0 11627 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 < 𝐴 ∧ 0 < 𝐵)) → 0 < (𝐴 + 𝐵)) | |
| 8 | 7 | an4s 661 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) → 0 < (𝐴 + 𝐵)) |
| 9 | 5, 6, 8 | syl2anb 599 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → 0 < (𝐴 + 𝐵)) |
| 10 | elrp 12911 | . 2 ⊢ ((𝐴 + 𝐵) ∈ ℝ+ ↔ ((𝐴 + 𝐵) ∈ ℝ ∧ 0 < (𝐴 + 𝐵))) | |
| 11 | 4, 9, 10 | sylanbrc 584 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ+) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 class class class wbr 5099 (class class class)co 7360 ℝcr 11029 0cc0 11030 + caddc 11033 < clt 11170 ℝ+crp 12909 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-rp 12910 |
| This theorem is referenced by: rpaddcld 12968 fsumrpcl 15664 logcnlem2 26612 logcnlem3 26613 logcnlem4 26614 loglesqrt 26731 ang180lem2 26780 cxp2limlem 26946 logdifbnd 26964 emcllem4 26969 emcllem5 26970 emcllem6 26971 selberg2lem 27521 chpdifbndlem2 27525 pntpbnd1a 27556 pntpbnd1 27557 pntpbnd2 27558 pntpbnd 27559 pntibndlem1 27560 pntibndlem2 27562 pntibnd 27564 pntlemd 27565 pntlemq 27572 pntlemr 27573 pntlemj 27574 pntlemp 27581 pntleml 27582 smcnlem 30776 hoidmvlelem3 46908 amgmwlem 50114 |
| Copyright terms: Public domain | W3C validator |