| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnco | Structured version Visualization version GIF version | ||
| Description: The composition of two continuous functions is a continuous function. (Contributed by FL, 8-Dec-2006.) (Revised by Mario Carneiro, 21-Aug-2015.) |
| Ref | Expression |
|---|---|
| cnco | ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) → (𝐺 ∘ 𝐹) ∈ (𝐽 Cn 𝐿)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cntop1 23615 | . . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
| 2 | cntop2 23616 | . . 3 ⊢ (𝐺 ∈ (𝐾 Cn 𝐿) → 𝐿 ∈ Top) | |
| 3 | 1, 2 | anim12i 625 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) → (𝐽 ∈ Top ∧ 𝐿 ∈ Top)) |
| 4 | eqid 2766 | . . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾 | |
| 5 | eqid 2766 | . . . . 5 ⊢ ∪ 𝐿 = ∪ 𝐿 | |
| 6 | 4, 5 | cnf 23621 | . . . 4 ⊢ (𝐺 ∈ (𝐾 Cn 𝐿) → 𝐺:∪ 𝐾⟶∪ 𝐿) |
| 7 | eqid 2766 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 8 | 7, 4 | cnf 23621 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾) |
| 9 | fco 6763 | . . . 4 ⊢ ((𝐺:∪ 𝐾⟶∪ 𝐿 ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → (𝐺 ∘ 𝐹):∪ 𝐽⟶∪ 𝐿) | |
| 10 | 6, 8, 9 | syl2anr 609 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) → (𝐺 ∘ 𝐹):∪ 𝐽⟶∪ 𝐿) |
| 11 | cnvco 5878 | . . . . . . 7 ⊢ ◡(𝐺 ∘ 𝐹) = (◡𝐹 ∘ ◡𝐺) | |
| 12 | 11 | imaeq1i 6066 | . . . . . 6 ⊢ (◡(𝐺 ∘ 𝐹) “ 𝑥) = ((◡𝐹 ∘ ◡𝐺) “ 𝑥) |
| 13 | imaco 6270 | . . . . . 6 ⊢ ((◡𝐹 ∘ ◡𝐺) “ 𝑥) = (◡𝐹 “ (◡𝐺 “ 𝑥)) | |
| 14 | 12, 13 | eqtri 2789 | . . . . 5 ⊢ (◡(𝐺 ∘ 𝐹) “ 𝑥) = (◡𝐹 “ (◡𝐺 “ 𝑥)) |
| 15 | simpll 779 | . . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) ∧ 𝑥 ∈ 𝐿) → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 16 | cnima 23640 | . . . . . . 7 ⊢ ((𝐺 ∈ (𝐾 Cn 𝐿) ∧ 𝑥 ∈ 𝐿) → (◡𝐺 “ 𝑥) ∈ 𝐾) | |
| 17 | 16 | adantll 727 | . . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) ∧ 𝑥 ∈ 𝐿) → (◡𝐺 “ 𝑥) ∈ 𝐾) |
| 18 | cnima 23640 | . . . . . 6 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (◡𝐺 “ 𝑥) ∈ 𝐾) → (◡𝐹 “ (◡𝐺 “ 𝑥)) ∈ 𝐽) | |
| 19 | 15, 17, 18 | syl2anc 596 | . . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) ∧ 𝑥 ∈ 𝐿) → (◡𝐹 “ (◡𝐺 “ 𝑥)) ∈ 𝐽) |
| 20 | 14, 19 | eqeltrid 2871 | . . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) ∧ 𝑥 ∈ 𝐿) → (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽) |
| 21 | 20 | ralrimiva 3161 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) → ∀𝑥 ∈ 𝐿 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽) |
| 22 | 10, 21 | jca 521 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) → ((𝐺 ∘ 𝐹):∪ 𝐽⟶∪ 𝐿 ∧ ∀𝑥 ∈ 𝐿 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽)) |
| 23 | 7, 5 | iscn2 23613 | . 2 ⊢ ((𝐺 ∘ 𝐹) ∈ (𝐽 Cn 𝐿) ↔ ((𝐽 ∈ Top ∧ 𝐿 ∈ Top) ∧ ((𝐺 ∘ 𝐹):∪ 𝐽⟶∪ 𝐿 ∧ ∀𝑥 ∈ 𝐿 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽))) |
| 24 | 3, 22, 23 | sylanbrc 595 | 1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) → (𝐺 ∘ 𝐹) ∈ (𝐽 Cn 𝐿)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2150 ∀wral 3083 ∪ cuni 4871 ◡ccnv 5656 “ cima 5660 ∘ ccom 5661 ⟶wf 6561 (class class class)co 7450 Topctop 23268 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: kgencn2 23933 txcn 24002 xkoco1cn 24033 xkoco2cn 24034 xkococnlem 24035 xkococn 24036 cnmpt11 24039 cnmpt21 24047 hmeoco 24148 qtophmeo 24193 htpyco1 25356 htpyco2 25357 phtpyco2 25368 reparphti 25375 reparpht 25376 phtpcco2 25377 copco 25396 pi1cof 25437 pi1coghm 25439 cnpconn 36204 txsconnlem 36214 txsconn 36215 cvmlift3lem2 36294 cvmlift3lem4 36296 cvmlift3lem5 36297 cvmlift3lem6 36298 hausgraph 44467 |
| Copyright terms: Public domain | W3C validator |