Theorem txrest 22236

Description: The subspace of a topological product space induced by a subset with a Cartesian product representation is a topological product of the subspaces induced by the subspaces of the terms of the products. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 2-Sep-2015.)

Assertion

Ref	Expression
txrest	⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)))

Proof of Theorem txrest

Dummy variables 𝑠 𝑟 𝑢 𝑣 𝑥 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2798	. . . . . 6 ⊢ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
2	1	txval 22169	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
3	2	adantr 484	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
4	3	oveq1d 7150	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
5	1	txbasex 22171	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V)
6		xpexg 7453	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → (𝐴 × 𝐵) ∈ V)
7		tgrest 21764	. . . 4 ⊢ ((ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
8	5, 6, 7	syl2an 598	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
9		elrest 16693	. . . . . . . 8 ⊢ ((ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
10	5, 6, 9	syl2an 598	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
11		vex 3444	. . . . . . . . . . 11 ⊢ 𝑟 ∈ V
12	11	inex1 5185	. . . . . . . . . 10 ⊢ (𝑟 ∩ 𝐴) ∈ V
13	12	a1i 11	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑟 ∈ 𝑅) → (𝑟 ∩ 𝐴) ∈ V)
14		elrest 16693	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐴 ∈ 𝑋) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
15	14	ad2ant2r 746	. . . . . . . . 9 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
16		xpeq1 5533	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑢 × 𝑣) = ((𝑟 ∩ 𝐴) × 𝑣))
17	16	eqeq2d 2809	. . . . . . . . . . 11 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑥 = (𝑢 × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
18	17	rexbidv 3256	. . . . . . . . . 10 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
19		vex 3444	. . . . . . . . . . . . 13 ⊢ 𝑠 ∈ V
20	19	inex1 5185	. . . . . . . . . . . 12 ⊢ (𝑠 ∩ 𝐵) ∈ V
21	20	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑠 ∈ 𝑆) → (𝑠 ∩ 𝐵) ∈ V)
22		elrest 16693	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑊 ∧ 𝐵 ∈ 𝑌) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
23	22	ad2ant2l 745	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
24		xpeq2 5540	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → ((𝑟 ∩ 𝐴) × 𝑣) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
25	24	eqeq2d 2809	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
26	25	adantl 485	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑣 = (𝑠 ∩ 𝐵)) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
27	21, 23, 26	rexxfr2d 5277	. . . . . . . . . 10 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
28	18, 27	sylan9bbr 514	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑢 = (𝑟 ∩ 𝐴)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
29	13, 15, 28	rexxfr2d 5277	. . . . . . . 8 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
30	11, 19	xpex 7456	. . . . . . . . . 10 ⊢ (𝑟 × 𝑠) ∈ V
31	30	rgen2w 3119	. . . . . . . . 9 ⊢ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V
32		eqid 2798	. . . . . . . . . 10 ⊢ (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
33		ineq1 4131	. . . . . . . . . . . 12 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)))
34		inxp 5667	. . . . . . . . . . . 12 ⊢ ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))
35	33, 34	eqtrdi 2849	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
36	35	eqeq2d 2809	. . . . . . . . . 10 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
37	32, 36	rexrnmpo 7269	. . . . . . . . 9 ⊢ (∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V → (∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
38	31, 37	ax-mp 5	. . . . . . . 8 ⊢ (∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
39	29, 38	syl6bbr 292	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
40	10, 39	bitr4d 285	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)))
41	40	abbi2dv 2927	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)})
42		eqid 2798	. . . . . 6 ⊢ (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))
43	42	rnmpo 7263	. . . . 5 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)}
44	41, 43	eqtr4di 2851	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)))
45	44	fveq2d 6649	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
46	4, 8, 45	3eqtr2d 2839	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
47		ovex 7168	. . 3 ⊢ (𝑅 ↾t 𝐴) ∈ V
48		ovex 7168	. . 3 ⊢ (𝑆 ↾t 𝐵) ∈ V
49		eqid 2798	. . . 4 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))
50	49	txval 22169	. . 3 ⊢ (((𝑅 ↾t 𝐴) ∈ V ∧ (𝑆 ↾t 𝐵) ∈ V) → ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
51	47, 48, 50	mp2an 691	. 2 ⊢ ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)))
52	46, 51	eqtr4di 2851	1 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  {cab 2776  ∀wral 3106  ∃wrex 3107  Vcvv 3441   ∩ cin 3880   × cxp 5517  ran crn 5520  ‘cfv 6324  (class class class)co 7135   ∈ cmpo 7137   ↾_t crest 16686  topGenctg 16703   ×_t ctx 22165

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-rest 16688  df-topgen 16709  df-tx 22167

This theorem is referenced by:  txlly  22241  txnlly  22242  txkgen  22257  cnmpt2res  22282  xkoinjcn  22292  cnmpopc  23533  cnheiborlem  23559  lhop1lem  24616  cxpcn3  25337  raddcn  31282  cvmlift2lem6  32668  cvmlift2lem9  32671  cvmlift2lem12  32674