snunioo - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > snunioo		Structured version Visualization version GIF version

Theorem snunioo 12240

Description: The closure of one end of an open real interval. (Contributed by Paul Chapman, 15-Mar-2008.) (Proof shortened by Mario Carneiro, 16-Jun-2014.)

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

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

Step	Hyp	Ref	Expression
1		simp1 1059	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ^*)
2		iccid 12162	. . . 4 ⊢ (𝐴 ∈ ℝ^* → (𝐴[,]𝐴) = {𝐴})
3	1, 2	syl 17	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → (𝐴[,]𝐴) = {𝐴})
4	3	uneq1d 3744	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) = ({𝐴} ∪ (𝐴(,)𝐵)))
5		simp2 1060	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ^*)
6		xrleid 11927	. . . 4 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ 𝐴)
7	1, 6	syl 17	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐴 ≤ 𝐴)
8		simp3 1061	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵)
9		df-icc 12124	. . . 4 ⊢ [,] = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)})
10		df-ioo 12121	. . . 4 ⊢ (,) = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)})
11		xrltnle 10049	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴 < 𝑤 ↔ ¬ 𝑤 ≤ 𝐴))
12		df-ico 12123	. . . 4 ⊢ [,) = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
13		xrlelttr 11931	. . . 4 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝑤 ≤ 𝐴 ∧ 𝐴 < 𝐵) → 𝑤 < 𝐵))
14		xrltle 11926	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴 < 𝑤 → 𝐴 ≤ 𝑤))
15	14	3adant1 1077	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴 < 𝑤 → 𝐴 ≤ 𝑤))
16	15	adantld 483	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → ((𝐴 ≤ 𝐴 ∧ 𝐴 < 𝑤) → 𝐴 ≤ 𝑤))
17	9, 10, 11, 12, 13, 16	ixxun 12133	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐴 < 𝐵)) → ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
18	1, 1, 5, 7, 8, 17	syl32anc 1331	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴[,]𝐴) ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
19	4, 18	eqtr3d 2657	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ({𝐴} ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1036 = wceq 1480 ∈ wcel 1987 ∪ cun 3553 {csn 4148 class class class wbr 4613 (class class class)co 6604 ℝ^*cxr 10017 < clt 10018 ≤ cle 10019 (,)cioo 12117 [,)cico 12119 [,]cicc 12120

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1719 ax-4 1734 ax-5 1836 ax-6 1885 ax-7 1932 ax-8 1989 ax-9 1996 ax-10 2016 ax-11 2031 ax-12 2044 ax-13 2245 ax-ext 2601 ax-sep 4741 ax-nul 4749 ax-pow 4803 ax-pr 4867 ax-un 6902 ax-cnex 9936 ax-resscn 9937 ax-pre-lttri 9954 ax-pre-lttrn 9955

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1037 df-3an 1038 df-tru 1483 df-ex 1702 df-nf 1707 df-sb 1878 df-eu 2473 df-mo 2474 df-clab 2608 df-cleq 2614 df-clel 2617 df-nfc 2750 df-ne 2791 df-nel 2894 df-ral 2912 df-rex 2913 df-rab 2916 df-v 3188 df-sbc 3418 df-csb 3515 df-dif 3558 df-un 3560 df-in 3562 df-ss 3569 df-nul 3892 df-if 4059 df-pw 4132 df-sn 4149 df-pr 4151 df-op 4155 df-uni 4403 df-br 4614 df-opab 4674 df-mpt 4675 df-id 4989 df-po 4995 df-so 4996 df-xp 5080 df-rel 5081 df-cnv 5082 df-co 5083 df-dm 5084 df-rn 5085 df-res 5086 df-ima 5087 df-iota 5810 df-fun 5849 df-fn 5850 df-f 5851 df-f1 5852 df-fo 5853 df-f1o 5854 df-fv 5855 df-ov 6607 df-oprab 6608 df-mpt2 6609 df-er 7687 df-en 7900 df-dom 7901 df-sdom 7902 df-pnf 10020 df-mnf 10021 df-xr 10022 df-ltxr 10023 df-le 10024 df-ioo 12121 df-ico 12123 df-icc 12124

This theorem is referenced by: prunioo 12243 ioojoin 12245 icombl1 23238 ioombl 23240 tan2h 33030 mbfposadd 33086 itg2addnclem2 33091 ftc1anclem5 33118 iocunico 37274 limciccioolb 39254 fourierdlem32 39660 fourierdlem93 39720

W3C validator