Theorem tx2cn 23837

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 8014	. . 3 ⊢ (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌
2	1	a1i 11	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌)
3		ffn 6706	. . . . . . . 8 ⊢ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 → (2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
4		elpreima 7054	. . . . . . . 8 ⊢ ((2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) → (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤)))
5	1, 3, 4	mp2b 10	. . . . . . 7 ⊢ (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤))
6		fvres 6901	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → ((2nd ↾ (𝑋 × 𝑌))‘𝑧) = (2nd ‘𝑧))
7	6	eleq1d 2847	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ (2nd ‘𝑧) ∈ 𝑤))
8		1st2nd2 8028	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
9		xp1st 8021	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (1st ‘𝑧) ∈ 𝑋)
10		elxp6 8023	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝑋 × 𝑤) ↔ (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑋 ∧ (2nd ‘𝑧) ∈ 𝑤)))
11		anass 474	. . . . . . . . . . . 12 ⊢ (((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) ∧ (2nd ‘𝑧) ∈ 𝑤) ↔ (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑋 ∧ (2nd ‘𝑧) ∈ 𝑤)))
12	10, 11	bitr4i 281	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (𝑋 × 𝑤) ↔ ((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) ∧ (2nd ‘𝑧) ∈ 𝑤))
13	12	baib 545	. . . . . . . . . 10 ⊢ ((𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ (1st ‘𝑧) ∈ 𝑋) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (2nd ‘𝑧) ∈ 𝑤))
14	8, 9, 13	syl2anc 596	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (2nd ‘𝑧) ∈ 𝑤))
15	7, 14	bitr4d 285	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ 𝑧 ∈ (𝑋 × 𝑤)))
16	15	pm5.32i 585	. . . . . . 7 ⊢ ((𝑧 ∈ (𝑋 × 𝑌) ∧ ((2nd ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤)))
17	5, 16	bitri 278	. . . . . 6 ⊢ (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤)))
18		toponss 23153	. . . . . . . . . 10 ⊢ ((𝑆 ∈ (TopOn‘𝑌) ∧ 𝑤 ∈ 𝑆) → 𝑤 ⊆ 𝑌)
19	18	adantll 727	. . . . . . . . 9 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → 𝑤 ⊆ 𝑌)
20		xpss2 5679	. . . . . . . . 9 ⊢ (𝑤 ⊆ 𝑌 → (𝑋 × 𝑤) ⊆ (𝑋 × 𝑌))
21	19, 20	syl 18	. . . . . . . 8 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑋 × 𝑤) ⊆ (𝑋 × 𝑌))
22	21	sseld 3933	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (𝑋 × 𝑤) → 𝑧 ∈ (𝑋 × 𝑌)))
23	22	pm4.71rd 572	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (𝑋 × 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑋 × 𝑤))))
24	17, 23	bitr4id 293	. . . . 5 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ 𝑧 ∈ (𝑋 × 𝑤)))
25	24	eqrdv 2760	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) = (𝑋 × 𝑤))
26		toponmax 23152	. . . . . 6 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝑅)
27		txopn 23829	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑤 ∈ 𝑆)) → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆))
28	27	expr 462	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑋 ∈ 𝑅) → (𝑤 ∈ 𝑆 → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆)))
29	26, 28	mpidan 702	. . . . 5 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑤 ∈ 𝑆 → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆)))
30	29	imp 412	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (𝑋 × 𝑤) ∈ (𝑅 ×t 𝑆))
31	25, 30	eqeltrd 2862	. . 3 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑆) → (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))
32	31	ralrimiva 3156	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))
33		txtopon 23818	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))
34		iscn 23461	. . 3 ⊢ (((𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆) ↔ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))))
35	33, 34	sylancom 600	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆) ↔ ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑤 ∈ 𝑆 (◡(2nd ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×t 𝑆))))
36	2, 32, 35	mpbir2and 726	1 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078   ⊆ wss 3902  ⟨cop 4593   × cxp 5657  ^◡ccnv 5658   ↾ cres 5661   “ cima 5662   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416  1^st c1st 7987  2^nd c2nd 7988  TopOnctopon 23136   Cn ccn 23450   ×_t ctx 23787

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-map 8831  df-topgen 17532  df-top 23120  df-topon 23137  df-bases 23172  df-cn 23453  df-tx 23789

This theorem is used by:  txcn  23853  txcmpb  23871  txkgen  23879  cnmpt2nd  23896  sxbrsiga  34788  txsconnlem  35806  txsconn  35807  hausgraph  44033