tx1cn - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > tx1cn		GIF version

Theorem tx1cn 14774

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

**Assertion**
Ref	Expression
tx1cn	⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1^st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×_t 𝑆) Cn 𝑅))

Proof of Theorem tx1cn Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1stres 6247	. . 3 ⊢ (1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋
2	1	a1i 9	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋)
3		ffn 5427	. . . . . . . 8 ⊢ ((1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋 → (1^st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
4		elpreima 5701	. . . . . . . 8 ⊢ ((1^st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) → (𝑧 ∈ (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤)))
5	1, 3, 4	mp2b 8	. . . . . . 7 ⊢ (𝑧 ∈ (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤))
6		fvres 5602	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → ((1^st ↾ (𝑋 × 𝑌))‘𝑧) = (1^st ‘𝑧))
7	6	eleq1d 2274	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ (1^st ‘𝑧) ∈ 𝑤))
8		1st2nd2 6263	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
9		xp2nd 6254	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (2^nd ‘𝑧) ∈ 𝑌)
10		elxp6 6257	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝑤 × 𝑌) ↔ (𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∧ ((1^st ‘𝑧) ∈ 𝑤 ∧ (2^nd ‘𝑧) ∈ 𝑌)))
11		anass 401	. . . . . . . . . . . 12 ⊢ (((𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∧ (1^st ‘𝑧) ∈ 𝑤) ∧ (2^nd ‘𝑧) ∈ 𝑌) ↔ (𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∧ ((1^st ‘𝑧) ∈ 𝑤 ∧ (2^nd ‘𝑧) ∈ 𝑌)))
12		an32 562	. . . . . . . . . . . 12 ⊢ (((𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∧ (1^st ‘𝑧) ∈ 𝑤) ∧ (2^nd ‘𝑧) ∈ 𝑌) ↔ ((𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∧ (2^nd ‘𝑧) ∈ 𝑌) ∧ (1^st ‘𝑧) ∈ 𝑤))
13	10, 11, 12	3bitr2i 208	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (𝑤 × 𝑌) ↔ ((𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∧ (2^nd ‘𝑧) ∈ 𝑌) ∧ (1^st ‘𝑧) ∈ 𝑤))
14	13	baib 921	. . . . . . . . . 10 ⊢ ((𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∧ (2^nd ‘𝑧) ∈ 𝑌) → (𝑧 ∈ (𝑤 × 𝑌) ↔ (1^st ‘𝑧) ∈ 𝑤))
15	8, 9, 14	syl2anc 411	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (𝑧 ∈ (𝑤 × 𝑌) ↔ (1^st ‘𝑧) ∈ 𝑤))
16	7, 15	bitr4d 191	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ 𝑧 ∈ (𝑤 × 𝑌)))
17	16	pm5.32i 454	. . . . . . 7 ⊢ ((𝑧 ∈ (𝑋 × 𝑌) ∧ ((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑤 × 𝑌)))
18	5, 17	bitri 184	. . . . . 6 ⊢ (𝑧 ∈ (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑤 × 𝑌)))
19		toponss 14531	. . . . . . . . . 10 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑤 ∈ 𝑅) → 𝑤 ⊆ 𝑋)
20	19	adantlr 477	. . . . . . . . 9 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → 𝑤 ⊆ 𝑋)
21		xpss1 4786	. . . . . . . . 9 ⊢ (𝑤 ⊆ 𝑋 → (𝑤 × 𝑌) ⊆ (𝑋 × 𝑌))
22	20, 21	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑤 × 𝑌) ⊆ (𝑋 × 𝑌))
23	22	sseld 3192	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑧 ∈ (𝑤 × 𝑌) → 𝑧 ∈ (𝑋 × 𝑌)))
24	23	pm4.71rd 394	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑧 ∈ (𝑤 × 𝑌) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑤 × 𝑌))))
25	18, 24	bitr4id 199	. . . . 5 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑧 ∈ (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ 𝑧 ∈ (𝑤 × 𝑌)))
26	25	eqrdv 2203	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) = (𝑤 × 𝑌))
27		toponmax 14530	. . . . . 6 ⊢ (𝑆 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝑆)
28	27	ad2antlr 489	. . . . 5 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → 𝑌 ∈ 𝑆)
29		txopn 14770	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ (𝑤 ∈ 𝑅 ∧ 𝑌 ∈ 𝑆)) → (𝑤 × 𝑌) ∈ (𝑅 ×_t 𝑆))
30	29	anassrs 400	. . . . 5 ⊢ ((((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) ∧ 𝑌 ∈ 𝑆) → (𝑤 × 𝑌) ∈ (𝑅 ×_t 𝑆))
31	28, 30	mpdan 421	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑤 × 𝑌) ∈ (𝑅 ×_t 𝑆))
32	26, 31	eqeltrd 2282	. . 3 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×_t 𝑆))
33	32	ralrimiva 2579	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∀𝑤 ∈ 𝑅 (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×_t 𝑆))
34		txtopon 14767	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×_t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))
35		simpl 109	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → 𝑅 ∈ (TopOn‘𝑋))
36		iscn 14702	. . 3 ⊢ (((𝑅 ×_t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝑅 ∈ (TopOn‘𝑋)) → ((1^st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×_t 𝑆) Cn 𝑅) ↔ ((1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋 ∧ ∀𝑤 ∈ 𝑅 (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×_t 𝑆))))
37	34, 35, 36	syl2anc 411	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ((1^st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×_t 𝑆) Cn 𝑅) ↔ ((1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋 ∧ ∀𝑤 ∈ 𝑅 (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×_t 𝑆))))
38	2, 33, 37	mpbir2and 947	1 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1^st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×_t 𝑆) Cn 𝑅))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2176 ∀wral 2484 ⊆ wss 3166 ⟨cop 3636 × cxp 4674 ^◡ccnv 4675 ↾ cres 4678 “ cima 4679 Fn wfn 5267 ⟶wf 5268 ‘cfv 5272 (class class class)co 5946 1^st c1st 6226 2^nd c2nd 6227 TopOnctopon 14515 Cn ccn 14690 ×_t ctx 14757

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-coll 4160 ax-sep 4163 ax-pow 4219 ax-pr 4254 ax-un 4481 ax-setind 4586

This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-ral 2489 df-rex 2490 df-reu 2491 df-rab 2493 df-v 2774 df-sbc 2999 df-csb 3094 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-iun 3929 df-br 4046 df-opab 4107 df-mpt 4108 df-id 4341 df-xp 4682 df-rel 4683 df-cnv 4684 df-co 4685 df-dm 4686 df-rn 4687 df-res 4688 df-ima 4689 df-iota 5233 df-fun 5274 df-fn 5275 df-f 5276 df-f1 5277 df-fo 5278 df-f1o 5279 df-fv 5280 df-ov 5949 df-oprab 5950 df-mpo 5951 df-1st 6228 df-2nd 6229 df-map 6739 df-topgen 13125 df-top 14503 df-topon 14516 df-bases 14548 df-cn 14693 df-tx 14758

This theorem is referenced by: txcn 14780 cnmpt1st 14793

W3C validator