![]() |
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 982 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
2 | an6 1332 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
3 | df-3an 982 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ)) | |
4 | anandir 591 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ))) | |
5 | ancom 266 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
6 | 5 | anbi2i 457 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ))) |
7 | 3, 4, 6 | 3bitri 206 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ))) |
8 | 7 | anbi1i 458 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ (((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
9 | 1, 2, 8 | 3bitr4ri 213 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁))) |
10 | elfz2 10084 | . 2 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
11 | eluz2 9601 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾)) | |
12 | eluz2 9601 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) ↔ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁)) | |
13 | 11, 12 | anbi12i 460 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ≤ 𝐾) ∧ (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ≤ 𝑁))) |
14 | 9, 10, 13 | 3bitr4i 212 | 1 ⊢ (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 ∧ w3a 980 ∈ wcel 2164 class class class wbr 4030 ‘cfv 5255 (class class class)co 5919 ≤ cle 8057 ℤcz 9320 ℤ≥cuz 9595 ...cfz 10077 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2987 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-fv 5263 df-ov 5922 df-oprab 5923 df-mpo 5924 df-neg 8195 df-z 9321 df-uz 9596 df-fz 10078 |
This theorem is referenced by: eluzfz 10089 elfzuz 10090 elfzuz3 10091 elfzuz2 10098 peano2fzr 10106 fzsplit2 10119 fzass4 10131 fzss1 10132 fzss2 10133 fzp1elp1 10144 fznn 10158 elfz2nn0 10181 elfzofz 10232 fzosplitsnm1 10279 fzofzp1b 10298 fzosplitsn 10303 seq3fveq2 10549 seqfveq2g 10551 monoord 10559 seq3id2 10600 bcn1 10832 seq3coll 10916 summodclem2a 11527 fisum0diag2 11593 mertenslemi1 11681 prodmodclem2a 11722 |
Copyright terms: Public domain | W3C validator |