Theorem txrest 23950

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 2760	. . . . . 6 ⊢ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
2	1	txval 23883	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
3	2	adantr 486	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
4	3	oveq1d 7435	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
5	1	txbasex 23885	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V)
6		xpexg 7764	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → (𝐴 × 𝐵) ∈ V)
7		tgrest 23477	. . . 4 ⊢ ((ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
8	5, 6, 7	syl2an 608	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
9		elrest 17598	. . . . . . . 8 ⊢ ((ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
10	5, 6, 9	syl2an 608	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
11		vex 3454	. . . . . . . . . . 11 ⊢ 𝑟 ∈ V
12	11	inex1 5276	. . . . . . . . . 10 ⊢ (𝑟 ∩ 𝐴) ∈ V
13	12	a1i 11	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑟 ∈ 𝑅) → (𝑟 ∩ 𝐴) ∈ V)
14		elrest 17598	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐴 ∈ 𝑋) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
15	14	ad2ant2r 760	. . . . . . . . 9 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
16		xpeq1 5664	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑢 × 𝑣) = ((𝑟 ∩ 𝐴) × 𝑣))
17	16	eqeq2d 2771	. . . . . . . . . . 11 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑥 = (𝑢 × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
18	17	rexbidv 3186	. . . . . . . . . 10 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
19		vex 3454	. . . . . . . . . . . . 13 ⊢ 𝑠 ∈ V
20	19	inex1 5276	. . . . . . . . . . . 12 ⊢ (𝑠 ∩ 𝐵) ∈ V
21	20	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑠 ∈ 𝑆) → (𝑠 ∩ 𝐵) ∈ V)
22		elrest 17598	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑊 ∧ 𝐵 ∈ 𝑌) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
23	22	ad2ant2l 759	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
24		xpeq2 5671	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → ((𝑟 ∩ 𝐴) × 𝑣) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
25	24	eqeq2d 2771	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
26	25	adantl 487	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑣 = (𝑠 ∩ 𝐵)) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
27	21, 23, 26	rexxfr2d 5372	. . . . . . . . . 10 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
28	18, 27	sylan9bbr 520	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑢 = (𝑟 ∩ 𝐴)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
29	13, 15, 28	rexxfr2d 5372	. . . . . . . 8 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
30	11, 19	xpex 7767	. . . . . . . . . 10 ⊢ (𝑟 × 𝑠) ∈ V
31	30	rgen2w 3081	. . . . . . . . 9 ⊢ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V
32		eqid 2760	. . . . . . . . . 10 ⊢ (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
33		ineq1 4110	. . . . . . . . . . . 12 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)))
34		inxp 5808	. . . . . . . . . . . 12 ⊢ ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))
35	33, 34	eqtrdi 2811	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
36	35	eqeq2d 2771	. . . . . . . . . 10 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
37	32, 36	rexrnmpo 7560	. . . . . . . . 9 ⊢ (∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V → (∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
38	31, 37	ax-mp 5	. . . . . . . 8 ⊢ (∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
39	29, 38	bitr4di 292	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑤 ∈ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
40	10, 39	bitr4d 285	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑥 ∈ (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)))
41	40	eqabdv 2893	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)})
42		eqid 2760	. . . . . 6 ⊢ (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))
43	42	rnmpo 7553	. . . . 5 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)}
44	41, 43	eqtr4di 2813	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)))
45	44	fveq2d 6889	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
46	4, 8, 45	3eqtr2d 2801	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
47		ovex 7453	. . 3 ⊢ (𝑅 ↾t 𝐴) ∈ V
48		ovex 7453	. . 3 ⊢ (𝑆 ↾t 𝐵) ∈ V
49		eqid 2760	. . . 4 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))
50	49	txval 23883	. . 3 ⊢ (((𝑅 ↾t 𝐴) ∈ V ∧ (𝑆 ↾t 𝐵) ∈ V) → ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
51	47, 48, 50	mp2an 705	. 2 ⊢ ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)))
52	46, 51	eqtr4di 2813	1 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅 ↾t 𝐴) ×t (𝑆 ↾t 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∩ cin 4089   × cxp 5648  ran crn 5651  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ↾_t crest 17591  topGenctg 17608   ×_t ctx 23879

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-rest 17593  df-topgen 17614  df-tx 23881

This theorem is used by:  txlly  23955  txnlly  23956  txkgen  23971  cnmpt2res  23996  xkoinjcn  24006  cnmpopc  25249  cnheiborlem  25275  lhop1lem  26333  cxpcn3  27076  raddcn  34561  cvmlift2lem6  36073  cvmlift2lem9  36076  cvmlift2lem12  36079