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

Theorem xkoval 23963
Description: Value of the compact-open topology. (Contributed by Mario Carneiro, 19-Mar-2015.)
Hypotheses
Ref Expression
xkoval.x 𝑋 = ∪ 𝑅
xkoval.k 𝐾 = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅 ↾t 𝑥) ∈ Comp}
xkoval.t 𝑇 = (𝑘 ∈ 𝐾, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})
Assertion
Ref Expression
xkoval ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ↑ko 𝑅) = (topGen‘(fi‘ran 𝑇)))
Distinct variable groups:   𝑣,𝑘,𝐾   𝑓,𝑘,𝑣,𝑥,𝑅   𝑆,𝑓,𝑘,𝑣,𝑥   𝑘,𝑋,𝑥
Allowed substitution hints:   𝑇(𝑥, 𝑣, 𝑓, 𝑘)   𝐾(𝑥, 𝑓)   𝑋(𝑣, 𝑓)

Proof of Theorem xkoval
Dummy variables 𝑠 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 490 . . . . . . . . . . . . 13 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → 𝑟 = 𝑅)
21unieqd 4884 . . . . . . . . . . . 12 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ∪ 𝑟 = ∪ 𝑅)
3 xkoval.x . . . . . . . . . . . 12 𝑋 = ∪ 𝑅
42, 3eqtr4di 2819 . . . . . . . . . . 11 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ∪ 𝑟 = 𝑋)
54pweqd 4576 . . . . . . . . . 10 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → 𝒫 ∪ 𝑟 = 𝒫 𝑋)
61oveq1d 7465 . . . . . . . . . . 11 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑟 ↾t 𝑥) = (𝑅 ↾t 𝑥))
76eleq1d 2852 . . . . . . . . . 10 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ((𝑟 ↾t 𝑥) ∈ Comp ↔ (𝑅 ↾t 𝑥) ∈ Comp))
85, 7rabeqbidv 3432 . . . . . . . . 9 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅 ↾t 𝑥) ∈ Comp})
9 xkoval.k . . . . . . . . 9 𝐾 = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅 ↾t 𝑥) ∈ Comp}
108, 9eqtr4di 2819 . . . . . . . 8 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp} = 𝐾)
11 simpl 488 . . . . . . . 8 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → 𝑠 = 𝑆)
121, 11oveq12d 7468 . . . . . . . . 9 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑟 Cn 𝑠) = (𝑅 Cn 𝑆))
1312rabeqdv 3430 . . . . . . . 8 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})
1410, 11, 13mpoeq123dv 7525 . . . . . . 7 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = (𝑘 ∈ 𝐾, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
15 xkoval.t . . . . . . 7 𝑇 = (𝑘 ∈ 𝐾, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})
1614, 15eqtr4di 2819 . . . . . 6 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = 𝑇)
1716rneqd 5931 . . . . 5 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ran 𝑇)
1817fveq2d 6919 . . . 4 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})) = (fi‘ran 𝑇))
1918fveq2d 6919 . . 3 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))) = (topGen‘(fi‘ran 𝑇)))
20 df-xko 23939 . . 3 ↑ko = (𝑠 ∈ Top, 𝑟 ∈ Top ↦ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))))
21 fvex 6928 . . 3 (topGen‘(fi‘ran 𝑇)) ∈ V
2219, 20, 21ovmpoa 7606 . 2 ((𝑆 ∈ Top ∧ 𝑅 ∈ Top) → (𝑆 ↑ko 𝑅) = (topGen‘(fi‘ran 𝑇)))
2322ancoms 464 1 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ↑ko 𝑅) = (topGen‘(fi‘ran 𝑇)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  {crab 3415   ⊆ wss 3899  𝒫 cpw 4559  ∪ cuni 4871  ran crn 5658   “ cima 5660  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  ficfi 9438   ↾t crest 17643  topGenctg 17660  Topctop 23268   Cn ccn 23599  Compccmp 23761   ↑ko cxko 23937
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-iota 6519  df-fun 6567  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-xko 23939
This theorem is used by:  xkotop  23964  xkoopn  23965  xkouni  23975  xkoccn  23995  xkopt  24031  xkoco1cn  24033  xkoco2cn  24034  xkococn  24036  xkoinjcn  24063
  Copyright terms: Public domain W3C validator