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

Theorem xkoopn 22192
Description: A basic open set of the compact-open topology. (Contributed by Mario Carneiro, 19-Mar-2015.)
Hypotheses
Ref Expression
xkoopn.x 𝑋 = 𝑅
xkoopn.r (𝜑𝑅 ∈ Top)
xkoopn.s (𝜑𝑆 ∈ Top)
xkoopn.a (𝜑𝐴𝑋)
xkoopn.c (𝜑 → (𝑅t 𝐴) ∈ Comp)
xkoopn.u (𝜑𝑈𝑆)
Assertion
Ref Expression
xkoopn (𝜑 → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} ∈ (𝑆ko 𝑅))
Distinct variable groups:   𝐴,𝑓   𝑅,𝑓   𝑆,𝑓   𝑈,𝑓
Allowed substitution hints:   𝜑(𝑓)   𝑋(𝑓)

Proof of Theorem xkoopn
Dummy variables 𝑘 𝑣 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovex 7173 . . . . . . 7 (𝑅 Cn 𝑆) ∈ V
21pwex 5258 . . . . . 6 𝒫 (𝑅 Cn 𝑆) ∈ V
3 xkoopn.x . . . . . . . 8 𝑋 = 𝑅
4 eqid 2822 . . . . . . . 8 {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}
5 eqid 2822 . . . . . . . 8 (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) = (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})
63, 4, 5xkotf 22188 . . . . . . 7 (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆)
7 frn 6500 . . . . . . 7 ((𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆))
86, 7ax-mp 5 . . . . . 6 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆)
92, 8ssexi 5202 . . . . 5 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ∈ V
10 ssfii 8871 . . . . 5 (ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ∈ V → ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})))
119, 10ax-mp 5 . . . 4 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))
12 fvex 6665 . . . . 5 (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})) ∈ V
13 bastg 21569 . . . . 5 ((fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})) ∈ V → (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})) ⊆ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))))
1412, 13ax-mp 5 . . . 4 (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})) ⊆ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})))
1511, 14sstri 3951 . . 3 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ⊆ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})))
16 oveq2 7148 . . . . . . 7 (𝑥 = 𝐴 → (𝑅t 𝑥) = (𝑅t 𝐴))
1716eleq1d 2898 . . . . . 6 (𝑥 = 𝐴 → ((𝑅t 𝑥) ∈ Comp ↔ (𝑅t 𝐴) ∈ Comp))
18 xkoopn.a . . . . . . 7 (𝜑𝐴𝑋)
19 xkoopn.r . . . . . . . 8 (𝜑𝑅 ∈ Top)
203topopn 21509 . . . . . . . 8 (𝑅 ∈ Top → 𝑋𝑅)
21 elpw2g 5223 . . . . . . . 8 (𝑋𝑅 → (𝐴 ∈ 𝒫 𝑋𝐴𝑋))
2219, 20, 213syl 18 . . . . . . 7 (𝜑 → (𝐴 ∈ 𝒫 𝑋𝐴𝑋))
2318, 22mpbird 260 . . . . . 6 (𝜑𝐴 ∈ 𝒫 𝑋)
24 xkoopn.c . . . . . 6 (𝜑 → (𝑅t 𝐴) ∈ Comp)
2517, 23, 24elrabd 3657 . . . . 5 (𝜑𝐴 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp})
26 xkoopn.u . . . . 5 (𝜑𝑈𝑆)
27 eqidd 2823 . . . . 5 (𝜑 → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈})
28 imaeq2 5903 . . . . . . . . 9 (𝑘 = 𝐴 → (𝑓𝑘) = (𝑓𝐴))
2928sseq1d 3973 . . . . . . . 8 (𝑘 = 𝐴 → ((𝑓𝑘) ⊆ 𝑣 ↔ (𝑓𝐴) ⊆ 𝑣))
3029rabbidv 3455 . . . . . . 7 (𝑘 = 𝐴 → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑣})
3130eqeq2d 2833 . . . . . 6 (𝑘 = 𝐴 → ({𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣} ↔ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑣}))
32 sseq2 3968 . . . . . . . 8 (𝑣 = 𝑈 → ((𝑓𝐴) ⊆ 𝑣 ↔ (𝑓𝐴) ⊆ 𝑈))
3332rabbidv 3455 . . . . . . 7 (𝑣 = 𝑈 → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑣} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈})
3433eqeq2d 2833 . . . . . 6 (𝑣 = 𝑈 → ({𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑣} ↔ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈}))
3531, 34rspc2ev 3610 . . . . 5 ((𝐴 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp} ∧ 𝑈𝑆 ∧ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈}) → ∃𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}∃𝑣𝑆 {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})
3625, 26, 27, 35syl3anc 1368 . . . 4 (𝜑 → ∃𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}∃𝑣𝑆 {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})
371rabex 5211 . . . . 5 {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} ∈ V
38 eqeq1 2826 . . . . . 6 (𝑦 = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} → (𝑦 = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣} ↔ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))
39382rexbidv 3286 . . . . 5 (𝑦 = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} → (∃𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}∃𝑣𝑆 𝑦 = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣} ↔ ∃𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}∃𝑣𝑆 {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))
405rnmpo 7268 . . . . 5 ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) = {𝑦 ∣ ∃𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}∃𝑣𝑆 𝑦 = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}}
4137, 39, 40elab2 3645 . . . 4 ({𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} ∈ ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}) ↔ ∃𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}∃𝑣𝑆 {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣})
4236, 41sylibr 237 . . 3 (𝜑 → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} ∈ ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))
4315, 42sseldi 3940 . 2 (𝜑 → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} ∈ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))))
44 xkoopn.s . . 3 (𝜑𝑆 ∈ Top)
453, 4, 5xkoval 22190 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆ko 𝑅) = (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))))
4619, 44, 45syl2anc 587 . 2 (𝜑 → (𝑆ko 𝑅) = (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑅t 𝑥) ∈ Comp}, 𝑣𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝑘) ⊆ 𝑣}))))
4743, 46eleqtrrd 2917 1 (𝜑 → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓𝐴) ⊆ 𝑈} ∈ (𝑆ko 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1538  wcel 2114  wrex 3131  {crab 3134  Vcvv 3469  wss 3908  𝒫 cpw 4511   cuni 4813   × cxp 5530  ran crn 5533  cima 5535  wf 6330  cfv 6334  (class class class)co 7140  cmpo 7142  ficfi 8862  t crest 16685  topGenctg 16702  Topctop 21496   Cn ccn 21827  Compccmp 21989  ko cxko 22164
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-tp 4544  df-op 4546  df-uni 4814  df-int 4852  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5437  df-eprel 5442  df-po 5451  df-so 5452  df-fr 5491  df-we 5493  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-f1 6339  df-fo 6340  df-f1o 6341  df-fv 6342  df-ov 7143  df-oprab 7144  df-mpo 7145  df-om 7566  df-1st 7675  df-2nd 7676  df-1o 8089  df-en 8497  df-fin 8500  df-fi 8863  df-topgen 16708  df-top 21497  df-xko 22166
This theorem is referenced by:  xkouni  22202  xkohaus  22256  xkoptsub  22257  xkoco1cn  22260  xkoco2cn  22261  xkococnlem  22262
  Copyright terms: Public domain W3C validator