| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elfz2 | Structured version Visualization version GIF version | ||
| Description: Membership in a finite set of sequential integers. We use the fact that an operation's value is empty outside of its domain to show 𝑀 ∈ ℤ and 𝑁 ∈ ℤ. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| elfz2 | ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | anass 474 | . 2 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)))) | |
| 2 | df-3an 1105 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ)) | |
| 3 | 2 | anbi1i 636 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 4 | elfz1 13556 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 5 | 3anass 1111 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) ↔ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 6 | ibar 538 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))))) | |
| 7 | 5, 6 | bitrid 286 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))))) |
| 8 | 4, 7 | bitrd 282 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))))) |
| 9 | fzf 13555 | . . . . . . 7 ⊢ ...:(ℤ × ℤ)⟶𝒫 ℤ | |
| 10 | 9 | fdmi 6721 | . . . . . 6 ⊢ dom ... = (ℤ × ℤ) |
| 11 | 10 | ndmov 7604 | . . . . 5 ⊢ (¬ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) = ∅) |
| 12 | 11 | eleq2d 2851 | . . . 4 ⊢ (¬ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ 𝐾 ∈ ∅)) |
| 13 | noel 4291 | . . . . . 6 ⊢ ¬ 𝐾 ∈ ∅ | |
| 14 | 13 | pm2.21i 120 | . . . . 5 ⊢ (𝐾 ∈ ∅ → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
| 15 | simpl 488 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 16 | 14, 15 | pm5.21ni 380 | . . . 4 ⊢ (¬ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ∅ ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))))) |
| 17 | 12, 16 | bitrd 282 | . . 3 ⊢ (¬ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))))) |
| 18 | 8, 17 | pm2.61i 184 | . 2 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)))) |
| 19 | 1, 3, 18 | 3bitr4ri 307 | 1 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2146 ∅c0 4286 𝒫 cpw 4564 class class class wbr 5111 × cxp 5661 (class class class)co 7419 ≤ cle 11259 ℤcz 12606 ...cfz 13551 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-1st 7992 df-2nd 7993 df-neg 11459 df-z 12607 df-fz 13552 |
| This theorem is used by: elfzd 13559 elfz4 13561 elfzuzb 13562 0nelfz1 13587 uzsubsubfz 13591 fzmmmeqm 13602 fzpreddisj 13618 elfz1b 13638 fzdif1 13650 fzp1nel 13656 elfz0ubfz0 13677 elfz0fzfz0 13678 fz0fzelfz0 13679 fz0fzdiffz0 13682 elfzmlbp 13684 preduz 13695 fzind2 13834 swrdswrdlem 14763 swrdswrd 14764 pfxccatin12lem2a 14786 pfxccatin12lem1 14787 swrdccatin2 14788 pfxccatin12lem2 14790 pfxccat3 14793 2cshwcshw 14886 cshwcsh2id 14889 fprodntriv 16019 fprodeq0 16052 prmgaplem4 17136 chfacfscmulgsum 23067 chfacfpmmulgsum 23071 gausslemma2dlem3 27583 2lgslem1a1 27604 crctcshwlkn0lem3 30228 fzne2d 42805 fmul01lt1lem2 46359 dvnprodlem2 46719 stoweidlem34 46806 fourierdlem12 46891 etransclem10 47016 etransclem24 47030 elfzelfzlble 48116 iccpartiltu 48229 31prm 48407 nnsum4primeseven 48623 nnsum4primesevenALTV 48624 |
| Copyright terms: Public domain | W3C validator |