| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fzosplitpr | Structured version Visualization version GIF version | ||
| Description: Extending a half-open integer range by an unordered pair at the end. (Contributed by Alexander van der Vekens, 22-Sep-2018.) |
| Ref | Expression |
|---|---|
| fzosplitpr | ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴..^(𝐵 + 2)) = ((𝐴..^𝐵) ∪ {𝐵, (𝐵 + 1)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-2 12328 | . . . . . 6 ⊢ 2 = (1 + 1) | |
| 2 | 1 | a1i 11 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 2 = (1 + 1)) |
| 3 | 2 | oveq2d 7432 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 + 2) = (𝐵 + (1 + 1))) |
| 4 | eluzelcn 12900 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℂ) | |
| 5 | 1cnd 11227 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 1 ∈ ℂ) | |
| 6 | add32r 11455 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 1 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐵 + (1 + 1)) = ((𝐵 + 1) + 1)) | |
| 7 | 4, 5, 5, 6 | syl3anc 1398 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 + (1 + 1)) = ((𝐵 + 1) + 1)) |
| 8 | 3, 7 | eqtrd 2797 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 + 2) = ((𝐵 + 1) + 1)) |
| 9 | 8 | oveq2d 7432 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴..^(𝐵 + 2)) = (𝐴..^((𝐵 + 1) + 1))) |
| 10 | peano2uz 12951 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 + 1) ∈ (ℤ≥‘𝐴)) | |
| 11 | fzosplitsn 13832 | . . 3 ⊢ ((𝐵 + 1) ∈ (ℤ≥‘𝐴) → (𝐴..^((𝐵 + 1) + 1)) = ((𝐴..^(𝐵 + 1)) ∪ {(𝐵 + 1)})) | |
| 12 | 10, 11 | syl 18 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴..^((𝐵 + 1) + 1)) = ((𝐴..^(𝐵 + 1)) ∪ {(𝐵 + 1)})) |
| 13 | fzosplitsn 13832 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴..^(𝐵 + 1)) = ((𝐴..^𝐵) ∪ {𝐵})) | |
| 14 | 13 | uneq1d 4117 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐴..^(𝐵 + 1)) ∪ {(𝐵 + 1)}) = (((𝐴..^𝐵) ∪ {𝐵}) ∪ {(𝐵 + 1)})) |
| 15 | unass 4121 | . . . 4 ⊢ (((𝐴..^𝐵) ∪ {𝐵}) ∪ {(𝐵 + 1)}) = ((𝐴..^𝐵) ∪ ({𝐵} ∪ {(𝐵 + 1)})) | |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (((𝐴..^𝐵) ∪ {𝐵}) ∪ {(𝐵 + 1)}) = ((𝐴..^𝐵) ∪ ({𝐵} ∪ {(𝐵 + 1)}))) |
| 17 | df-pr 4590 | . . . . . 6 ⊢ {𝐵, (𝐵 + 1)} = ({𝐵} ∪ {(𝐵 + 1)}) | |
| 18 | 17 | eqcomi 2771 | . . . . 5 ⊢ ({𝐵} ∪ {(𝐵 + 1)}) = {𝐵, (𝐵 + 1)} |
| 19 | 18 | a1i 11 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ({𝐵} ∪ {(𝐵 + 1)}) = {𝐵, (𝐵 + 1)}) |
| 20 | 19 | uneq2d 4118 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐴..^𝐵) ∪ ({𝐵} ∪ {(𝐵 + 1)})) = ((𝐴..^𝐵) ∪ {𝐵, (𝐵 + 1)})) |
| 21 | 14, 16, 20 | 3eqtrd 2801 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐴..^(𝐵 + 1)) ∪ {(𝐵 + 1)}) = ((𝐴..^𝐵) ∪ {𝐵, (𝐵 + 1)})) |
| 22 | 9, 12, 21 | 3eqtrd 2801 | 1 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴..^(𝐵 + 2)) = ((𝐴..^𝐵) ∪ {𝐵, (𝐵 + 1)})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∪ cun 3900 {csn 4587 {cpr 4589 ‘cfv 6537 (class class class)co 7416 ℂcc 11123 1c1 11126 + caddc 11128 2c2 12320 ℤ≥cuz 12888 ..^cfzo 13709 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-n0 12530 df-z 12617 df-uz 12889 df-fz 13562 df-fzo 13710 |
| This theorem is used by: fzosplitprm1 13834 clwwlknonex2lem1 30561 |
| Copyright terms: Public domain | W3C validator |