Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ioounsn | Structured version Visualization version GIF version |
Description: The union of an open interval with its upper endpoint is a left-open right-closed interval. (Contributed by Jon Pennant, 8-Jun-2019.) |
Ref | Expression |
---|---|
ioounsn | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp2 1135 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ*) | |
2 | iccid 13152 | . . . 4 ⊢ (𝐵 ∈ ℝ* → (𝐵[,]𝐵) = {𝐵}) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → (𝐵[,]𝐵) = {𝐵}) |
4 | 3 | uneq2d 4100 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ (𝐵[,]𝐵)) = ((𝐴(,)𝐵) ∪ {𝐵})) |
5 | simp1 1134 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ*) | |
6 | simp3 1136 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵) | |
7 | 1 | xrleidd 12914 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐵 ≤ 𝐵) |
8 | df-ioo 13111 | . . . 4 ⊢ (,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)}) | |
9 | df-icc 13114 | . . . 4 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
10 | xrlenlt 11068 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐵 ≤ 𝑤 ↔ ¬ 𝑤 < 𝐵)) | |
11 | df-ioc 13112 | . . . 4 ⊢ (,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 < 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
12 | simpl1 1189 | . . . . . 6 ⊢ (((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝑤 < 𝐵 ∧ 𝐵 ≤ 𝐵)) → 𝑤 ∈ ℝ*) | |
13 | simpl2 1190 | . . . . . 6 ⊢ (((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝑤 < 𝐵 ∧ 𝐵 ≤ 𝐵)) → 𝐵 ∈ ℝ*) | |
14 | simprl 767 | . . . . . 6 ⊢ (((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝑤 < 𝐵 ∧ 𝐵 ≤ 𝐵)) → 𝑤 < 𝐵) | |
15 | 12, 13, 14 | xrltled 12912 | . . . . 5 ⊢ (((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝑤 < 𝐵 ∧ 𝐵 ≤ 𝐵)) → 𝑤 ≤ 𝐵) |
16 | 15 | ex 412 | . . . 4 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 < 𝐵 ∧ 𝐵 ≤ 𝐵) → 𝑤 ≤ 𝐵)) |
17 | xrltletr 12919 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝑤) → 𝐴 < 𝑤)) | |
18 | 8, 9, 10, 11, 16, 17 | ixxun 13123 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐵)) → ((𝐴(,)𝐵) ∪ (𝐵[,]𝐵)) = (𝐴(,]𝐵)) |
19 | 5, 1, 1, 6, 7, 18 | syl32anc 1376 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ (𝐵[,]𝐵)) = (𝐴(,]𝐵)) |
20 | 4, 19 | eqtr3d 2775 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1537 ∈ wcel 2101 ∪ cun 3887 {csn 4564 class class class wbr 5077 (class class class)co 7295 ℝ*cxr 11036 < clt 11037 ≤ cle 11038 (,)cioo 13107 (,]cioc 13108 [,]cicc 13110 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2103 ax-9 2111 ax-10 2132 ax-11 2149 ax-12 2166 ax-ext 2704 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7608 ax-cnex 10955 ax-resscn 10956 ax-pre-lttri 10973 ax-pre-lttrn 10974 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2063 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2884 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rab 3224 df-v 3436 df-sbc 3719 df-csb 3835 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4260 df-if 4463 df-pw 4538 df-sn 4565 df-pr 4567 df-op 4571 df-uni 4842 df-br 5078 df-opab 5140 df-mpt 5161 df-id 5491 df-po 5505 df-so 5506 df-xp 5597 df-rel 5598 df-cnv 5599 df-co 5600 df-dm 5601 df-rn 5602 df-res 5603 df-ima 5604 df-iota 6399 df-fun 6449 df-fn 6450 df-f 6451 df-f1 6452 df-fo 6453 df-f1o 6454 df-fv 6455 df-ov 7298 df-oprab 7299 df-mpo 7300 df-er 8518 df-en 8754 df-dom 8755 df-sdom 8756 df-pnf 11039 df-mnf 11040 df-xr 11041 df-ltxr 11042 df-le 11043 df-ioo 13111 df-ioc 13112 df-icc 13114 |
This theorem is referenced by: iocunico 41066 iocmbl 41068 limcicciooub 43213 limcresiooub 43218 ioccncflimc 43461 volioc 43548 fourierdlem33 43716 fourierdlem49 43731 fourierdlem93 43775 fouriersw 43807 |
Copyright terms: Public domain | W3C validator |