| 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 13441 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → 0 ≤ 𝐾) | |
| 2 | elfzel2 13436 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → 𝑁 ∈ ℤ) | |
| 3 | elfzelz 13438 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → 𝐾 ∈ ℤ) | |
| 4 | zre 12490 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 5 | zre 12490 | . . . . 5 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
| 6 | subge02 11651 | . . . . 5 ⊢ ((𝑁 ∈ ℝ ∧ 𝐾 ∈ ℝ) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) | |
| 7 | 4, 5, 6 | syl2an 596 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
| 8 | 2, 3, 7 | syl2anc 584 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
| 9 | 1, 8 | mpbid 232 | . 2 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ≤ 𝑁) |
| 10 | fznn0sub 13470 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ ℕ0) | |
| 11 | nn0uz 12787 | . . . 4 ⊢ ℕ0 = (ℤ≥‘0) | |
| 12 | 10, 11 | eleqtrdi 2844 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ (ℤ≥‘0)) |
| 13 | elfz5 13430 | . . 3 ⊢ (((𝑁 − 𝐾) ∈ (ℤ≥‘0) ∧ 𝑁 ∈ ℤ) → ((𝑁 − 𝐾) ∈ (0...𝑁) ↔ (𝑁 − 𝐾) ≤ 𝑁)) | |
| 14 | 12, 2, 13 | syl2anc 584 | . 2 ⊢ (𝐾 ∈ (0...𝑁) → ((𝑁 − 𝐾) ∈ (0...𝑁) ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
| 15 | 9, 14 | mpbird 257 | 1 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ (0...𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2113 class class class wbr 5096 ‘cfv 6490 (class class class)co 7356 ℝcr 11023 0cc0 11024 ≤ cle 11165 − cmin 11362 ℕ0cn0 12399 ℤcz 12486 ℤ≥cuz 12749 ...cfz 13421 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-fz 13422 |
| This theorem is referenced by: uzsubfz0 13550 bccmpl 14230 pfxlswccat 14634 revcl 14682 revlen 14683 revccat 14687 revrev 14688 2cshwcshw 14746 cshwcshid 14748 revco 14755 fsum0diag2 15704 mertenslem1 15805 cshwshashlem2 17022 taylthlem2 26336 taylthlem2OLD 26337 birthdaylem2 26916 basellem3 27047 eleclclwwlknlem2 30085 gsummptrev 33088 vietalem 33684 vieta 33685 signstfveq0 34683 revpfxsfxrev 35259 swrdrevpfx 35260 swrdwlk 35270 dvnprodlem2 46133 ply1mulgsumlem2 48575 |
| Copyright terms: Public domain | W3C validator |