Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > snunioo1 | Structured version Visualization version GIF version |
Description: The closure of one end of an open real interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
snunioo1 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uncom 4128 | . 2 ⊢ ((𝐴(,)𝐵) ∪ (𝐴[,]𝐴)) = ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) | |
2 | iccid 12777 | . . . 4 ⊢ (𝐴 ∈ ℝ* → (𝐴[,]𝐴) = {𝐴}) | |
3 | 2 | 3ad2ant1 1129 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → (𝐴[,]𝐴) = {𝐴}) |
4 | 3 | uneq2d 4138 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ (𝐴[,]𝐴)) = ((𝐴(,)𝐵) ∪ {𝐴})) |
5 | simp1 1132 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ*) | |
6 | simp2 1133 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ*) | |
7 | xrleid 12538 | . . . 4 ⊢ (𝐴 ∈ ℝ* → 𝐴 ≤ 𝐴) | |
8 | 7 | 3ad2ant1 1129 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐴 ≤ 𝐴) |
9 | simp3 1134 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵) | |
10 | df-icc 12739 | . . . 4 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
11 | df-ioo 12736 | . . . 4 ⊢ (,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)}) | |
12 | xrltnle 10702 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐴 < 𝑤 ↔ ¬ 𝑤 ≤ 𝐴)) | |
13 | df-ico 12738 | . . . 4 ⊢ [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) | |
14 | xrlelttr 12543 | . . . 4 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ≤ 𝐴 ∧ 𝐴 < 𝐵) → 𝑤 < 𝐵)) | |
15 | simpl1 1187 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝐴 ∈ ℝ*) | |
16 | simpl3 1189 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝑤 ∈ ℝ*) | |
17 | simprr 771 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝐴 < 𝑤) | |
18 | 15, 16, 17 | xrltled 12537 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝐴 ≤ 𝑤) |
19 | 18 | ex 415 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → ((𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤) → 𝐴 ≤ 𝑤)) |
20 | 10, 11, 12, 13, 14, 19 | ixxun 12748 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝐵)) → ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵)) |
21 | 5, 5, 6, 8, 9, 20 | syl32anc 1374 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵)) |
22 | 1, 4, 21 | 3eqtr3a 2880 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ∪ cun 3933 {csn 4560 class class class wbr 5058 (class class class)co 7150 ℝ*cxr 10668 < clt 10669 ≤ cle 10670 (,)cioo 12732 [,)cico 12734 [,]cicc 12735 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-pre-lttri 10605 ax-pre-lttrn 10606 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-po 5468 df-so 5469 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-ov 7153 df-oprab 7154 df-mpo 7155 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-ioo 12736 df-ico 12738 df-icc 12739 |
This theorem is referenced by: limcresioolb 41917 icocncflimc 42165 volico 42262 fourierdlem48 42433 fouriersw 42510 |
Copyright terms: Public domain | W3C validator |