| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzoss2 | GIF version | ||
| Description: Subset relationship for half-open sequences of integers. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 29-Sep-2015.) |
| Ref | Expression |
|---|---|
| fzoss2 | ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝑀..^𝐾) ⊆ (𝑀..^𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzel2 9688 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 𝐾 ∈ ℤ) | |
| 2 | peano2zm 9445 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (𝐾 − 1) ∈ ℤ) | |
| 3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝐾 − 1) ∈ ℤ) |
| 4 | 1zzd 9434 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 1 ∈ ℤ) | |
| 5 | id 19 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 𝑁 ∈ (ℤ≥‘𝐾)) | |
| 6 | 1 | zcnd 9531 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 𝐾 ∈ ℂ) |
| 7 | ax-1cn 8053 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 8 | npcan 8316 | . . . . . . 7 ⊢ ((𝐾 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐾 − 1) + 1) = 𝐾) | |
| 9 | 6, 7, 8 | sylancl 413 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → ((𝐾 − 1) + 1) = 𝐾) |
| 10 | 9 | fveq2d 5603 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (ℤ≥‘((𝐾 − 1) + 1)) = (ℤ≥‘𝐾)) |
| 11 | 5, 10 | eleqtrrd 2287 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 𝑁 ∈ (ℤ≥‘((𝐾 − 1) + 1))) |
| 12 | eluzsub 9713 | . . . 4 ⊢ (((𝐾 − 1) ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘((𝐾 − 1) + 1))) → (𝑁 − 1) ∈ (ℤ≥‘(𝐾 − 1))) | |
| 13 | 3, 4, 11, 12 | syl3anc 1250 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝑁 − 1) ∈ (ℤ≥‘(𝐾 − 1))) |
| 14 | fzss2 10221 | . . 3 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘(𝐾 − 1)) → (𝑀...(𝐾 − 1)) ⊆ (𝑀...(𝑁 − 1))) | |
| 15 | 13, 14 | syl 14 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝑀...(𝐾 − 1)) ⊆ (𝑀...(𝑁 − 1))) |
| 16 | fzoval 10305 | . . 3 ⊢ (𝐾 ∈ ℤ → (𝑀..^𝐾) = (𝑀...(𝐾 − 1))) | |
| 17 | 1, 16 | syl 14 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝑀..^𝐾) = (𝑀...(𝐾 − 1))) |
| 18 | eluzelz 9692 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 𝑁 ∈ ℤ) | |
| 19 | fzoval 10305 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑀..^𝑁) = (𝑀...(𝑁 − 1))) | |
| 20 | 18, 19 | syl 14 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝑀..^𝑁) = (𝑀...(𝑁 − 1))) |
| 21 | 15, 17, 20 | 3sstr4d 3246 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝑀..^𝐾) ⊆ (𝑀..^𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∈ wcel 2178 ⊆ wss 3174 ‘cfv 5290 (class class class)co 5967 ℂcc 7958 1c1 7961 + caddc 7963 − cmin 8278 ℤcz 9407 ℤ≥cuz 9683 ...cfz 10165 ..^cfzo 10299 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-cnex 8051 ax-resscn 8052 ax-1cn 8053 ax-1re 8054 ax-icn 8055 ax-addcl 8056 ax-addrcl 8057 ax-mulcl 8058 ax-addcom 8060 ax-addass 8062 ax-distr 8064 ax-i2m1 8065 ax-0lt1 8066 ax-0id 8068 ax-rnegex 8069 ax-cnre 8071 ax-pre-ltirr 8072 ax-pre-ltwlin 8073 ax-pre-lttrn 8074 ax-pre-ltadd 8076 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rab 2495 df-v 2778 df-sbc 3006 df-csb 3102 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-iun 3943 df-br 4060 df-opab 4122 df-mpt 4123 df-id 4358 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-ima 4706 df-iota 5251 df-fun 5292 df-fn 5293 df-f 5294 df-fv 5298 df-riota 5922 df-ov 5970 df-oprab 5971 df-mpo 5972 df-1st 6249 df-2nd 6250 df-pnf 8144 df-mnf 8145 df-xr 8146 df-ltxr 8147 df-le 8148 df-sub 8280 df-neg 8281 df-inn 9072 df-n0 9331 df-z 9408 df-uz 9684 df-fz 10166 df-fzo 10300 |
| This theorem is referenced by: fzossrbm1 10332 fzosplit 10336 elfzoextl 10357 fzossfzop1 10378 ccatass 11102 ccatrn 11103 swrdval2 11142 pfxres 11172 pfxf 11173 pfxccat1 11193 pfxccatin12lem2a 11218 |
| Copyright terms: Public domain | W3C validator |