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

Theorem cnfval 15108
Description: The set of all continuous functions from topology 𝐽 to topology 𝐾. (Contributed by NM, 17-Oct-2006.) (Revised by Mario Carneiro, 21-Aug-2015.)
Assertion
Ref Expression
cnfval ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
Distinct variable groups:   𝑦,𝑓,𝐾   𝑓,𝑋,𝑦   𝑓,𝑌,𝑦   𝑓,𝐽,𝑦

Proof of Theorem cnfval
Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-cn 15102 . . 3 Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗})
21a1i 9 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗}))
3 simprr 533 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
43unieqd 3927 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
5 toponuni 14929 . . . . . 6 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 489 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑌 = 𝐾)
74, 6eqtr4d 2270 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝑌)
8 simprl 531 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
98unieqd 3927 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
10 toponuni 14929 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
1110ad2antrr 488 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑋 = 𝐽)
129, 11eqtr4d 2270 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝑋)
137, 12oveq12d 6070 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → ( 𝑘𝑚 𝑗) = (𝑌𝑚 𝑋))
148eleq2d 2304 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → ((𝑓𝑦) ∈ 𝑗 ↔ (𝑓𝑦) ∈ 𝐽))
153, 14raleqbidv 2759 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → (∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗 ↔ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽))
1613, 15rabeqbidv 2810 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
17 topontop 14928 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1817adantr 276 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐽 ∈ Top)
19 topontop 14928 . . 3 (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
2019adantl 277 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐾 ∈ Top)
21 fnmap 6891 . . . 4 𝑚 Fn (V × V)
22 toponmax 14939 . . . . . 6 (𝐾 ∈ (TopOn‘𝑌) → 𝑌𝐾)
2322elexd 2829 . . . . 5 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ V)
2423adantl 277 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑌 ∈ V)
25 toponmax 14939 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
2625elexd 2829 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ V)
2726adantr 276 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑋 ∈ V)
28 fnovex 6085 . . . 4 (( ↑𝑚 Fn (V × V) ∧ 𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝑌𝑚 𝑋) ∈ V)
2921, 24, 27, 28mp3an2i 1379 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑌𝑚 𝑋) ∈ V)
30 rabexg 4257 . . 3 ((𝑌𝑚 𝑋) ∈ V → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
3129, 30syl 14 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
322, 16, 18, 20, 31ovmpod 6183 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  wral 2522  {crab 2526  Vcvv 2815   cuni 3916   × cxp 4749  ccnv 4750  cima 4754   Fn wfn 5349  cfv 5354  (class class class)co 6052  cmpo 6054  𝑚 cmap 6884  Topctop 14911  TopOnctopon 14924   Cn ccn 15099
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-map 6886  df-top 14912  df-topon 14925  df-cn 15102
This theorem is referenced by:  cnovex  15110  iscn  15111
  Copyright terms: Public domain W3C validator