Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elfzom1elp1fzo | Structured version Visualization version GIF version |
Description: Membership of an integer incremented by one in a half-open range of nonnegative integers. (Contributed by Alexander van der Vekens, 24-Jun-2018.) (Proof shortened by AV, 5-Jan-2020.) |
Ref | Expression |
---|---|
elfzom1elp1fzo | ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (𝐼 + 1) ∈ (0..^𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfzofz 13041 | . . . . . . 7 ⊢ (𝐼 ∈ (0..^(𝑁 − 1)) → 𝐼 ∈ (0...(𝑁 − 1))) | |
2 | elfzuz2 12900 | . . . . . . 7 ⊢ (𝐼 ∈ (0...(𝑁 − 1)) → (𝑁 − 1) ∈ (ℤ≥‘0)) | |
3 | elnn0uz 12271 | . . . . . . . 8 ⊢ ((𝑁 − 1) ∈ ℕ0 ↔ (𝑁 − 1) ∈ (ℤ≥‘0)) | |
4 | zcn 11974 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
5 | 4 | anim1i 614 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ (𝑁 − 1) ∈ ℕ0) → (𝑁 ∈ ℂ ∧ (𝑁 − 1) ∈ ℕ0)) |
6 | elnnnn0 11928 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℂ ∧ (𝑁 − 1) ∈ ℕ0)) | |
7 | 5, 6 | sylibr 235 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ (𝑁 − 1) ∈ ℕ0) → 𝑁 ∈ ℕ) |
8 | 7 | expcom 414 | . . . . . . . 8 ⊢ ((𝑁 − 1) ∈ ℕ0 → (𝑁 ∈ ℤ → 𝑁 ∈ ℕ)) |
9 | 3, 8 | sylbir 236 | . . . . . . 7 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘0) → (𝑁 ∈ ℤ → 𝑁 ∈ ℕ)) |
10 | 1, 2, 9 | 3syl 18 | . . . . . 6 ⊢ (𝐼 ∈ (0..^(𝑁 − 1)) → (𝑁 ∈ ℤ → 𝑁 ∈ ℕ)) |
11 | 10 | impcom 408 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝑁 ∈ ℕ) |
12 | 1nn0 11901 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
13 | 12 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℕ0) |
14 | nnnn0 11892 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
15 | nnge1 11653 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ≤ 𝑁) | |
16 | 13, 14, 15 | 3jca 1120 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (1 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) |
17 | 11, 16 | syl 17 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (1 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) |
18 | elfz2nn0 12986 | . . . 4 ⊢ (1 ∈ (0...𝑁) ↔ (1 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) | |
19 | 17, 18 | sylibr 235 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 1 ∈ (0...𝑁)) |
20 | fzossrbm1 13054 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (0..^(𝑁 − 1)) ⊆ (0..^𝑁)) | |
21 | 20 | adantr 481 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (0..^(𝑁 − 1)) ⊆ (0..^𝑁)) |
22 | fzossfz 13044 | . . . . . 6 ⊢ (0..^𝑁) ⊆ (0...𝑁) | |
23 | 21, 22 | sstrdi 3976 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (0..^(𝑁 − 1)) ⊆ (0...𝑁)) |
24 | simpr 485 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝐼 ∈ (0..^(𝑁 − 1))) | |
25 | 23, 24 | jca 512 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → ((0..^(𝑁 − 1)) ⊆ (0...𝑁) ∧ 𝐼 ∈ (0..^(𝑁 − 1)))) |
26 | ssel2 3959 | . . . 4 ⊢ (((0..^(𝑁 − 1)) ⊆ (0...𝑁) ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝐼 ∈ (0...𝑁)) | |
27 | elfzubelfz 12907 | . . . 4 ⊢ (𝐼 ∈ (0...𝑁) → 𝑁 ∈ (0...𝑁)) | |
28 | 25, 26, 27 | 3syl 18 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝑁 ∈ (0...𝑁)) |
29 | 19, 28 | jca 512 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (1 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...𝑁))) |
30 | elfzodifsumelfzo 13091 | . 2 ⊢ ((1 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...𝑁)) → (𝐼 ∈ (0..^(𝑁 − 1)) → (𝐼 + 1) ∈ (0..^𝑁))) | |
31 | 29, 24, 30 | sylc 65 | 1 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (𝐼 + 1) ∈ (0..^𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1079 ∈ wcel 2105 ⊆ wss 3933 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 ℂcc 10523 0cc0 10525 1c1 10526 + caddc 10528 ≤ cle 10664 − cmin 10858 ℕcn 11626 ℕ0cn0 11885 ℤcz 11969 ℤ≥cuz 12231 ...cfz 12880 ..^cfzo 13021 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-fzo 13022 |
This theorem is referenced by: elfzom1p1elfzo 13105 clwwlkccatlem 27694 clwlkclwwlk 27707 clwwlkinwwlk 27745 clwwlkf 27753 clwwlkwwlksb 27760 cycpmco2lem7 30701 |
Copyright terms: Public domain | W3C validator |