| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzouzsplit | GIF version | ||
| Description: Split an upper integer set into a half-open integer range and another upper integer set. (Contributed by Mario Carneiro, 21-Sep-2016.) |
| Ref | Expression |
|---|---|
| fzouzsplit | ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (ℤ≥‘𝐴) = ((𝐴..^𝐵) ∪ (ℤ≥‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzelz 9869 | . . . . . . . 8 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℤ) | |
| 2 | eluzelz 9869 | . . . . . . . 8 ⊢ (𝑥 ∈ (ℤ≥‘𝐴) → 𝑥 ∈ ℤ) | |
| 3 | zlelttric 9627 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝐵 ≤ 𝑥 ∨ 𝑥 < 𝐵)) | |
| 4 | 1, 2, 3 | syl2an 289 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝑥 ∈ (ℤ≥‘𝐴)) → (𝐵 ≤ 𝑥 ∨ 𝑥 < 𝐵)) |
| 5 | 4 | orcomd 737 | . . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝑥 ∈ (ℤ≥‘𝐴)) → (𝑥 < 𝐵 ∨ 𝐵 ≤ 𝑥)) |
| 6 | id 19 | . . . . . . . 8 ⊢ (𝑥 ∈ (ℤ≥‘𝐴) → 𝑥 ∈ (ℤ≥‘𝐴)) | |
| 7 | elfzo2 10491 | . . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴..^𝐵) ↔ (𝑥 ∈ (ℤ≥‘𝐴) ∧ 𝐵 ∈ ℤ ∧ 𝑥 < 𝐵)) | |
| 8 | df-3an 1007 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ (ℤ≥‘𝐴) ∧ 𝐵 ∈ ℤ ∧ 𝑥 < 𝐵) ↔ ((𝑥 ∈ (ℤ≥‘𝐴) ∧ 𝐵 ∈ ℤ) ∧ 𝑥 < 𝐵)) | |
| 9 | 7, 8 | bitri 184 | . . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴..^𝐵) ↔ ((𝑥 ∈ (ℤ≥‘𝐴) ∧ 𝐵 ∈ ℤ) ∧ 𝑥 < 𝐵)) |
| 10 | 9 | baib 927 | . . . . . . . 8 ⊢ ((𝑥 ∈ (ℤ≥‘𝐴) ∧ 𝐵 ∈ ℤ) → (𝑥 ∈ (𝐴..^𝐵) ↔ 𝑥 < 𝐵)) |
| 11 | 6, 1, 10 | syl2anr 290 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝑥 ∈ (ℤ≥‘𝐴)) → (𝑥 ∈ (𝐴..^𝐵) ↔ 𝑥 < 𝐵)) |
| 12 | eluz 9873 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑥 ∈ (ℤ≥‘𝐵) ↔ 𝐵 ≤ 𝑥)) | |
| 13 | 1, 2, 12 | syl2an 289 | . . . . . . 7 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝑥 ∈ (ℤ≥‘𝐴)) → (𝑥 ∈ (ℤ≥‘𝐵) ↔ 𝐵 ≤ 𝑥)) |
| 14 | 11, 13 | orbi12d 801 | . . . . . 6 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝑥 ∈ (ℤ≥‘𝐴)) → ((𝑥 ∈ (𝐴..^𝐵) ∨ 𝑥 ∈ (ℤ≥‘𝐵)) ↔ (𝑥 < 𝐵 ∨ 𝐵 ≤ 𝑥))) |
| 15 | 5, 14 | mpbird 167 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝑥 ∈ (ℤ≥‘𝐴)) → (𝑥 ∈ (𝐴..^𝐵) ∨ 𝑥 ∈ (ℤ≥‘𝐵))) |
| 16 | 15 | ex 115 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝑥 ∈ (ℤ≥‘𝐴) → (𝑥 ∈ (𝐴..^𝐵) ∨ 𝑥 ∈ (ℤ≥‘𝐵)))) |
| 17 | elun 3362 | . . . 4 ⊢ (𝑥 ∈ ((𝐴..^𝐵) ∪ (ℤ≥‘𝐵)) ↔ (𝑥 ∈ (𝐴..^𝐵) ∨ 𝑥 ∈ (ℤ≥‘𝐵))) | |
| 18 | 16, 17 | imbitrrdi 162 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝑥 ∈ (ℤ≥‘𝐴) → 𝑥 ∈ ((𝐴..^𝐵) ∪ (ℤ≥‘𝐵)))) |
| 19 | 18 | ssrdv 3246 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (ℤ≥‘𝐴) ⊆ ((𝐴..^𝐵) ∪ (ℤ≥‘𝐵))) |
| 20 | elfzouz 10492 | . . . . 5 ⊢ (𝑥 ∈ (𝐴..^𝐵) → 𝑥 ∈ (ℤ≥‘𝐴)) | |
| 21 | 20 | ssriv 3244 | . . . 4 ⊢ (𝐴..^𝐵) ⊆ (ℤ≥‘𝐴) |
| 22 | 21 | a1i 9 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴..^𝐵) ⊆ (ℤ≥‘𝐴)) |
| 23 | uzss 9881 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (ℤ≥‘𝐵) ⊆ (ℤ≥‘𝐴)) | |
| 24 | 22, 23 | unssd 3397 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐴..^𝐵) ∪ (ℤ≥‘𝐵)) ⊆ (ℤ≥‘𝐴)) |
| 25 | 19, 24 | eqssd 3257 | 1 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (ℤ≥‘𝐴) = ((𝐴..^𝐵) ∪ (ℤ≥‘𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 ∪ cun 3211 ⊆ wss 3213 class class class wbr 4111 ‘cfv 5354 (class class class)co 6052 < clt 8313 ≤ cle 8314 ℤcz 9582 ℤ≥cuz 9859 ..^cfzo 10483 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-addass 8234 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-ltadd 8248 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-inn 9243 df-n0 9502 df-z 9583 df-uz 9860 df-fz 10349 df-fzo 10484 |
| This theorem is referenced by: zsupcllemstep 10596 xnn0nnen 10806 |
| Copyright terms: Public domain | W3C validator |