Theorem tx2cn 12811

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 6120	. . 3 ⊢ (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌
2	1	a1i 9	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌)
3		ffn 5331	. . . . . . . 8 ⊢ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 → (2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
4		elpreima 5598	. . . . . . . 8 ⊢ ((2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) → (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤)))
5	1, 3, 4	mp2b 8	. . . . . . 7 ⊢ (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤))
6		fvres 5504	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → ((2nd ↾ (𝑋 × 𝑌))‘𝑧) = (2nd ‘𝑧))
7	6	eleq1d 2233	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ (2nd ‘𝑧) ∈ 𝑤))
8		1st2nd2 6135	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
9		xp1st 6125	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (1st ‘𝑧) ∈ 𝑋)
10		elxp6 6129	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝑋 × 𝑤) ↔ (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑋 ∧ (2nd ‘𝑧) ∈ 𝑤)))
11		anass 399	. . . . . . . . . . . 12 ⊢ (((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) ∧ (2nd ‘𝑧) ∈ 𝑤) ↔ (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑋 ∧ (2nd ‘𝑧) ∈ 𝑤)))
12	10, 11	bitr4i 186	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (𝑋 × 𝑤) ↔ ((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) ∧ (2nd ‘𝑧) ∈ 𝑤))
13	12	baib 909	. . . . . . . . . 10 ⊢ ((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (2nd ‘𝑧) ∈ 𝑤))
14	8, 9, 13	syl2anc 409	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (2nd ‘𝑧) ∈ 𝑤))
15	7, 14	bitr4d 190	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ 𝑧 ∈ (𝑋 × 𝑤)))
16	15	pm5.32i 450	. . . . . . 7 ⊢ ((𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤)))
17	5, 16	bitri 183	. . . . . 6 ⊢ (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤)))
18		toponss 12565	. . . . . . . . . 10 ⊢ ((𝑆 ∈ (TopOn‘𝑌) ∧ 𝑤 ∈ 𝑆) → 𝑤 ⊆ 𝑌)
19	18	adantll 468	. . . . . . . . 9 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → 𝑤 ⊆ 𝑌)
20		xpss2 4709	. . . . . . . . 9 ⊢ (𝑤 ⊆ 𝑌 → (𝑋 × 𝑤) ⊆ (𝑋 × 𝑌))
21	19, 20	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑋 × 𝑤) ⊆ (𝑋 × 𝑌))
22	21	sseld 3136	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (𝑋 × 𝑤) → 𝑧 ∈ (𝑋 × 𝑌)))
23	22	pm4.71rd 392	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤))))
24	17, 23	bitr4id 198	. . . . 5 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ 𝑧 ∈ (𝑋 × 𝑤)))
25	24	eqrdv 2162	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) = (𝑋 × 𝑤))
26		toponmax 12564	. . . . . 6 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝑅)
27		txopn 12806	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑤 ∈ 𝑆)) → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆))
28	27	expr 373	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑋 ∈ 𝑅) → (𝑤 ∈ 𝑆 → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆)))
29	26, 28	mpidan 420	. . . . 5 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑤 ∈ 𝑆 → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆)))
30	29	imp 123	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆))
31	25, 30	eqeltrd 2241	. . 3 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))
32	31	ralrimiva 2537	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))
33		txtopon 12803	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))
34		iscn 12738	. . 3 ⊢ (((𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆) ↔ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))))
35	33, 34	sylancom 417	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆) ↔ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))))
36	2, 32, 35	mpbir2and 933	1 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1342   ∈ wcel 2135  ∀wral 2442   ⊆ wss 3111  ⟨cop 3573   × cxp 4596  ^◡ccnv 4597   ↾ cres 4600   “ cima 4601   Fn wfn 5177  ⟶wf 5178  ‘cfv 5182  (class class class)co 5836  1^st c1st 6098  2^nd c2nd 6099  TopOnctopon 12549   Cn ccn 12726   ×_t ctx 12793

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-coll 4091  ax-sep 4094  ax-pow 4147  ax-pr 4181  ax-un 4405  ax-setind 4508

This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-ral 2447  df-rex 2448  df-reu 2449  df-rab 2451  df-v 2723  df-sbc 2947  df-csb 3041  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-iun 3862  df-br 3977  df-opab 4038  df-mpt 4039  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611  df-iota 5147  df-fun 5184  df-fn 5185  df-f 5186  df-f1 5187  df-fo 5188  df-f1o 5189  df-fv 5190  df-ov 5839  df-oprab 5840  df-mpo 5841  df-1st 6100  df-2nd 6101  df-map 6607  df-topgen 12513  df-top 12537  df-topon 12550  df-bases 12582  df-cn 12729  df-tx 12794

This theorem is referenced by:  txcn  12816  cnmpt2nd  12830