Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > elfzp12 | GIF version |
Description: Options for membership in a finite interval of integers. (Contributed by Jeff Madsen, 18-Jun-2010.) |
Ref | Expression |
---|---|
elfzp12 | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 = 𝑀 ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfzelz 9809 | . . 3 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ ℤ) | |
2 | 1 | anim2i 339 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ (𝑀...𝑁)) → (𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ)) |
3 | eluzel2 9334 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
4 | eleq1 2202 | . . . . 5 ⊢ (𝐾 = 𝑀 → (𝐾 ∈ ℤ ↔ 𝑀 ∈ ℤ)) | |
5 | 3, 4 | syl5ibrcom 156 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐾 = 𝑀 → 𝐾 ∈ ℤ)) |
6 | 5 | imdistani 441 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 = 𝑀) → (𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ)) |
7 | elfzelz 9809 | . . . 4 ⊢ (𝐾 ∈ ((𝑀 + 1)...𝑁) → 𝐾 ∈ ℤ) | |
8 | 7 | anim2i 339 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ((𝑀 + 1)...𝑁)) → (𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ)) |
9 | 6, 8 | jaodan 786 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝐾 = 𝑀 ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁))) → (𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ)) |
10 | fzpred 9853 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...𝑁) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) | |
11 | 10 | eleq2d 2209 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐾 ∈ (𝑀...𝑁) ↔ 𝐾 ∈ ({𝑀} ∪ ((𝑀 + 1)...𝑁)))) |
12 | elun 3217 | . . . 4 ⊢ (𝐾 ∈ ({𝑀} ∪ ((𝑀 + 1)...𝑁)) ↔ (𝐾 ∈ {𝑀} ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁))) | |
13 | 11, 12 | syl6bb 195 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ {𝑀} ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁)))) |
14 | elsng 3542 | . . . 4 ⊢ (𝐾 ∈ ℤ → (𝐾 ∈ {𝑀} ↔ 𝐾 = 𝑀)) | |
15 | 14 | orbi1d 780 | . . 3 ⊢ (𝐾 ∈ ℤ → ((𝐾 ∈ {𝑀} ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁)) ↔ (𝐾 = 𝑀 ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁)))) |
16 | 13, 15 | sylan9bb 457 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 = 𝑀 ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁)))) |
17 | 2, 9, 16 | pm5.21nd 901 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 = 𝑀 ∨ 𝐾 ∈ ((𝑀 + 1)...𝑁)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 697 = wceq 1331 ∈ wcel 1480 ∪ cun 3069 {csn 3527 ‘cfv 5123 (class class class)co 5774 1c1 7624 + caddc 7626 ℤcz 9057 ℤ≥cuz 9329 ...cfz 9793 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7714 ax-resscn 7715 ax-1cn 7716 ax-1re 7717 ax-icn 7718 ax-addcl 7719 ax-addrcl 7720 ax-mulcl 7721 ax-addcom 7723 ax-addass 7725 ax-distr 7727 ax-i2m1 7728 ax-0lt1 7729 ax-0id 7731 ax-rnegex 7732 ax-cnre 7734 ax-pre-ltirr 7735 ax-pre-ltwlin 7736 ax-pre-lttrn 7737 ax-pre-apti 7738 ax-pre-ltadd 7739 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7805 df-mnf 7806 df-xr 7807 df-ltxr 7808 df-le 7809 df-sub 7938 df-neg 7939 df-inn 8724 df-n0 8981 df-z 9058 df-uz 9330 df-fz 9794 |
This theorem is referenced by: bcpasc 10515 |
Copyright terms: Public domain | W3C validator |