Theorem txtopon 15073

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 14825	. . 3 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑅 ∈ Top)
2		topontop 14825	. . 3 ⊢ (𝑆 ∈ (TopOn‘𝑌) → 𝑆 ∈ Top)
3		txtop 15071	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×t 𝑆) ∈ Top)
4	1, 2, 3	syl2an 289	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ Top)
5		eqid 2231	. . . . 5 ⊢ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))
6		eqid 2231	. . . . 5 ⊢ ∪ 𝑅 = ∪ 𝑅
7		eqid 2231	. . . . 5 ⊢ ∪ 𝑆 = ∪ 𝑆
8	5, 6, 7	txuni2 15067	. . . 4 ⊢ (∪ 𝑅 × ∪ 𝑆) = ∪ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))
9		toponuni 14826	. . . . 5 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑅)
10		toponuni 14826	. . . . 5 ⊢ (𝑆 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝑆)
11		xpeq12 4750	. . . . 5 ⊢ ((𝑋 = ∪ 𝑅 ∧ 𝑌 = ∪ 𝑆) → (𝑋 × 𝑌) = (∪ 𝑅 × ∪ 𝑆))
12	9, 10, 11	syl2an 289	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑋 × 𝑌) = (∪ 𝑅 × ∪ 𝑆))
13	5	txbasex 15068	. . . . 5 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)) ∈ V)
14		unitg 14873	. . . . 5 ⊢ (ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)) ∈ V → ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))) = ∪ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)))
15	13, 14	syl 14	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))) = ∪ ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣)))
16	8, 12, 15	3eqtr4a 2290	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑋 × 𝑌) = ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))))
17	5	txval 15066	. . . 4 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))))
18	17	unieqd 3909	. . 3 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → ∪ (𝑅 ×t 𝑆) = ∪ (topGen‘ran (𝑢 ∈ 𝑅, 𝑣 ∈ 𝑆 ↦ (𝑢 × 𝑣))))
19	16, 18	eqtr4d 2267	. 2 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
20		istopon 14824	. 2 ⊢ ((𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)) ↔ ((𝑅 ×t 𝑆) ∈ Top ∧ (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆)))
21	4, 19, 20	sylanbrc 417	1 ⊢ ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(𝑋 × 𝑌)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2202  Vcvv 2803  ∪ cuni 3898   × cxp 4729  ran crn 4732  ‘cfv 5333  (class class class)co 6028   ∈ cmpo 6030  topGenctg 13417  Topctop 14808  TopOnctopon 14821   ×_t ctx 15063

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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-topgen 13423  df-top 14809  df-topon 14822  df-bases 14854  df-tx 15064

This theorem is referenced by:  txuni  15074  tx1cn  15080  tx2cn  15081  txcnp  15082  txcnmpt  15084  txdis1cn  15089  txlm  15090  lmcn2  15091  cnmpt12  15098  cnmpt2c  15101  cnmpt21  15102  cnmpt2t  15104  cnmpt22  15105  cnmpt22f  15106  cnmpt2res  15108  cnmptcom  15109  txmetcn  15330  limccnp2lem  15487  limccnp2cntop  15488  dvcnp2cntop  15510  dvaddxxbr  15512  dvmulxxbr  15513  dvcoapbr  15518