Theorem cnmpt1plusg 24399

Description: Continuity of the group sum; analogue of cnmpt12f 23978 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 2761	. . . . . . . 8 ⊢ (Base‘𝐺) = (Base‘𝐺)
5	3, 4	tmdtopon 24393	. . . . . . 7 ⊢ (𝐺 ∈ TopMnd → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
6	2, 5	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
7		cnmpt1plusg.a	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽))
8		cnf2 23560	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ (𝐾 Cn 𝐽)) → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶(Base‘𝐺))
9	1, 6, 7, 8	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶(Base‘𝐺))
10	9	fvmptelcdm 7111	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ (Base‘𝐺))
11		cnmpt1plusg.b	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽))
12		cnf2 23560	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐵) ∈ (𝐾 Cn 𝐽)) → (𝑥 ∈ 𝑋 ↦ 𝐵):𝑋⟶(Base‘𝐺))
13	1, 6, 11, 12	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐵):𝑋⟶(Base‘𝐺))
14	13	fvmptelcdm 7111	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ (Base‘𝐺))
15		cnmpt1plusg.p	. . . . 5 ⊢ + = (+g‘𝐺)
16		eqid 2761	. . . . 5 ⊢ (+𝑓‘𝐺) = (+𝑓‘𝐺)
17	4, 15, 16	plusfval 18816	. . . 4 ⊢ ((𝐴 ∈ (Base‘𝐺) ∧ 𝐵 ∈ (Base‘𝐺)) → (𝐴(+𝑓‘𝐺)𝐵) = (𝐴 + 𝐵))
18	10, 14, 17	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐴(+𝑓‘𝐺)𝐵) = (𝐴 + 𝐵))
19	18	mpteq2dva 5198	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴(+𝑓‘𝐺)𝐵)) = (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵)))
20	3, 16	tmdcn 24395	. . . 4 ⊢ (𝐺 ∈ TopMnd → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
21	2, 20	syl 18	. . 3 ⊢ (𝜑 → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
22	1, 7, 11, 21	cnmpt12f 23978	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴(+𝑓‘𝐺)𝐵)) ∈ (𝐾 Cn 𝐽))
23	19, 22	eqeltrrd 2862	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝐵)) ∈ (𝐾 Cn 𝐽))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5186  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +_gcplusg 17421  TopOpenctopn 17585  +_𝑓cplusf 18806  TopOnctopon 23221   Cn ccn 23535   ×_t ctx 23872  TopMndctmd 24382

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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-map 8842  df-topgen 17607  df-plusf 18808  df-top 23205  df-topon 23222  df-topsp 23244  df-bases 23257  df-cn 23538  df-tx 23874  df-tmd 24384

This theorem is used by:  tmdmulg  24404  tmdgsum  24407  tmdlactcn  24414  clsnsg  24422  tgpt0  24431  cnmpt1mulr  24494