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 19051

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 1197	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝐴 ∈ 𝐼)
4		pwsmulg.y	. . . . 5 ⊢ 𝑌 = (𝑅 ↑_s 𝐼)
5		pwsmulg.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
6	4, 5	pwspjmhm 18757	. . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅))
7	1, 2, 3, 6	syl3anc 1373	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅))
8		simpr1 1195	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑁 ∈ ℕ₀)
9		simpr2 1196	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑋 ∈ 𝐵)
10		pwsmulg.s	. . . 4 ⊢ ∙ = (._g‘𝑌)
11		pwsmulg.t	. . . 4 ⊢ · = (._g‘𝑅)
12	5, 10, 11	mhmmulg 19047	. . 3 ⊢ (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅) ∧ 𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)))
13	7, 8, 9, 12	syl3anc 1373	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)))
14	4	pwsmnd 18699	. . . . 5 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → 𝑌 ∈ Mnd)
15	14	adantr 480	. . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → 𝑌 ∈ Mnd)
16	5, 10, 15, 8, 9	mulgnn0cld 19027	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑁 ∙ 𝑋) ∈ 𝐵)
17		fveq1 6857	. . . 4 ⊢ (𝑥 = (𝑁 ∙ 𝑋) → (𝑥‘𝐴) = ((𝑁 ∙ 𝑋)‘𝐴))
18		eqid 2729	. . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) = (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))
19		fvex 6871	. . . 4 ⊢ ((𝑁 ∙ 𝑋)‘𝐴) ∈ V
20	17, 18, 19	fvmpt 6968	. . 3 ⊢ ((𝑁 ∙ 𝑋) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = ((𝑁 ∙ 𝑋)‘𝐴))
21	16, 20	syl 17	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑁 ∙ 𝑋)) = ((𝑁 ∙ 𝑋)‘𝐴))
22		fveq1 6857	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥‘𝐴) = (𝑋‘𝐴))
23		fvex 6871	. . . . 5 ⊢ (𝑋‘𝐴) ∈ V
24	22, 18, 23	fvmpt 6968	. . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋) = (𝑋‘𝐴))
25	9, 24	syl 17	. . 3 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋) = (𝑋‘𝐴))
26	25	oveq2d 7403	. 2 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → (𝑁 · ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑋)) = (𝑁 · (𝑋‘𝐴)))
27	13, 21, 26	3eqtr3d 2772	1 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ (𝑁 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐼)) → ((𝑁 ∙ 𝑋)‘𝐴) = (𝑁 · (𝑋‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ↦ cmpt 5188 ‘cfv 6511 (class class class)co 7387 ℕ₀cn0 12442 Basecbs 17179 ↑_s cpws 17409 Mndcmnd 18661 MndHom cmhm 18708 ._gcmg 18999

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-map 8801 df-ixp 8871 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-sup 9393 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-7 12254 df-8 12255 df-9 12256 df-n0 12443 df-z 12530 df-dec 12650 df-uz 12794 df-fz 13469 df-seq 13967 df-struct 17117 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-hom 17244 df-cco 17245 df-0g 17404 df-prds 17410 df-pws 17412 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-mhm 18710 df-mulg 19000

This theorem is referenced by: evl1expd 22232

W3C validator