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 18756

Description: Expand out the substitutions in df-gsum 17512. (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 6899	. . . 4 ⊢ 𝐵 ∈ V
10	9	a1i 11	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
11		fex2 7935	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ V) → 𝐹 ∈ V)
12	7, 8, 10, 11	syl3anc 1398	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
13	7	fdmd 6720	. 2 ⊢ (𝜑 → dom 𝐹 = 𝐴)
14	1, 2, 3, 4, 5, 6, 12, 13	gsumvalx 18755	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 2146 ∀wral 3081 ∃wrex 3091 {crab 3418 Vcvv 3457 ∖ cdif 3903 ⊆ wss 3906 ifcif 4489 ^◡ccnv 5662 ran crn 5664 “ cima 5666 ∘ ccom 5667 ℩cio 6494 ⟶wf 6536 –1-1-onto→wf1o 6539 ‘cfv 6540 (class class class)co 7416 1c1 11112 ℤ_≥cuz 12873 ...cfz 13546 seqcseq 14050 ♯chash 14379 Basecbs 17286 +_gcplusg 17327 0_gc0g 17509 Σ_g cgsu 17510

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 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738

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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-seq 14051 df-gsum 17512

This theorem is used by: gsumress 18761 gsumval1 18762 gsumval2a 18764 gsumval3a 19996

W3C validator