gsumval - Metamath Proof Explorer

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

Theorem gsumval 18779

Description: Expand out the substitutions in df-gsum 17527. (Contributed by Mario Carneiro, 7-Dec-2014.)

**Hypotheses**
Ref	Expression
gsumval.b	⊢ 𝐵 = (Base‘𝐺)
gsumval.z	⊢ 0 = (0_g‘𝐺)
gsumval.p	⊢ + = (+_g‘𝐺)
gsumval.o	⊢ 𝑂 = {𝑠 ∈ 𝐵 ∣ ∀𝑡 ∈ 𝐵 ((𝑠 + 𝑡) = 𝑡 ∧ (𝑡 + 𝑠) = 𝑡)}
gsumval.w	⊢ (𝜑 → 𝑊 = (^◡𝐹 “ (V ∖ 𝑂)))
gsumval.g	⊢ (𝜑 → 𝐺 ∈ 𝑉)
gsumval.a	⊢ (𝜑 → 𝐴 ∈ 𝑋)
gsumval.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

**Assertion**
Ref	Expression
gsumval	⊢ (𝜑 → (𝐺 Σ_g 𝐹) = if(ran 𝐹 ⊆ 𝑂, 0 , if(𝐴 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ_≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝑊))–1-1-onto→𝑊 ∧ 𝑥 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘𝑊)))))))

Distinct variable groups: 𝑡,𝑠,𝑥,𝐵 𝑓,𝑚,𝑛,𝑥,𝜑 𝑓,𝐹,𝑚,𝑛,𝑥 𝑓,𝐺,𝑚,𝑛,𝑥 + ,𝑠,𝑡,𝑥 𝑓,𝑂,𝑚,𝑛,𝑥 Allowed substitution hints: 𝜑(𝑡, 𝑠) 𝐴(𝑥, 𝑡, 𝑓, 𝑚, 𝑛, 𝑠) 𝐵(𝑓, 𝑚, 𝑛) + (𝑓, 𝑚, 𝑛) 𝐹(𝑡, 𝑠) 𝐺(𝑡, 𝑠) 𝑂(𝑡, 𝑠) 𝑉(𝑥, 𝑡, 𝑓, 𝑚, 𝑛, 𝑠) 𝑊(𝑥, 𝑡, 𝑓, 𝑚, 𝑛, 𝑠) 𝑋(𝑥, 𝑡, 𝑓, 𝑚, 𝑛, 𝑠) 0 (𝑥, 𝑡, 𝑓, 𝑚, 𝑛, 𝑠)

**Proof of Theorem gsumval**
Step	Hyp	Ref	Expression
1		gsumval.b	. 2 ⊢ 𝐵 = (Base‘𝐺)
2		gsumval.z	. 2 ⊢ 0 = (0_g‘𝐺)
3		gsumval.p	. 2 ⊢ + = (+_g‘𝐺)
4		gsumval.o	. 2 ⊢ 𝑂 = {𝑠 ∈ 𝐵 ∣ ∀𝑡 ∈ 𝐵 ((𝑠 + 𝑡) = 𝑡 ∧ (𝑡 + 𝑠) = 𝑡)}
5		gsumval.w	. 2 ⊢ (𝜑 → 𝑊 = (^◡𝐹 “ (V ∖ 𝑂)))
6		gsumval.g	. 2 ⊢ (𝜑 → 𝐺 ∈ 𝑉)
7		gsumval.f	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
8		gsumval.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
9	1	fvexi 6892	. . . 4 ⊢ 𝐵 ∈ V
10	9	a1i 11	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
11		fex2 7933	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ V) → 𝐹 ∈ V)
12	7, 8, 10, 11	syl3anc 1398	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
13	7	fdmd 6713	. 2 ⊢ (𝜑 → dom 𝐹 = 𝐴)
14	1, 2, 3, 4, 5, 6, 12, 13	gsumvalx 18778	1 ⊢ (𝜑 → (𝐺 Σ_g 𝐹) = if(ran 𝐹 ⊆ 𝑂, 0 , if(𝐴 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ_≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝑊))–1-1-onto→𝑊 ∧ 𝑥 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘𝑊)))))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 {crab 3412 Vcvv 3450 ∖ cdif 3896 ⊆ wss 3899 ifcif 4482 ^◡ccnv 5654 ran crn 5656 “ cima 5658 ∘ ccom 5659 ℩cio 6487 ⟶wf 6529 –1-1-onto→wf1o 6532 ‘cfv 6533 (class class class)co 7413 1c1 11125 ℤ_≥cuz 12887 ...cfz 13561 seqcseq 14065 ♯chash 14394 Basecbs 17301 +_gcplusg 17342 0_gc0g 17524 Σ_g cgsu 17525

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-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-pred 6299 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-seq 14066 df-gsum 17527

This theorem is used by: gsumress 18784 gsumval1 18785 gsumval2a 18787 gsumval3a 20030

W3C validator