| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elfzm1b | 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 9681 | . . . 4 ⊢ 1 ∈ ℤ | |
| 2 | fzsubel 10483 | . . . . 5 ⊢ (((1 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)))) | |
| 3 | 1, 2 | mpanl1 438 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ (𝐾 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)))) |
| 4 | 1, 3 | mpanr2 442 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)))) |
| 5 | 1m1e0 9382 | . . . . 5 ⊢ (1 − 1) = 0 | |
| 6 | 5 | oveq1i 6098 | . . . 4 ⊢ ((1 − 1)...(𝑁 − 1)) = (0...(𝑁 − 1)) |
| 7 | 6 | eleq2i 2305 | . . 3 ⊢ ((𝐾 − 1) ∈ ((1 − 1)...(𝑁 − 1)) ↔ (𝐾 − 1) ∈ (0...(𝑁 − 1))) |
| 8 | 4, 7 | bitrdi 196 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ (0...(𝑁 − 1)))) |
| 9 | 8 | ancoms 268 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (1...𝑁) ↔ (𝐾 − 1) ∈ (0...(𝑁 − 1)))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 (class class class)co 6088 0cc0 8185 1c1 8186 − cmin 8504 ℤcz 9655 ...cfz 10428 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-fz 10429 |
| This theorem is used by: elfzom1b 10664 bcpasc 11226 |
| Copyright terms: Public domain | W3C validator |