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

Theorem cnfval 20947
 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 20941 . . 3 Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗})
21a1i 11 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗}))
3 simprr 795 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
43unieqd 4412 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝐾)
5 toponuni 20642 . . . . . 6 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 762 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑌 = 𝐾)
74, 6eqtr4d 2658 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑘 = 𝑌)
8 simprl 793 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
98unieqd 4412 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝐽)
10 toponuni 20642 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
1110ad2antrr 761 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑋 = 𝐽)
129, 11eqtr4d 2658 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → 𝑗 = 𝑋)
137, 12oveq12d 6622 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → ( 𝑘𝑚 𝑗) = (𝑌𝑚 𝑋))
148eleq2d 2684 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → ((𝑓𝑦) ∈ 𝑗 ↔ (𝑓𝑦) ∈ 𝐽))
153, 14raleqbidv 3141 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → (∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗 ↔ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽))
1613, 15rabeqbidv 3181 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽𝑘 = 𝐾)) → {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 (𝑓𝑦) ∈ 𝑗} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
17 topontop 20641 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1817adantr 481 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐽 ∈ Top)
19 topontop 20641 . . 3 (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
2019adantl 482 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐾 ∈ Top)
21 ovex 6632 . . . 4 (𝑌𝑚 𝑋) ∈ V
2221rabex 4773 . . 3 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V
2322a1i 11 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
242, 16, 18, 20, 23ovmpt2d 6741 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   = wceq 1480   ∈ wcel 1987  ∀wral 2907  {crab 2911  Vcvv 3186  ∪ cuni 4402  ◡ccnv 5073   “ cima 5077  ‘cfv 5847  (class class class)co 6604   ↦ cmpt2 6606   ↑𝑚 cmap 7802  Topctop 20617  TopOnctopon 20618   Cn ccn 20938 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-iota 5810  df-fun 5849  df-fv 5855  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-topon 20623  df-cn 20941 This theorem is referenced by:  iscn  20949  cnfex  38667
 Copyright terms: Public domain W3C validator