Theorem txcmpb 22249

Description: The topological product of two nonempty topologies is compact iff the component topologies are both compact. (Contributed by Mario Carneiro, 14-Sep-2014.)

Hypotheses

Ref	Expression
txcmpb.1	⊢ 𝑋 = ∪ 𝑅
txcmpb.2	⊢ 𝑌 = ∪ 𝑆

Assertion

Ref	Expression
txcmpb	⊢ (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp ↔ (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))

Proof of Theorem txcmpb

Step	Hyp	Ref	Expression
1		simpr 488	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
2		simplrr 777	. . . . . . 7 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑌 ≠ ∅)
3		fo1stres 7697	. . . . . . 7 ⊢ (𝑌 ≠ ∅ → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋)
4	2, 3	syl 17	. . . . . 6 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋)
5		txcmpb.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝑅
6		txcmpb.2	. . . . . . . . 9 ⊢ 𝑌 = ∪ 𝑆
7	5, 6	txuni 22197	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
8	7	ad2antrr 725	. . . . . . 7 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
9		foeq2 6562	. . . . . . 7 ⊢ ((𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆) → ((1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋 ↔ (1st ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑋))
10	8, 9	syl 17	. . . . . 6 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → ((1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋 ↔ (1st ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑋))
11	4, 10	mpbid 235	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑋)
12	5	toptopon 21522	. . . . . . 7 ⊢ (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘𝑋))
13	6	toptopon 21522	. . . . . . 7 ⊢ (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘𝑌))
14		tx1cn 22214	. . . . . . 7 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
15	12, 13, 14	syl2anb 600	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
16	15	ad2antrr 725	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
17	5	cncmp 21997	. . . . 5 ⊢ (((𝑅 ×t 𝑆) ∈ Comp ∧ (1st ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑋 ∧ (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅)) → 𝑅 ∈ Comp)
18	1, 11, 16, 17	syl3anc 1368	. . . 4 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑅 ∈ Comp)
19		simplrl 776	. . . . . . 7 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑋 ≠ ∅)
20		fo2ndres 7698	. . . . . . 7 ⊢ (𝑋 ≠ ∅ → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌)
21	19, 20	syl 17	. . . . . 6 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌)
22		foeq2 6562	. . . . . . 7 ⊢ ((𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆) → ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌 ↔ (2nd ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑌))
23	8, 22	syl 17	. . . . . 6 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌 ↔ (2nd ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑌))
24	21, 23	mpbid 235	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑌)
25		tx2cn 22215	. . . . . . 7 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
26	12, 13, 25	syl2anb 600	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
27	26	ad2antrr 725	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
28	6	cncmp 21997	. . . . 5 ⊢ (((𝑅 ×t 𝑆) ∈ Comp ∧ (2nd ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑌 ∧ (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆)) → 𝑆 ∈ Comp)
29	1, 24, 27, 28	syl3anc 1368	. . . 4 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑆 ∈ Comp)
30	18, 29	jca 515	. . 3 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp))
31	30	ex 416	. 2 ⊢ (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))
32		txcmp 22248	. 2 ⊢ ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
33	31, 32	impbid1 228	1 ⊢ (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp ↔ (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   ≠ wne 2987  ∅c0 4243  ∪ cuni 4800   × cxp 5517   ↾ cres 5521  –onto→wfo 6322  ‘cfv 6324  (class class class)co 7135  1^st c1st 7669  2^nd c2nd 7670  Topctop 21498  TopOnctopon 21515   Cn ccn 21829  Compccmp 21991   ×_t ctx 22165

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-fin 8496  df-topgen 16709  df-top 21499  df-topon 21516  df-bases 21551  df-cn 21832  df-cmp 21992  df-tx 22167

This theorem is referenced by: (None)