qtopbasss - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > qtopbasss		GIF version

Theorem qtopbasss 14024

Description: The set of open intervals with endpoints in a subset forms a basis for a topology. (Contributed by Mario Carneiro, 17-Jun-2014.) (Revised by Jim Kingdon, 22-May-2023.)

**Hypotheses**
Ref	Expression
qtopbas.1	⊢ 𝑆 ⊆ ℝ^*
qtopbas.max	⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → sup({𝑥, 𝑦}, ℝ^*, < ) ∈ 𝑆)
qtopbas.min	⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → inf({𝑥, 𝑦}, ℝ^*, < ) ∈ 𝑆)

**Assertion**
Ref	Expression
qtopbasss	⊢ ((,) “ (𝑆 × 𝑆)) ∈ TopBases

Distinct variable group: 𝑥,𝑦,𝑆

Proof of Theorem qtopbasss Dummy variables 𝑢 𝑡 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iooex 9907	. . 3 ⊢ (,) ∈ V
2	1	imaex 4984	. 2 ⊢ ((,) “ (𝑆 × 𝑆)) ∈ V
3		qtopbas.1	. . . . . . . . 9 ⊢ 𝑆 ⊆ ℝ^*
4	3	sseli 3152	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ℝ^*)
5	3	sseli 3152	. . . . . . . 8 ⊢ (𝑤 ∈ 𝑆 → 𝑤 ∈ ℝ^*)
6	4, 5	anim12i 338	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*))
7	3	sseli 3152	. . . . . . . 8 ⊢ (𝑣 ∈ 𝑆 → 𝑣 ∈ ℝ^*)
8	3	sseli 3152	. . . . . . . 8 ⊢ (𝑢 ∈ 𝑆 → 𝑢 ∈ ℝ^*)
9	7, 8	anim12i 338	. . . . . . 7 ⊢ ((𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆) → (𝑣 ∈ ℝ^* ∧ 𝑢 ∈ ℝ^*))
10		iooinsup 11285	. . . . . . 7 ⊢ (((𝑧 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^) ∧ (𝑣 ∈ ℝ^ ∧ 𝑢 ∈ ℝ^)) → ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) = (sup({𝑧, 𝑣}, ℝ^, < )(,)inf({𝑤, 𝑢}, ℝ^*, < )))
11	6, 9, 10	syl2an 289	. . . . . 6 ⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) = (sup({𝑧, 𝑣}, ℝ^, < )(,)inf({𝑤, 𝑢}, ℝ^, < )))
12		qtopbas.max	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → sup({𝑥, 𝑦}, ℝ^*, < ) ∈ 𝑆)
13	12	rgen2a 2531	. . . . . . . . . 10 ⊢ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 sup({𝑥, 𝑦}, ℝ^*, < ) ∈ 𝑆
14		preq12 3672	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = 𝑧) → {𝑥, 𝑦} = {𝑣, 𝑧})
15		prcom 3669	. . . . . . . . . . . . . 14 ⊢ {𝑣, 𝑧} = {𝑧, 𝑣}
16	14, 15	eqtrdi 2226	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = 𝑧) → {𝑥, 𝑦} = {𝑧, 𝑣})
17	16	supeq1d 6986	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = 𝑧) → sup({𝑥, 𝑦}, ℝ^, < ) = sup({𝑧, 𝑣}, ℝ^, < ))
18	17	eleq1d 2246	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = 𝑧) → (sup({𝑥, 𝑦}, ℝ^, < ) ∈ 𝑆 ↔ sup({𝑧, 𝑣}, ℝ^, < ) ∈ 𝑆))
19	18	rspc2gv 2854	. . . . . . . . . 10 ⊢ ((𝑣 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 sup({𝑥, 𝑦}, ℝ^, < ) ∈ 𝑆 → sup({𝑧, 𝑣}, ℝ^, < ) ∈ 𝑆))
20	13, 19	mpi 15	. . . . . . . . 9 ⊢ ((𝑣 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆) → sup({𝑧, 𝑣}, ℝ^*, < ) ∈ 𝑆)
21	20	ancoms 268	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) → sup({𝑧, 𝑣}, ℝ^*, < ) ∈ 𝑆)
22		qtopbas.min	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → inf({𝑥, 𝑦}, ℝ^*, < ) ∈ 𝑆)
23	22	rgen2a 2531	. . . . . . . . 9 ⊢ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 inf({𝑥, 𝑦}, ℝ^*, < ) ∈ 𝑆
24		preq12 3672	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑢) → {𝑥, 𝑦} = {𝑤, 𝑢})
25	24	infeq1d 7011	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑢) → inf({𝑥, 𝑦}, ℝ^, < ) = inf({𝑤, 𝑢}, ℝ^, < ))
26	25	eleq1d 2246	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑢) → (inf({𝑥, 𝑦}, ℝ^, < ) ∈ 𝑆 ↔ inf({𝑤, 𝑢}, ℝ^, < ) ∈ 𝑆))
27	26	rspc2gv 2854	. . . . . . . . 9 ⊢ ((𝑤 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 inf({𝑥, 𝑦}, ℝ^, < ) ∈ 𝑆 → inf({𝑤, 𝑢}, ℝ^, < ) ∈ 𝑆))
28	23, 27	mpi 15	. . . . . . . 8 ⊢ ((𝑤 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆) → inf({𝑤, 𝑢}, ℝ^*, < ) ∈ 𝑆)
29		df-ov 5878	. . . . . . . . 9 ⊢ (sup({𝑧, 𝑣}, ℝ^, < )(,)inf({𝑤, 𝑢}, ℝ^, < )) = ((,)‘⟨sup({𝑧, 𝑣}, ℝ^, < ), inf({𝑤, 𝑢}, ℝ^, < )⟩)
30		opelxpi 4659	. . . . . . . . . 10 ⊢ ((sup({𝑧, 𝑣}, ℝ^, < ) ∈ 𝑆 ∧ inf({𝑤, 𝑢}, ℝ^, < ) ∈ 𝑆) → ⟨sup({𝑧, 𝑣}, ℝ^, < ), inf({𝑤, 𝑢}, ℝ^, < )⟩ ∈ (𝑆 × 𝑆))
31		ioof 9971	. . . . . . . . . . . 12 ⊢ (,):(ℝ^* × ℝ^*)⟶𝒫 ℝ
32		ffun 5369	. . . . . . . . . . . 12 ⊢ ((,):(ℝ^* × ℝ^*)⟶𝒫 ℝ → Fun (,))
33	31, 32	ax-mp 5	. . . . . . . . . . 11 ⊢ Fun (,)
34		xpss12 4734	. . . . . . . . . . . . 13 ⊢ ((𝑆 ⊆ ℝ^* ∧ 𝑆 ⊆ ℝ^) → (𝑆 × 𝑆) ⊆ (ℝ^ × ℝ^*))
35	3, 3, 34	mp2an 426	. . . . . . . . . . . 12 ⊢ (𝑆 × 𝑆) ⊆ (ℝ^* × ℝ^*)
36	31	fdmi 5374	. . . . . . . . . . . 12 ⊢ dom (,) = (ℝ^* × ℝ^*)
37	35, 36	sseqtrri 3191	. . . . . . . . . . 11 ⊢ (𝑆 × 𝑆) ⊆ dom (,)
38		funfvima2 5750	. . . . . . . . . . 11 ⊢ ((Fun (,) ∧ (𝑆 × 𝑆) ⊆ dom (,)) → (⟨sup({𝑧, 𝑣}, ℝ^, < ), inf({𝑤, 𝑢}, ℝ^, < )⟩ ∈ (𝑆 × 𝑆) → ((,)‘⟨sup({𝑧, 𝑣}, ℝ^, < ), inf({𝑤, 𝑢}, ℝ^, < )⟩) ∈ ((,) “ (𝑆 × 𝑆))))
39	33, 37, 38	mp2an 426	. . . . . . . . . 10 ⊢ (⟨sup({𝑧, 𝑣}, ℝ^, < ), inf({𝑤, 𝑢}, ℝ^, < )⟩ ∈ (𝑆 × 𝑆) → ((,)‘⟨sup({𝑧, 𝑣}, ℝ^, < ), inf({𝑤, 𝑢}, ℝ^, < )⟩) ∈ ((,) “ (𝑆 × 𝑆)))
40	30, 39	syl 14	. . . . . . . . 9 ⊢ ((sup({𝑧, 𝑣}, ℝ^, < ) ∈ 𝑆 ∧ inf({𝑤, 𝑢}, ℝ^, < ) ∈ 𝑆) → ((,)‘⟨sup({𝑧, 𝑣}, ℝ^, < ), inf({𝑤, 𝑢}, ℝ^, < )⟩) ∈ ((,) “ (𝑆 × 𝑆)))
41	29, 40	eqeltrid 2264	. . . . . . . 8 ⊢ ((sup({𝑧, 𝑣}, ℝ^, < ) ∈ 𝑆 ∧ inf({𝑤, 𝑢}, ℝ^, < ) ∈ 𝑆) → (sup({𝑧, 𝑣}, ℝ^, < )(,)inf({𝑤, 𝑢}, ℝ^, < )) ∈ ((,) “ (𝑆 × 𝑆)))
42	21, 28, 41	syl2an 289	. . . . . . 7 ⊢ (((𝑧 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑤 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → (sup({𝑧, 𝑣}, ℝ^, < )(,)inf({𝑤, 𝑢}, ℝ^, < )) ∈ ((,) “ (𝑆 × 𝑆)))
43	42	an4s 588	. . . . . 6 ⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → (sup({𝑧, 𝑣}, ℝ^, < )(,)inf({𝑤, 𝑢}, ℝ^, < )) ∈ ((,) “ (𝑆 × 𝑆)))
44	11, 43	eqeltrd 2254	. . . . 5 ⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆)))
45	44	ralrimivva 2559	. . . 4 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) → ∀𝑣 ∈ 𝑆 ∀𝑢 ∈ 𝑆 ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆)))
46	45	rgen2a 2531	. . 3 ⊢ ∀𝑧 ∈ 𝑆 ∀𝑤 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ∀𝑢 ∈ 𝑆 ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆))
47		ffn 5366	. . . . . 6 ⊢ ((,):(ℝ^* × ℝ^)⟶𝒫 ℝ → (,) Fn (ℝ^ × ℝ^*))
48	31, 47	ax-mp 5	. . . . 5 ⊢ (,) Fn (ℝ^* × ℝ^*)
49		ineq1 3330	. . . . . . . 8 ⊢ (𝑥 = ((,)‘𝑡) → (𝑥 ∩ 𝑦) = (((,)‘𝑡) ∩ 𝑦))
50	49	eleq1d 2246	. . . . . . 7 ⊢ (𝑥 = ((,)‘𝑡) → ((𝑥 ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ (((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆))))
51	50	ralbidv 2477	. . . . . 6 ⊢ (𝑥 = ((,)‘𝑡) → (∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(𝑥 ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆))))
52	51	ralima 5757	. . . . 5 ⊢ (((,) Fn (ℝ^* × ℝ^) ∧ (𝑆 × 𝑆) ⊆ (ℝ^ × ℝ^*)) → (∀𝑥 ∈ ((,) “ (𝑆 × 𝑆))∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(𝑥 ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑡 ∈ (𝑆 × 𝑆)∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆))))
53	48, 35, 52	mp2an 426	. . . 4 ⊢ (∀𝑥 ∈ ((,) “ (𝑆 × 𝑆))∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(𝑥 ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑡 ∈ (𝑆 × 𝑆)∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)))
54		fveq2 5516	. . . . . . . . . 10 ⊢ (𝑡 = ⟨𝑧, 𝑤⟩ → ((,)‘𝑡) = ((,)‘⟨𝑧, 𝑤⟩))
55		df-ov 5878	. . . . . . . . . 10 ⊢ (𝑧(,)𝑤) = ((,)‘⟨𝑧, 𝑤⟩)
56	54, 55	eqtr4di 2228	. . . . . . . . 9 ⊢ (𝑡 = ⟨𝑧, 𝑤⟩ → ((,)‘𝑡) = (𝑧(,)𝑤))
57	56	ineq1d 3336	. . . . . . . 8 ⊢ (𝑡 = ⟨𝑧, 𝑤⟩ → (((,)‘𝑡) ∩ 𝑦) = ((𝑧(,)𝑤) ∩ 𝑦))
58	57	eleq1d 2246	. . . . . . 7 ⊢ (𝑡 = ⟨𝑧, 𝑤⟩ → ((((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ((𝑧(,)𝑤) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆))))
59	58	ralbidv 2477	. . . . . 6 ⊢ (𝑡 = ⟨𝑧, 𝑤⟩ → (∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))((𝑧(,)𝑤) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆))))
60		ineq2 3331	. . . . . . . . . 10 ⊢ (𝑦 = ((,)‘𝑡) → ((𝑧(,)𝑤) ∩ 𝑦) = ((𝑧(,)𝑤) ∩ ((,)‘𝑡)))
61	60	eleq1d 2246	. . . . . . . . 9 ⊢ (𝑦 = ((,)‘𝑡) → (((𝑧(,)𝑤) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ((𝑧(,)𝑤) ∩ ((,)‘𝑡)) ∈ ((,) “ (𝑆 × 𝑆))))
62	61	ralima 5757	. . . . . . . 8 ⊢ (((,) Fn (ℝ^* × ℝ^) ∧ (𝑆 × 𝑆) ⊆ (ℝ^ × ℝ^*)) → (∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))((𝑧(,)𝑤) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑡 ∈ (𝑆 × 𝑆)((𝑧(,)𝑤) ∩ ((,)‘𝑡)) ∈ ((,) “ (𝑆 × 𝑆))))
63	48, 35, 62	mp2an 426	. . . . . . 7 ⊢ (∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))((𝑧(,)𝑤) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑡 ∈ (𝑆 × 𝑆)((𝑧(,)𝑤) ∩ ((,)‘𝑡)) ∈ ((,) “ (𝑆 × 𝑆)))
64		fveq2 5516	. . . . . . . . . . 11 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → ((,)‘𝑡) = ((,)‘⟨𝑣, 𝑢⟩))
65		df-ov 5878	. . . . . . . . . . 11 ⊢ (𝑣(,)𝑢) = ((,)‘⟨𝑣, 𝑢⟩)
66	64, 65	eqtr4di 2228	. . . . . . . . . 10 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → ((,)‘𝑡) = (𝑣(,)𝑢))
67	66	ineq2d 3337	. . . . . . . . 9 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → ((𝑧(,)𝑤) ∩ ((,)‘𝑡)) = ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)))
68	67	eleq1d 2246	. . . . . . . 8 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → (((𝑧(,)𝑤) ∩ ((,)‘𝑡)) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆))))
69	68	ralxp 4771	. . . . . . 7 ⊢ (∀𝑡 ∈ (𝑆 × 𝑆)((𝑧(,)𝑤) ∩ ((,)‘𝑡)) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑣 ∈ 𝑆 ∀𝑢 ∈ 𝑆 ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆)))
70	63, 69	bitri 184	. . . . . 6 ⊢ (∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))((𝑧(,)𝑤) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑣 ∈ 𝑆 ∀𝑢 ∈ 𝑆 ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆)))
71	59, 70	bitrdi 196	. . . . 5 ⊢ (𝑡 = ⟨𝑧, 𝑤⟩ → (∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑣 ∈ 𝑆 ∀𝑢 ∈ 𝑆 ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆))))
72	71	ralxp 4771	. . . 4 ⊢ (∀𝑡 ∈ (𝑆 × 𝑆)∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(((,)‘𝑡) ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑧 ∈ 𝑆 ∀𝑤 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ∀𝑢 ∈ 𝑆 ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆)))
73	53, 72	bitri 184	. . 3 ⊢ (∀𝑥 ∈ ((,) “ (𝑆 × 𝑆))∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(𝑥 ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆)) ↔ ∀𝑧 ∈ 𝑆 ∀𝑤 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ∀𝑢 ∈ 𝑆 ((𝑧(,)𝑤) ∩ (𝑣(,)𝑢)) ∈ ((,) “ (𝑆 × 𝑆)))
74	46, 73	mpbir 146	. 2 ⊢ ∀𝑥 ∈ ((,) “ (𝑆 × 𝑆))∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(𝑥 ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆))
75		fiinbas 13552	. 2 ⊢ ((((,) “ (𝑆 × 𝑆)) ∈ V ∧ ∀𝑥 ∈ ((,) “ (𝑆 × 𝑆))∀𝑦 ∈ ((,) “ (𝑆 × 𝑆))(𝑥 ∩ 𝑦) ∈ ((,) “ (𝑆 × 𝑆))) → ((,) “ (𝑆 × 𝑆)) ∈ TopBases)
76	2, 74, 75	mp2an 426	1 ⊢ ((,) “ (𝑆 × 𝑆)) ∈ TopBases

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 ∀wral 2455 Vcvv 2738 ∩ cin 3129 ⊆ wss 3130 𝒫 cpw 3576 {cpr 3594 ⟨cop 3596 × cxp 4625 dom cdm 4627 “ cima 4630 Fun wfun 5211 Fn wfn 5212 ⟶wf 5213 ‘cfv 5217 (class class class)co 5875 supcsup 6981 infcinf 6982 ℝcr 7810 ℝ^*cxr 7991 < clt 7992 (,)cioo 9888 TopBasesctb 13545

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4119 ax-sep 4122 ax-nul 4130 ax-pow 4175 ax-pr 4210 ax-un 4434 ax-setind 4537 ax-iinf 4588 ax-cnex 7902 ax-resscn 7903 ax-1cn 7904 ax-1re 7905 ax-icn 7906 ax-addcl 7907 ax-addrcl 7908 ax-mulcl 7909 ax-mulrcl 7910 ax-addcom 7911 ax-mulcom 7912 ax-addass 7913 ax-mulass 7914 ax-distr 7915 ax-i2m1 7916 ax-0lt1 7917 ax-1rid 7918 ax-0id 7919 ax-rnegex 7920 ax-precex 7921 ax-cnre 7922 ax-pre-ltirr 7923 ax-pre-ltwlin 7924 ax-pre-lttrn 7925 ax-pre-apti 7926 ax-pre-ltadd 7927 ax-pre-mulgt0 7928 ax-pre-mulext 7929 ax-arch 7930 ax-caucvg 7931

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2740 df-sbc 2964 df-csb 3059 df-dif 3132 df-un 3134 df-in 3136 df-ss 3143 df-nul 3424 df-if 3536 df-pw 3578 df-sn 3599 df-pr 3600 df-op 3602 df-uni 3811 df-int 3846 df-iun 3889 df-br 4005 df-opab 4066 df-mpt 4067 df-tr 4103 df-id 4294 df-po 4297 df-iso 4298 df-iord 4367 df-on 4369 df-ilim 4370 df-suc 4372 df-iom 4591 df-xp 4633 df-rel 4634 df-cnv 4635 df-co 4636 df-dm 4637 df-rn 4638 df-res 4639 df-ima 4640 df-iota 5179 df-fun 5219 df-fn 5220 df-f 5221 df-f1 5222 df-fo 5223 df-f1o 5224 df-fv 5225 df-isom 5226 df-riota 5831 df-ov 5878 df-oprab 5879 df-mpo 5880 df-1st 6141 df-2nd 6142 df-recs 6306 df-frec 6392 df-sup 6983 df-inf 6984 df-pnf 7994 df-mnf 7995 df-xr 7996 df-ltxr 7997 df-le 7998 df-sub 8130 df-neg 8131 df-reap 8532 df-ap 8539 df-div 8630 df-inn 8920 df-2 8978 df-3 8979 df-4 8980 df-n0 9177 df-z 9254 df-uz 9529 df-rp 9654 df-xneg 9772 df-ioo 9892 df-seqfrec 10446 df-exp 10520 df-cj 10851 df-re 10852 df-im 10853 df-rsqrt 11007 df-abs 11008 df-bases 13546

This theorem is referenced by: qtopbas 14025 retopbas 14026

W3C validator