ptunhmeo - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ptunhmeo		Structured version Visualization version GIF version

Theorem ptunhmeo 23304

Description: Define a homeomorphism from a binary product of indexed product topologies to an indexed product topology on the union of the index sets. This is the topological analogue of (𝐴↑𝐵) · (𝐴↑𝐶) = 𝐴↑(𝐵 + 𝐶). (Contributed by Mario Carneiro, 8-Feb-2015.) (Proof shortened by Mario Carneiro, 23-Aug-2015.)

**Hypotheses**
Ref	Expression
ptunhmeo.x	⊢ 𝑋 = ∪ 𝐾
ptunhmeo.y	⊢ 𝑌 = ∪ 𝐿
ptunhmeo.j	⊢ 𝐽 = (∏_t‘𝐹)
ptunhmeo.k	⊢ 𝐾 = (∏_t‘(𝐹 ↾ 𝐴))
ptunhmeo.l	⊢ 𝐿 = (∏_t‘(𝐹 ↾ 𝐵))
ptunhmeo.g	⊢ 𝐺 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝑥 ∪ 𝑦))
ptunhmeo.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
ptunhmeo.f	⊢ (𝜑 → 𝐹:𝐶⟶Top)
ptunhmeo.u	⊢ (𝜑 → 𝐶 = (𝐴 ∪ 𝐵))
ptunhmeo.i	⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)

**Assertion**
Ref	Expression
ptunhmeo	⊢ (𝜑 → 𝐺 ∈ ((𝐾 ×_t 𝐿)Homeo𝐽))

Distinct variable groups: 𝑥,𝑦,𝐴 𝑥,𝐵,𝑦 𝜑,𝑥,𝑦 𝑥,𝐶,𝑦 𝑥,𝐹,𝑦 𝑥,𝐽,𝑦 𝑥,𝐾,𝑦 𝑥,𝐿,𝑦 𝑥,𝑋,𝑦 𝑥,𝑌,𝑦 Allowed substitution hints: 𝐺(𝑥,𝑦) 𝑉(𝑥,𝑦)

Proof of Theorem ptunhmeo Dummy variables 𝑓 𝑘 𝑛 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ptunhmeo.g	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝑥 ∪ 𝑦))
2		vex 3479	. . . . . . . 8 ⊢ 𝑥 ∈ V
3		vex 3479	. . . . . . . 8 ⊢ 𝑦 ∈ V
4	2, 3	op1std 7982	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (1^st ‘𝑧) = 𝑥)
5	2, 3	op2ndd 7983	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (2^nd ‘𝑧) = 𝑦)
6	4, 5	uneq12d 4164	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) = (𝑥 ∪ 𝑦))
7	6	mpompt 7519	. . . . 5 ⊢ (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1^st ‘𝑧) ∪ (2^nd ‘𝑧))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝑥 ∪ 𝑦))
8	1, 7	eqtr4i 2764	. . . 4 ⊢ 𝐺 = (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)))
9		xp1st 8004	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (1^st ‘𝑧) ∈ 𝑋)
10	9	adantl 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1^st ‘𝑧) ∈ 𝑋)
11		ixpeq2 8902	. . . . . . . . . . . . 13 ⊢ (∀𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ (𝐹‘𝑛) → X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛))
12		fvres 6908	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑛) = (𝐹‘𝑛))
13	12	unieqd 4922	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ 𝐴 → ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ (𝐹‘𝑛))
14	11, 13	mprg 3068	. . . . . . . . . . . 12 ⊢ X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)
15		ptunhmeo.c	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
16		ssun1 4172	. . . . . . . . . . . . . . 15 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵)
17		ptunhmeo.u	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐶 = (𝐴 ∪ 𝐵))
18	16, 17	sseqtrrid 4035	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ⊆ 𝐶)
19	15, 18	ssexd 5324	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ V)
20		ptunhmeo.f	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹:𝐶⟶Top)
21	20, 18	fssresd 6756	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹 ↾ 𝐴):𝐴⟶Top)
22		ptunhmeo.k	. . . . . . . . . . . . . 14 ⊢ 𝐾 = (∏_t‘(𝐹 ↾ 𝐴))
23	22	ptuni 23090	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ V ∧ (𝐹 ↾ 𝐴):𝐴⟶Top) → X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ 𝐾)
24	19, 21, 23	syl2anc 585	. . . . . . . . . . . 12 ⊢ (𝜑 → X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ 𝐾)
25	14, 24	eqtr3id 2787	. . . . . . . . . . 11 ⊢ (𝜑 → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = ∪ 𝐾)
26		ptunhmeo.x	. . . . . . . . . . 11 ⊢ 𝑋 = ∪ 𝐾
27	25, 26	eqtr4di 2791	. . . . . . . . . 10 ⊢ (𝜑 → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = 𝑋)
28	27	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = 𝑋)
29	10, 28	eleqtrrd 2837	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1^st ‘𝑧) ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛))
30		xp2nd 8005	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (2^nd ‘𝑧) ∈ 𝑌)
31	30	adantl 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2^nd ‘𝑧) ∈ 𝑌)
32	17	eqcomd 2739	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 ∪ 𝐵) = 𝐶)
33		ptunhmeo.i	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)
34		uneqdifeq 4492	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ 𝐶 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐴 ∪ 𝐵) = 𝐶 ↔ (𝐶 ∖ 𝐴) = 𝐵))
35	18, 33, 34	syl2anc 585	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐴 ∪ 𝐵) = 𝐶 ↔ (𝐶 ∖ 𝐴) = 𝐵))
36	32, 35	mpbid 231	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∖ 𝐴) = 𝐵)
37	36	ixpeq1d 8900	. . . . . . . . . . 11 ⊢ (𝜑 → X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) = X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛))
38		ixpeq2 8902	. . . . . . . . . . . . . 14 ⊢ (∀𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ (𝐹‘𝑛) → X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛))
39		fvres 6908	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝑛) = (𝐹‘𝑛))
40	39	unieqd 4922	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝐵 → ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ (𝐹‘𝑛))
41	38, 40	mprg 3068	. . . . . . . . . . . . 13 ⊢ X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛)
42		ssun2 4173	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵)
43	42, 17	sseqtrrid 4035	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ⊆ 𝐶)
44	15, 43	ssexd 5324	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ V)
45	20, 43	fssresd 6756	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐹 ↾ 𝐵):𝐵⟶Top)
46		ptunhmeo.l	. . . . . . . . . . . . . . 15 ⊢ 𝐿 = (∏_t‘(𝐹 ↾ 𝐵))
47	46	ptuni 23090	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ V ∧ (𝐹 ↾ 𝐵):𝐵⟶Top) → X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ 𝐿)
48	44, 45, 47	syl2anc 585	. . . . . . . . . . . . 13 ⊢ (𝜑 → X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ 𝐿)
49	41, 48	eqtr3id 2787	. . . . . . . . . . . 12 ⊢ (𝜑 → X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) = ∪ 𝐿)
50		ptunhmeo.y	. . . . . . . . . . . 12 ⊢ 𝑌 = ∪ 𝐿
51	49, 50	eqtr4di 2791	. . . . . . . . . . 11 ⊢ (𝜑 → X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) = 𝑌)
52	37, 51	eqtrd 2773	. . . . . . . . . 10 ⊢ (𝜑 → X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) = 𝑌)
53	52	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) = 𝑌)
54	31, 53	eleqtrrd 2837	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2^nd ‘𝑧) ∈ X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛))
55	18	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → 𝐴 ⊆ 𝐶)
56		undifixp 8925	. . . . . . . 8 ⊢ (((1^st ‘𝑧) ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ∧ (2^nd ‘𝑧) ∈ X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) ∧ 𝐴 ⊆ 𝐶) → ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) ∈ X𝑛 ∈ 𝐶 ∪ (𝐹‘𝑛))
57	29, 54, 55, 56	syl3anc 1372	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) ∈ X𝑛 ∈ 𝐶 ∪ (𝐹‘𝑛))
58		ixpfn 8894	. . . . . . 7 ⊢ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) ∈ X𝑛 ∈ 𝐶 ∪ (𝐹‘𝑛) → ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) Fn 𝐶)
59	57, 58	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) Fn 𝐶)
60		dffn5 6948	. . . . . 6 ⊢ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) Fn 𝐶 ↔ ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) = (𝑘 ∈ 𝐶 ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)))
61	59, 60	sylib 217	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → ((1^st ‘𝑧) ∪ (2^nd ‘𝑧)) = (𝑘 ∈ 𝐶 ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)))
62	61	mpteq2dva 5248	. . . 4 ⊢ (𝜑 → (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1^st ‘𝑧) ∪ (2^nd ‘𝑧))) = (𝑧 ∈ (𝑋 × 𝑌) ↦ (𝑘 ∈ 𝐶 ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘))))
63	8, 62	eqtrid 2785	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ (𝑋 × 𝑌) ↦ (𝑘 ∈ 𝐶 ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘))))
64		ptunhmeo.j	. . . 4 ⊢ 𝐽 = (∏_t‘𝐹)
65		pttop 23078	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ (𝐹 ↾ 𝐴):𝐴⟶Top) → (∏_t‘(𝐹 ↾ 𝐴)) ∈ Top)
66	19, 21, 65	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → (∏_t‘(𝐹 ↾ 𝐴)) ∈ Top)
67	22, 66	eqeltrid 2838	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Top)
68	26	toptopon 22411	. . . . . 6 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑋))
69	67, 68	sylib 217	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑋))
70		pttop 23078	. . . . . . . 8 ⊢ ((𝐵 ∈ V ∧ (𝐹 ↾ 𝐵):𝐵⟶Top) → (∏_t‘(𝐹 ↾ 𝐵)) ∈ Top)
71	44, 45, 70	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → (∏_t‘(𝐹 ↾ 𝐵)) ∈ Top)
72	46, 71	eqeltrid 2838	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ Top)
73	50	toptopon 22411	. . . . . 6 ⊢ (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘𝑌))
74	72, 73	sylib 217	. . . . 5 ⊢ (𝜑 → 𝐿 ∈ (TopOn‘𝑌))
75		txtopon 23087	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (TopOn‘𝑌)) → (𝐾 ×_t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
76	69, 74, 75	syl2anc 585	. . . 4 ⊢ (𝜑 → (𝐾 ×_t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
77	17	eleq2d 2820	. . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 𝐶 ↔ 𝑘 ∈ (𝐴 ∪ 𝐵)))
78	77	biimpa 478	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝑘 ∈ (𝐴 ∪ 𝐵))
79		elun 4148	. . . . . 6 ⊢ (𝑘 ∈ (𝐴 ∪ 𝐵) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵))
80	78, 79	sylib 217	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵))
81		ixpfn 8894	. . . . . . . . . . 11 ⊢ ((1^st ‘𝑧) ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) → (1^st ‘𝑧) Fn 𝐴)
82	29, 81	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1^st ‘𝑧) Fn 𝐴)
83	82	adantlr 714	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1^st ‘𝑧) Fn 𝐴)
84	51	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) = 𝑌)
85	31, 84	eleqtrrd 2837	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2^nd ‘𝑧) ∈ X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛))
86		ixpfn 8894	. . . . . . . . . . 11 ⊢ ((2^nd ‘𝑧) ∈ X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) → (2^nd ‘𝑧) Fn 𝐵)
87	85, 86	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2^nd ‘𝑧) Fn 𝐵)
88	87	adantlr 714	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2^nd ‘𝑧) Fn 𝐵)
89	33	ad2antrr 725	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (𝐴 ∩ 𝐵) = ∅)
90		simplr 768	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → 𝑘 ∈ 𝐴)
91		fvun1 6980	. . . . . . . . 9 ⊢ (((1^st ‘𝑧) Fn 𝐴 ∧ (2^nd ‘𝑧) Fn 𝐵 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑘 ∈ 𝐴)) → (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘) = ((1^st ‘𝑧)‘𝑘))
92	83, 88, 89, 90, 91	syl112anc 1375	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘) = ((1^st ‘𝑧)‘𝑘))
93	92	mpteq2dva 5248	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)) = (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1^st ‘𝑧)‘𝑘)))
94	76	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐾 ×_t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
95	4	mpompt 7519	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) ↦ (1^st ‘𝑧)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑥)
96	69	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐾 ∈ (TopOn‘𝑋))
97	74	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐿 ∈ (TopOn‘𝑌))
98	96, 97	cnmpt1st 23164	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑥) ∈ ((𝐾 ×_t 𝐿) Cn 𝐾))
99	95, 98	eqeltrid 2838	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (1^st ‘𝑧)) ∈ ((𝐾 ×_t 𝐿) Cn 𝐾))
100	19	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐴 ∈ V)
101	21	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐹 ↾ 𝐴):𝐴⟶Top)
102		simpr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴)
103	26, 22	ptpjcn 23107	. . . . . . . . . 10 ⊢ ((𝐴 ∈ V ∧ (𝐹 ↾ 𝐴):𝐴⟶Top ∧ 𝑘 ∈ 𝐴) → (𝑓 ∈ 𝑋 ↦ (𝑓‘𝑘)) ∈ (𝐾 Cn ((𝐹 ↾ 𝐴)‘𝑘)))
104	100, 101, 102, 103	syl3anc 1372	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑓 ∈ 𝑋 ↦ (𝑓‘𝑘)) ∈ (𝐾 Cn ((𝐹 ↾ 𝐴)‘𝑘)))
105		fvres 6908	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑘) = (𝐹‘𝑘))
106	105	adantl 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑘) = (𝐹‘𝑘))
107	106	oveq2d 7422	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐾 Cn ((𝐹 ↾ 𝐴)‘𝑘)) = (𝐾 Cn (𝐹‘𝑘)))
108	104, 107	eleqtrd 2836	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑓 ∈ 𝑋 ↦ (𝑓‘𝑘)) ∈ (𝐾 Cn (𝐹‘𝑘)))
109		fveq1 6888	. . . . . . . 8 ⊢ (𝑓 = (1^st ‘𝑧) → (𝑓‘𝑘) = ((1^st ‘𝑧)‘𝑘))
110	94, 99, 96, 108, 109	cnmpt11 23159	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1^st ‘𝑧)‘𝑘)) ∈ ((𝐾 ×_t 𝐿) Cn (𝐹‘𝑘)))
111	93, 110	eqeltrd 2834	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×_t 𝐿) Cn (𝐹‘𝑘)))
112	82	adantlr 714	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1^st ‘𝑧) Fn 𝐴)
113	87	adantlr 714	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2^nd ‘𝑧) Fn 𝐵)
114	33	ad2antrr 725	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (𝐴 ∩ 𝐵) = ∅)
115		simplr 768	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → 𝑘 ∈ 𝐵)
116		fvun2 6981	. . . . . . . . 9 ⊢ (((1^st ‘𝑧) Fn 𝐴 ∧ (2^nd ‘𝑧) Fn 𝐵 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑘 ∈ 𝐵)) → (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘) = ((2^nd ‘𝑧)‘𝑘))
117	112, 113, 114, 115, 116	syl112anc 1375	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘) = ((2^nd ‘𝑧)‘𝑘))
118	117	mpteq2dva 5248	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)) = (𝑧 ∈ (𝑋 × 𝑌) ↦ ((2^nd ‘𝑧)‘𝑘)))
119	76	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝐾 ×_t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
120	5	mpompt 7519	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) ↦ (2^nd ‘𝑧)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑦)
121	69	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐾 ∈ (TopOn‘𝑋))
122	74	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐿 ∈ (TopOn‘𝑌))
123	121, 122	cnmpt2nd 23165	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑦) ∈ ((𝐾 ×_t 𝐿) Cn 𝐿))
124	120, 123	eqeltrid 2838	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (2^nd ‘𝑧)) ∈ ((𝐾 ×_t 𝐿) Cn 𝐿))
125	44	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐵 ∈ V)
126	45	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝐹 ↾ 𝐵):𝐵⟶Top)
127		simpr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ 𝐵)
128	50, 46	ptpjcn 23107	. . . . . . . . . 10 ⊢ ((𝐵 ∈ V ∧ (𝐹 ↾ 𝐵):𝐵⟶Top ∧ 𝑘 ∈ 𝐵) → (𝑓 ∈ 𝑌 ↦ (𝑓‘𝑘)) ∈ (𝐿 Cn ((𝐹 ↾ 𝐵)‘𝑘)))
129	125, 126, 127, 128	syl3anc 1372	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑓 ∈ 𝑌 ↦ (𝑓‘𝑘)) ∈ (𝐿 Cn ((𝐹 ↾ 𝐵)‘𝑘)))
130		fvres 6908	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝑘) = (𝐹‘𝑘))
131	130	adantl 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ((𝐹 ↾ 𝐵)‘𝑘) = (𝐹‘𝑘))
132	131	oveq2d 7422	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝐿 Cn ((𝐹 ↾ 𝐵)‘𝑘)) = (𝐿 Cn (𝐹‘𝑘)))
133	129, 132	eleqtrd 2836	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑓 ∈ 𝑌 ↦ (𝑓‘𝑘)) ∈ (𝐿 Cn (𝐹‘𝑘)))
134		fveq1 6888	. . . . . . . 8 ⊢ (𝑓 = (2^nd ‘𝑧) → (𝑓‘𝑘) = ((2^nd ‘𝑧)‘𝑘))
135	119, 124, 122, 133, 134	cnmpt11 23159	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ ((2^nd ‘𝑧)‘𝑘)) ∈ ((𝐾 ×_t 𝐿) Cn (𝐹‘𝑘)))
136	118, 135	eqeltrd 2834	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×_t 𝐿) Cn (𝐹‘𝑘)))
137	111, 136	jaodan 957	. . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵)) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×_t 𝐿) Cn (𝐹‘𝑘)))
138	80, 137	syldan 592	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×_t 𝐿) Cn (𝐹‘𝑘)))
139	64, 76, 15, 20, 138	ptcn 23123	. . 3 ⊢ (𝜑 → (𝑧 ∈ (𝑋 × 𝑌) ↦ (𝑘 ∈ 𝐶 ↦ (((1^st ‘𝑧) ∪ (2^nd ‘𝑧))‘𝑘))) ∈ ((𝐾 ×_t 𝐿) Cn 𝐽))
140	63, 139	eqeltrd 2834	. 2 ⊢ (𝜑 → 𝐺 ∈ ((𝐾 ×_t 𝐿) Cn 𝐽))
141	26, 50, 64, 22, 46, 1, 15, 20, 17, 33	ptuncnv 23303	. . 3 ⊢ (𝜑 → ^◡𝐺 = (𝑧 ∈ ∪ 𝐽 ↦ ⟨(𝑧 ↾ 𝐴), (𝑧 ↾ 𝐵)⟩))
142		pttop 23078	. . . . . . 7 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐹:𝐶⟶Top) → (∏_t‘𝐹) ∈ Top)
143	15, 20, 142	syl2anc 585	. . . . . 6 ⊢ (𝜑 → (∏_t‘𝐹) ∈ Top)
144	64, 143	eqeltrid 2838	. . . . 5 ⊢ (𝜑 → 𝐽 ∈ Top)
145		eqid 2733	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
146	145	toptopon 22411	. . . . 5 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
147	144, 146	sylib 217	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
148	145, 64, 22	ptrescn 23135	. . . . 5 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐹:𝐶⟶Top ∧ 𝐴 ⊆ 𝐶) → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐴)) ∈ (𝐽 Cn 𝐾))
149	15, 20, 18, 148	syl3anc 1372	. . . 4 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐴)) ∈ (𝐽 Cn 𝐾))
150	145, 64, 46	ptrescn 23135	. . . . 5 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐹:𝐶⟶Top ∧ 𝐵 ⊆ 𝐶) → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐵)) ∈ (𝐽 Cn 𝐿))
151	15, 20, 43, 150	syl3anc 1372	. . . 4 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐵)) ∈ (𝐽 Cn 𝐿))
152	147, 149, 151	cnmpt1t 23161	. . 3 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐽 ↦ ⟨(𝑧 ↾ 𝐴), (𝑧 ↾ 𝐵)⟩) ∈ (𝐽 Cn (𝐾 ×_t 𝐿)))
153	141, 152	eqeltrd 2834	. 2 ⊢ (𝜑 → ^◡𝐺 ∈ (𝐽 Cn (𝐾 ×_t 𝐿)))
154		ishmeo 23255	. 2 ⊢ (𝐺 ∈ ((𝐾 ×_t 𝐿)Homeo𝐽) ↔ (𝐺 ∈ ((𝐾 ×_t 𝐿) Cn 𝐽) ∧ ^◡𝐺 ∈ (𝐽 Cn (𝐾 ×_t 𝐿))))
155	140, 153, 154	sylanbrc 584	1 ⊢ (𝜑 → 𝐺 ∈ ((𝐾 ×_t 𝐿)Homeo𝐽))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 Vcvv 3475 ∖ cdif 3945 ∪ cun 3946 ∩ cin 3947 ⊆ wss 3948 ∅c0 4322 ⟨cop 4634 ∪ cuni 4908 ↦ cmpt 5231 × cxp 5674 ^◡ccnv 5675 ↾ cres 5678 Fn wfn 6536 ⟶wf 6537 ‘cfv 6541 (class class class)co 7406 ∈ cmpo 7408 1^st c1st 7970 2^nd c2nd 7971 Xcixp 8888 ∏_tcpt 17381 Topctop 22387 TopOnctopon 22404 Cn ccn 22720 ×_t ctx 23056 Homeochmeo 23249

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 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 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 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-1o 8463 df-er 8700 df-map 8819 df-ixp 8889 df-en 8937 df-dom 8938 df-fin 8940 df-fi 9403 df-topgen 17386 df-pt 17387 df-top 22388 df-topon 22405 df-bases 22441 df-cn 22723 df-cnp 22724 df-tx 23058 df-hmeo 23251

This theorem is referenced by: xpstopnlem1 23305 ptcmpfi 23309

W3C validator