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

Theorem gsumpt 19011
Description: Sum of a family that is nonzero at at most one point. (Contributed by Stefan O'Rear, 7-Feb-2015.) (Revised by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 6-Jun-2019.)
Hypotheses
Ref Expression
gsumpt.b 𝐵 = (Base‘𝐺)
gsumpt.z 0 = (0g𝐺)
gsumpt.g (𝜑𝐺 ∈ Mnd)
gsumpt.a (𝜑𝐴𝑉)
gsumpt.x (𝜑𝑋𝐴)
gsumpt.f (𝜑𝐹:𝐴𝐵)
gsumpt.s (𝜑 → (𝐹 supp 0 ) ⊆ {𝑋})
Assertion
Ref Expression
gsumpt (𝜑 → (𝐺 Σg 𝐹) = (𝐹𝑋))

Proof of Theorem gsumpt
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 gsumpt.f . . . 4 (𝜑𝐹:𝐴𝐵)
2 gsumpt.x . . . . 5 (𝜑𝑋𝐴)
32snssd 4734 . . . 4 (𝜑 → {𝑋} ⊆ 𝐴)
41, 3feqresmpt 6727 . . 3 (𝜑 → (𝐹 ↾ {𝑋}) = (𝑎 ∈ {𝑋} ↦ (𝐹𝑎)))
54oveq2d 7161 . 2 (𝜑 → (𝐺 Σg (𝐹 ↾ {𝑋})) = (𝐺 Σg (𝑎 ∈ {𝑋} ↦ (𝐹𝑎))))
6 gsumpt.b . . 3 𝐵 = (Base‘𝐺)
7 gsumpt.z . . 3 0 = (0g𝐺)
8 eqid 2818 . . 3 (Cntz‘𝐺) = (Cntz‘𝐺)
9 gsumpt.g . . 3 (𝜑𝐺 ∈ Mnd)
10 gsumpt.a . . 3 (𝜑𝐴𝑉)
111, 2ffvelrnd 6844 . . . . . . . 8 (𝜑 → (𝐹𝑋) ∈ 𝐵)
12 eqidd 2819 . . . . . . . 8 (𝜑 → ((𝐹𝑋)(+g𝐺)(𝐹𝑋)) = ((𝐹𝑋)(+g𝐺)(𝐹𝑋)))
13 eqid 2818 . . . . . . . . . 10 (+g𝐺) = (+g𝐺)
146, 13, 8elcntzsn 18393 . . . . . . . . 9 ((𝐹𝑋) ∈ 𝐵 → ((𝐹𝑋) ∈ ((Cntz‘𝐺)‘{(𝐹𝑋)}) ↔ ((𝐹𝑋) ∈ 𝐵 ∧ ((𝐹𝑋)(+g𝐺)(𝐹𝑋)) = ((𝐹𝑋)(+g𝐺)(𝐹𝑋)))))
1511, 14syl 17 . . . . . . . 8 (𝜑 → ((𝐹𝑋) ∈ ((Cntz‘𝐺)‘{(𝐹𝑋)}) ↔ ((𝐹𝑋) ∈ 𝐵 ∧ ((𝐹𝑋)(+g𝐺)(𝐹𝑋)) = ((𝐹𝑋)(+g𝐺)(𝐹𝑋)))))
1611, 12, 15mpbir2and 709 . . . . . . 7 (𝜑 → (𝐹𝑋) ∈ ((Cntz‘𝐺)‘{(𝐹𝑋)}))
1716snssd 4734 . . . . . 6 (𝜑 → {(𝐹𝑋)} ⊆ ((Cntz‘𝐺)‘{(𝐹𝑋)}))
18 eqid 2818 . . . . . . 7 (mrCls‘(SubMnd‘𝐺)) = (mrCls‘(SubMnd‘𝐺))
19 eqid 2818 . . . . . . 7 (𝐺s ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})) = (𝐺s ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
208, 18, 19cntzspan 18893 . . . . . 6 ((𝐺 ∈ Mnd ∧ {(𝐹𝑋)} ⊆ ((Cntz‘𝐺)‘{(𝐹𝑋)})) → (𝐺s ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})) ∈ CMnd)
219, 17, 20syl2anc 584 . . . . 5 (𝜑 → (𝐺s ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})) ∈ CMnd)
226submacs 17979 . . . . . . . 8 (𝐺 ∈ Mnd → (SubMnd‘𝐺) ∈ (ACS‘𝐵))
23 acsmre 16911 . . . . . . . 8 ((SubMnd‘𝐺) ∈ (ACS‘𝐵) → (SubMnd‘𝐺) ∈ (Moore‘𝐵))
249, 22, 233syl 18 . . . . . . 7 (𝜑 → (SubMnd‘𝐺) ∈ (Moore‘𝐵))
2511snssd 4734 . . . . . . 7 (𝜑 → {(𝐹𝑋)} ⊆ 𝐵)
2618mrccl 16870 . . . . . . 7 (((SubMnd‘𝐺) ∈ (Moore‘𝐵) ∧ {(𝐹𝑋)} ⊆ 𝐵) → ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ∈ (SubMnd‘𝐺))
2724, 25, 26syl2anc 584 . . . . . 6 (𝜑 → ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ∈ (SubMnd‘𝐺))
2819, 8submcmn2 18888 . . . . . 6 (((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ∈ (SubMnd‘𝐺) → ((𝐺s ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})) ∈ CMnd ↔ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ⊆ ((Cntz‘𝐺)‘((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))))
2927, 28syl 17 . . . . 5 (𝜑 → ((𝐺s ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})) ∈ CMnd ↔ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ⊆ ((Cntz‘𝐺)‘((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))))
3021, 29mpbid 233 . . . 4 (𝜑 → ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ⊆ ((Cntz‘𝐺)‘((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})))
311ffnd 6508 . . . . . 6 (𝜑𝐹 Fn 𝐴)
32 simpr 485 . . . . . . . . . 10 (((𝜑𝑎𝐴) ∧ 𝑎 = 𝑋) → 𝑎 = 𝑋)
3332fveq2d 6667 . . . . . . . . 9 (((𝜑𝑎𝐴) ∧ 𝑎 = 𝑋) → (𝐹𝑎) = (𝐹𝑋))
3424, 18, 25mrcssidd 16884 . . . . . . . . . . 11 (𝜑 → {(𝐹𝑋)} ⊆ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
35 fvex 6676 . . . . . . . . . . . 12 (𝐹𝑋) ∈ V
3635snss 4710 . . . . . . . . . . 11 ((𝐹𝑋) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ↔ {(𝐹𝑋)} ⊆ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
3734, 36sylibr 235 . . . . . . . . . 10 (𝜑 → (𝐹𝑋) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
3837ad2antrr 722 . . . . . . . . 9 (((𝜑𝑎𝐴) ∧ 𝑎 = 𝑋) → (𝐹𝑋) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
3933, 38eqeltrd 2910 . . . . . . . 8 (((𝜑𝑎𝐴) ∧ 𝑎 = 𝑋) → (𝐹𝑎) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
40 eldifsn 4711 . . . . . . . . . . 11 (𝑎 ∈ (𝐴 ∖ {𝑋}) ↔ (𝑎𝐴𝑎𝑋))
41 gsumpt.s . . . . . . . . . . . 12 (𝜑 → (𝐹 supp 0 ) ⊆ {𝑋})
427fvexi 6677 . . . . . . . . . . . . 13 0 ∈ V
4342a1i 11 . . . . . . . . . . . 12 (𝜑0 ∈ V)
441, 41, 10, 43suppssr 7850 . . . . . . . . . . 11 ((𝜑𝑎 ∈ (𝐴 ∖ {𝑋})) → (𝐹𝑎) = 0 )
4540, 44sylan2br 594 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐴𝑎𝑋)) → (𝐹𝑎) = 0 )
467subm0cl 17964 . . . . . . . . . . . 12 (((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ∈ (SubMnd‘𝐺) → 0 ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
4727, 46syl 17 . . . . . . . . . . 11 (𝜑0 ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
4847adantr 481 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐴𝑎𝑋)) → 0 ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
4945, 48eqeltrd 2910 . . . . . . . . 9 ((𝜑 ∧ (𝑎𝐴𝑎𝑋)) → (𝐹𝑎) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
5049anassrs 468 . . . . . . . 8 (((𝜑𝑎𝐴) ∧ 𝑎𝑋) → (𝐹𝑎) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
5139, 50pm2.61dane 3101 . . . . . . 7 ((𝜑𝑎𝐴) → (𝐹𝑎) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
5251ralrimiva 3179 . . . . . 6 (𝜑 → ∀𝑎𝐴 (𝐹𝑎) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
53 ffnfv 6874 . . . . . 6 (𝐹:𝐴⟶((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑎𝐴 (𝐹𝑎) ∈ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})))
5431, 52, 53sylanbrc 583 . . . . 5 (𝜑𝐹:𝐴⟶((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
5554frnd 6514 . . . 4 (𝜑 → ran 𝐹 ⊆ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}))
568cntzidss 18406 . . . 4 ((((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)}) ⊆ ((Cntz‘𝐺)‘((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})) ∧ ran 𝐹 ⊆ ((mrCls‘(SubMnd‘𝐺))‘{(𝐹𝑋)})) → ran 𝐹 ⊆ ((Cntz‘𝐺)‘ran 𝐹))
5730, 55, 56syl2anc 584 . . 3 (𝜑 → ran 𝐹 ⊆ ((Cntz‘𝐺)‘ran 𝐹))
581ffund 6511 . . . 4 (𝜑 → Fun 𝐹)
59 snfi 8582 . . . . 5 {𝑋} ∈ Fin
60 ssfi 8726 . . . . 5 (({𝑋} ∈ Fin ∧ (𝐹 supp 0 ) ⊆ {𝑋}) → (𝐹 supp 0 ) ∈ Fin)
6159, 41, 60sylancr 587 . . . 4 (𝜑 → (𝐹 supp 0 ) ∈ Fin)
62 fex 6980 . . . . . 6 ((𝐹:𝐴𝐵𝐴𝑉) → 𝐹 ∈ V)
631, 10, 62syl2anc 584 . . . . 5 (𝜑𝐹 ∈ V)
64 isfsupp 8825 . . . . 5 ((𝐹 ∈ V ∧ 0 ∈ V) → (𝐹 finSupp 0 ↔ (Fun 𝐹 ∧ (𝐹 supp 0 ) ∈ Fin)))
6563, 43, 64syl2anc 584 . . . 4 (𝜑 → (𝐹 finSupp 0 ↔ (Fun 𝐹 ∧ (𝐹 supp 0 ) ∈ Fin)))
6658, 61, 65mpbir2and 709 . . 3 (𝜑𝐹 finSupp 0 )
676, 7, 8, 9, 10, 1, 57, 41, 66gsumzres 18958 . 2 (𝜑 → (𝐺 Σg (𝐹 ↾ {𝑋})) = (𝐺 Σg 𝐹))
68 fveq2 6663 . . . 4 (𝑎 = 𝑋 → (𝐹𝑎) = (𝐹𝑋))
696, 68gsumsn 19003 . . 3 ((𝐺 ∈ Mnd ∧ 𝑋𝐴 ∧ (𝐹𝑋) ∈ 𝐵) → (𝐺 Σg (𝑎 ∈ {𝑋} ↦ (𝐹𝑎))) = (𝐹𝑋))
709, 2, 11, 69syl3anc 1363 . 2 (𝜑 → (𝐺 Σg (𝑎 ∈ {𝑋} ↦ (𝐹𝑎))) = (𝐹𝑋))
715, 67, 703eqtr3d 2861 1 (𝜑 → (𝐺 Σg 𝐹) = (𝐹𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1528  wcel 2105  wne 3013  wral 3135  Vcvv 3492  cdif 3930  wss 3933  {csn 4557   class class class wbr 5057  cmpt 5137  ran crn 5549  cres 5550  Fun wfun 6342   Fn wfn 6343  wf 6344  cfv 6348  (class class class)co 7145   supp csupp 7819  Fincfn 8497   finSupp cfsupp 8821  Basecbs 16471  s cress 16472  +gcplusg 16553  0gc0g 16701   Σg cgsu 16702  Moorecmre 16841  mrClscmrc 16842  ACScacs 16844  Mndcmnd 17899  SubMndcsubmnd 17943  Cntzccntz 18383  CMndccmn 18835
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450  ax-cnex 10581  ax-resscn 10582  ax-1cn 10583  ax-icn 10584  ax-addcl 10585  ax-addrcl 10586  ax-mulcl 10587  ax-mulrcl 10588  ax-mulcom 10589  ax-addass 10590  ax-mulass 10591  ax-distr 10592  ax-i2m1 10593  ax-1ne0 10594  ax-1rid 10595  ax-rnegex 10596  ax-rrecex 10597  ax-cnre 10598  ax-pre-lttri 10599  ax-pre-lttrn 10600  ax-pre-ltadd 10601  ax-pre-mulgt0 10602
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-nel 3121  df-ral 3140  df-rex 3141  df-reu 3142  df-rmo 3143  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-pss 3951  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4831  df-int 4868  df-iun 4912  df-iin 4913  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-se 5508  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-isom 6357  df-riota 7103  df-ov 7148  df-oprab 7149  df-mpo 7150  df-om 7570  df-1st 7678  df-2nd 7679  df-supp 7820  df-wrecs 7936  df-recs 7997  df-rdg 8035  df-1o 8091  df-oadd 8095  df-er 8278  df-en 8498  df-dom 8499  df-sdom 8500  df-fin 8501  df-fsupp 8822  df-oi 8962  df-card 9356  df-pnf 10665  df-mnf 10666  df-xr 10667  df-ltxr 10668  df-le 10669  df-sub 10860  df-neg 10861  df-nn 11627  df-2 11688  df-n0 11886  df-z 11970  df-uz 12232  df-fz 12881  df-fzo 13022  df-seq 13358  df-hash 13679  df-ndx 16474  df-slot 16475  df-base 16477  df-sets 16478  df-ress 16479  df-plusg 16566  df-0g 16703  df-gsum 16704  df-mre 16845  df-mrc 16846  df-acs 16848  df-mgm 17840  df-sgrp 17889  df-mnd 17900  df-submnd 17945  df-mulg 18163  df-cntz 18385  df-cmn 18837
This theorem is referenced by:  gsummpt1n0  19014  dprdfid  19068  evlslem3  20221  evlslem1  20223  coe1tmmul2  20372  coe1tmmul  20373  uvcresum  20865  frlmup2  20871  mamulid  20978  mamurid  20979  coe1mul3  24620  tayl0  24877  jensen  25493  linc1  44408
  Copyright terms: Public domain W3C validator