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

Theorem cnpval 13365
Description: The set of all functions from topology 𝐽 to topology 𝐾 that are continuous at a point 𝑃. (Contributed by NM, 17-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Assertion
Ref Expression
cnpval ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
Distinct variable groups:   𝑥,𝑓,𝑦,𝐽   𝑓,𝐾,𝑥,𝑦   𝑓,𝑋,𝑥,𝑦   𝑃,𝑓,𝑥,𝑦   𝑓,𝑌,𝑥,𝑦

Proof of Theorem cnpval
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 cnpfval 13362 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}))
21fveq1d 5513 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃))
32adantr 276 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃))
4 eqid 2177 . . . 4 (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
5 fveq2 5511 . . . . . . . 8 (𝑣 = 𝑃 → (𝑓𝑣) = (𝑓𝑃))
65eleq1d 2246 . . . . . . 7 (𝑣 = 𝑃 → ((𝑓𝑣) ∈ 𝑦 ↔ (𝑓𝑃) ∈ 𝑦))
7 eleq1 2240 . . . . . . . . 9 (𝑣 = 𝑃 → (𝑣𝑥𝑃𝑥))
87anbi1d 465 . . . . . . . 8 (𝑣 = 𝑃 → ((𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
98rexbidv 2478 . . . . . . 7 (𝑣 = 𝑃 → (∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
106, 9imbi12d 234 . . . . . 6 (𝑣 = 𝑃 → (((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
1110ralbidv 2477 . . . . 5 (𝑣 = 𝑃 → (∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
1211rabbidv 2726 . . . 4 (𝑣 = 𝑃 → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
13 simpr 110 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑃𝑋)
14 fnmap 6649 . . . . . 6 𝑚 Fn (V × V)
15 toponmax 13190 . . . . . . . 8 (𝐾 ∈ (TopOn‘𝑌) → 𝑌𝐾)
1615elexd 2750 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ V)
1716ad2antlr 489 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑌 ∈ V)
18 toponmax 13190 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
1918elexd 2750 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ V)
2019ad2antrr 488 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑋 ∈ V)
21 fnovex 5902 . . . . . 6 (( ↑𝑚 Fn (V × V) ∧ 𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝑌𝑚 𝑋) ∈ V)
2214, 17, 20, 21mp3an2i 1342 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → (𝑌𝑚 𝑋) ∈ V)
23 rabexg 4143 . . . . 5 ((𝑌𝑚 𝑋) ∈ V → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} ∈ V)
2422, 23syl 14 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} ∈ V)
254, 12, 13, 24fvmptd3 5605 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
263, 25eqtrd 2210 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
27263impa 1194 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 978   = wceq 1353  wcel 2148  wral 2455  wrex 2456  {crab 2459  Vcvv 2737  wss 3129  cmpt 4061   × cxp 4621  cima 4626   Fn wfn 5207  cfv 5212  (class class class)co 5869  𝑚 cmap 6642  TopOnctopon 13175   CnP ccnp 13353
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 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533
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 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-map 6644  df-top 13163  df-topon 13176  df-cnp 13356
This theorem is referenced by:  iscnp  13366
  Copyright terms: Public domain W3C validator