Theorem mulgfvalg 12985

Description: Group multiple (exponentiation) operation. (Contributed by Mario Carneiro, 11-Dec-2014.)

Hypotheses

Ref	Expression
mulgval.b	⊢ 𝐵 = (Base‘𝐺)
mulgval.p	⊢ + = (+g‘𝐺)
mulgval.o	⊢ 0 = (0g‘𝐺)
mulgval.i	⊢ 𝐼 = (invg‘𝐺)
mulgval.t	⊢ · = (.g‘𝐺)

Assertion

Ref	Expression
mulgfvalg	⊢ (𝐺 ∈ 𝑉 → · = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))))

Distinct variable groups:   𝑥, 0 ,𝑛   𝑥,𝐵,𝑛   𝑥, + ,𝑛   𝑥,𝐺,𝑛   𝑥,𝐼,𝑛

Allowed substitution hints:   · (𝑥,𝑛)   𝑉(𝑥,𝑛)

Proof of Theorem mulgfvalg

Dummy variables 𝑤 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mulgval.t	. 2 ⊢ · = (.g‘𝐺)
2		df-mulg 12984	. . 3 ⊢ .g = (𝑤 ∈ V ↦ (𝑛 ∈ ℤ, 𝑥 ∈ (Base‘𝑤) ↦ if(𝑛 = 0, (0g‘𝑤), ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))))))
3		eqidd 2178	. . . 4 ⊢ (𝑤 = 𝐺 → ℤ = ℤ)
4		fveq2 5516	. . . . 5 ⊢ (𝑤 = 𝐺 → (Base‘𝑤) = (Base‘𝐺))
5		mulgval.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
6	4, 5	eqtr4di 2228	. . . 4 ⊢ (𝑤 = 𝐺 → (Base‘𝑤) = 𝐵)
7		fveq2 5516	. . . . . 6 ⊢ (𝑤 = 𝐺 → (0g‘𝑤) = (0g‘𝐺))
8		mulgval.o	. . . . . 6 ⊢ 0 = (0g‘𝐺)
9	7, 8	eqtr4di 2228	. . . . 5 ⊢ (𝑤 = 𝐺 → (0g‘𝑤) = 0 )
10		seqex 10447	. . . . . . 7 ⊢ seq1((+g‘𝑤), (ℕ × {𝑥})) ∈ V
11	10	a1i 9	. . . . . 6 ⊢ (𝑤 = 𝐺 → seq1((+g‘𝑤), (ℕ × {𝑥})) ∈ V)
12		id 19	. . . . . . . . 9 ⊢ (𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥})) → 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥})))
13		fveq2 5516	. . . . . . . . . . 11 ⊢ (𝑤 = 𝐺 → (+g‘𝑤) = (+g‘𝐺))
14		mulgval.p	. . . . . . . . . . 11 ⊢ + = (+g‘𝐺)
15	13, 14	eqtr4di 2228	. . . . . . . . . 10 ⊢ (𝑤 = 𝐺 → (+g‘𝑤) = + )
16	15	seqeq2d 10452	. . . . . . . . 9 ⊢ (𝑤 = 𝐺 → seq1((+g‘𝑤), (ℕ × {𝑥})) = seq1( + , (ℕ × {𝑥})))
17	12, 16	sylan9eqr 2232	. . . . . . . 8 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → 𝑠 = seq1( + , (ℕ × {𝑥})))
18	17	fveq1d 5518	. . . . . . 7 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (𝑠‘𝑛) = (seq1( + , (ℕ × {𝑥}))‘𝑛))
19		simpl 109	. . . . . . . . . 10 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → 𝑤 = 𝐺)
20	19	fveq2d 5520	. . . . . . . . 9 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (invg‘𝑤) = (invg‘𝐺))
21		mulgval.i	. . . . . . . . 9 ⊢ 𝐼 = (invg‘𝐺)
22	20, 21	eqtr4di 2228	. . . . . . . 8 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (invg‘𝑤) = 𝐼)
23	17	fveq1d 5518	. . . . . . . 8 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (𝑠‘-𝑛) = (seq1( + , (ℕ × {𝑥}))‘-𝑛))
24	22, 23	fveq12d 5523	. . . . . . 7 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → ((invg‘𝑤)‘(𝑠‘-𝑛)) = (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))
25	18, 24	ifeq12d 3554	. . . . . 6 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))) = if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))
26	11, 25	csbied 3104	. . . . 5 ⊢ (𝑤 = 𝐺 → ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))) = if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))
27	9, 26	ifeq12d 3554	. . . 4 ⊢ (𝑤 = 𝐺 → if(𝑛 = 0, (0g‘𝑤), ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛)))) = if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))))
28	3, 6, 27	mpoeq123dv 5937	. . 3 ⊢ (𝑤 = 𝐺 → (𝑛 ∈ ℤ, 𝑥 ∈ (Base‘𝑤) ↦ if(𝑛 = 0, (0g‘𝑤), ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))))) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))))
29		elex 2749	. . 3 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
30		zex 9262	. . . 4 ⊢ ℤ ∈ V
31		basfn 12520	. . . . . 6 ⊢ Base Fn V
32		funfvex 5533	. . . . . . 7 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
33	32	funfni 5317	. . . . . 6 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
34	31, 29, 33	sylancr 414	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → (Base‘𝐺) ∈ V)
35	5, 34	eqeltrid 2264	. . . 4 ⊢ (𝐺 ∈ 𝑉 → 𝐵 ∈ V)
36		mpoexga 6213	. . . 4 ⊢ ((ℤ ∈ V ∧ 𝐵 ∈ V) → (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) ∈ V)
37	30, 35, 36	sylancr 414	. . 3 ⊢ (𝐺 ∈ 𝑉 → (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) ∈ V)
38	2, 28, 29, 37	fvmptd3 5610	. 2 ⊢ (𝐺 ∈ 𝑉 → (.g‘𝐺) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))))
39	1, 38	eqtrid 2222	1 ⊢ (𝐺 ∈ 𝑉 → · = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353   ∈ wcel 2148  Vcvv 2738  ⦋csb 3058  ifcif 3535  {csn 3593   class class class wbr 4004   × cxp 4625   Fn wfn 5212  ‘cfv 5217   ∈ cmpo 5877  0cc0 7811  1c1 7812   < clt 7992  -cneg 8129  ℕcn 8919  ℤcz 9253  seqcseq 10445  Basecbs 12462  +_gcplusg 12536  0_gc0g 12705  inv_gcminusg 12878  ._gcmg 12983

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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4119  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-iinf 4588  ax-cnex 7902  ax-resscn 7903  ax-1re 7905  ax-addrcl 7908

This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-un 3134  df-in 3136  df-ss 3143  df-if 3536  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-iun 3889  df-br 4005  df-opab 4066  df-mpt 4067  df-tr 4103  df-id 4294  df-iord 4367  df-on 4369  df-iom 4591  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-ov 5878  df-oprab 5879  df-mpo 5880  df-1st 6141  df-2nd 6142  df-recs 6306  df-frec 6392  df-neg 8131  df-inn 8920  df-z 9254  df-seqfrec 10446  df-ndx 12465  df-slot 12466  df-base 12468  df-mulg 12984

This theorem is referenced by:  mulgval  12986  mulgfng  12987  mulgpropdg  13025