Theorem gsumpropd2 13469

Description: A stronger version of gsumpropd 13468, working for magma, where only the closure of the addition operation on a common base is required, see gsummgmpropd 13470. (Contributed by Thierry Arnoux, 28-Jun-2017.)

Hypotheses

Ref	Expression
gsumpropd2.f	⊢ (𝜑 → 𝐹 ∈ 𝑉)
gsumpropd2.g	⊢ (𝜑 → 𝐺 ∈ 𝑊)
gsumpropd2.h	⊢ (𝜑 → 𝐻 ∈ 𝑋)
gsumpropd2.b	⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻))
gsumpropd2.c	⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
gsumpropd2.e	⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
gsumpropd2.n	⊢ (𝜑 → Fun 𝐹)
gsumpropd2.r	⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))

Assertion

Ref	Expression
gsumpropd2	⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))

Distinct variable groups:   𝐹,𝑠,𝑡   𝐺,𝑠,𝑡   𝐻,𝑠,𝑡   𝜑,𝑠,𝑡

Allowed substitution hints:   𝑉(𝑡,𝑠)   𝑊(𝑡,𝑠)   𝑋(𝑡,𝑠)

Proof of Theorem gsumpropd2

Dummy variables 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2230	. . . . . . 7 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐺))
2		gsumpropd2.b	. . . . . . 7 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻))
3		gsumpropd2.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ 𝑊)
4		gsumpropd2.h	. . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ 𝑋)
5		gsumpropd2.e	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
6	1, 2, 3, 4, 5	grpidpropdg 13450	. . . . . 6 ⊢ (𝜑 → (0g‘𝐺) = (0g‘𝐻))
7	6	eqeq2d 2241	. . . . 5 ⊢ (𝜑 → (𝑥 = (0g‘𝐺) ↔ 𝑥 = (0g‘𝐻)))
8	7	anbi2d 464	. . . 4 ⊢ (𝜑 → ((dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐺)) ↔ (dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐻))))
9		simprl 529	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → 𝑛 ∈ (ℤ≥‘𝑚))
10		gsumpropd2.r	. . . . . . . . . . . 12 ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
11	10	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → ran 𝐹 ⊆ (Base‘𝐺))
12		gsumpropd2.n	. . . . . . . . . . . . 13 ⊢ (𝜑 → Fun 𝐹)
13	12	ad2antrr 488	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → Fun 𝐹)
14		simpr 110	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → 𝑠 ∈ (𝑚...𝑛))
15		simplrr 536	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → dom 𝐹 = (𝑚...𝑛))
16	14, 15	eleqtrrd 2309	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → 𝑠 ∈ dom 𝐹)
17		fvelrn 5774	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑠 ∈ dom 𝐹) → (𝐹‘𝑠) ∈ ran 𝐹)
18	13, 16, 17	syl2anc 411	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → (𝐹‘𝑠) ∈ ran 𝐹)
19	11, 18	sseldd 3226	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → (𝐹‘𝑠) ∈ (Base‘𝐺))
20		gsumpropd2.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
21	20	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → 𝐹 ∈ 𝑉)
22		plusgslid 13188	. . . . . . . . . . . . 13 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
23	22	slotex 13102	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ 𝑊 → (+g‘𝐺) ∈ V)
24	3, 23	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → (+g‘𝐺) ∈ V)
25	24	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (+g‘𝐺) ∈ V)
26	22	slotex 13102	. . . . . . . . . . . 12 ⊢ (𝐻 ∈ 𝑋 → (+g‘𝐻) ∈ V)
27	4, 26	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → (+g‘𝐻) ∈ V)
28	27	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (+g‘𝐻) ∈ V)
29		gsumpropd2.c	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
30	29	adantlr 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
31	5	adantlr 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
32	9, 19, 21, 25, 28, 30, 31	seqfeq4g 10786	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))
33	32	eqeq2d 2241	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))
34	33	anassrs 400	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑚)) ∧ dom 𝐹 = (𝑚...𝑛)) → (𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))
35	34	pm5.32da 452	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑚)) → ((dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ (dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
36	35	rexbidva 2527	. . . . 5 ⊢ (𝜑 → (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
37	36	exbidv 1871	. . . 4 ⊢ (𝜑 → (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
38	8, 37	orbi12d 798	. . 3 ⊢ (𝜑 → (((dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐺)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛))) ↔ ((dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐻)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))))
39	38	iotabidv 5307	. 2 ⊢ (𝜑 → (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐺)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)))) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐻)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))))
40		eqid 2229	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
41		eqid 2229	. . 3 ⊢ (0g‘𝐺) = (0g‘𝐺)
42		eqid 2229	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
43		eqidd 2230	. . 3 ⊢ (𝜑 → dom 𝐹 = dom 𝐹)
44	40, 41, 42, 3, 20, 43	igsumvalx 13465	. 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐺)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)))))
45		eqid 2229	. . 3 ⊢ (Base‘𝐻) = (Base‘𝐻)
46		eqid 2229	. . 3 ⊢ (0g‘𝐻) = (0g‘𝐻)
47		eqid 2229	. . 3 ⊢ (+g‘𝐻) = (+g‘𝐻)
48	45, 46, 47, 4, 20, 43	igsumvalx 13465	. 2 ⊢ (𝜑 → (𝐻 Σg 𝐹) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g‘𝐻)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))))
49	39, 44, 48	3eqtr4d 2272	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 713   = wceq 1395  ∃wex 1538   ∈ wcel 2200  ∃wrex 2509  Vcvv 2800   ⊆ wss 3198  ∅c0 3492  dom cdm 4723  ran crn 4724  ℩cio 5282  Fun wfun 5318  ‘cfv 5324  (class class class)co 6013  ℤ_≥cuz 9748  ...cfz 10236  seqcseq 10702  Basecbs 13075  +_gcplusg 13153  0_gc0g 13332   Σ_g cgsu 13333

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-addcom 8125  ax-addass 8127  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-0id 8133  ax-rnegex 8134  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-ltadd 8141

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-inn 9137  df-2 9195  df-n0 9396  df-z 9473  df-uz 9749  df-fz 10237  df-fzo 10371  df-seqfrec 10703  df-ndx 13078  df-slot 13079  df-base 13081  df-plusg 13166  df-0g 13334  df-igsum 13335

This theorem is referenced by:  gsummgmpropd  13470