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

Theorem cnfval 14781
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 14775 . . 3 Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗})
21a1i 9 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗}))
3 simprr 531 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
43unieqd 3875 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
5 toponuni 14602 . . . . . 6 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 489 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑌 = 𝐾)
74, 6eqtr4d 2243 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝑌)
8 simprl 529 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
98unieqd 3875 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
10 toponuni 14602 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
1110ad2antrr 488 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑋 = 𝐽)
129, 11eqtr4d 2243 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝑋)
137, 12oveq12d 5985 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → ( 𝑘𝑚 𝑗) = (𝑌𝑚 𝑋))
148eleq2d 2277 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → ((𝑓𝑦) ∈ 𝑗 ↔ (𝑓𝑦) ∈ 𝐽))
153, 14raleqbidv 2721 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → (∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗 ↔ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽))
1613, 15rabeqbidv 2771 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
17 topontop 14601 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1817adantr 276 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐽 ∈ Top)
19 topontop 14601 . . 3 (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
2019adantl 277 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐾 ∈ Top)
21 fnmap 6765 . . . 4 𝑚 Fn (V × V)
22 toponmax 14612 . . . . . 6 (𝐾 ∈ (TopOn‘𝑌) → 𝑌𝐾)
2322elexd 2790 . . . . 5 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ V)
2423adantl 277 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑌 ∈ V)
25 toponmax 14612 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
2625elexd 2790 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ V)
2726adantr 276 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑋 ∈ V)
28 fnovex 6000 . . . 4 (( ↑𝑚 Fn (V × V) ∧ 𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝑌𝑚 𝑋) ∈ V)
2921, 24, 27, 28mp3an2i 1355 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑌𝑚 𝑋) ∈ V)
30 rabexg 4203 . . 3 ((𝑌𝑚 𝑋) ∈ V → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
3129, 30syl 14 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
322, 16, 18, 20, 31ovmpod 6096 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  wcel 2178  wral 2486  {crab 2490  Vcvv 2776   cuni 3864   × cxp 4691  ccnv 4692  cima 4696   Fn wfn 5285  cfv 5290  (class class class)co 5967  cmpo 5969  𝑚 cmap 6758  Topctop 14584  TopOnctopon 14597   Cn ccn 14772
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-map 6760  df-top 14585  df-topon 14598  df-cn 14775
This theorem is referenced by:  cnovex  14783  iscn  14784
  Copyright terms: Public domain W3C validator