Theorem cnmpt1plusg 24313

Description: Continuity of the group sum; analogue of cnmpt12f 23892 which cannot be used directly because +_g is not a function. (Contributed by Mario Carneiro, 23-Aug-2015.)

Hypotheses

Ref	Expression
tgpcn.j	⊢ 𝐽 = (TopOpen‘𝐺)
cnmpt1plusg.p	⊢ + = (+g‘𝐺)
cnmpt1plusg.g	⊢ (𝜑 → 𝐺 ∈ TopMnd)
cnmpt1plusg.k	⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑋))
cnmpt1plusg.a	⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽))
cnmpt1plusg.b	⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽))

Assertion

Ref	Expression
cnmpt1plusg	⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵)) ∈ (𝐾 Cn 𝐽))

Distinct variable groups:   𝑥,𝐺   𝑥,𝐽   𝑥,𝐾   𝜑,𝑥   𝑥,𝑋

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   + (𝑥)

Proof of Theorem cnmpt1plusg

Step	Hyp	Ref	Expression
1		cnmpt1plusg.k	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑋))
2		cnmpt1plusg.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TopMnd)
3		tgpcn.j	. . . . . . . 8 ⊢ 𝐽 = (TopOpen‘𝐺)
4		eqid 2760	. . . . . . . 8 ⊢ (Base‘𝐺) = (Base‘𝐺)
5	3, 4	tmdtopon 24307	. . . . . . 7 ⊢ (𝐺 ∈ TopMnd → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
6	2, 5	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
7		cnmpt1plusg.a	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽))
8		cnf2 23474	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽)) → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶(Base‘𝐺))
9	1, 6, 7, 8	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶(Base‘𝐺))
10	9	fvmptelcdm 7106	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ (Base‘𝐺))
11		cnmpt1plusg.b	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽))
12		cnf2 23474	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽)) → (𝑥 ∈ 𝑋 ↦ 𝐵):𝑋⟶(Base‘𝐺))
13	1, 6, 11, 12	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵):𝑋⟶(Base‘𝐺))
14	13	fvmptelcdm 7106	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ (Base‘𝐺))
15		cnmpt1plusg.p	. . . . 5 ⊢ + = (+g‘𝐺)
16		eqid 2760	. . . . 5 ⊢ (+𝑓‘𝐺) = (+𝑓‘𝐺)
17	4, 15, 16	plusfval 18737	. . . 4 ⊢ ((𝐴 ∈ (Base‘𝐺) ∧ 𝐵 ∈ (Base‘𝐺)) → (𝐴(+𝑓‘𝐺)𝐵) = (𝐴 + 𝐵))
18	10, 14, 17	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐴(+𝑓‘𝐺)𝐵) = (𝐴 + 𝐵))
19	18	mpteq2dva 5198	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴(+𝑓‘𝐺)𝐵)) = (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵)))
20	3, 16	tmdcn 24309	. . . 4 ⊢ (𝐺 ∈ TopMnd → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
21	2, 20	syl 18	. . 3 ⊢ (𝜑 → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
22	1, 7, 11, 21	cnmpt12f 23892	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴(+𝑓‘𝐺)𝐵)) ∈ (𝐾 Cn 𝐽))
23	19, 22	eqeltrrd 2861	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵)) ∈ (𝐾 Cn 𝐽))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5186  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413  Basecbs 17301  +_gcplusg 17342  TopOpenctopn 17506  +_𝑓cplusf 18727  TopOnctopon 23135   Cn ccn 23449   ×_t ctx 23786  TopMndctmd 24296

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-map 8828  df-topgen 17528  df-plusf 18729  df-top 23119  df-topon 23136  df-topsp 23158  df-bases 23171  df-cn 23452  df-tx 23788  df-tmd 24298

This theorem is used by:  tmdmulg  24318  tmdgsum  24321  tmdlactcn  24328  clsnsg  24336  tgpt0  24345  cnmpt1mulr  24408