Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elfzm1b | Structured version Visualization version GIF version |
Description: An integer is a member of a 1-based finite set of sequential integers iff its predecessor is a member of the corresponding 0-based set. (Contributed by Paul Chapman, 22-Jun-2011.) |
Ref | Expression |
---|---|
elfzm1b | ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ (0...(𝑁 − 1)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1z 12396 | . . . 4 ⊢ 1 ∈ ℤ | |
2 | fzsubel 13338 | . . . . 5 ⊢ (((1 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)))) | |
3 | 1, 2 | mpanl1 698 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ (𝐾 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)))) |
4 | 1, 3 | mpanr2 702 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)))) |
5 | 1m1e0 12091 | . . . . 5 ⊢ (1 − 1) = 0 | |
6 | 5 | oveq1i 7317 | . . . 4 ⊢ ((1 − 1)...(𝑁 − 1)) = (0...(𝑁 − 1)) |
7 | 6 | eleq2i 2828 | . . 3 ⊢ ((𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)) ↔ (𝐾 − 1) ∈ (0...(𝑁 − 1))) |
8 | 4, 7 | bitrdi 287 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ (0...(𝑁 − 1)))) |
9 | 8 | ancoms 460 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ (0...(𝑁 − 1)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∈ wcel 2104 (class class class)co 7307 0cc0 10917 1c1 10918 − cmin 11251 ℤcz 12365 ...cfz 13285 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-cnex 10973 ax-resscn 10974 ax-1cn 10975 ax-icn 10976 ax-addcl 10977 ax-addrcl 10978 ax-mulcl 10979 ax-mulrcl 10980 ax-mulcom 10981 ax-addass 10982 ax-mulass 10983 ax-distr 10984 ax-i2m1 10985 ax-1ne0 10986 ax-1rid 10987 ax-rnegex 10988 ax-rrecex 10989 ax-cnre 10990 ax-pre-lttri 10991 ax-pre-lttrn 10992 ax-pre-ltadd 10993 ax-pre-mulgt0 10994 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3286 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-tr 5199 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-om 7745 df-2nd 7864 df-frecs 8128 df-wrecs 8159 df-recs 8233 df-rdg 8272 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11057 df-mnf 11058 df-xr 11059 df-ltxr 11060 df-le 11061 df-sub 11253 df-neg 11254 df-nn 12020 df-n0 12280 df-z 12366 df-fz 13286 |
This theorem is referenced by: elfzom1b 13532 bcpasc 14081 cayhamlem1 22060 cpmadugsumlemF 22070 cvmliftlem7 33298 poimirlem1 35822 poimirlem2 35823 poimirlem11 35832 poimirlem14 35835 poimirlem31 35852 iccpartipre 44931 |
Copyright terms: Public domain | W3C validator |