| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fznn0sub2 | Structured version Visualization version GIF version | ||
| Description: Subtraction closure for a member of a finite set of sequential nonnegative integers. (Contributed by NM, 26-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| fznn0sub2 | ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ (0...𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzle1 13457 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → 0 ≤ 𝐾) | |
| 2 | elfzel2 13452 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → 𝑁 ∈ ℤ) | |
| 3 | elfzelz 13454 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → 𝐾 ∈ ℤ) | |
| 4 | zre 12506 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 5 | zre 12506 | . . . . 5 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
| 6 | subge02 11667 | . . . . 5 ⊢ ((𝑁 ∈ ℝ ∧ 𝐾 ∈ ℝ) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) | |
| 7 | 4, 5, 6 | syl2an 597 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
| 8 | 2, 3, 7 | syl2anc 585 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
| 9 | 1, 8 | mpbid 232 | . 2 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ≤ 𝑁) |
| 10 | fznn0sub 13486 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ ℕ0) | |
| 11 | nn0uz 12803 | . . . 4 ⊢ ℕ0 = (ℤ≥‘0) | |
| 12 | 10, 11 | eleqtrdi 2847 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ (ℤ≥‘0)) |
| 13 | elfz5 13446 | . . 3 ⊢ (((𝑁 − 𝐾) ∈ (ℤ≥‘0) ∧ 𝑁 ∈ ℤ) → ((𝑁 − 𝐾) ∈ (0...𝑁) ↔ (𝑁 − 𝐾) ≤ 𝑁)) | |
| 14 | 12, 2, 13 | syl2anc 585 | . 2 ⊢ (𝐾 ∈ (0...𝑁) → ((𝑁 − 𝐾) ∈ (0...𝑁) ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
| 15 | 9, 14 | mpbird 257 | 1 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ (0...𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2114 class class class wbr 5100 ‘cfv 6502 (class class class)co 7370 ℝcr 11039 0cc0 11040 ≤ cle 11181 − cmin 11378 ℕ0cn0 12415 ℤcz 12502 ℤ≥cuz 12765 ...cfz 13437 |
| 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 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| 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 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-n0 12416 df-z 12503 df-uz 12766 df-fz 13438 |
| This theorem is referenced by: uzsubfz0 13566 bccmpl 14246 pfxlswccat 14650 revcl 14698 revlen 14699 revccat 14703 revrev 14704 2cshwcshw 14762 cshwcshid 14764 revco 14771 fsum0diag2 15720 mertenslem1 15821 cshwshashlem2 17038 taylthlem2 26355 taylthlem2OLD 26356 birthdaylem2 26935 basellem3 27066 eleclclwwlknlem2 30154 gsummptrev 33156 vietalem 33762 vieta 33763 signstfveq0 34761 revpfxsfxrev 35338 swrdrevpfx 35339 swrdwlk 35349 dvnprodlem2 46334 ply1mulgsumlem2 48776 |
| Copyright terms: Public domain | W3C validator |