| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elfzuzb | 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 1011 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 2 | an6 1362 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 3 | df-3an 1011 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ)) | |
| 4 | anandir 599 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ))) | |
| 5 | ancom 266 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 6 | 5 | anbi2i 461 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ))) |
| 7 | 3, 4, 6 | 3bitri 206 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ))) |
| 8 | 7 | anbi1i 462 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 9 | 1, 2, 8 | 3bitr4ri 213 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁))) |
| 10 | elfz2 10418 | . 2 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 11 | eluz2 9927 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾)) | |
| 12 | eluz2 9927 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) ↔ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁)) | |
| 13 | 11, 12 | anbi12i 464 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁))) |
| 14 | 9, 10, 13 | 3bitr4i 212 | 1 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 ↔ wb 105 ∧ w3a 1009 ∈ wcel 2209 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ≤ cle 8361 ℤcz 9644 ℤ≥cuz 9921 ...cfz 10411 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-neg 8500 df-z 9645 df-uz 9922 df-fz 10412 |
| This theorem is used by: eluzfz 10423 elfzuz 10424 elfzuz3 10425 elfzuz2 10433 peano2fzr 10441 fzsplit2 10455 fzsplit3 10458 fzass4 10468 fzss1 10469 fzss2 10470 fzp1elp1 10482 fznn 10496 elfz2nn0 10519 elfzofz 10570 fzosplitsnm1 10627 fzofzp1b 10646 fzosplitsn 10651 infssfzcldc 10669 infssfzledc 10670 seq3fveq2 10912 seqfveq2g 10914 monoord 10922 seq3id2 10963 bcn1 11196 seq3coll 11294 ccatrn 11377 swrds1 11440 swrdccat2 11443 summodclem2a 12148 fisum0diag2 12214 mertenslemi1 12302 prodmodclem2a 12343 |
| Copyright terms: Public domain | W3C validator |