tx1cn - Intuitionistic Logic Explorer

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

Theorem tx1cn 15151

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 6355	. . 3 ⊢ (1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋
2	1	a1i 9	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋)
3		ffn 5510	. . . . . . . 8 ⊢ ((1^st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)⟶𝑋 → (1^st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
4		elpreima 5799	. . . . . . . 8 ⊢ ((1^st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) → (𝑧 ∈ (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤)))
5	1, 3, 4	mp2b 8	. . . . . . 7 ⊢ (𝑧 ∈ (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ ((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤))
6		fvres 5696	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → ((1^st ↾ (𝑋 × 𝑌))‘𝑧) = (1^st ‘𝑧))
7	6	eleq1d 2303	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (((1^st ↾ (𝑋 × 𝑌))‘𝑧) ∈ 𝑤 ↔ (1^st ‘𝑧) ∈ 𝑤))
8		1st2nd2 6371	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
9		xp2nd 6362	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (2^nd ‘𝑧) ∈ 𝑌)
10		elxp6 6365	. . . . . . . . . . . 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 564	. . . . . . . . . . . 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 927	. . . . . . . . . 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 14908	. . . . . . . . . 10 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑤 ∈ 𝑅) → 𝑤 ⊆ 𝑋)
20	19	adantlr 477	. . . . . . . . 9 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → 𝑤 ⊆ 𝑋)
21		xpss1 4862	. . . . . . . . 9 ⊢ (𝑤 ⊆ 𝑋 → (𝑤 × 𝑌) ⊆ (𝑋 × 𝑌))
22	20, 21	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑤 × 𝑌) ⊆ (𝑋 × 𝑌))
23	22	sseld 3239	. . . . . . 7 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑧 ∈ (𝑤 × 𝑌) → 𝑧 ∈ (𝑋 × 𝑌)))
24	23	pm4.71rd 394	. . . . . 6 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑧 ∈ (𝑤 × 𝑌) ↔ (𝑧 ∈ (𝑋 × 𝑌) ∧ 𝑧 ∈ (𝑤 × 𝑌))))
25	18, 24	bitr4id 199	. . . . 5 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (𝑧 ∈ (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ↔ 𝑧 ∈ (𝑤 × 𝑌)))
26	25	eqrdv 2232	. . . 4 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) = (𝑤 × 𝑌))
27		toponmax 14907	. . . . . 6 ⊢ (𝑆 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝑆)
28	27	ad2antlr 489	. . . . 5 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → 𝑌 ∈ 𝑆)
29		txopn 15147	. . . . . 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 2311	. . 3 ⊢ (((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) ∧ 𝑤 ∈ 𝑅) → (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×_t 𝑆))
33	32	ralrimiva 2617	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∀𝑤 ∈ 𝑅 (^◡(1^st ↾ (𝑋 × 𝑌)) “ 𝑤) ∈ (𝑅 ×_t 𝑆))
34		txtopon 15144	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×_t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))
35		simpl 109	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → 𝑅 ∈ (TopOn‘𝑋))
36		iscn 15079	. . 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 953	1 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1^st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×_t 𝑆) Cn 𝑅))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2205 ∀wral 2522 ⊆ wss 3213 ⟨cop 3694 × cxp 4749 ^◡ccnv 4750 ↾ cres 4753 “ cima 4754 Fn wfn 5349 ⟶wf 5350 ‘cfv 5354 (class class class)co 6052 1^st c1st 6334 2^nd c2nd 6335 TopOnctopon 14892 Cn ccn 15067 ×_t ctx 15134

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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661

This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-map 6886 df-topgen 13490 df-top 14880 df-topon 14893 df-bases 14925 df-cn 15070 df-tx 15135

This theorem is referenced by: txcn 15157 cnmpt1st 15170

W3C validator