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

Theorem xkoval 23933
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 4883 . . . . . . . . . . . 12 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ∪ 𝑟 = ∪ 𝑅)
3 xkoval.x . . . . . . . . . . . 12 𝑋 = ∪ 𝑅
42, 3eqtr4di 2816 . . . . . . . . . . 11 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ∪ 𝑟 = 𝑋)
54pweqd 4577 . . . . . . . . . 10 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → 𝒫 ∪ 𝑟 = 𝒫 𝑋)
61oveq1d 7455 . . . . . . . . . . 11 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑟 ↾t 𝑥) = (𝑅 ↾t 𝑥))
76eleq1d 2849 . . . . . . . . . 10 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ((𝑟 ↾t 𝑥) ∈ Comp ↔ (𝑅 ↾t 𝑥) ∈ Comp))
85, 7rabeqbidv 3433 . . . . . . . . 9 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅 ↾t 𝑥) ∈ Comp})
9 xkoval.k . . . . . . . . 9 𝐾 = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅 ↾t 𝑥) ∈ Comp}
108, 9eqtr4di 2816 . . . . . . . 8 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp} = 𝐾)
11 simpl 488 . . . . . . . 8 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → 𝑠 = 𝑆)
121, 11oveq12d 7458 . . . . . . . . 9 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑟 Cn 𝑠) = (𝑅 Cn 𝑆))
1312rabeqdv 3431 . . . . . . . 8 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})
1410, 11, 13mpoeq123dv 7515 . . . . . . 7 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = (𝑘 ∈ 𝐾, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
15 xkoval.t . . . . . . 7 𝑇 = (𝑘 ∈ 𝐾, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})
1614, 15eqtr4di 2816 . . . . . 6 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = 𝑇)
1716rneqd 5926 . . . . 5 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ran 𝑇)
1817fveq2d 6909 . . . 4 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})) = (fi‘ran 𝑇))
1918fveq2d 6909 . . 3 ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))) = (topGen‘(fi‘ran 𝑇)))
20 df-xko 23909 . . 3 ↑ko = (𝑠 ∈ Top, 𝑟 ∈ Top ↦ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑟 ∣ (𝑟 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑠 ↦ {𝑓 ∈ (𝑟 Cn 𝑠) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))))
21 fvex 6918 . . 3 (topGen‘(fi‘ran 𝑇)) ∈ V
2219, 20, 21ovmpoa 7596 . 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 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900  𝒫 cpw 4560  ∪ cuni 4870  ran crn 5656   “ cima 5658  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442  ficfi 9426   ↾t crest 17617  topGenctg 17634  Topctop 23238   Cn ccn 23569  Compccmp 23731   ↑ko cxko 23907
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-xko 23909
This theorem is used by:  xkotop  23934  xkoopn  23935  xkouni  23945  xkoccn  23965  xkopt  24001  xkoco1cn  24003  xkoco2cn  24004  xkococn  24006  xkoinjcn  24033
  Copyright terms: Public domain W3C validator