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

Theorem cnss1 23402
Description: If the topology 𝐾 is finer than 𝐽, then there are more continuous functions from 𝐾 than from 𝐽. (Contributed by Mario Carneiro, 19-Mar-2015.) (Revised by Mario Carneiro, 21-Aug-2015.)
Hypothesis
Ref Expression
cnss1.1 𝑋 = 𝐽
Assertion
Ref Expression
cnss1 ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝐽 Cn 𝐿) ⊆ (𝐾 Cn 𝐿))

Proof of Theorem cnss1
Dummy variables 𝑥 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnss1.1 . . . . . 6 𝑋 = 𝐽
2 eqid 2769 . . . . . 6 𝐿 = 𝐿
31, 2cnf 23372 . . . . 5 (𝑓 ∈ (𝐽 Cn 𝐿) → 𝑓:𝑋 𝐿)
43adantl 486 . . . 4 (((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) → 𝑓:𝑋 𝐿)
5 simpllr 787 . . . . . 6 ((((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) ∧ 𝑥𝐿) → 𝐽𝐾)
6 cnima 23391 . . . . . . 7 ((𝑓 ∈ (𝐽 Cn 𝐿) ∧ 𝑥𝐿) → (𝑓𝑥) ∈ 𝐽)
76adantll 726 . . . . . 6 ((((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) ∧ 𝑥𝐿) → (𝑓𝑥) ∈ 𝐽)
85, 7sseldd 3944 . . . . 5 ((((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) ∧ 𝑥𝐿) → (𝑓𝑥) ∈ 𝐾)
98ralrimiva 3163 . . . 4 (((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) → ∀𝑥𝐿 (𝑓𝑥) ∈ 𝐾)
10 simpll 778 . . . . 5 (((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) → 𝐾 ∈ (TopOn‘𝑋))
11 cntop2 23367 . . . . . . 7 (𝑓 ∈ (𝐽 Cn 𝐿) → 𝐿 ∈ Top)
1211adantl 486 . . . . . 6 (((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) → 𝐿 ∈ Top)
13 toptopon2 23044 . . . . . 6 (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘ 𝐿))
1412, 13sylib 221 . . . . 5 (((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) → 𝐿 ∈ (TopOn‘ 𝐿))
15 iscn 23361 . . . . 5 ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (TopOn‘ 𝐿)) → (𝑓 ∈ (𝐾 Cn 𝐿) ↔ (𝑓:𝑋 𝐿 ∧ ∀𝑥𝐿 (𝑓𝑥) ∈ 𝐾)))
1610, 14, 15syl2anc 595 . . . 4 (((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) → (𝑓 ∈ (𝐾 Cn 𝐿) ↔ (𝑓:𝑋 𝐿 ∧ ∀𝑥𝐿 (𝑓𝑥) ∈ 𝐾)))
174, 9, 16mpbir2and 725 . . 3 (((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐿)) → 𝑓 ∈ (𝐾 Cn 𝐿))
1817ex 417 . 2 ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝑓 ∈ (𝐽 Cn 𝐿) → 𝑓 ∈ (𝐾 Cn 𝐿)))
1918ssrdv 3949 1 ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝐽 Cn 𝐿) ⊆ (𝐾 Cn 𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wral 3085  wss 3911   cuni 4874  ccnv 5661  cima 5665  wf 6533  cfv 6537  (class class class)co 7411  Topctop 23019  TopOnctopon 23036   Cn ccn 23350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3423  df-v 3463  df-sbc 3752  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-map 8826  df-top 23020  df-topon 23037  df-cn 23353
This theorem is referenced by:  kgen2cn  23685  xkopjcn  23782
  Copyright terms: Public domain W3C validator