cayhamlem2 - Metamath Proof Explorer

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

Theorem cayhamlem2 21753

Description: Lemma for cayhamlem3 21756. (Contributed by AV, 24-Nov-2019.)

**Hypotheses**
Ref	Expression
cayhamlem2.k	⊢ 𝐾 = (Base‘𝑅)
cayhamlem2.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
cayhamlem2.b	⊢ 𝐵 = (Base‘𝐴)
cayhamlem2.1	⊢ 1 = (1_r‘𝐴)
cayhamlem2.m	⊢ ∗ = ( ·_𝑠 ‘𝐴)
cayhamlem2.e	⊢ ↑ = (._g‘(mulGrp‘𝐴))
cayhamlem2.r	⊢ · = (._r‘𝐴)

**Assertion**
Ref	Expression
cayhamlem2	⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → ((𝐻‘𝐿) ∗ (𝐿 ↑ 𝑀)) = ((𝐿 ↑ 𝑀) · ((𝐻‘𝐿) ∗ 1 )))

**Proof of Theorem cayhamlem2**
Step	Hyp	Ref	Expression
1		elmapi 8519	. . . . . . . 8 ⊢ (𝐻 ∈ (𝐾 ↑_m ℕ₀) → 𝐻:ℕ₀⟶𝐾)
2	1	ffvelrnda 6893	. . . . . . 7 ⊢ ((𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀) → (𝐻‘𝐿) ∈ 𝐾)
3	2	adantl 485	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → (𝐻‘𝐿) ∈ 𝐾)
4		cayhamlem2.k	. . . . . . . . 9 ⊢ 𝐾 = (Base‘𝑅)
5		cayhamlem2.a	. . . . . . . . . . . 12 ⊢ 𝐴 = (𝑁 Mat 𝑅)
6	5	matsca2 21289	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑅 = (Scalar‘𝐴))
7	6	3adant3 1134	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝑅 = (Scalar‘𝐴))
8	7	fveq2d 6710	. . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (Base‘𝑅) = (Base‘(Scalar‘𝐴)))
9	4, 8	eqtr2id 2787	. . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (Base‘(Scalar‘𝐴)) = 𝐾)
10	9	eleq2d 2819	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ((𝐻‘𝐿) ∈ (Base‘(Scalar‘𝐴)) ↔ (𝐻‘𝐿) ∈ 𝐾))
11	10	adantr 484	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → ((𝐻‘𝐿) ∈ (Base‘(Scalar‘𝐴)) ↔ (𝐻‘𝐿) ∈ 𝐾))
12	3, 11	mpbird 260	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → (𝐻‘𝐿) ∈ (Base‘(Scalar‘𝐴)))
13		eqid 2734	. . . . . 6 ⊢ (algSc‘𝐴) = (algSc‘𝐴)
14		eqid 2734	. . . . . 6 ⊢ (Scalar‘𝐴) = (Scalar‘𝐴)
15		eqid 2734	. . . . . 6 ⊢ (Base‘(Scalar‘𝐴)) = (Base‘(Scalar‘𝐴))
16		cayhamlem2.m	. . . . . 6 ⊢ ∗ = ( ·_𝑠 ‘𝐴)
17		cayhamlem2.1	. . . . . 6 ⊢ 1 = (1_r‘𝐴)
18	13, 14, 15, 16, 17	asclval 20811	. . . . 5 ⊢ ((𝐻‘𝐿) ∈ (Base‘(Scalar‘𝐴)) → ((algSc‘𝐴)‘(𝐻‘𝐿)) = ((𝐻‘𝐿) ∗ 1 ))
19	12, 18	syl 17	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → ((algSc‘𝐴)‘(𝐻‘𝐿)) = ((𝐻‘𝐿) ∗ 1 ))
20	19	eqcomd 2740	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → ((𝐻‘𝐿) ∗ 1 ) = ((algSc‘𝐴)‘(𝐻‘𝐿)))
21	20	oveq2d 7218	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → ((𝐿 ↑ 𝑀) · ((𝐻‘𝐿) ∗ 1 )) = ((𝐿 ↑ 𝑀) · ((algSc‘𝐴)‘(𝐻‘𝐿))))
22	5	matassa 21313	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝐴 ∈ AssAlg)
23	22	3adant3 1134	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝐴 ∈ AssAlg)
24	23	adantr 484	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → 𝐴 ∈ AssAlg)
25		crngring 19546	. . . . . . . 8 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
26	25	anim2i 620	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring))
27	26	3adant3 1134	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring))
28	5	matring 21312	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
29		eqid 2734	. . . . . . 7 ⊢ (mulGrp‘𝐴) = (mulGrp‘𝐴)
30	29	ringmgp 19540	. . . . . 6 ⊢ (𝐴 ∈ Ring → (mulGrp‘𝐴) ∈ Mnd)
31	27, 28, 30	3syl 18	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (mulGrp‘𝐴) ∈ Mnd)
32	31	adantr 484	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → (mulGrp‘𝐴) ∈ Mnd)
33		simprr 773	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → 𝐿 ∈ ℕ₀)
34		simpl3 1195	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → 𝑀 ∈ 𝐵)
35		cayhamlem2.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
36	29, 35	mgpbas 19482	. . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝐴))
37		cayhamlem2.e	. . . . 5 ⊢ ↑ = (._g‘(mulGrp‘𝐴))
38	36, 37	mulgnn0cl 18480	. . . 4 ⊢ (((mulGrp‘𝐴) ∈ Mnd ∧ 𝐿 ∈ ℕ₀ ∧ 𝑀 ∈ 𝐵) → (𝐿 ↑ 𝑀) ∈ 𝐵)
39	32, 33, 34, 38	syl3anc 1373	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → (𝐿 ↑ 𝑀) ∈ 𝐵)
40		cayhamlem2.r	. . . 4 ⊢ · = (._r‘𝐴)
41	13, 14, 15, 35, 40, 16	asclmul2 20818	. . 3 ⊢ ((𝐴 ∈ AssAlg ∧ (𝐻‘𝐿) ∈ (Base‘(Scalar‘𝐴)) ∧ (𝐿 ↑ 𝑀) ∈ 𝐵) → ((𝐿 ↑ 𝑀) · ((algSc‘𝐴)‘(𝐻‘𝐿))) = ((𝐻‘𝐿) ∗ (𝐿 ↑ 𝑀)))
42	24, 12, 39, 41	syl3anc 1373	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → ((𝐿 ↑ 𝑀) · ((algSc‘𝐴)‘(𝐻‘𝐿))) = ((𝐻‘𝐿) ∗ (𝐿 ↑ 𝑀)))
43	21, 42	eqtr2d 2775	1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ (𝐻 ∈ (𝐾 ↑_m ℕ₀) ∧ 𝐿 ∈ ℕ₀)) → ((𝐻‘𝐿) ∗ (𝐿 ↑ 𝑀)) = ((𝐿 ↑ 𝑀) · ((𝐻‘𝐿) ∗ 1 )))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ‘cfv 6369 (class class class)co 7202 ↑_m cmap 8497 Fincfn 8615 ℕ₀cn0 12073 Basecbs 16684 ._rcmulr 16768 Scalarcsca 16770 ·_𝑠 cvsca 16771 Mndcmnd 18145 ._gcmg 18460 mulGrpcmgp 19476 1_rcur 19488 Ringcrg 19534 CRingccrg 19535 AssAlgcasa 20784 algSccascl 20786 Mat cmat 21276

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-ot 4540 df-uni 4810 df-int 4850 df-iun 4896 df-iin 4897 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-se 5499 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-isom 6378 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-of 7458 df-om 7634 df-1st 7750 df-2nd 7751 df-supp 7893 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-er 8380 df-map 8499 df-ixp 8568 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-fsupp 8975 df-sup 9047 df-oi 9115 df-card 9538 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-nn 11814 df-2 11876 df-3 11877 df-4 11878 df-5 11879 df-6 11880 df-7 11881 df-8 11882 df-9 11883 df-n0 12074 df-z 12160 df-dec 12277 df-uz 12422 df-fz 13079 df-fzo 13222 df-seq 13558 df-hash 13880 df-struct 16686 df-ndx 16687 df-slot 16688 df-base 16690 df-sets 16691 df-ress 16692 df-plusg 16780 df-mulr 16781 df-sca 16783 df-vsca 16784 df-ip 16785 df-tset 16786 df-ple 16787 df-ds 16789 df-hom 16791 df-cco 16792 df-0g 16918 df-gsum 16919 df-prds 16924 df-pws 16926 df-mre 17061 df-mrc 17062 df-acs 17064 df-mgm 18086 df-sgrp 18135 df-mnd 18146 df-mhm 18190 df-submnd 18191 df-grp 18340 df-minusg 18341 df-sbg 18342 df-mulg 18461 df-subg 18512 df-ghm 18592 df-cntz 18683 df-cmn 19144 df-abl 19145 df-mgp 19477 df-ur 19489 df-ring 19536 df-cring 19537 df-subrg 19770 df-lmod 19873 df-lss 19941 df-sra 20181 df-rgmod 20182 df-dsmm 20666 df-frlm 20681 df-assa 20787 df-ascl 20789 df-mamu 21255 df-mat 21277

This theorem is referenced by: cayhamlem3 21756

W3C validator