Theorem ptunhmeo 21421

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 3176	. . . . . . . 8 ⊢ 𝑥 ∈ V
3		vex 3176	. . . . . . . 8 ⊢ 𝑦 ∈ V
4	2, 3	op1std 7069	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (1st ‘𝑧) = 𝑥)
5	2, 3	op2ndd 7070	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (2nd ‘𝑧) = 𝑦)
6	4, 5	uneq12d 3730	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ((1st ‘𝑧) ∪ (2nd ‘𝑧)) = (𝑥 ∪ 𝑦))
7	6	mpt2mpt 6650	. . . . 5 ⊢ (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1st ‘𝑧) ∪ (2nd ‘𝑧))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝑥 ∪ 𝑦))
8	1, 7	eqtr4i 2635	. . . 4 ⊢ 𝐺 = (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1st ‘𝑧) ∪ (2nd ‘𝑧)))
9		xp1st 7089	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (1st ‘𝑧) ∈ 𝑋)
10	9	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1st ‘𝑧) ∈ 𝑋)
11		ixpeq2 7808	. . . . . . . . . . . . 13 ⊢ (∀𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ (𝐹‘𝑛) → X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛))
12		fvres 6117	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑛) = (𝐹‘𝑛))
13	12	unieqd 4382	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ 𝐴 → ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ (𝐹‘𝑛))
14	11, 13	mprg 2910	. . . . . . . . . . . 12 ⊢ X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)
15		ptunhmeo.c	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
16		ssun1 3738	. . . . . . . . . . . . . . 15 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵)
17		ptunhmeo.u	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐶 = (𝐴 ∪ 𝐵))
18	16, 17	syl5sseqr 3617	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ⊆ 𝐶)
19	15, 18	ssexd 4733	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ V)
20		ptunhmeo.f	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹:𝐶⟶Top)
21	20, 18	fssresd 5984	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹 ↾ 𝐴):𝐴⟶Top)
22		ptunhmeo.k	. . . . . . . . . . . . . 14 ⊢ 𝐾 = (∏t‘(𝐹 ↾ 𝐴))
23	22	ptuni 21207	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ V ∧ (𝐹 ↾ 𝐴):𝐴⟶Top) → X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ 𝐾)
24	19, 21, 23	syl2anc 691	. . . . . . . . . . . 12 ⊢ (𝜑 → X𝑛 ∈ 𝐴 ∪ ((𝐹 ↾ 𝐴)‘𝑛) = ∪ 𝐾)
25	14, 24	syl5eqr 2658	. . . . . . . . . . 11 ⊢ (𝜑 → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = ∪ 𝐾)
26		ptunhmeo.x	. . . . . . . . . . 11 ⊢ 𝑋 = ∪ 𝐾
27	25, 26	syl6eqr 2662	. . . . . . . . . 10 ⊢ (𝜑 → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = 𝑋)
28	27	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = 𝑋)
29	10, 28	eleqtrrd 2691	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1st ‘𝑧) ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛))
30		xp2nd 7090	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (2nd ‘𝑧) ∈ 𝑌)
31	30	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2nd ‘𝑧) ∈ 𝑌)
32	17	eqcomd 2616	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 ∪ 𝐵) = 𝐶)
33		ptunhmeo.i	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)
34		uneqdifeq 4009	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ 𝐶 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐴 ∪ 𝐵) = 𝐶 ↔ (𝐶 ∖ 𝐴) = 𝐵))
35	18, 33, 34	syl2anc 691	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐴 ∪ 𝐵) = 𝐶 ↔ (𝐶 ∖ 𝐴) = 𝐵))
36	32, 35	mpbid 221	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∖ 𝐴) = 𝐵)
37	36	ixpeq1d 7806	. . . . . . . . . . 11 ⊢ (𝜑 → X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) = X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛))
38		ixpeq2 7808	. . . . . . . . . . . . . 14 ⊢ (∀𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ (𝐹‘𝑛) → X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛))
39		fvres 6117	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝑛) = (𝐹‘𝑛))
40	39	unieqd 4382	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝐵 → ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ (𝐹‘𝑛))
41	38, 40	mprg 2910	. . . . . . . . . . . . 13 ⊢ X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛)
42		ssun2 3739	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵)
43	42, 17	syl5sseqr 3617	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ⊆ 𝐶)
44	15, 43	ssexd 4733	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ V)
45	20, 43	fssresd 5984	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐹 ↾ 𝐵):𝐵⟶Top)
46		ptunhmeo.l	. . . . . . . . . . . . . . 15 ⊢ 𝐿 = (∏t‘(𝐹 ↾ 𝐵))
47	46	ptuni 21207	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ V ∧ (𝐹 ↾ 𝐵):𝐵⟶Top) → X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ 𝐿)
48	44, 45, 47	syl2anc 691	. . . . . . . . . . . . 13 ⊢ (𝜑 → X𝑛 ∈ 𝐵 ∪ ((𝐹 ↾ 𝐵)‘𝑛) = ∪ 𝐿)
49	41, 48	syl5eqr 2658	. . . . . . . . . . . 12 ⊢ (𝜑 → X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) = ∪ 𝐿)
50		ptunhmeo.y	. . . . . . . . . . . 12 ⊢ 𝑌 = ∪ 𝐿
51	49, 50	syl6eqr 2662	. . . . . . . . . . 11 ⊢ (𝜑 → X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) = 𝑌)
52	37, 51	eqtrd 2644	. . . . . . . . . 10 ⊢ (𝜑 → X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) = 𝑌)
53	52	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) = 𝑌)
54	31, 53	eleqtrrd 2691	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2nd ‘𝑧) ∈ X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛))
55	18	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → 𝐴 ⊆ 𝐶)
56		undifixp 7830	. . . . . . . 8 ⊢ (((1st ‘𝑧) ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ∧ (2nd ‘𝑧) ∈ X𝑛 ∈ (𝐶 ∖ 𝐴)∪ (𝐹‘𝑛) ∧ 𝐴 ⊆ 𝐶) → ((1st ‘𝑧) ∪ (2nd ‘𝑧)) ∈ X𝑛 ∈ 𝐶 ∪ (𝐹‘𝑛))
57	29, 54, 55, 56	syl3anc 1318	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → ((1st ‘𝑧) ∪ (2nd ‘𝑧)) ∈ X𝑛 ∈ 𝐶 ∪ (𝐹‘𝑛))
58		ixpfn 7800	. . . . . . 7 ⊢ (((1st ‘𝑧) ∪ (2nd ‘𝑧)) ∈ X𝑛 ∈ 𝐶 ∪ (𝐹‘𝑛) → ((1st ‘𝑧) ∪ (2nd ‘𝑧)) Fn 𝐶)
59	57, 58	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → ((1st ‘𝑧) ∪ (2nd ‘𝑧)) Fn 𝐶)
60		dffn5 6151	. . . . . 6 ⊢ (((1st ‘𝑧) ∪ (2nd ‘𝑧)) Fn 𝐶 ↔ ((1st ‘𝑧) ∪ (2nd ‘𝑧)) = (𝑘 ∈ 𝐶 ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)))
61	59, 60	sylib 207	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → ((1st ‘𝑧) ∪ (2nd ‘𝑧)) = (𝑘 ∈ 𝐶 ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)))
62	61	mpteq2dva 4672	. . . 4 ⊢ (𝜑 → (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1st ‘𝑧) ∪ (2nd ‘𝑧))) = (𝑧 ∈ (𝑋 × 𝑌) ↦ (𝑘 ∈ 𝐶 ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘))))
63	8, 62	syl5eq 2656	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ (𝑋 × 𝑌) ↦ (𝑘 ∈ 𝐶 ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘))))
64		ptunhmeo.j	. . . 4 ⊢ 𝐽 = (∏t‘𝐹)
65		pttop 21195	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ (𝐹 ↾ 𝐴):𝐴⟶Top) → (∏t‘(𝐹 ↾ 𝐴)) ∈ Top)
66	19, 21, 65	syl2anc 691	. . . . . . 7 ⊢ (𝜑 → (∏t‘(𝐹 ↾ 𝐴)) ∈ Top)
67	22, 66	syl5eqel 2692	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Top)
68	26	toptopon 20548	. . . . . 6 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑋))
69	67, 68	sylib 207	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑋))
70		pttop 21195	. . . . . . . 8 ⊢ ((𝐵 ∈ V ∧ (𝐹 ↾ 𝐵):𝐵⟶Top) → (∏t‘(𝐹 ↾ 𝐵)) ∈ Top)
71	44, 45, 70	syl2anc 691	. . . . . . 7 ⊢ (𝜑 → (∏t‘(𝐹 ↾ 𝐵)) ∈ Top)
72	46, 71	syl5eqel 2692	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ Top)
73	50	toptopon 20548	. . . . . 6 ⊢ (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘𝑌))
74	72, 73	sylib 207	. . . . 5 ⊢ (𝜑 → 𝐿 ∈ (TopOn‘𝑌))
75		txtopon 21204	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (TopOn‘𝑌)) → (𝐾 ×t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
76	69, 74, 75	syl2anc 691	. . . 4 ⊢ (𝜑 → (𝐾 ×t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
77	17	eleq2d 2673	. . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 𝐶 ↔ 𝑘 ∈ (𝐴 ∪ 𝐵)))
78	77	biimpa 500	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝑘 ∈ (𝐴 ∪ 𝐵))
79		elun 3715	. . . . . 6 ⊢ (𝑘 ∈ (𝐴 ∪ 𝐵) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵))
80	78, 79	sylib 207	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵))
81		ixpfn 7800	. . . . . . . . . . 11 ⊢ ((1st ‘𝑧) ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) → (1st ‘𝑧) Fn 𝐴)
82	29, 81	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1st ‘𝑧) Fn 𝐴)
83	82	adantlr 747	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1st ‘𝑧) Fn 𝐴)
84	51	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) = 𝑌)
85	31, 84	eleqtrrd 2691	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2nd ‘𝑧) ∈ X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛))
86		ixpfn 7800	. . . . . . . . . . 11 ⊢ ((2nd ‘𝑧) ∈ X𝑛 ∈ 𝐵 ∪ (𝐹‘𝑛) → (2nd ‘𝑧) Fn 𝐵)
87	85, 86	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2nd ‘𝑧) Fn 𝐵)
88	87	adantlr 747	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2nd ‘𝑧) Fn 𝐵)
89	33	ad2antrr 758	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (𝐴 ∩ 𝐵) = ∅)
90		simplr 788	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → 𝑘 ∈ 𝐴)
91		fvun1 6179	. . . . . . . . 9 ⊢ (((1st ‘𝑧) Fn 𝐴 ∧ (2nd ‘𝑧) Fn 𝐵 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑘 ∈ 𝐴)) → (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘) = ((1st ‘𝑧)‘𝑘))
92	83, 88, 89, 90, 91	syl112anc 1322	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘) = ((1st ‘𝑧)‘𝑘))
93	92	mpteq2dva 4672	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)) = (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1st ‘𝑧)‘𝑘)))
94	76	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐾 ×t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
95	4	mpt2mpt 6650	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) ↦ (1st ‘𝑧)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑥)
96	69	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐾 ∈ (TopOn‘𝑋))
97	74	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐿 ∈ (TopOn‘𝑌))
98	96, 97	cnmpt1st 21281	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑥) ∈ ((𝐾 ×t 𝐿) Cn 𝐾))
99	95, 98	syl5eqel 2692	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (1st ‘𝑧)) ∈ ((𝐾 ×t 𝐿) Cn 𝐾))
100	19	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐴 ∈ V)
101	21	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐹 ↾ 𝐴):𝐴⟶Top)
102		simpr 476	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴)
103	26, 22	ptpjcn 21224	. . . . . . . . . 10 ⊢ ((𝐴 ∈ V ∧ (𝐹 ↾ 𝐴):𝐴⟶Top ∧ 𝑘 ∈ 𝐴) → (𝑓 ∈ 𝑋 ↦ (𝑓‘𝑘)) ∈ (𝐾 Cn ((𝐹 ↾ 𝐴)‘𝑘)))
104	100, 101, 102, 103	syl3anc 1318	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑓 ∈ 𝑋 ↦ (𝑓‘𝑘)) ∈ (𝐾 Cn ((𝐹 ↾ 𝐴)‘𝑘)))
105		fvres 6117	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑘) = (𝐹‘𝑘))
106	105	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑘) = (𝐹‘𝑘))
107	106	oveq2d 6565	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐾 Cn ((𝐹 ↾ 𝐴)‘𝑘)) = (𝐾 Cn (𝐹‘𝑘)))
108	104, 107	eleqtrd 2690	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑓 ∈ 𝑋 ↦ (𝑓‘𝑘)) ∈ (𝐾 Cn (𝐹‘𝑘)))
109		fveq1 6102	. . . . . . . 8 ⊢ (𝑓 = (1st ‘𝑧) → (𝑓‘𝑘) = ((1st ‘𝑧)‘𝑘))
110	94, 99, 96, 108, 109	cnmpt11 21276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ ((1st ‘𝑧)‘𝑘)) ∈ ((𝐾 ×t 𝐿) Cn (𝐹‘𝑘)))
111	93, 110	eqeltrd 2688	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×t 𝐿) Cn (𝐹‘𝑘)))
112	82	adantlr 747	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (1st ‘𝑧) Fn 𝐴)
113	87	adantlr 747	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (2nd ‘𝑧) Fn 𝐵)
114	33	ad2antrr 758	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (𝐴 ∩ 𝐵) = ∅)
115		simplr 788	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → 𝑘 ∈ 𝐵)
116		fvun2 6180	. . . . . . . . 9 ⊢ (((1st ‘𝑧) Fn 𝐴 ∧ (2nd ‘𝑧) Fn 𝐵 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑘 ∈ 𝐵)) → (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘) = ((2nd ‘𝑧)‘𝑘))
117	112, 113, 114, 115, 116	syl112anc 1322	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐵) ∧ 𝑧 ∈ (𝑋 × 𝑌)) → (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘) = ((2nd ‘𝑧)‘𝑘))
118	117	mpteq2dva 4672	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)) = (𝑧 ∈ (𝑋 × 𝑌) ↦ ((2nd ‘𝑧)‘𝑘)))
119	76	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝐾 ×t 𝐿) ∈ (TopOn‘(𝑋 × 𝑌)))
120	5	mpt2mpt 6650	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) ↦ (2nd ‘𝑧)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑦)
121	69	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐾 ∈ (TopOn‘𝑋))
122	74	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐿 ∈ (TopOn‘𝑌))
123	121, 122	cnmpt2nd 21282	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝑦) ∈ ((𝐾 ×t 𝐿) Cn 𝐿))
124	120, 123	syl5eqel 2692	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (2nd ‘𝑧)) ∈ ((𝐾 ×t 𝐿) Cn 𝐿))
125	44	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐵 ∈ V)
126	45	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝐹 ↾ 𝐵):𝐵⟶Top)
127		simpr 476	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ 𝐵)
128	50, 46	ptpjcn 21224	. . . . . . . . . 10 ⊢ ((𝐵 ∈ V ∧ (𝐹 ↾ 𝐵):𝐵⟶Top ∧ 𝑘 ∈ 𝐵) → (𝑓 ∈ 𝑌 ↦ (𝑓‘𝑘)) ∈ (𝐿 Cn ((𝐹 ↾ 𝐵)‘𝑘)))
129	125, 126, 127, 128	syl3anc 1318	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑓 ∈ 𝑌 ↦ (𝑓‘𝑘)) ∈ (𝐿 Cn ((𝐹 ↾ 𝐵)‘𝑘)))
130		fvres 6117	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝑘) = (𝐹‘𝑘))
131	130	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ((𝐹 ↾ 𝐵)‘𝑘) = (𝐹‘𝑘))
132	131	oveq2d 6565	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝐿 Cn ((𝐹 ↾ 𝐵)‘𝑘)) = (𝐿 Cn (𝐹‘𝑘)))
133	129, 132	eleqtrd 2690	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑓 ∈ 𝑌 ↦ (𝑓‘𝑘)) ∈ (𝐿 Cn (𝐹‘𝑘)))
134		fveq1 6102	. . . . . . . 8 ⊢ (𝑓 = (2nd ‘𝑧) → (𝑓‘𝑘) = ((2nd ‘𝑧)‘𝑘))
135	119, 124, 122, 133, 134	cnmpt11 21276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ ((2nd ‘𝑧)‘𝑘)) ∈ ((𝐾 ×t 𝐿) Cn (𝐹‘𝑘)))
136	118, 135	eqeltrd 2688	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×t 𝐿) Cn (𝐹‘𝑘)))
137	111, 136	jaodan 822	. . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵)) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×t 𝐿) Cn (𝐹‘𝑘)))
138	80, 137	syldan 486	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → (𝑧 ∈ (𝑋 × 𝑌) ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘)) ∈ ((𝐾 ×t 𝐿) Cn (𝐹‘𝑘)))
139	64, 76, 15, 20, 138	ptcn 21240	. . 3 ⊢ (𝜑 → (𝑧 ∈ (𝑋 × 𝑌) ↦ (𝑘 ∈ 𝐶 ↦ (((1st ‘𝑧) ∪ (2nd ‘𝑧))‘𝑘))) ∈ ((𝐾 ×t 𝐿) Cn 𝐽))
140	63, 139	eqeltrd 2688	. 2 ⊢ (𝜑 → 𝐺 ∈ ((𝐾 ×t 𝐿) Cn 𝐽))
141	26, 50, 64, 22, 46, 1, 15, 20, 17, 33	ptuncnv 21420	. . 3 ⊢ (𝜑 → ◡𝐺 = (𝑧 ∈ ∪ 𝐽 ↦ ⟨(𝑧 ↾ 𝐴), (𝑧 ↾ 𝐵)⟩))
142		pttop 21195	. . . . . . 7 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐹:𝐶⟶Top) → (∏t‘𝐹) ∈ Top)
143	15, 20, 142	syl2anc 691	. . . . . 6 ⊢ (𝜑 → (∏t‘𝐹) ∈ Top)
144	64, 143	syl5eqel 2692	. . . . 5 ⊢ (𝜑 → 𝐽 ∈ Top)
145		eqid 2610	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
146	145	toptopon 20548	. . . . 5 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
147	144, 146	sylib 207	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
148	145, 64, 22	ptrescn 21252	. . . . 5 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐹:𝐶⟶Top ∧ 𝐴 ⊆ 𝐶) → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐴)) ∈ (𝐽 Cn 𝐾))
149	15, 20, 18, 148	syl3anc 1318	. . . 4 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐴)) ∈ (𝐽 Cn 𝐾))
150	145, 64, 46	ptrescn 21252	. . . . 5 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐹:𝐶⟶Top ∧ 𝐵 ⊆ 𝐶) → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐵)) ∈ (𝐽 Cn 𝐿))
151	15, 20, 43, 150	syl3anc 1318	. . . 4 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐽 ↦ (𝑧 ↾ 𝐵)) ∈ (𝐽 Cn 𝐿))
152	147, 149, 151	cnmpt1t 21278	. . 3 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐽 ↦ ⟨(𝑧 ↾ 𝐴), (𝑧 ↾ 𝐵)⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
153	141, 152	eqeltrd 2688	. 2 ⊢ (𝜑 → ◡𝐺 ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
154		ishmeo 21372	. 2 ⊢ (𝐺 ∈ ((𝐾 ×t 𝐿)Homeo𝐽) ↔ (𝐺 ∈ ((𝐾 ×t 𝐿) Cn 𝐽) ∧ ◡𝐺 ∈ (𝐽 Cn (𝐾 ×t 𝐿))))
155	140, 153, 154	sylanbrc 695	1 ⊢ (𝜑 → 𝐺 ∈ ((𝐾 ×t 𝐿)Homeo𝐽))

Syntax hints:   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173   ∖ cdif 3537   ∪ cun 3538   ∩ cin 3539   ⊆ wss 3540  ∅c0 3874  ⟨cop 4131  ∪ cuni 4372   ↦ cmpt 4643   × cxp 5036  ^◡ccnv 5037   ↾ cres 5040   Fn wfn 5799  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  1^st c1st 7057  2^nd c2nd 7058  Xcixp 7794  ∏_tcpt 15922  Topctop 20517  TopOnctopon 20518   Cn ccn 20838   ×_t ctx 21173  Homeochmeo 21366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-iin 4458  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-ixp 7795  df-en 7842  df-dom 7843  df-fin 7845  df-fi 8200  df-topgen 15927  df-pt 15928  df-top 20521  df-bases 20522  df-topon 20523  df-cn 20841  df-cnp 20842  df-tx 21175  df-hmeo 21368

This theorem is referenced by:  xpstopnlem1  21422  ptcmpfi  21426