Theorem txcmpb 23871

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 490	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
2		simplrr 790	. . . . . . 7 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑌 ≠ ∅)
3		fo1stres 8015	. . . . . . 7 ⊢ (𝑌 ≠ ∅ → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋)
4	2, 3	syl 18	. . . . . 6 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋)
5		txcmpb.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝑅
6		txcmpb.2	. . . . . . . . 9 ⊢ 𝑌 = ∪ 𝑆
7	5, 6	txuni 23819	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
8	7	ad2antrr 739	. . . . . . 7 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
9		foeq2 6790	. . . . . . 7 ⊢ ((𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆) → ((1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋 ↔ (1st ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑋))
10	8, 9	syl 18	. . . . . 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 23143	. . . . . . 7 ⊢ (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘𝑋))
13	6	toptopon 23143	. . . . . . 7 ⊢ (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘𝑌))
14		tx1cn 23836	. . . . . . 7 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
15	12, 13, 14	syl2anb 610	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
16	15	ad2antrr 739	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
17	5	cncmp 23618	. . . . 5 ⊢ (((𝑅 ×t 𝑆) ∈ Comp ∧ (1st ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑋 ∧ (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅)) → 𝑅 ∈ Comp)
18	1, 11, 16, 17	syl3anc 1398	. . . 4 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑅 ∈ Comp)
19		simplrl 789	. . . . . . 7 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑋 ≠ ∅)
20		fo2ndres 8016	. . . . . . 7 ⊢ (𝑋 ≠ ∅ → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌)
21	19, 20	syl 18	. . . . . 6 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌)
22		foeq2 6790	. . . . . . 7 ⊢ ((𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆) → ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌 ↔ (2nd ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑌))
23	8, 22	syl 18	. . . . . 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 23837	. . . . . . 7 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
26	12, 13, 25	syl2anb 610	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
27	26	ad2antrr 739	. . . . 5 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
28	6	cncmp 23618	. . . . 5 ⊢ (((𝑅 ×t 𝑆) ∈ Comp ∧ (2nd ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑌 ∧ (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆)) → 𝑆 ∈ Comp)
29	1, 24, 27, 28	syl3anc 1398	. . . 4 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑆 ∈ Comp)
30	18, 29	jca 521	. . 3 ⊢ ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp))
31	30	ex 418	. 2 ⊢ (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))
32		txcmp 23870	. 2 ⊢ ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
33	31, 32	impbid1 228	1 ⊢ (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp ↔ (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∅c0 4282  ∪ cuni 4870   × cxp 5657   ↾ cres 5661  –onto→wfo 6535  ‘cfv 6537  (class class class)co 7416  1^st c1st 7987  2^nd c2nd 7988  Topctop 23119  TopOnctopon 23136   Cn ccn 23450  Compccmp 23612   ×_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-rep 5236  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-3or 1104  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-reu 3368  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-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  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-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-1o 8458  df-2o 8459  df-map 8831  df-en 8956  df-dom 8957  df-fin 8959  df-topgen 17532  df-top 23120  df-topon 23137  df-bases 23172  df-cn 23453  df-cmp 23613  df-tx 23789

This theorem is used by: (None)