Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cnss2 | Structured version Visualization version GIF version |
Description: If the topology 𝐾 is finer than 𝐽, then there are fewer continuous functions into 𝐾 than into 𝐽 from some other space. (Contributed by Mario Carneiro, 19-Mar-2015.) (Revised by Mario Carneiro, 21-Aug-2015.) |
Ref | Expression |
---|---|
cnss2.1 | ⊢ 𝑌 = ∪ 𝐾 |
Ref | Expression |
---|---|
cnss2 | ⊢ ((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) → (𝐽 Cn 𝐾) ⊆ (𝐽 Cn 𝐿)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2824 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
2 | cnss2.1 | . . . . . 6 ⊢ 𝑌 = ∪ 𝐾 | |
3 | 1, 2 | cnf 21857 | . . . . 5 ⊢ (𝑓 ∈ (𝐽 Cn 𝐾) → 𝑓:∪ 𝐽⟶𝑌) |
4 | 3 | adantl 484 | . . . 4 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝑓:∪ 𝐽⟶𝑌) |
5 | simplr 767 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐿 ⊆ 𝐾) | |
6 | cnima 21876 | . . . . . . 7 ⊢ ((𝑓 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ∈ 𝐾) → (◡𝑓 “ 𝑥) ∈ 𝐽) | |
7 | 6 | ralrimiva 3185 | . . . . . 6 ⊢ (𝑓 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝐾 (◡𝑓 “ 𝑥) ∈ 𝐽) |
8 | 7 | adantl 484 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → ∀𝑥 ∈ 𝐾 (◡𝑓 “ 𝑥) ∈ 𝐽) |
9 | ssralv 4036 | . . . . 5 ⊢ (𝐿 ⊆ 𝐾 → (∀𝑥 ∈ 𝐾 (◡𝑓 “ 𝑥) ∈ 𝐽 → ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽)) | |
10 | 5, 8, 9 | sylc 65 | . . . 4 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽) |
11 | cntop1 21851 | . . . . . . 7 ⊢ (𝑓 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
12 | 11 | adantl 484 | . . . . . 6 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Top) |
13 | toptopon2 21529 | . . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽)) | |
14 | 12, 13 | sylib 220 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ (TopOn‘∪ 𝐽)) |
15 | simpll 765 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐿 ∈ (TopOn‘𝑌)) | |
16 | iscn 21846 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐿 ∈ (TopOn‘𝑌)) → (𝑓 ∈ (𝐽 Cn 𝐿) ↔ (𝑓:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽))) | |
17 | 14, 15, 16 | syl2anc 586 | . . . 4 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → (𝑓 ∈ (𝐽 Cn 𝐿) ↔ (𝑓:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽))) |
18 | 4, 10, 17 | mpbir2and 711 | . . 3 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝑓 ∈ (𝐽 Cn 𝐿)) |
19 | 18 | ex 415 | . 2 ⊢ ((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) → (𝑓 ∈ (𝐽 Cn 𝐾) → 𝑓 ∈ (𝐽 Cn 𝐿))) |
20 | 19 | ssrdv 3976 | 1 ⊢ ((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) → (𝐽 Cn 𝐾) ⊆ (𝐽 Cn 𝐿)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∀wral 3141 ⊆ wss 3939 ∪ cuni 4841 ◡ccnv 5557 “ cima 5561 ⟶wf 6354 ‘cfv 6358 (class class class)co 7159 Topctop 21504 TopOnctopon 21521 Cn ccn 21835 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-map 8411 df-top 21505 df-topon 21522 df-cn 21838 |
This theorem is referenced by: kgencn3 22169 xmetdcn 23449 |
Copyright terms: Public domain | W3C validator |