![]() |
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 11894 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
2 | nn0ge0 11910 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 𝑁) | |
3 | 1, 2 | jca 515 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ ℝ ∧ 0 ≤ 𝑁)) |
4 | addge01 11139 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (0 ≤ 𝑁 ↔ 𝐴 ≤ (𝐴 + 𝑁))) | |
5 | 4 | biimp3a 1466 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 0 ≤ 𝑁) → 𝐴 ≤ (𝐴 + 𝑁)) |
6 | 5 | 3expb 1117 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ (𝑁 ∈ ℝ ∧ 0 ≤ 𝑁)) → 𝐴 ≤ (𝐴 + 𝑁)) |
7 | 3, 6 | sylan2 595 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → 𝐴 ≤ (𝐴 + 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2111 class class class wbr 5030 (class class class)co 7135 ℝcr 10525 0cc0 10526 + caddc 10529 ≤ cle 10665 ℕ0cn0 11885 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 |
This theorem is referenced by: nn0addge1i 11933 eluzmn 12238 fzctr 13014 elincfzoext 13090 pcaddlem 16214 psgnunilem2 18615 mndodconglem 18661 efgredleme 18861 mplmonmul 20704 coe1tmmul2fv 20907 coe1pwmulfv 20909 uniioombllem3 24189 coe1mul3 24700 ply1divmo 24736 plydiveu 24894 quotcan 24905 leibpi 25528 basellem6 25671 chtublem 25795 pntrmax 26148 signstfvc 31954 prodsplit 39386 fourierdlem47 42795 |
Copyright terms: Public domain | W3C validator |