| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnmpt1plusg | Structured version Visualization version GIF version | ||
| Description: Continuity of the group sum; analogue of cnmpt12f 23714 which cannot be used directly because +g is not a function. (Contributed by Mario Carneiro, 23-Aug-2015.) |
| Ref | Expression |
|---|---|
| tgpcn.j | ⊢ 𝐽 = (TopOpen‘𝐺) |
| cnmpt1plusg.p | ⊢ + = (+g‘𝐺) |
| cnmpt1plusg.g | ⊢ (𝜑 → 𝐺 ∈ TopMnd) |
| cnmpt1plusg.k | ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑋)) |
| cnmpt1plusg.a | ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽)) |
| cnmpt1plusg.b | ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽)) |
| Ref | Expression |
|---|---|
| cnmpt1plusg | ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵)) ∈ (𝐾 Cn 𝐽)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnmpt1plusg.k | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑋)) | |
| 2 | cnmpt1plusg.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TopMnd) | |
| 3 | tgpcn.j | . . . . . . . 8 ⊢ 𝐽 = (TopOpen‘𝐺) | |
| 4 | eqid 2761 | . . . . . . . 8 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 5 | 3, 4 | tmdtopon 24129 | . . . . . . 7 ⊢ (𝐺 ∈ TopMnd → 𝐽 ∈ (TopOn‘(Base‘𝐺))) |
| 6 | 2, 5 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(Base‘𝐺))) |
| 7 | cnmpt1plusg.a | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽)) | |
| 8 | cnf2 23297 | . . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽)) → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶(Base‘𝐺)) | |
| 9 | 1, 6, 7, 8 | syl3anc 1389 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶(Base‘𝐺)) |
| 10 | 9 | fvmptelcdm 7089 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ (Base‘𝐺)) |
| 11 | cnmpt1plusg.b | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽)) | |
| 12 | cnf2 23297 | . . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽)) → (𝑥 ∈ 𝑋 ↦ 𝐵):𝑋⟶(Base‘𝐺)) | |
| 13 | 1, 6, 11, 12 | syl3anc 1389 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵):𝑋⟶(Base‘𝐺)) |
| 14 | 13 | fvmptelcdm 7089 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ (Base‘𝐺)) |
| 15 | cnmpt1plusg.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 16 | eqid 2761 | . . . . 5 ⊢ (+𝑓‘𝐺) = (+𝑓‘𝐺) | |
| 17 | 4, 15, 16 | plusfval 18672 | . . . 4 ⊢ ((𝐴 ∈ (Base‘𝐺) ∧ 𝐵 ∈ (Base‘𝐺)) → (𝐴(+𝑓‘𝐺)𝐵) = (𝐴 + 𝐵)) |
| 18 | 10, 14, 17 | syl2anc 593 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐴(+𝑓‘𝐺)𝐵) = (𝐴 + 𝐵)) |
| 19 | 18 | mpteq2dva 5190 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴(+𝑓‘𝐺)𝐵)) = (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵))) |
| 20 | 3, 16 | tmdcn 24131 | . . . 4 ⊢ (𝐺 ∈ TopMnd → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) |
| 21 | 2, 20 | syl 17 | . . 3 ⊢ (𝜑 → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) |
| 22 | 1, 7, 11, 21 | cnmpt12f 23714 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴(+𝑓‘𝐺)𝐵)) ∈ (𝐾 Cn 𝐽)) |
| 23 | 19, 22 | eqeltrrd 2862 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵)) ∈ (𝐾 Cn 𝐽)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ↦ cmpt 5178 ⟶wf 6512 ‘cfv 6516 (class class class)co 7391 Basecbs 17236 +gcplusg 17277 TopOpenctopn 17441 +𝑓cplusf 18662 TopOnctopon 22958 Cn ccn 23272 ×t ctx 23608 TopMndctmd 24118 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-fv 6524 df-ov 7394 df-oprab 7395 df-mpo 7396 df-1st 7965 df-2nd 7966 df-map 8804 df-topgen 17463 df-plusf 18664 df-top 22942 df-topon 22959 df-topsp 22981 df-bases 22994 df-cn 23275 df-tx 23610 df-tmd 24120 |
| This theorem is referenced by: tmdmulg 24140 tmdgsum 24143 tmdlactcn 24150 clsnsg 24158 tgpt0 24167 cnmpt1mulr 24230 |
| Copyright terms: Public domain | W3C validator |