| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elfz5 | Structured version Visualization version GIF version | ||
| Description: Membership in a finite set of sequential integers. (Contributed by NM, 26-Dec-2005.) |
| Ref | Expression |
|---|---|
| elfz5 | ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ 𝐾 ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzelz 12851 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ ℤ) | |
| 2 | eluzel2 12846 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 3 | 1, 2 | jca 519 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) |
| 4 | elfz 13520 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 5 | 4 | 3expa 1132 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 6 | 3, 5 | sylan 589 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 7 | eluzle 12854 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝐾) | |
| 8 | 7 | biantrurd 540 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 ≤ 𝑁 ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 9 | 8 | adantr 484 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ≤ 𝑁 ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 10 | 6, 9 | bitr4d 284 | 1 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ 𝐾 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6523 (class class class)co 7398 ≤ cle 11219 ℤcz 12570 ℤ≥cuz 12841 ...cfz 13514 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-cnex 11131 ax-resscn 11132 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-fv 6531 df-ov 7401 df-oprab 7402 df-mpo 7403 df-neg 11419 df-z 12571 df-uz 12842 df-fz 13515 |
| This theorem is referenced by: fzsplit2 13556 fznn0sub2 13642 predfz 13660 bcval5 14333 hashf1 14472 seqcoll 14479 limsupgre 15510 isercolllem2 15695 isercoll 15697 fsumcvg3 15758 fsum0diaglem 15805 climcndslem2 15882 mertenslem1 15916 ncoprmlnprm 16765 pcfac 16937 prmreclem2 16955 prmreclem3 16956 prmreclem5 16958 1arith 16965 vdwlem1 17019 vdwlem3 17021 vdwlem10 17028 sylow1lem1 19640 psrbaglefi 21980 ovoliunlem1 25566 ovolicc2lem4 25584 uniioombllem3 25649 mbfi1fseqlem3 25781 plyeq0lem 26272 coeeulem 26286 coeidlem 26299 coeid3 26302 coeeq2 26304 coemulhi 26316 vieta1lem2 26377 birthdaylem2 27019 birthdaylem3 27020 ftalem5 27143 basellem2 27148 basellem3 27149 basellem5 27151 musum 27257 fsumvma2 27280 chpchtsum 27285 lgsne0 27401 lgsquadlem2 27447 rplogsumlem2 27551 dchrisumlem1 27555 dchrisum0lem1 27582 ostth2lem3 27701 eupth2lems 30442 fzsplit3 32997 eulerpartlems 34659 eulerpartlemb 34667 erdszelem7 35552 cvmliftlem7 35646 |
| Copyright terms: Public domain | W3C validator |