iccordt - Metamath Proof Explorer

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

Theorem iccordt 23160

Description: A closed interval is closed in the order topology of the extended reals. (Contributed by Mario Carneiro, 3-Sep-2015.)

**Assertion**
Ref	Expression
iccordt	⊢ (𝐴[,]𝐵) ∈ (Clsd‘(ordTop‘ ≤ ))

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

Step	Hyp	Ref	Expression
1		df-ov 7361	. 2 ⊢ (𝐴[,]𝐵) = ([,]‘⟨𝐴, 𝐵⟩)
2		letsr 18518	. . . . . 6 ⊢ ≤ ∈ TosetRel
3		ledm 18515	. . . . . . 7 ⊢ ℝ^* = dom ≤
4	3	ordtcld3 23145	. . . . . 6 ⊢ (( ≤ ∈ TosetRel ∧ 𝑥 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^) → {𝑧 ∈ ℝ^ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)} ∈ (Clsd‘(ordTop‘ ≤ )))
5	2, 4	mp3an1 1451	. . . . 5 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^) → {𝑧 ∈ ℝ^ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)} ∈ (Clsd‘(ordTop‘ ≤ )))
6	5	rgen2 3175	. . . 4 ⊢ ∀𝑥 ∈ ℝ^* ∀𝑦 ∈ ℝ^* {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)} ∈ (Clsd‘(ordTop‘ ≤ ))
7		df-icc 13270	. . . . 5 ⊢ [,] = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)})
8	7	fmpo 8012	. . . 4 ⊢ (∀𝑥 ∈ ℝ^* ∀𝑦 ∈ ℝ^* {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)} ∈ (Clsd‘(ordTop‘ ≤ )) ↔ [,]:(ℝ^* × ℝ^*)⟶(Clsd‘(ordTop‘ ≤ )))
9	6, 8	mpbi 230	. . 3 ⊢ [,]:(ℝ^* × ℝ^*)⟶(Clsd‘(ordTop‘ ≤ ))
10		letop 23152	. . . 4 ⊢ (ordTop‘ ≤ ) ∈ Top
11		0cld 22984	. . . 4 ⊢ ((ordTop‘ ≤ ) ∈ Top → ∅ ∈ (Clsd‘(ordTop‘ ≤ )))
12	10, 11	ax-mp 5	. . 3 ⊢ ∅ ∈ (Clsd‘(ordTop‘ ≤ ))
13	9, 12	f0cli 7043	. 2 ⊢ ([,]‘⟨𝐴, 𝐵⟩) ∈ (Clsd‘(ordTop‘ ≤ ))
14	1, 13	eqeltri 2831	1 ⊢ (𝐴[,]𝐵) ∈ (Clsd‘(ordTop‘ ≤ ))

Colors of variables: wff setvar class

Syntax hints: ∧ wa 395 ∈ wcel 2114 ∀wral 3050 {crab 3398 ∅c0 4284 ⟨cop 4585 class class class wbr 5097 × cxp 5621 ⟶wf 6487 ‘cfv 6491 (class class class)co 7358 ℝ^*cxr 11167 ≤ cle 11169 [,]cicc 13266 ordTopcordt 17422 TosetRel ctsr 18490 Topctop 22839 Clsdccld 22962

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-pre-lttri 11102 ax-pre-lttrn 11103

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4902 df-iun 4947 df-iin 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-1o 8397 df-2o 8398 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-fi 9316 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-icc 13270 df-topgen 17365 df-ordt 17424 df-ps 18491 df-tsr 18492 df-top 22840 df-topon 22857 df-bases 22892 df-cld 22965

This theorem is referenced by: lecldbas 23165 icccldii 49201

W3C validator