Theorem txdis 12446

Description: The topological product of discrete spaces is discrete. (Contributed by Mario Carneiro, 14-Aug-2015.)

Assertion

Ref	Expression
txdis	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝒫 𝐴 ×t 𝒫 𝐵) = 𝒫 (𝐴 × 𝐵))

Proof of Theorem txdis

Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		distop 12254	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Top)
2		distop 12254	. . . . 5 ⊢ (𝐵 ∈ 𝑊 → 𝒫 𝐵 ∈ Top)
3		unipw 4139	. . . . . . 7 ⊢ ∪ 𝒫 𝐴 = 𝐴
4	3	eqcomi 2143	. . . . . 6 ⊢ 𝐴 = ∪ 𝒫 𝐴
5		unipw 4139	. . . . . . 7 ⊢ ∪ 𝒫 𝐵 = 𝐵
6	5	eqcomi 2143	. . . . . 6 ⊢ 𝐵 = ∪ 𝒫 𝐵
7	4, 6	txuni 12432	. . . . 5 ⊢ ((𝒫 𝐴 ∈ Top ∧ 𝒫 𝐵 ∈ Top) → (𝐴 × 𝐵) = ∪ (𝒫 𝐴 ×t 𝒫 𝐵))
8	1, 2, 7	syl2an 287	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) = ∪ (𝒫 𝐴 ×t 𝒫 𝐵))
9		eqimss2 3152	. . . 4 ⊢ ((𝐴 × 𝐵) = ∪ (𝒫 𝐴 ×t 𝒫 𝐵) → ∪ (𝒫 𝐴 ×t 𝒫 𝐵) ⊆ (𝐴 × 𝐵))
10	8, 9	syl 14	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ (𝒫 𝐴 ×t 𝒫 𝐵) ⊆ (𝐴 × 𝐵))
11		sspwuni 3897	. . 3 ⊢ ((𝒫 𝐴 ×t 𝒫 𝐵) ⊆ 𝒫 (𝐴 × 𝐵) ↔ ∪ (𝒫 𝐴 ×t 𝒫 𝐵) ⊆ (𝐴 × 𝐵))
12	10, 11	sylibr 133	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝒫 𝐴 ×t 𝒫 𝐵) ⊆ 𝒫 (𝐴 × 𝐵))
13		elelpwi 3522	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵)) → 𝑦 ∈ (𝐴 × 𝐵))
14	13	adantl 275	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → 𝑦 ∈ (𝐴 × 𝐵))
15		xp1st 6063	. . . . . . . 8 ⊢ (𝑦 ∈ (𝐴 × 𝐵) → (1st ‘𝑦) ∈ 𝐴)
16		snelpwi 4134	. . . . . . . 8 ⊢ ((1st ‘𝑦) ∈ 𝐴 → {(1st ‘𝑦)} ∈ 𝒫 𝐴)
17	14, 15, 16	3syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → {(1st ‘𝑦)} ∈ 𝒫 𝐴)
18		xp2nd 6064	. . . . . . . 8 ⊢ (𝑦 ∈ (𝐴 × 𝐵) → (2nd ‘𝑦) ∈ 𝐵)
19		snelpwi 4134	. . . . . . . 8 ⊢ ((2nd ‘𝑦) ∈ 𝐵 → {(2nd ‘𝑦)} ∈ 𝒫 𝐵)
20	14, 18, 19	3syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → {(2nd ‘𝑦)} ∈ 𝒫 𝐵)
21		vsnid 3557	. . . . . . . 8 ⊢ 𝑦 ∈ {𝑦}
22		1st2nd2 6073	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝐴 × 𝐵) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
23	14, 22	syl 14	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
24	23	sneqd 3540	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → {𝑦} = {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩})
25	21, 24	eleqtrid 2228	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → 𝑦 ∈ {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩})
26		simprl 520	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → 𝑦 ∈ 𝑥)
27	23, 26	eqeltrrd 2217	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ ∈ 𝑥)
28	27	snssd 3665	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩} ⊆ 𝑥)
29		xpeq1 4553	. . . . . . . . . 10 ⊢ (𝑧 = {(1st ‘𝑦)} → (𝑧 × 𝑤) = ({(1st ‘𝑦)} × 𝑤))
30	29	eleq2d 2209	. . . . . . . . 9 ⊢ (𝑧 = {(1st ‘𝑦)} → (𝑦 ∈ (𝑧 × 𝑤) ↔ 𝑦 ∈ ({(1st ‘𝑦)} × 𝑤)))
31	29	sseq1d 3126	. . . . . . . . 9 ⊢ (𝑧 = {(1st ‘𝑦)} → ((𝑧 × 𝑤) ⊆ 𝑥 ↔ ({(1st ‘𝑦)} × 𝑤) ⊆ 𝑥))
32	30, 31	anbi12d 464	. . . . . . . 8 ⊢ (𝑧 = {(1st ‘𝑦)} → ((𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥) ↔ (𝑦 ∈ ({(1st ‘𝑦)} × 𝑤) ∧ ({(1st ‘𝑦)} × 𝑤) ⊆ 𝑥)))
33		xpeq2 4554	. . . . . . . . . . 11 ⊢ (𝑤 = {(2nd ‘𝑦)} → ({(1st ‘𝑦)} × 𝑤) = ({(1st ‘𝑦)} × {(2nd ‘𝑦)}))
34		1stexg 6065	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ V → (1st ‘𝑦) ∈ V)
35	34	elv 2690	. . . . . . . . . . . 12 ⊢ (1st ‘𝑦) ∈ V
36		2ndexg 6066	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ V → (2nd ‘𝑦) ∈ V)
37	36	elv 2690	. . . . . . . . . . . 12 ⊢ (2nd ‘𝑦) ∈ V
38	35, 37	xpsn 5596	. . . . . . . . . . 11 ⊢ ({(1st ‘𝑦)} × {(2nd ‘𝑦)}) = {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩}
39	33, 38	syl6eq 2188	. . . . . . . . . 10 ⊢ (𝑤 = {(2nd ‘𝑦)} → ({(1st ‘𝑦)} × 𝑤) = {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩})
40	39	eleq2d 2209	. . . . . . . . 9 ⊢ (𝑤 = {(2nd ‘𝑦)} → (𝑦 ∈ ({(1st ‘𝑦)} × 𝑤) ↔ 𝑦 ∈ {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩}))
41	39	sseq1d 3126	. . . . . . . . 9 ⊢ (𝑤 = {(2nd ‘𝑦)} → (({(1st ‘𝑦)} × 𝑤) ⊆ 𝑥 ↔ {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩} ⊆ 𝑥))
42	40, 41	anbi12d 464	. . . . . . . 8 ⊢ (𝑤 = {(2nd ‘𝑦)} → ((𝑦 ∈ ({(1st ‘𝑦)} × 𝑤) ∧ ({(1st ‘𝑦)} × 𝑤) ⊆ 𝑥) ↔ (𝑦 ∈ {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩} ∧ {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩} ⊆ 𝑥)))
43	32, 42	rspc2ev 2804	. . . . . . 7 ⊢ (({(1st ‘𝑦)} ∈ 𝒫 𝐴 ∧ {(2nd ‘𝑦)} ∈ 𝒫 𝐵 ∧ (𝑦 ∈ {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩} ∧ {⟨(1st ‘𝑦), (2nd ‘𝑦)⟩} ⊆ 𝑥)) → ∃𝑧 ∈ 𝒫 𝐴∃𝑤 ∈ 𝒫 𝐵(𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥))
44	17, 20, 25, 28, 43	syl112anc 1220	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 (𝐴 × 𝐵))) → ∃𝑧 ∈ 𝒫 𝐴∃𝑤 ∈ 𝒫 𝐵(𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥))
45	44	expr 372	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝑦 ∈ 𝑥) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) → ∃𝑧 ∈ 𝒫 𝐴∃𝑤 ∈ 𝒫 𝐵(𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)))
46	45	ralrimdva 2512	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) → ∀𝑦 ∈ 𝑥 ∃𝑧 ∈ 𝒫 𝐴∃𝑤 ∈ 𝒫 𝐵(𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)))
47		eltx 12428	. . . . 5 ⊢ ((𝒫 𝐴 ∈ Top ∧ 𝒫 𝐵 ∈ Top) → (𝑥 ∈ (𝒫 𝐴 ×t 𝒫 𝐵) ↔ ∀𝑦 ∈ 𝑥 ∃𝑧 ∈ 𝒫 𝐴∃𝑤 ∈ 𝒫 𝐵(𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)))
48	1, 2, 47	syl2an 287	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ (𝒫 𝐴 ×t 𝒫 𝐵) ↔ ∀𝑦 ∈ 𝑥 ∃𝑧 ∈ 𝒫 𝐴∃𝑤 ∈ 𝒫 𝐵(𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)))
49	46, 48	sylibrd 168	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) → 𝑥 ∈ (𝒫 𝐴 ×t 𝒫 𝐵)))
50	49	ssrdv 3103	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 (𝐴 × 𝐵) ⊆ (𝒫 𝐴 ×t 𝒫 𝐵))
51	12, 50	eqssd 3114	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝒫 𝐴 ×t 𝒫 𝐵) = 𝒫 (𝐴 × 𝐵))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331   ∈ wcel 1480  ∀wral 2416  ∃wrex 2417  Vcvv 2686   ⊆ wss 3071  𝒫 cpw 3510  {csn 3527  ⟨cop 3530  ∪ cuni 3736   × cxp 4537  ‘cfv 5123  (class class class)co 5774  1^st c1st 6036  2^nd c2nd 6037  Topctop 12164   ×_t ctx 12421

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-topgen 12141  df-top 12165  df-topon 12178  df-bases 12210  df-tx 12422

This theorem is referenced by: (None)