pwsmulg - Metamath Proof Explorer

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

Theorem pwsmulg 19150

Description: Value of a group multiple in a structure power. (Contributed by Mario Carneiro, 15-Jun-2015.)

**Hypotheses**
Ref	Expression
pwsmulg.y	⊢ 𝑌 = (𝑅 ↑_s 𝐼)
pwsmulg.b	⊢ 𝐵 = (Base‘𝑌)
pwsmulg.s	⊢ ∙ = (._g‘𝑌)
pwsmulg.t	⊢ · = (._g‘𝑅)

**Assertion**
Ref	Expression
pwsmulg	⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑁 ∙ 𝑋)‘𝐴) = (𝑁 · (𝑋‘𝐴)))

Proof of Theorem pwsmulg Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 767	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑅 ∈ Mnd)
2		simplr 769	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝐼 ∈ 𝑉)
3		simpr3 1195	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝐴 ∈ 𝐼)
4		pwsmulg.y	. . . . 5 ⊢ 𝑌 = (𝑅 ↑_s 𝐼)
5		pwsmulg.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
6	4, 5	pwspjmhm 18856	. . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅))
7	1, 2, 3, 6	syl3anc 1370	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅))
8		simpr1 1193	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑁 ∈ ℕ₀)
9		simpr2 1194	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑋 ∈ 𝐵)
10		pwsmulg.s	. . . 4 ⊢ ∙ = (._g‘𝑌)
11		pwsmulg.t	. . . 4 ⊢ · = (._g‘𝑅)
12	5, 10, 11	mhmmulg 19146	. . 3 ⊢ (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅) ∧ 𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)))
13	7, 8, 9, 12	syl3anc 1370	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)))
14	4	pwsmnd 18798	. . . . 5 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → 𝑌 ∈ Mnd)
15	14	adantr 480	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑌 ∈ Mnd)
16	5, 10, 15, 8, 9	mulgnn0cld 19126	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑁 ∙ 𝑋) ∈ 𝐵)
17		fveq1 6906	. . . 4 ⊢ (𝑥 = (𝑁 ∙ 𝑋) → (𝑥‘𝐴) = ((𝑁 ∙ 𝑋)‘𝐴))
18		eqid 2735	. . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) = (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))
19		fvex 6920	. . . 4 ⊢ ((𝑁 ∙ 𝑋)‘𝐴) ∈ V
20	17, 18, 19	fvmpt 7016	. . 3 ⊢ ((𝑁 ∙ 𝑋) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = ((𝑁 ∙ 𝑋)‘𝐴))
21	16, 20	syl 17	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = ((𝑁 ∙ 𝑋)‘𝐴))
22		fveq1 6906	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥‘𝐴) = (𝑋‘𝐴))
23		fvex 6920	. . . . 5 ⊢ (𝑋‘𝐴) ∈ V
24	22, 18, 23	fvmpt 7016	. . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋) = (𝑋‘𝐴))
25	9, 24	syl 17	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋) = (𝑋‘𝐴))
26	25	oveq2d 7447	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)) = (𝑁 · (𝑋‘𝐴)))
27	13, 21, 26	3eqtr3d 2783	1 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑁 ∙ 𝑋)‘𝐴) = (𝑁 · (𝑋‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ↦ cmpt 5231 ‘cfv 6563 (class class class)co 7431 ℕ₀cn0 12524 Basecbs 17245 ↑_s cpws 17493 Mndcmnd 18760 MndHom cmhm 18807 ._gcmg 19098

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-map 8867 df-ixp 8937 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9480 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-z 12612 df-dec 12732 df-uz 12877 df-fz 13545 df-seq 14040 df-struct 17181 df-slot 17216 df-ndx 17228 df-base 17246 df-plusg 17311 df-mulr 17312 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-hom 17322 df-cco 17323 df-0g 17488 df-prds 17494 df-pws 17496 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-mhm 18809 df-mulg 19099

This theorem is referenced by: evl1expd 22365

W3C validator