Theorem txrest 23104

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 2733	. . . . . 6 ⊢ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
2	1	txval 23037	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
3	2	adantr 482	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
4	3	oveq1d 7411	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
5	1	txbasex 23039	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V)
6		xpexg 7724	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → (𝐴 × 𝐵) ∈ V)
7		tgrest 22632	. . . 4 ⊢ ((ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
8	5, 6, 7	syl2an 597	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
9		elrest 17360	. . . . . . . 8 ⊢ ((ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
10	5, 6, 9	syl2an 597	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
11		vex 3479	. . . . . . . . . . 11 ⊢ 𝑟 ∈ V
12	11	inex1 5313	. . . . . . . . . 10 ⊢ (𝑟 ∩ 𝐴) ∈ V
13	12	a1i 11	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑟 ∈ 𝑅) → (𝑟 ∩ 𝐴) ∈ V)
14		elrest 17360	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐴 ∈ 𝑋) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
15	14	ad2ant2r 746	. . . . . . . . 9 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
16		xpeq1 5686	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑢 × 𝑣) = ((𝑟 ∩ 𝐴) × 𝑣))
17	16	eqeq2d 2744	. . . . . . . . . . 11 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑥 = (𝑢 × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
18	17	rexbidv 3179	. . . . . . . . . 10 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
19		vex 3479	. . . . . . . . . . . . 13 ⊢ 𝑠 ∈ V
20	19	inex1 5313	. . . . . . . . . . . 12 ⊢ (𝑠 ∩ 𝐵) ∈ V
21	20	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑠 ∈ 𝑆) → (𝑠 ∩ 𝐵) ∈ V)
22		elrest 17360	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑊 ∧ 𝐵 ∈ 𝑌) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
23	22	ad2ant2l 745	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
24		xpeq2 5693	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → ((𝑟 ∩ 𝐴) × 𝑣) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
25	24	eqeq2d 2744	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
26	25	adantl 483	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑣 = (𝑠 ∩ 𝐵)) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
27	21, 23, 26	rexxfr2d 5405	. . . . . . . . . 10 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
28	18, 27	sylan9bbr 512	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑢 = (𝑟 ∩ 𝐴)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
29	13, 15, 28	rexxfr2d 5405	. . . . . . . 8 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
30	11, 19	xpex 7727	. . . . . . . . . 10 ⊢ (𝑟 × 𝑠) ∈ V
31	30	rgen2w 3067	. . . . . . . . 9 ⊢ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V
32		eqid 2733	. . . . . . . . . 10 ⊢ (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
33		ineq1 4203	. . . . . . . . . . . 12 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)))
34		inxp 5827	. . . . . . . . . . . 12 ⊢ ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))
35	33, 34	eqtrdi 2789	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
36	35	eqeq2d 2744	. . . . . . . . . 10 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
37	32, 36	rexrnmpo 7535	. . . . . . . . 9 ⊢ (∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V → (∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
38	31, 37	ax-mp 5	. . . . . . . 8 ⊢ (∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
39	29, 38	bitr4di 289	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
40	10, 39	bitr4d 282	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)))
41	40	eqabdv 2868	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)})
42		eqid 2733	. . . . . 6 ⊢ (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))
43	42	rnmpo 7529	. . . . 5 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)}
44	41, 43	eqtr4di 2791	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)))
45	44	fveq2d 6885	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
46	4, 8, 45	3eqtr2d 2779	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
47		ovex 7429	. . 3 ⊢ (𝑅 ↾t 𝐴) ∈ V
48		ovex 7429	. . 3 ⊢ (𝑆 ↾t 𝐵) ∈ V
49		eqid 2733	. . . 4 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))
50	49	txval 23037	. . 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 2791	1 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542   ∈ wcel 2107  {cab 2710  ∀wral 3062  ∃wrex 3071  Vcvv 3475   ∩ cin 3945   × cxp 5670  ran crn 5673  ‘cfv 6535  (class class class)co 7396   ∈ cmpo 7398   ↾_t crest 17353  topGenctg 17370   ×_t ctx 23033

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5281  ax-sep 5295  ax-nul 5302  ax-pow 5359  ax-pr 5423  ax-un 7712

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3776  df-csb 3892  df-dif 3949  df-un 3951  df-in 3953  df-ss 3963  df-nul 4321  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4905  df-iun 4995  df-br 5145  df-opab 5207  df-mpt 5228  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6487  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7962  df-2nd 7963  df-rest 17355  df-topgen 17376  df-tx 23035

This theorem is referenced by:  txlly  23109  txnlly  23110  txkgen  23125  cnmpt2res  23150  xkoinjcn  23160  cnmpopc  24413  cnheiborlem  24439  lhop1lem  25499  cxpcn3  26223  raddcn  32840  cvmlift2lem6  34230  cvmlift2lem9  34233  cvmlift2lem12  34236