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 19159

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 766	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑅 ∈ Mnd)
2		simplr 768	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝐼 ∈ 𝑉)
3		simpr3 1196	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝐴 ∈ 𝐼)
4		pwsmulg.y	. . . . 5 ⊢ 𝑌 = (𝑅 ↑_s 𝐼)
5		pwsmulg.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
6	4, 5	pwspjmhm 18865	. . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅))
7	1, 2, 3, 6	syl3anc 1371	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅))
8		simpr1 1194	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑁 ∈ ℕ₀)
9		simpr2 1195	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑋 ∈ 𝐵)
10		pwsmulg.s	. . . 4 ⊢ ∙ = (._g‘𝑌)
11		pwsmulg.t	. . . 4 ⊢ · = (._g‘𝑅)
12	5, 10, 11	mhmmulg 19155	. . 3 ⊢ (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅) ∧ 𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)))
13	7, 8, 9, 12	syl3anc 1371	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)))
14	4	pwsmnd 18807	. . . . 5 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → 𝑌 ∈ Mnd)
15	14	adantr 480	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑌 ∈ Mnd)
16	5, 10, 15, 8, 9	mulgnn0cld 19135	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑁 ∙ 𝑋) ∈ 𝐵)
17		fveq1 6919	. . . 4 ⊢ (𝑥 = (𝑁 ∙ 𝑋) → (𝑥‘𝐴) = ((𝑁 ∙ 𝑋)‘𝐴))
18		eqid 2740	. . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) = (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))
19		fvex 6933	. . . 4 ⊢ ((𝑁 ∙ 𝑋)‘𝐴) ∈ V
20	17, 18, 19	fvmpt 7029	. . 3 ⊢ ((𝑁 ∙ 𝑋) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = ((𝑁 ∙ 𝑋)‘𝐴))
21	16, 20	syl 17	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = ((𝑁 ∙ 𝑋)‘𝐴))
22		fveq1 6919	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥‘𝐴) = (𝑋‘𝐴))
23		fvex 6933	. . . . 5 ⊢ (𝑋‘𝐴) ∈ V
24	22, 18, 23	fvmpt 7029	. . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋) = (𝑋‘𝐴))
25	9, 24	syl 17	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋) = (𝑋‘𝐴))
26	25	oveq2d 7464	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)) = (𝑁 · (𝑋‘𝐴)))
27	13, 21, 26	3eqtr3d 2788	1 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑁 ∙ 𝑋)‘𝐴) = (𝑁 · (𝑋‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ↦ cmpt 5249 ‘cfv 6573 (class class class)co 7448 ℕ₀cn0 12553 Basecbs 17258 ↑_s cpws 17506 Mndcmnd 18772 MndHom cmhm 18816 ._gcmg 19107

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-er 8763 df-map 8886 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-sup 9511 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-fz 13568 df-seq 14053 df-struct 17194 df-slot 17229 df-ndx 17241 df-base 17259 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-hom 17335 df-cco 17336 df-0g 17501 df-prds 17507 df-pws 17509 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-mhm 18818 df-mulg 19108

This theorem is referenced by: evl1expd 22370

W3C validator