txcnmpt - Metamath Proof Explorer

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

Theorem txcnmpt 23851

Description: A map into the product of two topological spaces is continuous if both of its projections are continuous. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 22-Aug-2015.)

**Hypotheses**
Ref	Expression
txcnmpt.1	⊢ 𝑊 = ∪ 𝑈
txcnmpt.2	⊢ 𝐻 = (𝑥 ∈ 𝑊 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩)

**Assertion**
Ref	Expression
txcnmpt	⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻 ∈ (𝑈 Cn (𝑅 ×_t 𝑆)))

Distinct variable groups: 𝑥,𝐹 𝑥,𝐺 𝑥,𝑅 𝑥,𝑆 𝑥,𝑈 𝑥,𝑊 Allowed substitution hint: 𝐻(𝑥)

Proof of Theorem txcnmpt Dummy variables 𝑠 𝑟 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		txcnmpt.1	. . . . . . 7 ⊢ 𝑊 = ∪ 𝑈
2		eqid 2762	. . . . . . 7 ⊢ ∪ 𝑅 = ∪ 𝑅
3	1, 2	cnf 23472	. . . . . 6 ⊢ (𝐹 ∈ (𝑈 Cn 𝑅) → 𝐹:𝑊⟶∪ 𝑅)
4	3	adantr 486	. . . . 5 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐹:𝑊⟶∪ 𝑅)
5	4	ffvelcdmda 7080	. . . 4 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝐹‘𝑥) ∈ ∪ 𝑅)
6		eqid 2762	. . . . . . 7 ⊢ ∪ 𝑆 = ∪ 𝑆
7	1, 6	cnf 23472	. . . . . 6 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝐺:𝑊⟶∪ 𝑆)
8	7	adantl 487	. . . . 5 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐺:𝑊⟶∪ 𝑆)
9	8	ffvelcdmda 7080	. . . 4 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝐺‘𝑥) ∈ ∪ 𝑆)
10	5, 9	opelxpd 5698	. . 3 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥 ∈ 𝑊) → ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (∪ 𝑅 × ∪ 𝑆))
11		txcnmpt.2	. . 3 ⊢ 𝐻 = (𝑥 ∈ 𝑊 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩)
12	10, 11	fmptd 7110	. 2 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻:𝑊⟶(∪ 𝑅 × ∪ 𝑆))
13	11	mptpreima 6238	. . . . . 6 ⊢ (^◡𝐻 “ (𝑟 × 𝑠)) = {𝑥 ∈ 𝑊 ∣ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)}
14	4	adantr 486	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐹:𝑊⟶∪ 𝑅)
15	14	adantr 486	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → 𝐹:𝑊⟶∪ 𝑅)
16		ffn 6706	. . . . . . . . . . . 12 ⊢ (𝐹:𝑊⟶∪ 𝑅 → 𝐹 Fn 𝑊)
17		elpreima 7054	. . . . . . . . . . . 12 ⊢ (𝐹 Fn 𝑊 → (𝑥 ∈ (^◡𝐹 “ 𝑟) ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
18	15, 16, 17	3syl 19	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐹 “ 𝑟) ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
19		ibar 538	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑊 → ((𝐹‘𝑥) ∈ 𝑟 ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
20	19	adantl 487	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → ((𝐹‘𝑥) ∈ 𝑟 ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
21	18, 20	bitr4d 285	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐹 “ 𝑟) ↔ (𝐹‘𝑥) ∈ 𝑟))
22	8	ad2antrr 739	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → 𝐺:𝑊⟶∪ 𝑆)
23		ffn 6706	. . . . . . . . . . . 12 ⊢ (𝐺:𝑊⟶∪ 𝑆 → 𝐺 Fn 𝑊)
24		elpreima 7054	. . . . . . . . . . . 12 ⊢ (𝐺 Fn 𝑊 → (𝑥 ∈ (^◡𝐺 “ 𝑠) ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
25	22, 23, 24	3syl 19	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐺 “ 𝑠) ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
26		ibar 538	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑊 → ((𝐺‘𝑥) ∈ 𝑠 ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
27	26	adantl 487	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → ((𝐺‘𝑥) ∈ 𝑠 ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
28	25, 27	bitr4d 285	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐺 “ 𝑠) ↔ (𝐺‘𝑥) ∈ 𝑠))
29	21, 28	anbi12d 644	. . . . . . . . 9 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → ((𝑥 ∈ (^◡𝐹 “ 𝑟) ∧ 𝑥 ∈ (^◡𝐺 “ 𝑠)) ↔ ((𝐹‘𝑥) ∈ 𝑟 ∧ (𝐺‘𝑥) ∈ 𝑠)))
30		elin 3918	. . . . . . . . 9 ⊢ (𝑥 ∈ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ↔ (𝑥 ∈ (^◡𝐹 “ 𝑟) ∧ 𝑥 ∈ (^◡𝐺 “ 𝑠)))
31		opelxp 5695	. . . . . . . . 9 ⊢ (⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠) ↔ ((𝐹‘𝑥) ∈ 𝑟 ∧ (𝐺‘𝑥) ∈ 𝑠))
32	29, 30, 31	3bitr4g 317	. . . . . . . 8 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ↔ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)))
33	32	rabbi2dva 4174	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑊 ∩ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠))) = {𝑥 ∈ 𝑊 ∣ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)})
34		inss1 4185	. . . . . . . . . 10 ⊢ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ (^◡𝐹 “ 𝑟)
35		cnvimass 6082	. . . . . . . . . 10 ⊢ (^◡𝐹 “ 𝑟) ⊆ dom 𝐹
36	34, 35	sstri 3943	. . . . . . . . 9 ⊢ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ dom 𝐹
37	36, 14	fssdm 6726	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ 𝑊)
38		sseqin2 4172	. . . . . . . 8 ⊢ (((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ 𝑊 ↔ (𝑊 ∩ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠))) = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
39	37, 38	sylib 221	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑊 ∩ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠))) = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
40	33, 39	eqtr3d 2799	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → {𝑥 ∈ 𝑊 ∣ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)} = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
41	13, 40	eqtrid 2809	. . . . 5 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐻 “ (𝑟 × 𝑠)) = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
42		cntop1 23466	. . . . . . . 8 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑈 ∈ Top)
43	42	adantl 487	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ Top)
44	43	adantr 486	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑈 ∈ Top)
45		cnima 23491	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝑟 ∈ 𝑅) → (^◡𝐹 “ 𝑟) ∈ 𝑈)
46	45	ad2ant2r 760	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐹 “ 𝑟) ∈ 𝑈)
47		cnima 23491	. . . . . . 7 ⊢ ((𝐺 ∈ (𝑈 Cn 𝑆) ∧ 𝑠 ∈ 𝑆) → (^◡𝐺 “ 𝑠) ∈ 𝑈)
48	47	ad2ant2l 759	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐺 “ 𝑠) ∈ 𝑈)
49		inopn 23125	. . . . . 6 ⊢ ((𝑈 ∈ Top ∧ (^◡𝐹 “ 𝑟) ∈ 𝑈 ∧ (^◡𝐺 “ 𝑠) ∈ 𝑈) → ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ∈ 𝑈)
50	44, 46, 48, 49	syl3anc 1398	. . . . 5 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ∈ 𝑈)
51	41, 50	eqeltrd 2862	. . . 4 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
52	51	ralrimivva 3207	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
53		vex 3457	. . . . . 6 ⊢ 𝑟 ∈ V
54		vex 3457	. . . . . 6 ⊢ 𝑠 ∈ V
55	53, 54	xpex 7755	. . . . 5 ⊢ (𝑟 × 𝑠) ∈ V
56	55	rgen2w 3083	. . . 4 ⊢ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V
57		eqid 2762	. . . . 5 ⊢ (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
58		imaeq2 6056	. . . . . 6 ⊢ (𝑧 = (𝑟 × 𝑠) → (^◡𝐻 “ 𝑧) = (^◡𝐻 “ (𝑟 × 𝑠)))
59	58	eleq1d 2847	. . . . 5 ⊢ (𝑧 = (𝑟 × 𝑠) → ((^◡𝐻 “ 𝑧) ∈ 𝑈 ↔ (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
60	57, 59	ralrnmpo 7555	. . . 4 ⊢ (∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V → (∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈 ↔ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
61	56, 60	ax-mp 5	. . 3 ⊢ (∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈 ↔ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
62	52, 61	sylibr 237	. 2 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈)
63	1	toptopon 23143	. . . 4 ⊢ (𝑈 ∈ Top ↔ 𝑈 ∈ (TopOn‘𝑊))
64	43, 63	sylib 221	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ (TopOn‘𝑊))
65		cntop2 23467	. . . 4 ⊢ (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ Top)
66		cntop2 23467	. . . 4 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ Top)
67		eqid 2762	. . . . 5 ⊢ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
68	67	txval 23791	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×_t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
69	65, 66, 68	syl2an 608	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×_t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
70		toptopon2 23144	. . . . 5 ⊢ (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘∪ 𝑅))
71	65, 70	sylib 221	. . . 4 ⊢ (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ (TopOn‘∪ 𝑅))
72		toptopon2 23144	. . . . 5 ⊢ (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘∪ 𝑆))
73	66, 72	sylib 221	. . . 4 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ (TopOn‘∪ 𝑆))
74		txtopon 23818	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (𝑅 ×_t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
75	71, 73, 74	syl2an 608	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×_t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
76	64, 69, 75	tgcn 23478	. 2 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝐻 ∈ (𝑈 Cn (𝑅 ×_t 𝑆)) ↔ (𝐻:𝑊⟶(∪ 𝑅 × ∪ 𝑆) ∧ ∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈)))
77	12, 62, 76	mpbir2and 726	1 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻 ∈ (𝑈 Cn (𝑅 ×_t 𝑆)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 {crab 3414 Vcvv 3453 ∩ cin 3901 ⊆ wss 3902 ⟨cop 4593 ∪ cuni 4870 ↦ cmpt 5190 × cxp 5657 ^◡ccnv 5658 dom cdm 5659 ran crn 5660 “ cima 5662 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7416 ∈ cmpo 7418 topGenctg 17526 Topctop 23119 TopOnctopon 23136 Cn ccn 23450 ×_t ctx 23787

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-map 8831 df-topgen 17532 df-top 23120 df-topon 23137 df-bases 23172 df-cn 23453 df-tx 23789

This theorem is used by: uptx 23852 hauseqlcld 23873 txkgen 23879 cnmpt1t 23892 cnmpt2t 23900 txpconn 35798

W3C validator