| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzss1 | GIF version | ||
| Description: Subset relationship for finite sets of sequential integers. (Contributed by NM, 28-Sep-2005.) (Proof shortened by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| fzss1 | ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾...𝑁) ⊆ (𝑀...𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzuz 10213 | . . . . 5 ⊢ (𝑘 ∈ (𝐾...𝑁) → 𝑘 ∈ (ℤ≥‘𝐾)) | |
| 2 | id 19 | . . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ (ℤ≥‘𝑀)) | |
| 3 | uztrn 9735 | . . . . 5 ⊢ ((𝑘 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑀)) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 4 | 1, 2, 3 | syl2anr 290 | . . . 4 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ (𝐾...𝑁)) → 𝑘 ∈ (ℤ≥‘𝑀)) |
| 5 | elfzuz3 10214 | . . . . 5 ⊢ (𝑘 ∈ (𝐾...𝑁) → 𝑁 ∈ (ℤ≥‘𝑘)) | |
| 6 | 5 | adantl 277 | . . . 4 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ (𝐾...𝑁)) → 𝑁 ∈ (ℤ≥‘𝑘)) |
| 7 | elfzuzb 10211 | . . . 4 ⊢ (𝑘 ∈ (𝑀...𝑁) ↔ (𝑘 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝑘))) | |
| 8 | 4, 6, 7 | sylanbrc 417 | . . 3 ⊢ ((𝐾 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ (𝐾...𝑁)) → 𝑘 ∈ (𝑀...𝑁)) |
| 9 | 8 | ex 115 | . 2 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (𝐾...𝑁) → 𝑘 ∈ (𝑀...𝑁))) |
| 10 | 9 | ssrdv 3230 | 1 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾...𝑁) ⊆ (𝑀...𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2200 ⊆ wss 3197 ‘cfv 5317 (class class class)co 6000 ℤ≥cuz 9718 ...cfz 10200 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-cnex 8086 ax-resscn 8087 ax-pre-ltwlin 8108 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4383 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-fv 5325 df-ov 6003 df-oprab 6004 df-mpo 6005 df-pnf 8179 df-mnf 8180 df-xr 8181 df-ltxr 8182 df-le 8183 df-neg 8316 df-z 9443 df-uz 9719 df-fz 10201 |
| This theorem is referenced by: fzssnn 10260 fzp1ss 10265 ige2m1fz 10302 fzoss1 10365 fzossnn0 10369 ser3mono 10704 seqsplitg 10706 iseqf1olemnab 10718 seqf1oglem2 10737 bcpasc 10983 swrdswrd 11232 swrdccatin2 11256 pfxccatin12lem2c 11257 pfxccatpfx2 11264 mertenslemi1 12041 reumodprminv 12771 structfn 13046 strleund 13131 strleun 13132 ply1termlem 15410 dvply1 15433 gausslemma2dlem3 15736 2lgslem1a 15761 |
| Copyright terms: Public domain | W3C validator |