| 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 2766 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | cnss2.1 | . . . . . 6 ⊢ 𝑌 = ∪ 𝐾 | |
| 3 | 1, 2 | cnf 23621 | . . . . 5 ⊢ (𝑓 ∈ (𝐽 Cn 𝐾) → 𝑓:∪ 𝐽⟶𝑌) |
| 4 | 3 | adantl 487 | . . . 4 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝑓:∪ 𝐽⟶𝑌) |
| 5 | simplr 781 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐿 ⊆ 𝐾) | |
| 6 | cnima 23640 | . . . . . . 7 ⊢ ((𝑓 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ∈ 𝐾) → (◡𝑓 “ 𝑥) ∈ 𝐽) | |
| 7 | 6 | ralrimiva 3161 | . . . . . 6 ⊢ (𝑓 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝐾 (◡𝑓 “ 𝑥) ∈ 𝐽) |
| 8 | 7 | adantl 487 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → ∀𝑥 ∈ 𝐾 (◡𝑓 “ 𝑥) ∈ 𝐽) |
| 9 | ssralv 3981 | . . . . 5 ⊢ (𝐿 ⊆ 𝐾 → (∀𝑥 ∈ 𝐾 (◡𝑓 “ 𝑥) ∈ 𝐽 → ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽)) | |
| 10 | 5, 8, 9 | sylc 66 | . . . 4 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽) |
| 11 | cntop1 23615 | . . . . . . 7 ⊢ (𝑓 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
| 12 | 11 | adantl 487 | . . . . . 6 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Top) |
| 13 | toptopon2 23293 | . . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽)) | |
| 14 | 12, 13 | sylib 221 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ (TopOn‘∪ 𝐽)) |
| 15 | simpll 779 | . . . . 5 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐿 ∈ (TopOn‘𝑌)) | |
| 16 | iscn 23610 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐿 ∈ (TopOn‘𝑌)) → (𝑓 ∈ (𝐽 Cn 𝐿) ↔ (𝑓:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽))) | |
| 17 | 14, 15, 16 | syl2anc 596 | . . . 4 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → (𝑓 ∈ (𝐽 Cn 𝐿) ↔ (𝑓:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐿 (◡𝑓 “ 𝑥) ∈ 𝐽))) |
| 18 | 4, 10, 17 | mpbir2and 726 | . . 3 ⊢ (((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝑓 ∈ (𝐽 Cn 𝐿)) |
| 19 | 18 | ex 418 | . 2 ⊢ ((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) → (𝑓 ∈ (𝐽 Cn 𝐾) → 𝑓 ∈ (𝐽 Cn 𝐿))) |
| 20 | 19 | ssrdv 3918 | 1 ⊢ ((𝐿 ∈ (TopOn‘𝑌) ∧ 𝐿 ⊆ 𝐾) → (𝐽 Cn 𝐾) ⊆ (𝐽 Cn 𝐿)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∀wral 3083 ⊆ wss 3899 ∪ cuni 4871 ◡ccnv 5656 “ cima 5660 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 Topctop 23268 TopOnctopon 23285 Cn ccn 23599 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-sbc 3742 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-map 8886 df-top 23269 df-topon 23286 df-cn 23602 |
| This theorem is used by: kgencn3 23934 xmetdcn 25215 |
| Copyright terms: Public domain | W3C validator |