| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nn0addge1 | Structured version Visualization version GIF version | ||
| Description: A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
| Ref | Expression |
|---|---|
| nn0addge1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → 𝐴 ≤ (𝐴 + 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0re 12515 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 2 | nn0ge0 12531 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 𝑁) | |
| 3 | 1, 2 | jca 511 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ ℝ ∧ 0 ≤ 𝑁)) |
| 4 | addge01 11752 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (0 ≤ 𝑁 ↔ 𝐴 ≤ (𝐴 + 𝑁))) | |
| 5 | 4 | biimp3a 1471 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 0 ≤ 𝑁) → 𝐴 ≤ (𝐴 + 𝑁)) |
| 6 | 5 | 3expb 1120 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ (𝑁 ∈ ℝ ∧ 0 ≤ 𝑁)) → 𝐴 ≤ (𝐴 + 𝑁)) |
| 7 | 3, 6 | sylan2 593 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → 𝐴 ≤ (𝐴 + 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2109 class class class wbr 5124 (class class class)co 7410 ℝcr 11133 0cc0 11134 + caddc 11137 ≤ cle 11275 ℕ0cn0 12506 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-nn 12246 df-n0 12507 |
| This theorem is referenced by: nn0addge1i 12554 nn0le2x 12560 eluzmn 12864 fzctr 13662 elincfzoext 13744 pcaddlem 16913 psgnunilem2 19481 mndodconglem 19527 efgredleme 19729 mplmonmul 21999 coe1tmmul2fv 22220 coe1pwmulfv 22222 uniioombllem3 25543 coe1mul3 26061 ply1divmo 26098 plydiveu 26263 quotcan 26274 leibpi 26909 basellem6 27053 chtublem 27179 pntrmax 27532 ccatdmss 32930 ply1dg3rt0irred 33600 signstfvc 34611 fourierdlem47 46149 |
| Copyright terms: Public domain | W3C validator |