Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elfzuzb | Structured version Visualization version GIF version |
Description: Membership in a finite set of sequential integers in terms of sets of upper integers. (Contributed by NM, 18-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.) |
Ref | Expression |
---|---|
elfzuzb | ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-3an 1089 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
2 | an6 1445 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
3 | df-3an 1089 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ)) | |
4 | anandir 675 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ))) | |
5 | an43 656 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ))) | |
6 | 3, 4, 5 | 3bitri 297 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ))) |
7 | 6 | anbi1i 625 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
8 | 1, 2, 7 | 3bitr4ri 304 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁))) |
9 | elfz2 13296 | . 2 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
10 | eluz2 12638 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾)) | |
11 | eluz2 12638 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) ↔ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁)) | |
12 | 10, 11 | anbi12i 628 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁))) |
13 | 8, 9, 12 | 3bitr4i 303 | 1 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 397 ∧ w3a 1087 ∈ wcel 2104 class class class wbr 5081 ‘cfv 6458 (class class class)co 7307 ≤ cle 11060 ℤcz 12369 ℤ≥cuz 12632 ...cfz 13289 |
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-pr 5361 ax-un 7620 ax-cnex 10977 ax-resscn 10978 |
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-ral 3063 df-rex 3072 df-rab 3306 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 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-id 5500 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-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-fv 6466 df-ov 7310 df-oprab 7311 df-mpo 7312 df-1st 7863 df-2nd 7864 df-neg 11258 df-z 12370 df-uz 12633 df-fz 13290 |
This theorem is referenced by: eluzfz 13301 elfzuz 13302 elfzuz3 13303 elfzuz2 13311 peano2fzr 13319 fzsplit2 13331 fzass4 13344 fzss1 13345 fzss2 13346 fzp1elp1 13359 fznn 13374 elfz2nn0 13397 elfzofz 13453 fzosplitsnm1 13512 fzofzp1b 13535 fzosplitsn 13545 seqcl2 13791 seqfveq2 13795 monoord 13803 seqid2 13819 bcn1 14077 fz1isolem 14224 seqcoll 14227 ccatrn 14343 swrds1 14428 swrdccat2 14431 spllen 14516 splfv2a 14518 splval2 14519 caubnd 15119 isercolllem2 15426 isercolllem3 15427 summolem2a 15476 fsum0diag2 15544 climcndslem1 15610 mertenslem1 15645 prodmolem2a 15693 vdwlem2 16732 vdwlem8 16738 gexcl3 19241 efginvrel2 19382 efgredleme 19398 efgcpbllemb 19410 1stckgenlem 22753 imasdsf1olem 23575 iscmet3lem1 24504 dvtaylp 25578 mtest 25612 ppisval 26302 ppisval2 26303 chtdif 26356 ppidif 26361 logfaclbnd 26419 bposlem4 26484 dchrisumlem2 26687 pntpbnd1 26783 fzsplit3 31164 mettrifi 35963 monoordxrv 43250 smonoord 45067 |
Copyright terms: Public domain | W3C validator |