Theorem txtopon 14430

Description: The underlying set of the product of two topologies. (Contributed by Mario Carneiro, 22-Aug-2015.) (Revised by Mario Carneiro, 2-Sep-2015.)

Assertion

Ref	Expression
txtopon	⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))

Proof of Theorem txtopon

Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		topontop 14182	. . 3 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑅 ∈ Top)
2		topontop 14182	. . 3 ⊢ (𝑆 ∈ (TopOn‘𝑌) → 𝑆 ∈ Top)
3		txtop 14428	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×t 𝑆) ∈ Top)
4	1, 2, 3	syl2an 289	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ Top)
5		eqid 2193	. . . . 5 ⊢ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))
6		eqid 2193	. . . . 5 ⊢ ∪ 𝑅 = ∪ 𝑅
7		eqid 2193	. . . . 5 ⊢ ∪ 𝑆 = ∪ 𝑆
8	5, 6, 7	txuni2 14424	. . . 4 ⊢ (∪ 𝑅 × ∪ 𝑆) = ∪ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))
9		toponuni 14183	. . . . 5 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑅)
10		toponuni 14183	. . . . 5 ⊢ (𝑆 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝑆)
11		xpeq12 4678	. . . . 5 ⊢ ((𝑋 = ∪ 𝑅 ∧ 𝑌 = ∪ 𝑆) → (𝑋 × 𝑌) = (∪ 𝑅 × ∪ 𝑆))
12	9, 10, 11	syl2an 289	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑋 × 𝑌) = (∪ 𝑅 × ∪ 𝑆))
13	5	txbasex 14425	. . . . 5 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)) ∈ V)
14		unitg 14230	. . . . 5 ⊢ (ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)) ∈ V → ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))) = ∪ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)))
15	13, 14	syl 14	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))) = ∪ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)))
16	8, 12, 15	3eqtr4a 2252	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑋 × 𝑌) = ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))))
17	5	txval 14423	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))))
18	17	unieqd 3846	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∪ (𝑅 ×t 𝑆) = ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))))
19	16, 18	eqtr4d 2229	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
20		istopon 14181	. 2 ⊢ ((𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)) ↔ ((𝑅 ×t 𝑆) ∈ Top ∧ (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆)))
21	4, 19, 20	sylanbrc 417	1 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2164  Vcvv 2760  ∪ cuni 3835   × cxp 4657  ran crn 4660  ‘cfv 5254  (class class class)co 5918   ∈ cmpo 5920  topGenctg 12865  Topctop 14165  TopOnctopon 14178   ×_t ctx 14420

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-topgen 12871  df-top 14166  df-topon 14179  df-bases 14211  df-tx 14421

This theorem is referenced by:  txuni  14431  tx1cn  14437  tx2cn  14438  txcnp  14439  txcnmpt  14441  txdis1cn  14446  txlm  14447  lmcn2  14448  cnmpt12  14455  cnmpt2c  14458  cnmpt21  14459  cnmpt2t  14461  cnmpt22  14462  cnmpt22f  14463  cnmpt2res  14465  cnmptcom  14466  txmetcn  14687  limccnp2lem  14830  limccnp2cntop  14831  dvcnp2cntop  14848  dvaddxxbr  14850  dvmulxxbr  14851  dvcoapbr  14856