| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fznatpl1 | Structured version Visualization version GIF version | ||
| Description: Shift membership in a finite sequence of naturals. (Contributed by Scott Fenton, 17-Jul-2013.) |
| Ref | Expression |
|---|---|
| fznatpl1 | ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝐼 + 1) ∈ (1...𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1red 11182 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 1 ∈ ℝ) | |
| 2 | elfzelz 13492 | . . . . . 6 ⊢ (𝐼 ∈ (1...(𝑁 − 1)) → 𝐼 ∈ ℤ) | |
| 3 | 2 | zred 12645 | . . . . 5 ⊢ (𝐼 ∈ (1...(𝑁 − 1)) → 𝐼 ∈ ℝ) |
| 4 | 3 | adantl 481 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝐼 ∈ ℝ) |
| 5 | peano2re 11354 | . . . 4 ⊢ (𝐼 ∈ ℝ → (𝐼 + 1) ∈ ℝ) | |
| 6 | 4, 5 | syl 17 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝐼 + 1) ∈ ℝ) |
| 7 | peano2re 11354 | . . . . 5 ⊢ (1 ∈ ℝ → (1 + 1) ∈ ℝ) | |
| 8 | 1, 7 | syl 17 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (1 + 1) ∈ ℝ) |
| 9 | 1 | ltp1d 12120 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 1 < (1 + 1)) |
| 10 | elfzle1 13495 | . . . . . 6 ⊢ (𝐼 ∈ (1...(𝑁 − 1)) → 1 ≤ 𝐼) | |
| 11 | 10 | adantl 481 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 1 ≤ 𝐼) |
| 12 | 1re 11181 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 13 | leadd1 11653 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝐼 ∈ ℝ ∧ 1 ∈ ℝ) → (1 ≤ 𝐼 ↔ (1 + 1) ≤ (𝐼 + 1))) | |
| 14 | 12, 12, 13 | mp3an13 1454 | . . . . . 6 ⊢ (𝐼 ∈ ℝ → (1 ≤ 𝐼 ↔ (1 + 1) ≤ (𝐼 + 1))) |
| 15 | 4, 14 | syl 17 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (1 ≤ 𝐼 ↔ (1 + 1) ≤ (𝐼 + 1))) |
| 16 | 11, 15 | mpbid 232 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (1 + 1) ≤ (𝐼 + 1)) |
| 17 | 1, 8, 6, 9, 16 | ltletrd 11341 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 1 < (𝐼 + 1)) |
| 18 | 1, 6, 17 | ltled 11329 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 1 ≤ (𝐼 + 1)) |
| 19 | elfzle2 13496 | . . . 4 ⊢ (𝐼 ∈ (1...(𝑁 − 1)) → 𝐼 ≤ (𝑁 − 1)) | |
| 20 | 19 | adantl 481 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝐼 ≤ (𝑁 − 1)) |
| 21 | nnz 12557 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 22 | 21 | adantr 480 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑁 ∈ ℤ) |
| 23 | 22 | zred 12645 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑁 ∈ ℝ) |
| 24 | leaddsub 11661 | . . . . 5 ⊢ ((𝐼 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝐼 + 1) ≤ 𝑁 ↔ 𝐼 ≤ (𝑁 − 1))) | |
| 25 | 12, 24 | mp3an2 1451 | . . . 4 ⊢ ((𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝐼 + 1) ≤ 𝑁 ↔ 𝐼 ≤ (𝑁 − 1))) |
| 26 | 3, 23, 25 | syl2an2 686 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → ((𝐼 + 1) ≤ 𝑁 ↔ 𝐼 ≤ (𝑁 − 1))) |
| 27 | 20, 26 | mpbird 257 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝐼 + 1) ≤ 𝑁) |
| 28 | 2 | peano2zd 12648 | . . 3 ⊢ (𝐼 ∈ (1...(𝑁 − 1)) → (𝐼 + 1) ∈ ℤ) |
| 29 | 1z 12570 | . . . 4 ⊢ 1 ∈ ℤ | |
| 30 | elfz 13481 | . . . 4 ⊢ (((𝐼 + 1) ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐼 + 1) ∈ (1...𝑁) ↔ (1 ≤ (𝐼 + 1) ∧ (𝐼 + 1) ≤ 𝑁))) | |
| 31 | 29, 30 | mp3an2 1451 | . . 3 ⊢ (((𝐼 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐼 + 1) ∈ (1...𝑁) ↔ (1 ≤ (𝐼 + 1) ∧ (𝐼 + 1) ≤ 𝑁))) |
| 32 | 28, 22, 31 | syl2an2 686 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → ((𝐼 + 1) ∈ (1...𝑁) ↔ (1 ≤ (𝐼 + 1) ∧ (𝐼 + 1) ≤ 𝑁))) |
| 33 | 18, 27, 32 | mpbir2and 713 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝐼 + 1) ∈ (1...𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2109 class class class wbr 5110 (class class class)co 7390 ℝcr 11074 1c1 11076 + caddc 11078 ≤ cle 11216 − cmin 11412 ℕcn 12193 ℤcz 12536 ...cfz 13475 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 |
| This theorem is referenced by: axlowdimlem10 28885 axlowdimlem14 28889 1smat1 33801 madjusmdetlem2 33825 |
| Copyright terms: Public domain | W3C validator |