Theorem txrest 23897

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 23830	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
3	2	adantr 486	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))))
4	3	oveq1d 7424	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((topGen‘ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
5	1	txbasex 23832	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ∈ V)
6		xpexg 7748	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → (𝐴 × 𝐵) ∈ V)
7		tgrest 23424	. . . 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 17545	. . . . . . . 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 5277	. . . . . . . . . 10 ⊢ (𝑟 ∩ 𝐴) ∈ V
13	12	a1i 11	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑟 ∈ 𝑅) → (𝑟 ∩ 𝐴) ∈ V)
14		elrest 17545	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐴 ∈ 𝑋) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
15	14	ad2ant2r 760	. . . . . . . . 9 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑢 ∈ (𝑅 ↾t 𝐴) ↔ ∃𝑟 ∈ 𝑅 𝑢 = (𝑟 ∩ 𝐴)))
16		xpeq1 5662	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑢 × 𝑣) = ((𝑟 ∩ 𝐴) × 𝑣))
17	16	eqeq2d 2771	. . . . . . . . . . 11 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (𝑥 = (𝑢 × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
18	17	rexbidv 3186	. . . . . . . . . 10 ⊢ (𝑢 = (𝑟 ∩ 𝐴) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣)))
19		vex 3454	. . . . . . . . . . . . 13 ⊢ 𝑠 ∈ V
20	19	inex1 5277	. . . . . . . . . . . 12 ⊢ (𝑠 ∩ 𝐵) ∈ V
21	20	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑠 ∈ 𝑆) → (𝑠 ∩ 𝐵) ∈ V)
22		elrest 17545	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑊 ∧ 𝐵 ∈ 𝑌) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
23	22	ad2ant2l 759	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑣 ∈ (𝑆 ↾t 𝐵) ↔ ∃𝑠 ∈ 𝑆 𝑣 = (𝑠 ∩ 𝐵)))
24		xpeq2 5669	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → ((𝑟 ∩ 𝐴) × 𝑣) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
25	24	eqeq2d 2771	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑠 ∩ 𝐵) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
26	25	adantl 487	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑣 = (𝑠 ∩ 𝐵)) → (𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
27	21, 23, 26	rexxfr2d 5373	. . . . . . . . . 10 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = ((𝑟 ∩ 𝐴) × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
28	18, 27	sylan9bbr 520	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) ∧ 𝑢 = (𝑟 ∩ 𝐴)) → (∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
29	13, 15, 28	rexxfr2d 5373	. . . . . . . 8 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
30	11, 19	xpex 7751	. . . . . . . . . 10 ⊢ (𝑟 × 𝑠) ∈ V
31	30	rgen2w 3081	. . . . . . . . 9 ⊢ ∀𝑟 ∈ 𝑅 ∀𝑠 ∈ 𝑆 (𝑟 × 𝑠) ∈ V
32		eqid 2760	. . . . . . . . . 10 ⊢ (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) = (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠))
33		ineq1 4159	. . . . . . . . . . . 12 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)))
34		inxp 5806	. . . . . . . . . . . 12 ⊢ ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))
35	33, 34	eqtrdi 2811	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵)))
36	35	eqeq2d 2771	. . . . . . . . . 10 ⊢ (𝑤 = (𝑟 × 𝑠) → (𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ 𝑥 = ((𝑟 ∩ 𝐴) × (𝑠 ∩ 𝐵))))
37	32, 36	rexrnmpo 7549	. . . . . . . . 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 7542	. . . . 5 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅 ↾t 𝐴)∃𝑣 ∈ (𝑆 ↾t 𝐵)𝑥 = (𝑢 × 𝑣)}
44	41, 43	eqtr4di 2813	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)))
45	44	fveq2d 6878	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (topGen‘(ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
46	4, 8, 45	3eqtr2d 2801	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))))
47		ovex 7442	. . 3 ⊢ (𝑅 ↾t 𝐴) ∈ V
48		ovex 7442	. . 3 ⊢ (𝑆 ↾t 𝐵) ∈ V
49		eqid 2760	. . . 4 ⊢ ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ (𝑅 ↾t 𝐴), 𝑣 ∈ (𝑆 ↾t 𝐵) ↦ (𝑢 × 𝑣))
50	49	txval 23830	. . 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 1570   ∈ wcel 2145  {cab 2738  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∩ cin 3898   × cxp 5646  ran crn 5649  ‘cfv 6528  (class class class)co 7409   ∈ cmpo 7411   ↾_t crest 17538  topGenctg 17555   ×_t ctx 23826

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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735

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 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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-ov 7412  df-oprab 7413  df-mpo 7414  df-1st 7985  df-2nd 7986  df-rest 17540  df-topgen 17561  df-tx 23828

This theorem is used by:  txlly  23902  txnlly  23903  txkgen  23918  cnmpt2res  23943  xkoinjcn  23953  cnmpopc  25196  cnheiborlem  25222  lhop1lem  26280  cxpcn3  27025  raddcn  34480  cvmlift2lem6  35988  cvmlift2lem9  35991  cvmlift2lem12  35994