ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnpfval GIF version

Theorem cnpfval 13588
Description: The function mapping the points in a topology 𝐽 to the set of all functions from 𝐽 to topology 𝐾 continuous at that point. (Contributed by NM, 17-Oct-2006.) (Revised by Mario Carneiro, 21-Aug-2015.)
Assertion
Ref Expression
cnpfval ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
Distinct variable groups:   𝑤,𝑓,𝑥,𝐾   𝑓,𝑋,𝑤,𝑥   𝑓,𝑌,𝑤,𝑥   𝑣,𝑓,𝐽,𝑤,𝑥
Allowed substitution hints:   𝐾(𝑣)   𝑋(𝑣)   𝑌(𝑣)

Proof of Theorem cnpfval
Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-cnp 13582 . . 3 CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑤𝑘 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝑗 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
21a1i 9 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑤𝑘 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝑗 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))})))
3 simprl 529 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
43unieqd 3820 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
5 toponuni 13406 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
65ad2antrr 488 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑋 = 𝐽)
74, 6eqtr4d 2213 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝑋)
8 simprr 531 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
98unieqd 3820 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
10 toponuni 13406 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
1110ad2antlr 489 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑌 = 𝐾)
129, 11eqtr4d 2213 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝑌)
1312, 7oveq12d 5892 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → ( 𝑘𝑚 𝑗) = (𝑌𝑚 𝑋))
143rexeqdv 2679 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → (∃𝑣𝑗 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤) ↔ ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤)))
1514imbi2d 230 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → (((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝑗 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤)) ↔ ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))))
168, 15raleqbidv 2684 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → (∀𝑤𝑘 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝑗 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤)) ↔ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))))
1713, 16rabeqbidv 2732 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑤𝑘 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝑗 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))})
187, 17mpteq12dv 4085 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑤𝑘 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝑗 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
19 topontop 13405 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2019adantr 276 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐽 ∈ Top)
21 topontop 13405 . . 3 (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
2221adantl 277 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐾 ∈ Top)
23 fnmap 6654 . . . . . . . 8 𝑚 Fn (V × V)
2423a1i 9 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ↑𝑚 Fn (V × V))
25 toponmax 13416 . . . . . . . . 9 (𝐾 ∈ (TopOn‘𝑌) → 𝑌𝐾)
2625elexd 2750 . . . . . . . 8 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ V)
2726adantl 277 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑌 ∈ V)
28 toponmax 13416 . . . . . . . . 9 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
2928elexd 2750 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ V)
3029adantr 276 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑋 ∈ V)
31 fnovex 5907 . . . . . . 7 (( ↑𝑚 Fn (V × V) ∧ 𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝑌𝑚 𝑋) ∈ V)
3224, 27, 30, 31syl3anc 1238 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑌𝑚 𝑋) ∈ V)
3332adantr 276 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥𝑋) → (𝑌𝑚 𝑋) ∈ V)
34 ssrab2 3240 . . . . . 6 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ⊆ (𝑌𝑚 𝑋)
35 elpw2g 4156 . . . . . 6 ((𝑌𝑚 𝑋) ∈ V → ({𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ 𝒫 (𝑌𝑚 𝑋) ↔ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ⊆ (𝑌𝑚 𝑋)))
3634, 35mpbiri 168 . . . . 5 ((𝑌𝑚 𝑋) ∈ V → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ 𝒫 (𝑌𝑚 𝑋))
3733, 36syl 14 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥𝑋) → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ 𝒫 (𝑌𝑚 𝑋))
3837fmpttd 5671 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}):𝑋⟶𝒫 (𝑌𝑚 𝑋))
3928adantr 276 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑋𝐽)
4032pwexd 4181 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝒫 (𝑌𝑚 𝑋) ∈ V)
41 fex2 5384 . . 3 (((𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}):𝑋⟶𝒫 (𝑌𝑚 𝑋) ∧ 𝑋𝐽 ∧ 𝒫 (𝑌𝑚 𝑋) ∈ V) → (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) ∈ V)
4238, 39, 40, 41syl3anc 1238 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) ∈ V)
432, 18, 20, 22, 42ovmpod 6001 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1353  wcel 2148  wral 2455  wrex 2456  {crab 2459  Vcvv 2737  wss 3129  𝒫 cpw 3575   cuni 3809  cmpt 4064   × cxp 4624  cima 4629   Fn wfn 5211  wf 5212  cfv 5216  (class class class)co 5874  cmpo 5876  𝑚 cmap 6647  Topctop 13388  TopOnctopon 13401   CnP ccnp 13579
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-fv 5224  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1st 6140  df-2nd 6141  df-map 6649  df-top 13389  df-topon 13402  df-cnp 13582
This theorem is referenced by:  cnpval  13591
  Copyright terms: Public domain W3C validator