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 12354 | . . . . . . 7 ⊢ (𝐼 ∈ (0..^(𝑁 − 1)) → 𝐼 ∈ (0...(𝑁 − 1))) | |
2 | elfzuz2 12217 | . . . . . . 7 ⊢ (𝐼 ∈ (0...(𝑁 − 1)) → (𝑁 − 1) ∈ (ℤ≥‘0)) | |
3 | elnn0uz 11601 | . . . . . . . 8 ⊢ ((𝑁 − 1) ∈ ℕ0 ↔ (𝑁 − 1) ∈ (ℤ≥‘0)) | |
4 | zcn 11259 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
5 | 4 | anim1i 590 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ (𝑁 − 1) ∈ ℕ0) → (𝑁 ∈ ℂ ∧ (𝑁 − 1) ∈ ℕ0)) |
6 | elnnnn0 11213 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℂ ∧ (𝑁 − 1) ∈ ℕ0)) | |
7 | 5, 6 | sylibr 223 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ (𝑁 − 1) ∈ ℕ0) → 𝑁 ∈ ℕ) |
8 | 7 | expcom 450 | . . . . . . . 8 ⊢ ((𝑁 − 1) ∈ ℕ0 → (𝑁 ∈ ℤ → 𝑁 ∈ ℕ)) |
9 | 3, 8 | sylbir 224 | . . . . . . 7 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘0) → (𝑁 ∈ ℤ → 𝑁 ∈ ℕ)) |
10 | 1, 2, 9 | 3syl 18 | . . . . . 6 ⊢ (𝐼 ∈ (0..^(𝑁 − 1)) → (𝑁 ∈ ℤ → 𝑁 ∈ ℕ)) |
11 | 10 | impcom 445 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝑁 ∈ ℕ) |
12 | 1nn0 11185 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
13 | 12 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℕ0) |
14 | nnnn0 11176 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
15 | nnge1 10923 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ≤ 𝑁) | |
16 | 13, 14, 15 | 3jca 1235 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (1 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) |
17 | 11, 16 | syl 17 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (1 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) |
18 | elfz2nn0 12300 | . . . 4 ⊢ (1 ∈ (0...𝑁) ↔ (1 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) | |
19 | 17, 18 | sylibr 223 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 1 ∈ (0...𝑁)) |
20 | fzossrbm1 12366 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (0..^(𝑁 − 1)) ⊆ (0..^𝑁)) | |
21 | 20 | adantr 480 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (0..^(𝑁 − 1)) ⊆ (0..^𝑁)) |
22 | fzossfz 12357 | . . . . . 6 ⊢ (0..^𝑁) ⊆ (0...𝑁) | |
23 | 21, 22 | syl6ss 3580 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (0..^(𝑁 − 1)) ⊆ (0...𝑁)) |
24 | simpr 476 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝐼 ∈ (0..^(𝑁 − 1))) | |
25 | 23, 24 | jca 553 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → ((0..^(𝑁 − 1)) ⊆ (0...𝑁) ∧ 𝐼 ∈ (0..^(𝑁 − 1)))) |
26 | ssel2 3563 | . . . 4 ⊢ (((0..^(𝑁 − 1)) ⊆ (0...𝑁) ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝐼 ∈ (0...𝑁)) | |
27 | elfzubelfz 12224 | . . . 4 ⊢ (𝐼 ∈ (0...𝑁) → 𝑁 ∈ (0...𝑁)) | |
28 | 25, 26, 27 | 3syl 18 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → 𝑁 ∈ (0...𝑁)) |
29 | 19, 28 | jca 553 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (1 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...𝑁))) |
30 | elfzodifsumelfzo 12401 | . 2 ⊢ ((1 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...𝑁)) → (𝐼 ∈ (0..^(𝑁 − 1)) → (𝐼 + 1) ∈ (0..^𝑁))) | |
31 | 29, 24, 30 | sylc 63 | 1 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ (0..^(𝑁 − 1))) → (𝐼 + 1) ∈ (0..^𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 ∈ wcel 1977 ⊆ wss 3540 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 0cc0 9815 1c1 9816 + caddc 9818 ≤ cle 9954 − cmin 10145 ℕcn 10897 ℕ0cn0 11169 ℤcz 11254 ℤ≥cuz 11563 ...cfz 12197 ..^cfzo 12334 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335 |
This theorem is referenced by: clwlkisclwwlk 26317 clwwlkf 26322 clwlkfclwwlk 26371 clwlkclwwlk 41211 clwwlksf 41222 clwlksfclwwlk 41269 av-extwwlkfablem2 41510 |
Copyright terms: Public domain | W3C validator |