MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tsmspropd Structured version   Visualization version   GIF version

Theorem tsmspropd 24326
Description: The group sum depends only on the base set, additive operation, and topology components. Note that for entirely unrestricted functions, there can be dependency on out-of-domain values of the operation, so this is somewhat weaker than mndpropd 18846 etc. (Contributed by Mario Carneiro, 18-Sep-2015.)
Hypotheses
Ref Expression
tsmspropd.f (𝜑𝐹𝑉)
tsmspropd.g (𝜑𝐺𝑊)
tsmspropd.h (𝜑𝐻𝑋)
tsmspropd.b (𝜑 → (Base‘𝐺) = (Base‘𝐻))
tsmspropd.p (𝜑 → (+g𝐺) = (+g𝐻))
tsmspropd.j (𝜑 → (TopOpen‘𝐺) = (TopOpen‘𝐻))
Assertion
Ref Expression
tsmspropd (𝜑 → (𝐺 tsums 𝐹) = (𝐻 tsums 𝐹))

Proof of Theorem tsmspropd
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tsmspropd.j . . . 4 (𝜑 → (TopOpen‘𝐺) = (TopOpen‘𝐻))
21oveq1d 7438 . . 3 (𝜑 → ((TopOpen‘𝐺) fLimf ((𝒫 dom 𝐹 ∩ Fin)filGenran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦}))) = ((TopOpen‘𝐻) fLimf ((𝒫 dom 𝐹 ∩ Fin)filGenran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦}))))
3 tsmspropd.f . . . . . 6 (𝜑𝐹𝑉)
43resexd 6032 . . . . 5 (𝜑 → (𝐹𝑦) ∈ V)
5 tsmspropd.g . . . . 5 (𝜑𝐺𝑊)
6 tsmspropd.h . . . . 5 (𝜑𝐻𝑋)
7 tsmspropd.b . . . . 5 (𝜑 → (Base‘𝐺) = (Base‘𝐻))
8 tsmspropd.p . . . . 5 (𝜑 → (+g𝐺) = (+g𝐻))
94, 5, 6, 7, 8gsumpropd 18765 . . . 4 (𝜑 → (𝐺 Σg (𝐹𝑦)) = (𝐻 Σg (𝐹𝑦)))
109mpteq2dv 5210 . . 3 (𝜑 → (𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ (𝐺 Σg (𝐹𝑦))) = (𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ (𝐻 Σg (𝐹𝑦))))
112, 10fveq12d 6895 . 2 (𝜑 → (((TopOpen‘𝐺) fLimf ((𝒫 dom 𝐹 ∩ Fin)filGenran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦})))‘(𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ (𝐺 Σg (𝐹𝑦)))) = (((TopOpen‘𝐻) fLimf ((𝒫 dom 𝐹 ∩ Fin)filGenran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦})))‘(𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ (𝐻 Σg (𝐹𝑦)))))
12 eqid 2766 . . 3 (Base‘𝐺) = (Base‘𝐺)
13 eqid 2766 . . 3 (TopOpen‘𝐺) = (TopOpen‘𝐺)
14 eqid 2766 . . 3 (𝒫 dom 𝐹 ∩ Fin) = (𝒫 dom 𝐹 ∩ Fin)
15 eqid 2766 . . 3 ran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦}) = ran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦})
16 eqidd 2767 . . 3 (𝜑 → dom 𝐹 = dom 𝐹)
1712, 13, 14, 15, 5, 3, 16tsmsval2 24324 . 2 (𝜑 → (𝐺 tsums 𝐹) = (((TopOpen‘𝐺) fLimf ((𝒫 dom 𝐹 ∩ Fin)filGenran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦})))‘(𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ (𝐺 Σg (𝐹𝑦)))))
18 eqid 2766 . . 3 (Base‘𝐻) = (Base‘𝐻)
19 eqid 2766 . . 3 (TopOpen‘𝐻) = (TopOpen‘𝐻)
2018, 19, 14, 15, 6, 3, 16tsmsval2 24324 . 2 (𝜑 → (𝐻 tsums 𝐹) = (((TopOpen‘𝐻) fLimf ((𝒫 dom 𝐹 ∩ Fin)filGenran (𝑧 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ {𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ∣ 𝑧𝑦})))‘(𝑦 ∈ (𝒫 dom 𝐹 ∩ Fin) ↦ (𝐻 Σg (𝐹𝑦)))))
2111, 17, 203eqtr4d 2811 1 (𝜑 → (𝐺 tsums 𝐹) = (𝐻 tsums 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  {crab 3419  Vcvv 3458  cin 3907  wss 3908  𝒫 cpw 4567  cmpt 5197  dom cdm 5666  ran crn 5667  cres 5668  cfv 6543  (class class class)co 7423  Fincfn 8952  Basecbs 17294  +gcplusg 17335  TopOpenctopn 17499   Σg cgsu 17518  filGencfg 21548   fLimf cflf 24129   tsums ctsu 24320
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-seq 14058  df-0g 17519  df-gsum 17520  df-tsms 24321
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator