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 12347 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ ℤ) | |
2 | eluzel2 12342 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
3 | 1, 2 | jca 515 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) |
4 | elfz 13000 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
5 | 4 | 3expa 1119 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
6 | 3, 5 | sylan 583 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
7 | eluzle 12350 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝐾) | |
8 | 7 | biantrurd 536 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 ≤ 𝑁 ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
9 | 8 | adantr 484 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ≤ 𝑁 ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
10 | 6, 9 | bitr4d 285 | 1 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ 𝐾 ≤ 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2114 class class class wbr 5040 ‘cfv 6350 (class class class)co 7183 ≤ cle 10767 ℤcz 12075 ℤ≥cuz 12337 ...cfz 12994 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-sep 5177 ax-nul 5184 ax-pr 5306 ax-cnex 10684 ax-resscn 10685 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-ral 3059 df-rex 3060 df-rab 3063 df-v 3402 df-sbc 3686 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4222 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-op 4533 df-uni 4807 df-br 5041 df-opab 5103 df-mpt 5121 df-id 5439 df-xp 5541 df-rel 5542 df-cnv 5543 df-co 5544 df-dm 5545 df-rn 5546 df-res 5547 df-ima 5548 df-iota 6308 df-fun 6352 df-fn 6353 df-f 6354 df-fv 6358 df-ov 7186 df-oprab 7187 df-mpo 7188 df-neg 10964 df-z 12076 df-uz 12338 df-fz 12995 |
This theorem is referenced by: fzsplit2 13036 fznn0sub2 13118 predfz 13136 bcval5 13783 hashf1 13922 seqcoll 13929 limsupgre 14941 isercolllem2 15128 isercoll 15130 fsumcvg3 15192 fsum0diaglem 15237 climcndslem2 15311 mertenslem1 15345 ncoprmlnprm 16181 pcfac 16348 prmreclem2 16366 prmreclem3 16367 prmreclem5 16369 1arith 16376 vdwlem1 16430 vdwlem3 16432 vdwlem10 16439 sylow1lem1 18854 psrbaglefi 20758 psrbaglefiOLD 20759 ovoliunlem1 24267 ovolicc2lem4 24285 uniioombllem3 24350 mbfi1fseqlem3 24483 plyeq0lem 24972 coeeulem 24986 coeidlem 24999 coeid3 25002 coeeq2 25004 coemulhi 25016 vieta1lem2 25072 birthdaylem2 25703 birthdaylem3 25704 ftalem5 25827 basellem2 25832 basellem3 25833 basellem5 25835 musum 25941 fsumvma2 25963 chpchtsum 25968 lgsne0 26084 lgsquadlem2 26130 rplogsumlem2 26234 dchrisumlem1 26238 dchrisum0lem1 26265 ostth2lem3 26384 eupth2lems 28188 fzsplit3 30703 eulerpartlems 31910 eulerpartlemb 31918 erdszelem7 32743 cvmliftlem7 32837 |
Copyright terms: Public domain | W3C validator |