![]() |
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 13504 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → 0 ≤ 𝐾) | |
2 | elfzel2 13499 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → 𝑁 ∈ ℤ) | |
3 | elfzelz 13501 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → 𝐾 ∈ ℤ) | |
4 | zre 12562 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
5 | zre 12562 | . . . . 5 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
6 | subge02 11730 | . . . . 5 ⊢ ((𝑁 ∈ ℝ ∧ 𝐾 ∈ ℝ) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) | |
7 | 4, 5, 6 | syl2an 597 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
8 | 2, 3, 7 | syl2anc 585 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → (0 ≤ 𝐾 ↔ (𝑁 − 𝐾) ≤ 𝑁)) |
9 | 1, 8 | mpbid 231 | . 2 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ≤ 𝑁) |
10 | fznn0sub 13533 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ ℕ0) | |
11 | nn0uz 12864 | . . . 4 ⊢ ℕ0 = (ℤ≥‘0) | |
12 | 10, 11 | eleqtrdi 2844 | . . 3 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁 − 𝐾) ∈ (ℤ≥‘0)) |
13 | elfz5 13493 | . . 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 205 ∈ wcel 2107 class class class wbr 5149 ‘cfv 6544 (class class class)co 7409 ℝcr 11109 0cc0 11110 ≤ cle 11249 − cmin 11444 ℕ0cn0 12472 ℤcz 12558 ℤ≥cuz 12822 ...cfz 13484 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-n0 12473 df-z 12559 df-uz 12823 df-fz 13485 |
This theorem is referenced by: uzsubfz0 13609 bccmpl 14269 pfxlswccat 14663 revcl 14711 revlen 14712 revccat 14716 revrev 14717 2cshwcshw 14776 cshwcshid 14778 revco 14785 fsum0diag2 15729 mertenslem1 15830 cshwshashlem2 17030 taylthlem2 25886 birthdaylem2 26457 basellem3 26587 eleclclwwlknlem2 29314 signstfveq0 33588 revpfxsfxrev 34106 swrdrevpfx 34107 swrdwlk 34117 dvnprodlem2 44663 ply1mulgsumlem2 47068 |
Copyright terms: Public domain | W3C validator |