txcnmpt - Intuitionistic Logic Explorer

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

Theorem txcnmpt 15374

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 2238	. . . . . . 7 ⊢ ∪ 𝑅 = ∪ 𝑅
3	1, 2	cnf 15305	. . . . . 6 ⊢ (𝐹 ∈ (𝑈 Cn 𝑅) → 𝐹:𝑊⟶∪ 𝑅)
4	3	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐹:𝑊⟶∪ 𝑅)
5	4	ffvelcdmda 5843	. . . 4 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝐹‘𝑥) ∈ ∪ 𝑅)
6		eqid 2238	. . . . . . 7 ⊢ ∪ 𝑆 = ∪ 𝑆
7	1, 6	cnf 15305	. . . . . 6 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝐺:𝑊⟶∪ 𝑆)
8	7	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐺:𝑊⟶∪ 𝑆)
9	8	ffvelcdmda 5843	. . . 4 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝐺‘𝑥) ∈ ∪ 𝑆)
10	5, 9	opelxpd 4807	. . 3 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥 ∈ 𝑊) → ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (∪ 𝑅 × ∪ 𝑆))
11		txcnmpt.2	. . 3 ⊢ 𝐻 = (𝑥 ∈ 𝑊 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩)
12	10, 11	fmptd 5862	. 2 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻:𝑊⟶(∪ 𝑅 × ∪ 𝑆))
13	11	mptpreima 5281	. . . . . 6 ⊢ (^◡𝐻 “ (𝑟 × 𝑠)) = {𝑥 ∈ 𝑊 ∣ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)}
14	4	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐹:𝑊⟶∪ 𝑅)
15	14	adantr 276	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → 𝐹:𝑊⟶∪ 𝑅)
16		ffn 5533	. . . . . . . . . . . 12 ⊢ (𝐹:𝑊⟶∪ 𝑅 → 𝐹 Fn 𝑊)
17		elpreima 5828	. . . . . . . . . . . 12 ⊢ (𝐹 Fn 𝑊 → (𝑥 ∈ (^◡𝐹 “ 𝑟) ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
18	15, 16, 17	3syl 17	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐹 “ 𝑟) ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
19		ibar 301	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑊 → ((𝐹‘𝑥) ∈ 𝑟 ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
20	19	adantl 277	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → ((𝐹‘𝑥) ∈ 𝑟 ↔ (𝑥 ∈ 𝑊 ∧ (𝐹‘𝑥) ∈ 𝑟)))
21	18, 20	bitr4d 191	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐹 “ 𝑟) ↔ (𝐹‘𝑥) ∈ 𝑟))
22	8	ad2antrr 492	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → 𝐺:𝑊⟶∪ 𝑆)
23		ffn 5533	. . . . . . . . . . . 12 ⊢ (𝐺:𝑊⟶∪ 𝑆 → 𝐺 Fn 𝑊)
24		elpreima 5828	. . . . . . . . . . . 12 ⊢ (𝐺 Fn 𝑊 → (𝑥 ∈ (^◡𝐺 “ 𝑠) ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
25	22, 23, 24	3syl 17	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐺 “ 𝑠) ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
26		ibar 301	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑊 → ((𝐺‘𝑥) ∈ 𝑠 ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
27	26	adantl 277	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → ((𝐺‘𝑥) ∈ 𝑠 ↔ (𝑥 ∈ 𝑊 ∧ (𝐺‘𝑥) ∈ 𝑠)))
28	25, 27	bitr4d 191	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ (^◡𝐺 “ 𝑠) ↔ (𝐺‘𝑥) ∈ 𝑠))
29	21, 28	anbi12d 477	. . . . . . . . 9 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → ((𝑥 ∈ (^◡𝐹 “ 𝑟) ∧ 𝑥 ∈ (^◡𝐺 “ 𝑠)) ↔ ((𝐹‘𝑥) ∈ 𝑟 ∧ (𝐺‘𝑥) ∈ 𝑠)))
30		elin 3412	. . . . . . . . 9 ⊢ (𝑥 ∈ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ↔ (𝑥 ∈ (^◡𝐹 “ 𝑟) ∧ 𝑥 ∈ (^◡𝐺 “ 𝑠)))
31		opelxp 4804	. . . . . . . . 9 ⊢ (⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠) ↔ ((𝐹‘𝑥) ∈ 𝑟 ∧ (𝐺‘𝑥) ∈ 𝑠))
32	29, 30, 31	3bitr4g 223	. . . . . . . 8 ⊢ ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑊) → (𝑥 ∈ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ↔ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)))
33	32	rabbi2dva 3439	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑊 ∩ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠))) = {𝑥 ∈ 𝑊 ∣ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)})
34		inss1 3451	. . . . . . . . . 10 ⊢ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ (^◡𝐹 “ 𝑟)
35		cnvimass 5150	. . . . . . . . . 10 ⊢ (^◡𝐹 “ 𝑟) ⊆ dom 𝐹
36	34, 35	sstri 3257	. . . . . . . . 9 ⊢ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ dom 𝐹
37	36, 14	fssdm 5549	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ 𝑊)
38		sseqin2 3450	. . . . . . . 8 ⊢ (((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ⊆ 𝑊 ↔ (𝑊 ∩ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠))) = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
39	37, 38	sylib 122	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑊 ∩ ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠))) = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
40	33, 39	eqtr3d 2273	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → {𝑥 ∈ 𝑊 ∣ ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝑟 × 𝑠)} = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
41	13, 40	eqtrid 2283	. . . . 5 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐻 “ (𝑟 × 𝑠)) = ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)))
42		cntop1 15302	. . . . . . . 8 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑈 ∈ Top)
43	42	adantl 277	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ Top)
44	43	adantr 276	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑈 ∈ Top)
45		cnima 15321	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝑟 ∈ 𝑅) → (^◡𝐹 “ 𝑟) ∈ 𝑈)
46	45	ad2ant2r 513	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐹 “ 𝑟) ∈ 𝑈)
47		cnima 15321	. . . . . . 7 ⊢ ((𝐺 ∈ (𝑈 Cn 𝑆) ∧ 𝑠 ∈ 𝑆) → (^◡𝐺 “ 𝑠) ∈ 𝑈)
48	47	ad2ant2l 512	. . . . . 6 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐺 “ 𝑠) ∈ 𝑈)
49		inopn 15104	. . . . . 6 ⊢ ((𝑈 ∈ Top ∧ (^◡𝐹 “ 𝑟) ∈ 𝑈 ∧ (^◡𝐺 “ 𝑠) ∈ 𝑈) → ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ∈ 𝑈)
50	44, 46, 48, 49	syl3anc 1278	. . . . 5 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((^◡𝐹 “ 𝑟) ∩ (^◡𝐺 “ 𝑠)) ∈ 𝑈)
51	41, 50	eqeltrd 2315	. . . 4 ⊢ (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
52	51	ralrimivva 2632	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
53		vex 2824	. . . . . 6 ⊢ 𝑟 ∈ V
54		vex 2824	. . . . . 6 ⊢ 𝑠 ∈ V
55	53, 54	xpex 4891	. . . . 5 ⊢ (𝑟 × 𝑠) ∈ V
56	55	rgen2w 2606	. . . 4 ⊢ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V
57		eqid 2238	. . . . 5 ⊢ (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
58		imaeq2 5122	. . . . . 6 ⊢ (𝑧 = (𝑟 × 𝑠) → (^◡𝐻 “ 𝑧) = (^◡𝐻 “ (𝑟 × 𝑠)))
59	58	eleq1d 2307	. . . . 5 ⊢ (𝑧 = (𝑟 × 𝑠) → ((^◡𝐻 “ 𝑧) ∈ 𝑈 ↔ (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
60	57, 59	ralrnmpo 6203	. . . 4 ⊢ (∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V → (∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈 ↔ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
61	56, 60	ax-mp 5	. . 3 ⊢ (∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈 ↔ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (^◡𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
62	52, 61	sylibr 134	. 2 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈)
63	1	toptopon 15119	. . . 4 ⊢ (𝑈 ∈ Top ↔ 𝑈 ∈ (TopOn‘𝑊))
64	43, 63	sylib 122	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ (TopOn‘𝑊))
65		cntop2 15303	. . . 4 ⊢ (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ Top)
66		cntop2 15303	. . . 4 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ Top)
67		eqid 2238	. . . . 5 ⊢ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
68	67	txval 15356	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×_t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
69	65, 66, 68	syl2an 289	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×_t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
70		toptopon2 15120	. . . . 5 ⊢ (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘∪ 𝑅))
71	65, 70	sylib 122	. . . 4 ⊢ (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ (TopOn‘∪ 𝑅))
72		toptopon2 15120	. . . . 5 ⊢ (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘∪ 𝑆))
73	66, 72	sylib 122	. . . 4 ⊢ (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ (TopOn‘∪ 𝑆))
74		txtopon 15363	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (𝑅 ×_t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
75	71, 73, 74	syl2an 289	. . 3 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×_t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
76	64, 69, 75	tgcn 15309	. 2 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝐻 ∈ (𝑈 Cn (𝑅 ×_t 𝑆)) ↔ (𝐻:𝑊⟶(∪ 𝑅 × ∪ 𝑆) ∧ ∀𝑧 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))(^◡𝐻 “ 𝑧) ∈ 𝑈)))
77	12, 62, 76	mpbir2and 957	1 ⊢ ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻 ∈ (𝑈 Cn (𝑅 ×_t 𝑆)))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∀wral 2528 {crab 2532 Vcvv 2821 ∩ cin 3219 ⊆ wss 3220 ⟨cop 3712 ∪ cuni 3935 ↦ cmpt 4192 × cxp 4772 ^◡ccnv 4773 dom cdm 4774 ran crn 4775 “ cima 4777 Fn wfn 5372 ⟶wf 5373 ‘cfv 5377 (class class class)co 6085 ∈ cmpo 6087 topGenctg 13608 Topctop 15098 TopOnctopon 15111 Cn ccn 15286 ×_t ctx 15353

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684

This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-map 6924 df-topgen 13614 df-top 15099 df-topon 15112 df-bases 15144 df-cn 15289 df-tx 15354

This theorem is used by: uptx 15375 cnmpt1t 15386 cnmpt2t 15394

W3C validator