Theorem tx2cn 12275

Description: Continuity of the second projection map of a topological product. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 22-Aug-2015.)

Assertion

Ref	Expression
tx2cn	⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))

Proof of Theorem tx2cn

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f2ndres 6010	. . 3 ⊢ (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌
2	1	a1i 9	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌)
3		toponss 12030	. . . . . . . . . 10 ⊢ ((𝑆 ∈ (TopOn‘𝑌) ∧ 𝑤 ∈ 𝑆) → 𝑤 ⊆ 𝑌)
4	3	adantll 465	. . . . . . . . 9 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → 𝑤 ⊆ 𝑌)
5		xpss2 4608	. . . . . . . . 9 ⊢ (𝑤 ⊆ 𝑌 → (𝑋 × 𝑤) ⊆ (𝑋 × 𝑌))
6	4, 5	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑋 × 𝑤) ⊆ (𝑋 × 𝑌))
7	6	sseld 3060	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (𝑋 × 𝑤) → 𝑧 ∈ (𝑋 × 𝑌)))
8	7	pm4.71rd 389	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤))))
9		ffn 5228	. . . . . . . 8 ⊢ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 → (2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
10		elpreima 5491	. . . . . . . 8 ⊢ ((2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) → (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤)))
11	1, 9, 10	mp2b 8	. . . . . . 7 ⊢ (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤))
12		fvres 5397	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → ((2nd ↾ (𝑋 × 𝑌))‘𝑧) = (2nd ‘𝑧))
13	12	eleq1d 2181	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ (2nd ‘𝑧) ∈ 𝑤))
14		1st2nd2 6025	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
15		xp1st 6015	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (1st ‘𝑧) ∈ 𝑋)
16		elxp6 6019	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝑋 × 𝑤) ↔ (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑋 ∧ (2nd ‘𝑧) ∈ 𝑤)))
17		anass 396	. . . . . . . . . . . 12 ⊢ (((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) ∧ (2nd ‘𝑧) ∈ 𝑤) ↔ (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑋 ∧ (2nd ‘𝑧) ∈ 𝑤)))
18	16, 17	bitr4i 186	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (𝑋 × 𝑤) ↔ ((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) ∧ (2nd ‘𝑧) ∈ 𝑤))
19	18	baib 885	. . . . . . . . . 10 ⊢ ((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (2nd ‘𝑧) ∈ 𝑤))
20	14, 15, 19	syl2anc 406	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (2nd ‘𝑧) ∈ 𝑤))
21	13, 20	bitr4d 190	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ 𝑧 ∈ (𝑋 × 𝑤)))
22	21	pm5.32i 447	. . . . . . 7 ⊢ ((𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤)))
23	11, 22	bitri 183	. . . . . 6 ⊢ (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤)))
24	8, 23	syl6rbbr 198	. . . . 5 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ 𝑧 ∈ (𝑋 × 𝑤)))
25	24	eqrdv 2111	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) = (𝑋 × 𝑤))
26		toponmax 12029	. . . . . 6 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝑅)
27		txopn 12270	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑤 ∈ 𝑆)) → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆))
28	27	expr 370	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑋 ∈ 𝑅) → (𝑤 ∈ 𝑆 → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆)))
29	26, 28	mpidan 417	. . . . 5 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑤 ∈ 𝑆 → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆)))
30	29	imp 123	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆))
31	25, 30	eqeltrd 2189	. . 3 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))
32	31	ralrimiva 2477	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))
33		txtopon 12267	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))
34		iscn 12202	. . 3 ⊢ (((𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆) ↔ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))))
35	33, 34	sylancom 414	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆) ↔ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))))
36	2, 32, 35	mpbir2and 909	1 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1312   ∈ wcel 1461  ∀wral 2388   ⊆ wss 3035  ⟨cop 3494   × cxp 4495  ^◡ccnv 4496   ↾ cres 4499   “ cima 4500   Fn wfn 5074  ⟶wf 5075  ‘cfv 5079  (class class class)co 5726  1^st c1st 5988  2^nd c2nd 5989  TopOnctopon 12014   Cn ccn 12191   ×_t ctx 12257

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-13 1472  ax-14 1473  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-coll 4001  ax-sep 4004  ax-pow 4056  ax-pr 4089  ax-un 4313  ax-setind 4410

This theorem depends on definitions:  df-bi 116  df-3an 945  df-tru 1315  df-fal 1318  df-nf 1418  df-sb 1717  df-eu 1976  df-mo 1977  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ne 2281  df-ral 2393  df-rex 2394  df-reu 2395  df-rab 2397  df-v 2657  df-sbc 2877  df-csb 2970  df-dif 3037  df-un 3039  df-in 3041  df-ss 3048  df-pw 3476  df-sn 3497  df-pr 3498  df-op 3500  df-uni 3701  df-iun 3779  df-br 3894  df-opab 3948  df-mpt 3949  df-id 4173  df-xp 4503  df-rel 4504  df-cnv 4505  df-co 4506  df-dm 4507  df-rn 4508  df-res 4509  df-ima 4510  df-iota 5044  df-fun 5081  df-fn 5082  df-f 5083  df-f1 5084  df-fo 5085  df-f1o 5086  df-fv 5087  df-ov 5729  df-oprab 5730  df-mpo 5731  df-1st 5990  df-2nd 5991  df-map 6496  df-topgen 11978  df-top 12002  df-topon 12015  df-bases 12047  df-cn 12194  df-tx 12258

This theorem is referenced by:  txcn  12280  cnmpt2nd  12294