| Mathbox for Jon Pennant |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iocunico | Structured version Visualization version GIF version | ||
| Description: Split an open interval into two pieces at point B, Co-author TA. (Contributed by Jon Pennant, 8-Jun-2019.) |
| Ref | Expression |
|---|---|
| iocunico | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,]𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | un23 4172 | . . 3 ⊢ (((𝐴(,)𝐵) ∪ {𝐵}) ∪ (𝐵(,)𝐶)) = (((𝐴(,)𝐵) ∪ (𝐵(,)𝐶)) ∪ {𝐵}) | |
| 2 | unundir 4175 | . . 3 ⊢ (((𝐴(,)𝐵) ∪ (𝐵(,)𝐶)) ∪ {𝐵}) = (((𝐴(,)𝐵) ∪ {𝐵}) ∪ ((𝐵(,)𝐶) ∪ {𝐵})) | |
| 3 | uncom 4157 | . . . 4 ⊢ ((𝐵(,)𝐶) ∪ {𝐵}) = ({𝐵} ∪ (𝐵(,)𝐶)) | |
| 4 | 3 | uneq2i 4164 | . . 3 ⊢ (((𝐴(,)𝐵) ∪ {𝐵}) ∪ ((𝐵(,)𝐶) ∪ {𝐵})) = (((𝐴(,)𝐵) ∪ {𝐵}) ∪ ({𝐵} ∪ (𝐵(,)𝐶))) |
| 5 | 1, 2, 4 | 3eqtrri 2788 | . 2 ⊢ (((𝐴(,)𝐵) ∪ {𝐵}) ∪ ({𝐵} ∪ (𝐵(,)𝐶))) = (((𝐴(,)𝐵) ∪ {𝐵}) ∪ (𝐵(,)𝐶)) |
| 6 | simpl1 1210 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐴 ∈ ℝ*) | |
| 7 | simpl2 1211 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ ℝ*) | |
| 8 | simprl 783 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐴 < 𝐵) | |
| 9 | ioounsn 13612 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵)) | |
| 10 | 6, 7, 8, 9 | syl3anc 1398 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵)) |
| 11 | simpl3 1212 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐶 ∈ ℝ*) | |
| 12 | simprr 785 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 < 𝐶) | |
| 13 | snunioo 13613 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 < 𝐶) → ({𝐵} ∪ (𝐵(,)𝐶)) = (𝐵[,)𝐶)) | |
| 14 | 7, 11, 12, 13 | syl3anc 1398 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ({𝐵} ∪ (𝐵(,)𝐶)) = (𝐵[,)𝐶)) |
| 15 | 10, 14 | uneq12d 4168 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → (((𝐴(,)𝐵) ∪ {𝐵}) ∪ ({𝐵} ∪ (𝐵(,)𝐶))) = ((𝐴(,]𝐵) ∪ (𝐵[,)𝐶))) |
| 16 | ioojoin 13618 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → (((𝐴(,)𝐵) ∪ {𝐵}) ∪ (𝐵(,)𝐶)) = (𝐴(,)𝐶)) | |
| 17 | 5, 15, 16 | 3eqtr3a 2819 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,]𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∪ cun 4149 {csn 4584 class class class wbr 5102 (class class class)co 7421 ℝ*cxr 11346 < clt 11347 (,)cioo 13480 (,]cioc 13481 [,)cico 13482 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-pre-lttri 11278 ax-pre-lttrn 11279 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-ioo 13484 df-ioc 13485 df-ico 13486 df-icc 13487 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |