snunioo1 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > snunioo1		Structured version Visualization version GIF version

Theorem snunioo1 45483

Description: The closure of one end of an open real interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Assertion**
Ref	Expression
snunioo1	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵))

Proof of Theorem snunioo1 Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uncom 4117	. 2 ⊢ ((𝐴(,)𝐵) ∪ (𝐴[,]𝐴)) = ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵))
2		iccid 13327	. . . 4 ⊢ (𝐴 ∈ ℝ^* → (𝐴[,]𝐴) = {𝐴})
3	2	3ad2ant1 1133	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → (𝐴[,]𝐴) = {𝐴})
4	3	uneq2d 4127	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ (𝐴[,]𝐴)) = ((𝐴(,)𝐵) ∪ {𝐴}))
5		simp1 1136	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ^*)
6		simp2 1137	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ^*)
7		xrleid 13087	. . . 4 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ 𝐴)
8	7	3ad2ant1 1133	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐴 ≤ 𝐴)
9		simp3 1138	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵)
10		df-icc 13289	. . . 4 ⊢ [,] = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)})
11		df-ioo 13286	. . . 4 ⊢ (,) = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)})
12		xrltnle 11217	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴 < 𝑤 ↔ ¬ 𝑤 ≤ 𝐴))
13		df-ico 13288	. . . 4 ⊢ [,) = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
14		xrlelttr 13092	. . . 4 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝑤 ≤ 𝐴 ∧ 𝐴 < 𝐵) → 𝑤 < 𝐵))
15		simpl1 1192	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝐴 ∈ ℝ^)
16		simpl3 1194	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝑤 ∈ ℝ^)
17		simprr 772	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝐴 < 𝑤)
18	15, 16, 17	xrltled 13086	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤)) → 𝐴 ≤ 𝑤)
19	18	ex 412	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → ((𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤) → 𝐴 ≤ 𝑤))
20	10, 11, 12, 13, 14, 19	ixxun 13298	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝐵)) → ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
21	5, 5, 6, 8, 9, 20	syl32anc 1380	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
22	1, 4, 21	3eqtr3a 2788	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∪ cun 3909 {csn 4585 class class class wbr 5102 (class class class)co 7369 ℝ^*cxr 11183 < clt 11184 ≤ cle 11185 (,)cioo 13282 [,)cico 13284 [,]cicc 13285

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-pre-lttri 11118 ax-pre-lttrn 11119

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-po 5539 df-so 5540 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-ov 7372 df-oprab 7373 df-mpo 7374 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-ioo 13286 df-ico 13288 df-icc 13289

This theorem is referenced by: limcresioolb 45614 icocncflimc 45860 volico 45954 fourierdlem48 46125 fouriersw 46202

W3C validator