MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xkouni Structured version   Visualization version   GIF version

Theorem xkouni 21402
Description: The base set of the compact-open topology. (Contributed by Mario Carneiro, 19-Mar-2015.)
Hypothesis
Ref Expression
xkouni.1 𝐽 = (𝑆 ^ko 𝑅)
Assertion
Ref Expression
xkouni ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = 𝐽)

Proof of Theorem xkouni
Dummy variables 𝑓 𝑘 𝑣 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ima0 5481 . . . . . . . . 9 (𝑓 “ ∅) = ∅
2 0ss 3972 . . . . . . . . 9 ∅ ⊆ 𝑆
31, 2eqsstri 3635 . . . . . . . 8 (𝑓 “ ∅) ⊆ 𝑆
43a1i 11 . . . . . . 7 (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ 𝑓 ∈ (𝑅 Cn 𝑆)) → (𝑓 “ ∅) ⊆ 𝑆)
54ralrimiva 2966 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∀𝑓 ∈ (𝑅 Cn 𝑆)(𝑓 “ ∅) ⊆ 𝑆)
6 rabid2 3118 . . . . . 6 ((𝑅 Cn 𝑆) = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ 𝑆} ↔ ∀𝑓 ∈ (𝑅 Cn 𝑆)(𝑓 “ ∅) ⊆ 𝑆)
75, 6sylibr 224 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ 𝑆})
8 eqid 2622 . . . . . 6 𝑅 = 𝑅
9 simpl 473 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑅 ∈ Top)
10 simpr 477 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑆 ∈ Top)
11 0ss 3972 . . . . . . 7 ∅ ⊆ 𝑅
1211a1i 11 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∅ ⊆ 𝑅)
13 rest0 20973 . . . . . . . 8 (𝑅 ∈ Top → (𝑅t ∅) = {∅})
1413adantr 481 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅t ∅) = {∅})
15 0cmp 21197 . . . . . . 7 {∅} ∈ Comp
1614, 15syl6eqel 2709 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅t ∅) ∈ Comp)
17 eqid 2622 . . . . . . . 8 𝑆 = 𝑆
1817topopn 20711 . . . . . . 7 (𝑆 ∈ Top → 𝑆𝑆)
1918adantl 482 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑆𝑆)
208, 9, 10, 12, 16, 19xkoopn 21392 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ 𝑆} ∈ (𝑆 ^ko 𝑅))
217, 20eqeltrd 2701 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ∈ (𝑆 ^ko 𝑅))
22 xkouni.1 . . . 4 𝐽 = (𝑆 ^ko 𝑅)
2321, 22syl6eleqr 2712 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ∈ 𝐽)
24 elssuni 4467 . . 3 ((𝑅 Cn 𝑆) ∈ 𝐽 → (𝑅 Cn 𝑆) ⊆ 𝐽)
2523, 24syl 17 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ⊆ 𝐽)
26 eqid 2622 . . . . . 6 {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp} = {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}
27 eqid 2622 . . . . . 6 (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) = (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})
288, 26, 27xkoval 21390 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ^ko 𝑅) = (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))))
2928unieqd 4446 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ^ko 𝑅) = (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))))
3022unieqi 4445 . . . 4 𝐽 = (𝑆 ^ko 𝑅)
31 ovex 6678 . . . . . . . 8 (𝑅 Cn 𝑆) ∈ V
3231pwex 4848 . . . . . . 7 𝒫 (𝑅 Cn 𝑆) ∈ V
338, 26, 27xkotf 21388 . . . . . . . 8 (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆)
34 frn 6053 . . . . . . . 8 ((𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆))
3533, 34ax-mp 5 . . . . . . 7 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆)
3632, 35ssexi 4803 . . . . . 6 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ∈ V
37 fiuni 8334 . . . . . 6 (ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ∈ V → ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) = (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})))
3836, 37ax-mp 5 . . . . 5 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) = (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))
39 fvex 6201 . . . . . 6 (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})) ∈ V
40 unitg 20771 . . . . . 6 ((fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})) ∈ V → (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))) = (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})))
4139, 40ax-mp 5 . . . . 5 (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))) = (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))
4238, 41eqtr4i 2647 . . . 4 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) = (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})))
4329, 30, 423eqtr4g 2681 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝐽 = ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))
4435a1i 11 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆))
45 sspwuni 4611 . . . 4 (ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆) ↔ ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ (𝑅 Cn 𝑆))
4644, 45sylib 208 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑅 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ (𝑅 Cn 𝑆))
4743, 46eqsstrd 3639 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝐽 ⊆ (𝑅 Cn 𝑆))
4825, 47eqssd 3620 1 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = 𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  wral 2912  {crab 2916  Vcvv 3200  wss 3574  c0 3915  𝒫 cpw 4158  {csn 4177   cuni 4436   × cxp 5112  ran crn 5115  cima 5117  wf 5884  cfv 5888  (class class class)co 6650  cmpt2 6652  ficfi 8316  t crest 16081  topGenctg 16098  Topctop 20698   Cn ccn 21028  Compccmp 21189   ^ko cxko 21364
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-fin 7959  df-fi 8317  df-rest 16083  df-topgen 16104  df-top 20699  df-topon 20716  df-bases 20750  df-cmp 21190  df-xko 21366
This theorem is referenced by:  xkotopon  21403  xkohaus  21456  xkoptsub  21457
  Copyright terms: Public domain W3C validator