lecldbas - Metamath Proof Explorer

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

Theorem lecldbas 22351

Description: The set of closed intervals forms a closed subbasis for the topology on the extended reals. Since our definition of a basis is in terms of open sets, we express this by showing that the complements of closed intervals form an open subbasis for the topology. (Contributed by Mario Carneiro, 3-Sep-2015.)

**Hypothesis**
Ref	Expression
lecldbas.1	⊢ 𝐹 = (𝑥 ∈ ran [,] ↦ (ℝ^* ∖ 𝑥))

**Assertion**
Ref	Expression
lecldbas	⊢ (ordTop‘ ≤ ) = (topGen‘(fi‘ran 𝐹))

Proof of Theorem lecldbas Dummy variables 𝑎 𝑏 𝑐 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2739	. . . 4 ⊢ ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) = ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞))
2		eqid 2739	. . . 4 ⊢ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)) = ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦))
3	1, 2	leordtval2 22344	. . 3 ⊢ (ordTop‘ ≤ ) = (topGen‘(fi‘(ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)))))
4		fvex 6781	. . . 4 ⊢ (fi‘ran 𝐹) ∈ V
5		fvex 6781	. . . . . 6 ⊢ (ordTop‘ ≤ ) ∈ V
6		lecldbas.1	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ ran [,] ↦ (ℝ^* ∖ 𝑥))
7		iccf 13162	. . . . . . . . . . 11 ⊢ [,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^
8		ffn 6596	. . . . . . . . . . 11 ⊢ ([,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^ → [,] Fn (ℝ^* × ℝ^*))
9	7, 8	ax-mp 5	. . . . . . . . . 10 ⊢ [,] Fn (ℝ^* × ℝ^*)
10		ovelrn 7439	. . . . . . . . . 10 ⊢ ([,] Fn (ℝ^* × ℝ^) → (𝑥 ∈ ran [,] ↔ ∃𝑎 ∈ ℝ^ ∃𝑏 ∈ ℝ^* 𝑥 = (𝑎[,]𝑏)))
11	9, 10	ax-mp 5	. . . . . . . . 9 ⊢ (𝑥 ∈ ran [,] ↔ ∃𝑎 ∈ ℝ^* ∃𝑏 ∈ ℝ^* 𝑥 = (𝑎[,]𝑏))
12		difeq2 4055	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑎[,]𝑏) → (ℝ^* ∖ 𝑥) = (ℝ^* ∖ (𝑎[,]𝑏)))
13		iccordt 22346	. . . . . . . . . . . . 13 ⊢ (𝑎[,]𝑏) ∈ (Clsd‘(ordTop‘ ≤ ))
14		letopuni 22339	. . . . . . . . . . . . . 14 ⊢ ℝ^* = ∪ (ordTop‘ ≤ )
15	14	cldopn 22163	. . . . . . . . . . . . 13 ⊢ ((𝑎[,]𝑏) ∈ (Clsd‘(ordTop‘ ≤ )) → (ℝ^* ∖ (𝑎[,]𝑏)) ∈ (ordTop‘ ≤ ))
16	13, 15	ax-mp 5	. . . . . . . . . . . 12 ⊢ (ℝ^* ∖ (𝑎[,]𝑏)) ∈ (ordTop‘ ≤ )
17	12, 16	eqeltrdi 2848	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑎[,]𝑏) → (ℝ^* ∖ 𝑥) ∈ (ordTop‘ ≤ ))
18	17	rexlimivw 3212	. . . . . . . . . 10 ⊢ (∃𝑏 ∈ ℝ^* 𝑥 = (𝑎[,]𝑏) → (ℝ^* ∖ 𝑥) ∈ (ordTop‘ ≤ ))
19	18	rexlimivw 3212	. . . . . . . . 9 ⊢ (∃𝑎 ∈ ℝ^* ∃𝑏 ∈ ℝ^* 𝑥 = (𝑎[,]𝑏) → (ℝ^* ∖ 𝑥) ∈ (ordTop‘ ≤ ))
20	11, 19	sylbi 216	. . . . . . . 8 ⊢ (𝑥 ∈ ran [,] → (ℝ^* ∖ 𝑥) ∈ (ordTop‘ ≤ ))
21	6, 20	fmpti 6980	. . . . . . 7 ⊢ 𝐹:ran [,]⟶(ordTop‘ ≤ )
22		frn 6603	. . . . . . 7 ⊢ (𝐹:ran [,]⟶(ordTop‘ ≤ ) → ran 𝐹 ⊆ (ordTop‘ ≤ ))
23	21, 22	ax-mp 5	. . . . . 6 ⊢ ran 𝐹 ⊆ (ordTop‘ ≤ )
24	5, 23	ssexi 5249	. . . . 5 ⊢ ran 𝐹 ∈ V
25		eqid 2739	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) = (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞))
26		mnfxr 11016	. . . . . . . . . . 11 ⊢ -∞ ∈ ℝ^*
27		fnovrn 7438	. . . . . . . . . . 11 ⊢ (([,] Fn (ℝ^* × ℝ^) ∧ -∞ ∈ ℝ^ ∧ 𝑦 ∈ ℝ^*) → (-∞[,]𝑦) ∈ ran [,])
28	9, 26, 27	mp3an12 1449	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ^* → (-∞[,]𝑦) ∈ ran [,])
29	26	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ^* → -∞ ∈ ℝ^*)
30		id 22	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ^* → 𝑦 ∈ ℝ^*)
31		pnfxr 11013	. . . . . . . . . . . . . . 15 ⊢ +∞ ∈ ℝ^*
32	31	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ^* → +∞ ∈ ℝ^*)
33		mnfle 12852	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ^* → -∞ ≤ 𝑦)
34		pnfge 12848	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ^* → 𝑦 ≤ +∞)
35		df-icc 13068	. . . . . . . . . . . . . . 15 ⊢ [,] = (𝑎 ∈ ℝ^, 𝑏 ∈ ℝ^ ↦ {𝑐 ∈ ℝ^* ∣ (𝑎 ≤ 𝑐 ∧ 𝑐 ≤ 𝑏)})
36		df-ioc 13066	. . . . . . . . . . . . . . 15 ⊢ (,] = (𝑎 ∈ ℝ^, 𝑏 ∈ ℝ^ ↦ {𝑐 ∈ ℝ^* ∣ (𝑎 < 𝑐 ∧ 𝑐 ≤ 𝑏)})
37		xrltnle 11026	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℝ^* ∧ 𝑧 ∈ ℝ^*) → (𝑦 < 𝑧 ↔ ¬ 𝑧 ≤ 𝑦))
38		xrletr 12874	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → ((𝑧 ≤ 𝑦 ∧ 𝑦 ≤ +∞) → 𝑧 ≤ +∞))
39		xrlelttr 12872	. . . . . . . . . . . . . . . 16 ⊢ ((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ 𝑧 ∈ ℝ^*) → ((-∞ ≤ 𝑦 ∧ 𝑦 < 𝑧) → -∞ < 𝑧))
40		xrltle 12865	. . . . . . . . . . . . . . . . 17 ⊢ ((-∞ ∈ ℝ^* ∧ 𝑧 ∈ ℝ^*) → (-∞ < 𝑧 → -∞ ≤ 𝑧))
41	40	3adant2 1129	. . . . . . . . . . . . . . . 16 ⊢ ((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ 𝑧 ∈ ℝ^*) → (-∞ < 𝑧 → -∞ ≤ 𝑧))
42	39, 41	syld 47	. . . . . . . . . . . . . . 15 ⊢ ((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ 𝑧 ∈ ℝ^*) → ((-∞ ≤ 𝑦 ∧ 𝑦 < 𝑧) → -∞ ≤ 𝑧))
43	35, 36, 37, 35, 38, 42	ixxun 13077	. . . . . . . . . . . . . 14 ⊢ (((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) ∧ (-∞ ≤ 𝑦 ∧ 𝑦 ≤ +∞)) → ((-∞[,]𝑦) ∪ (𝑦(,]+∞)) = (-∞[,]+∞))
44	29, 30, 32, 33, 34, 43	syl32anc 1376	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ^* → ((-∞[,]𝑦) ∪ (𝑦(,]+∞)) = (-∞[,]+∞))
45		iccmax 13137	. . . . . . . . . . . . 13 ⊢ (-∞[,]+∞) = ℝ^*
46	44, 45	eqtrdi 2795	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ^* → ((-∞[,]𝑦) ∪ (𝑦(,]+∞)) = ℝ^*)
47		iccssxr 13144	. . . . . . . . . . . . 13 ⊢ (-∞[,]𝑦) ⊆ ℝ^*
48	35, 36, 37	ixxdisj 13076	. . . . . . . . . . . . . 14 ⊢ ((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → ((-∞[,]𝑦) ∩ (𝑦(,]+∞)) = ∅)
49	26, 31, 48	mp3an13 1450	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ^* → ((-∞[,]𝑦) ∩ (𝑦(,]+∞)) = ∅)
50		uneqdifeq 4428	. . . . . . . . . . . . 13 ⊢ (((-∞[,]𝑦) ⊆ ℝ^* ∧ ((-∞[,]𝑦) ∩ (𝑦(,]+∞)) = ∅) → (((-∞[,]𝑦) ∪ (𝑦(,]+∞)) = ℝ^* ↔ (ℝ^* ∖ (-∞[,]𝑦)) = (𝑦(,]+∞)))
51	47, 49, 50	sylancr 586	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ^* → (((-∞[,]𝑦) ∪ (𝑦(,]+∞)) = ℝ^* ↔ (ℝ^* ∖ (-∞[,]𝑦)) = (𝑦(,]+∞)))
52	46, 51	mpbid 231	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℝ^* → (ℝ^* ∖ (-∞[,]𝑦)) = (𝑦(,]+∞))
53	52	eqcomd 2745	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ^* → (𝑦(,]+∞) = (ℝ^* ∖ (-∞[,]𝑦)))
54		difeq2 4055	. . . . . . . . . . 11 ⊢ (𝑥 = (-∞[,]𝑦) → (ℝ^* ∖ 𝑥) = (ℝ^* ∖ (-∞[,]𝑦)))
55	54	rspceeqv 3575	. . . . . . . . . 10 ⊢ (((-∞[,]𝑦) ∈ ran [,] ∧ (𝑦(,]+∞) = (ℝ^* ∖ (-∞[,]𝑦))) → ∃𝑥 ∈ ran [,](𝑦(,]+∞) = (ℝ^* ∖ 𝑥))
56	28, 53, 55	syl2anc 583	. . . . . . . . 9 ⊢ (𝑦 ∈ ℝ^* → ∃𝑥 ∈ ran [,](𝑦(,]+∞) = (ℝ^* ∖ 𝑥))
57		xrex 12709	. . . . . . . . . . 11 ⊢ ℝ^* ∈ V
58	57	difexi 5255	. . . . . . . . . 10 ⊢ (ℝ^* ∖ 𝑥) ∈ V
59	6, 58	elrnmpti 5866	. . . . . . . . 9 ⊢ ((𝑦(,]+∞) ∈ ran 𝐹 ↔ ∃𝑥 ∈ ran [,](𝑦(,]+∞) = (ℝ^* ∖ 𝑥))
60	56, 59	sylibr 233	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ^* → (𝑦(,]+∞) ∈ ran 𝐹)
61	25, 60	fmpti 6980	. . . . . . 7 ⊢ (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)):ℝ^*⟶ran 𝐹
62		frn 6603	. . . . . . 7 ⊢ ((𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)):ℝ^⟶ran 𝐹 → ran (𝑦 ∈ ℝ^ ↦ (𝑦(,]+∞)) ⊆ ran 𝐹)
63	61, 62	ax-mp 5	. . . . . 6 ⊢ ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ⊆ ran 𝐹
64		eqid 2739	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)) = (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦))
65		fnovrn 7438	. . . . . . . . . . 11 ⊢ (([,] Fn (ℝ^* × ℝ^) ∧ 𝑦 ∈ ℝ^ ∧ +∞ ∈ ℝ^*) → (𝑦[,]+∞) ∈ ran [,])
66	9, 31, 65	mp3an13 1450	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ^* → (𝑦[,]+∞) ∈ ran [,])
67		df-ico 13067	. . . . . . . . . . . . . . 15 ⊢ [,) = (𝑎 ∈ ℝ^, 𝑏 ∈ ℝ^ ↦ {𝑐 ∈ ℝ^* ∣ (𝑎 ≤ 𝑐 ∧ 𝑐 < 𝑏)})
68		xrlenlt 11024	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℝ^* ∧ 𝑧 ∈ ℝ^*) → (𝑦 ≤ 𝑧 ↔ ¬ 𝑧 < 𝑦))
69		xrltletr 12873	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → ((𝑧 < 𝑦 ∧ 𝑦 ≤ +∞) → 𝑧 < +∞))
70		xrltle 12865	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑧 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → (𝑧 < +∞ → 𝑧 ≤ +∞))
71	70	3adant2 1129	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → (𝑧 < +∞ → 𝑧 ≤ +∞))
72	69, 71	syld 47	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → ((𝑧 < 𝑦 ∧ 𝑦 ≤ +∞) → 𝑧 ≤ +∞))
73		xrletr 12874	. . . . . . . . . . . . . . 15 ⊢ ((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ 𝑧 ∈ ℝ^*) → ((-∞ ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → -∞ ≤ 𝑧))
74	67, 35, 68, 35, 72, 73	ixxun 13077	. . . . . . . . . . . . . 14 ⊢ (((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) ∧ (-∞ ≤ 𝑦 ∧ 𝑦 ≤ +∞)) → ((-∞[,)𝑦) ∪ (𝑦[,]+∞)) = (-∞[,]+∞))
75	29, 30, 32, 33, 34, 74	syl32anc 1376	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ^* → ((-∞[,)𝑦) ∪ (𝑦[,]+∞)) = (-∞[,]+∞))
76		uncom 4091	. . . . . . . . . . . . 13 ⊢ ((-∞[,)𝑦) ∪ (𝑦[,]+∞)) = ((𝑦[,]+∞) ∪ (-∞[,)𝑦))
77	75, 76, 45	3eqtr3g 2802	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ^* → ((𝑦[,]+∞) ∪ (-∞[,)𝑦)) = ℝ^*)
78		iccssxr 13144	. . . . . . . . . . . . 13 ⊢ (𝑦[,]+∞) ⊆ ℝ^*
79		incom 4139	. . . . . . . . . . . . . 14 ⊢ ((𝑦[,]+∞) ∩ (-∞[,)𝑦)) = ((-∞[,)𝑦) ∩ (𝑦[,]+∞))
80	67, 35, 68	ixxdisj 13076	. . . . . . . . . . . . . . 15 ⊢ ((-∞ ∈ ℝ^* ∧ 𝑦 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → ((-∞[,)𝑦) ∩ (𝑦[,]+∞)) = ∅)
81	26, 31, 80	mp3an13 1450	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ^* → ((-∞[,)𝑦) ∩ (𝑦[,]+∞)) = ∅)
82	79, 81	eqtrid 2791	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ^* → ((𝑦[,]+∞) ∩ (-∞[,)𝑦)) = ∅)
83		uneqdifeq 4428	. . . . . . . . . . . . 13 ⊢ (((𝑦[,]+∞) ⊆ ℝ^* ∧ ((𝑦[,]+∞) ∩ (-∞[,)𝑦)) = ∅) → (((𝑦[,]+∞) ∪ (-∞[,)𝑦)) = ℝ^* ↔ (ℝ^* ∖ (𝑦[,]+∞)) = (-∞[,)𝑦)))
84	78, 82, 83	sylancr 586	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ^* → (((𝑦[,]+∞) ∪ (-∞[,)𝑦)) = ℝ^* ↔ (ℝ^* ∖ (𝑦[,]+∞)) = (-∞[,)𝑦)))
85	77, 84	mpbid 231	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℝ^* → (ℝ^* ∖ (𝑦[,]+∞)) = (-∞[,)𝑦))
86	85	eqcomd 2745	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ^* → (-∞[,)𝑦) = (ℝ^* ∖ (𝑦[,]+∞)))
87		difeq2 4055	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑦[,]+∞) → (ℝ^* ∖ 𝑥) = (ℝ^* ∖ (𝑦[,]+∞)))
88	87	rspceeqv 3575	. . . . . . . . . 10 ⊢ (((𝑦[,]+∞) ∈ ran [,] ∧ (-∞[,)𝑦) = (ℝ^* ∖ (𝑦[,]+∞))) → ∃𝑥 ∈ ran [,](-∞[,)𝑦) = (ℝ^* ∖ 𝑥))
89	66, 86, 88	syl2anc 583	. . . . . . . . 9 ⊢ (𝑦 ∈ ℝ^* → ∃𝑥 ∈ ran [,](-∞[,)𝑦) = (ℝ^* ∖ 𝑥))
90	6, 58	elrnmpti 5866	. . . . . . . . 9 ⊢ ((-∞[,)𝑦) ∈ ran 𝐹 ↔ ∃𝑥 ∈ ran [,](-∞[,)𝑦) = (ℝ^* ∖ 𝑥))
91	89, 90	sylibr 233	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ^* → (-∞[,)𝑦) ∈ ran 𝐹)
92	64, 91	fmpti 6980	. . . . . . 7 ⊢ (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)):ℝ^*⟶ran 𝐹
93		frn 6603	. . . . . . 7 ⊢ ((𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)):ℝ^⟶ran 𝐹 → ran (𝑦 ∈ ℝ^ ↦ (-∞[,)𝑦)) ⊆ ran 𝐹)
94	92, 93	ax-mp 5	. . . . . 6 ⊢ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)) ⊆ ran 𝐹
95	63, 94	unssi 4123	. . . . 5 ⊢ (ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦))) ⊆ ran 𝐹
96		fiss 9144	. . . . 5 ⊢ ((ran 𝐹 ∈ V ∧ (ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦))) ⊆ ran 𝐹) → (fi‘(ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)))) ⊆ (fi‘ran 𝐹))
97	24, 95, 96	mp2an 688	. . . 4 ⊢ (fi‘(ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)))) ⊆ (fi‘ran 𝐹)
98		tgss 22099	. . . 4 ⊢ (((fi‘ran 𝐹) ∈ V ∧ (fi‘(ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦)))) ⊆ (fi‘ran 𝐹)) → (topGen‘(fi‘(ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦))))) ⊆ (topGen‘(fi‘ran 𝐹)))
99	4, 97, 98	mp2an 688	. . 3 ⊢ (topGen‘(fi‘(ran (𝑦 ∈ ℝ^* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ^* ↦ (-∞[,)𝑦))))) ⊆ (topGen‘(fi‘ran 𝐹))
100	3, 99	eqsstri 3959	. 2 ⊢ (ordTop‘ ≤ ) ⊆ (topGen‘(fi‘ran 𝐹))
101		letop 22338	. . 3 ⊢ (ordTop‘ ≤ ) ∈ Top
102		tgfiss 22122	. . 3 ⊢ (((ordTop‘ ≤ ) ∈ Top ∧ ran 𝐹 ⊆ (ordTop‘ ≤ )) → (topGen‘(fi‘ran 𝐹)) ⊆ (ordTop‘ ≤ ))
103	101, 23, 102	mp2an 688	. 2 ⊢ (topGen‘(fi‘ran 𝐹)) ⊆ (ordTop‘ ≤ )
104	100, 103	eqssi 3941	1 ⊢ (ordTop‘ ≤ ) = (topGen‘(fi‘ran 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1541 ∈ wcel 2109 ∃wrex 3066 Vcvv 3430 ∖ cdif 3888 ∪ cun 3889 ∩ cin 3890 ⊆ wss 3891 ∅c0 4261 𝒫 cpw 4538 class class class wbr 5078 ↦ cmpt 5161 × cxp 5586 ran crn 5589 Fn wfn 6425 ⟶wf 6426 ‘cfv 6430 (class class class)co 7268 ficfi 9130 +∞cpnf 10990 -∞cmnf 10991 ℝ^*cxr 10992 < clt 10993 ≤ cle 10994 (,]cioc 13062 [,)cico 13063 [,]cicc 13064 topGenctg 17129 ordTopcordt 17191 Topctop 22023 Clsdccld 22148

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-cnex 10911 ax-resscn 10912 ax-1cn 10913 ax-icn 10914 ax-addcl 10915 ax-addrcl 10916 ax-mulcl 10917 ax-mulrcl 10918 ax-mulcom 10919 ax-addass 10920 ax-mulass 10921 ax-distr 10922 ax-i2m1 10923 ax-1ne0 10924 ax-1rid 10925 ax-rnegex 10926 ax-rrecex 10927 ax-cnre 10928 ax-pre-lttri 10929 ax-pre-lttrn 10930 ax-pre-ltadd 10931 ax-pre-mulgt0 10932

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4845 df-int 4885 df-iun 4931 df-iin 4932 df-br 5079 df-opab 5141 df-mpt 5162 df-tr 5196 df-id 5488 df-eprel 5494 df-po 5502 df-so 5503 df-fr 5543 df-we 5545 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-ord 6266 df-on 6267 df-lim 6268 df-suc 6269 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-om 7701 df-1st 7817 df-2nd 7818 df-1o 8281 df-er 8472 df-en 8708 df-dom 8709 df-sdom 8710 df-fin 8711 df-fi 9131 df-pnf 10995 df-mnf 10996 df-xr 10997 df-ltxr 10998 df-le 10999 df-sub 11190 df-neg 11191 df-ioc 13066 df-ico 13067 df-icc 13068 df-topgen 17135 df-ordt 17193 df-ps 18265 df-tsr 18266 df-top 22024 df-topon 22041 df-bases 22077 df-cld 22151

This theorem is referenced by: (None)

W3C validator