cpmatinvcl - Metamath Proof Explorer

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

Theorem cpmatinvcl 22210

Description: The set of all constant polynomial matrices over a ring 𝑅 is closed under inversion. (Contributed by AV, 17-Nov-2019.) (Proof shortened by AV, 28-Nov-2019.)

**Hypotheses**
Ref	Expression
cpmatsrngpmat.s	⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)
cpmatsrngpmat.p	⊢ 𝑃 = (Poly₁‘𝑅)
cpmatsrngpmat.c	⊢ 𝐶 = (𝑁 Mat 𝑃)

**Assertion**
Ref	Expression
cpmatinvcl	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ∀𝑥 ∈ 𝑆 ((inv_g‘𝐶)‘𝑥) ∈ 𝑆)

Distinct variable groups: 𝑥,𝑁 𝑥,𝑅 Allowed substitution hints: 𝐶(𝑥) 𝑃(𝑥) 𝑆(𝑥)

Proof of Theorem cpmatinvcl Dummy variables 𝑖 𝑗 𝑎 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cpmatsrngpmat.s	. . . . . 6 ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)
2		cpmatsrngpmat.p	. . . . . 6 ⊢ 𝑃 = (Poly₁‘𝑅)
3		cpmatsrngpmat.c	. . . . . 6 ⊢ 𝐶 = (𝑁 Mat 𝑃)
4		eqid 2732	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
5		eqid 2732	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
6		eqid 2732	. . . . . 6 ⊢ (algSc‘𝑃) = (algSc‘𝑃)
7	1, 2, 3, 4, 5, 6	cpmatelimp2 22207	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑥 ∈ 𝑆 → (𝑥 ∈ (Base‘𝐶) ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑎 ∈ (Base‘𝑅)(𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎))))
8	2	ply1sca 21766	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 ∈ Ring → 𝑅 = (Scalar‘𝑃))
9	8	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑅 = (Scalar‘𝑃))
10	9	adantr 481	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑎 ∈ (Base‘𝑅)) → 𝑅 = (Scalar‘𝑃))
11	10	eqcomd 2738	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑎 ∈ (Base‘𝑅)) → (Scalar‘𝑃) = 𝑅)
12	11	fveq2d 6892	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑎 ∈ (Base‘𝑅)) → (inv_g‘(Scalar‘𝑃)) = (inv_g‘𝑅))
13	12	fveq1d 6890	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑎 ∈ (Base‘𝑅)) → ((inv_g‘(Scalar‘𝑃))‘𝑎) = ((inv_g‘𝑅)‘𝑎))
14		ringgrp 20054	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp)
15	14	adantl 482	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑅 ∈ Grp)
16		eqid 2732	. . . . . . . . . . . . 13 ⊢ (inv_g‘𝑅) = (inv_g‘𝑅)
17	5, 16	grpinvcl 18868	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ Grp ∧ 𝑎 ∈ (Base‘𝑅)) → ((inv_g‘𝑅)‘𝑎) ∈ (Base‘𝑅))
18	15, 17	sylan 580	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑎 ∈ (Base‘𝑅)) → ((inv_g‘𝑅)‘𝑎) ∈ (Base‘𝑅))
19	13, 18	eqeltrd 2833	. . . . . . . . . 10 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑎 ∈ (Base‘𝑅)) → ((inv_g‘(Scalar‘𝑃))‘𝑎) ∈ (Base‘𝑅))
20	19	ad5ant14 756	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ (𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) → ((inv_g‘(Scalar‘𝑃))‘𝑎) ∈ (Base‘𝑅))
21		fveq2 6888	. . . . . . . . . . 11 ⊢ (𝑐 = ((inv_g‘(Scalar‘𝑃))‘𝑎) → ((algSc‘𝑃)‘𝑐) = ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎)))
22	21	eqeq2d 2743	. . . . . . . . . 10 ⊢ (𝑐 = ((inv_g‘(Scalar‘𝑃))‘𝑎) → ((𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐) ↔ (𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎))))
23	22	adantl 482	. . . . . . . . 9 ⊢ (((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ (𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) ∧ 𝑐 = ((inv_g‘(Scalar‘𝑃))‘𝑎)) → ((𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐) ↔ (𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎))))
24	2	ply1ring 21761	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring)
25	24	ad3antlr 729	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑃 ∈ Ring)
26		simplr 767	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑥 ∈ (Base‘𝐶))
27		simpr 485	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))
28	25, 26, 27	3jca 1128	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑃 ∈ Ring ∧ 𝑥 ∈ (Base‘𝐶) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)))
29	28	ad2antrr 724	. . . . . . . . . . 11 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ (𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) → (𝑃 ∈ Ring ∧ 𝑥 ∈ (Base‘𝐶) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)))
30		eqid 2732	. . . . . . . . . . . 12 ⊢ (inv_g‘𝑃) = (inv_g‘𝑃)
31		eqid 2732	. . . . . . . . . . . 12 ⊢ (inv_g‘𝐶) = (inv_g‘𝐶)
32	3, 4, 30, 31	matinvgcell 21928	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ Ring ∧ 𝑥 ∈ (Base‘𝐶) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((inv_g‘𝑃)‘(𝑖𝑥𝑗)))
33	29, 32	syl 17	. . . . . . . . . 10 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ (𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) → (𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((inv_g‘𝑃)‘(𝑖𝑥𝑗)))
34		fveq2 6888	. . . . . . . . . . 11 ⊢ ((𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎) → ((inv_g‘𝑃)‘(𝑖𝑥𝑗)) = ((inv_g‘𝑃)‘((algSc‘𝑃)‘𝑎)))
35		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (Scalar‘𝑃) = (Scalar‘𝑃)
36	25	adantr 481	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) → 𝑃 ∈ Ring)
37	2	ply1lmod 21765	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ LMod)
38	37	ad3antlr 729	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑃 ∈ LMod)
39	38	adantr 481	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) → 𝑃 ∈ LMod)
40	6, 35, 36, 39	asclghm 21428	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) → (algSc‘𝑃) ∈ ((Scalar‘𝑃) GrpHom 𝑃))
41	9	fveq2d 6892	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (Base‘𝑅) = (Base‘(Scalar‘𝑃)))
42	41	eleq2d 2819	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑎 ∈ (Base‘𝑅) ↔ 𝑎 ∈ (Base‘(Scalar‘𝑃))))
43	42	biimpd 228	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑎 ∈ (Base‘𝑅) → 𝑎 ∈ (Base‘(Scalar‘𝑃))))
44	43	ad2antrr 724	. . . . . . . . . . . . . 14 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑎 ∈ (Base‘𝑅) → 𝑎 ∈ (Base‘(Scalar‘𝑃))))
45	44	imp 407	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) → 𝑎 ∈ (Base‘(Scalar‘𝑃)))
46		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (Base‘(Scalar‘𝑃)) = (Base‘(Scalar‘𝑃))
47		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (inv_g‘(Scalar‘𝑃)) = (inv_g‘(Scalar‘𝑃))
48	46, 47, 30	ghminv 19093	. . . . . . . . . . . . 13 ⊢ (((algSc‘𝑃) ∈ ((Scalar‘𝑃) GrpHom 𝑃) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑃))) → ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎)) = ((inv_g‘𝑃)‘((algSc‘𝑃)‘𝑎)))
49	40, 45, 48	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) → ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎)) = ((inv_g‘𝑃)‘((algSc‘𝑃)‘𝑎)))
50	49	eqcomd 2738	. . . . . . . . . . 11 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) → ((inv_g‘𝑃)‘((algSc‘𝑃)‘𝑎)) = ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎)))
51	34, 50	sylan9eqr 2794	. . . . . . . . . 10 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ (𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) → ((inv_g‘𝑃)‘(𝑖𝑥𝑗)) = ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎)))
52	33, 51	eqtrd 2772	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ (𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) → (𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘((inv_g‘(Scalar‘𝑃))‘𝑎)))
53	20, 23, 52	rspcedvd 3614	. . . . . . . 8 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ (𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) → ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐))
54	53	rexlimdva2 3157	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (∃𝑎 ∈ (Base‘𝑅)(𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎) → ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐)))
55	54	ralimdvva 3204	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ (Base‘𝐶)) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑎 ∈ (Base‘𝑅)(𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎) → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐)))
56	55	expimpd 454	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ((𝑥 ∈ (Base‘𝐶) ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑎 ∈ (Base‘𝑅)(𝑖𝑥𝑗) = ((algSc‘𝑃)‘𝑎)) → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐)))
57	7, 56	syld 47	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑥 ∈ 𝑆 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐)))
58	57	imp 407	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐))
59		simpll 765	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → 𝑁 ∈ Fin)
60		simplr 767	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → 𝑅 ∈ Ring)
61	2, 3	pmatring 22185	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐶 ∈ Ring)
62		ringgrp 20054	. . . . . . 7 ⊢ (𝐶 ∈ Ring → 𝐶 ∈ Grp)
63	61, 62	syl 17	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐶 ∈ Grp)
64	63	adantr 481	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → 𝐶 ∈ Grp)
65	1, 2, 3, 4	cpmatpmat 22203	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐶))
66	65	3expa 1118	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐶))
67	4, 31	grpinvcl 18868	. . . . 5 ⊢ ((𝐶 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐶)) → ((inv_g‘𝐶)‘𝑥) ∈ (Base‘𝐶))
68	64, 66, 67	syl2anc 584	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → ((inv_g‘𝐶)‘𝑥) ∈ (Base‘𝐶))
69	1, 2, 3, 4, 5, 6	cpmatel2 22206	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ ((inv_g‘𝐶)‘𝑥) ∈ (Base‘𝐶)) → (((inv_g‘𝐶)‘𝑥) ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐)))
70	59, 60, 68, 69	syl3anc 1371	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → (((inv_g‘𝐶)‘𝑥) ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∃𝑐 ∈ (Base‘𝑅)(𝑖((inv_g‘𝐶)‘𝑥)𝑗) = ((algSc‘𝑃)‘𝑐)))
71	58, 70	mpbird 256	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑥 ∈ 𝑆) → ((inv_g‘𝐶)‘𝑥) ∈ 𝑆)
72	71	ralrimiva 3146	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ∀𝑥 ∈ 𝑆 ((inv_g‘𝐶)‘𝑥) ∈ 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ‘cfv 6540 (class class class)co 7405 Fincfn 8935 Basecbs 17140 Scalarcsca 17196 Grpcgrp 18815 inv_gcminusg 18816 GrpHom cghm 19083 Ringcrg 20049 LModclmod 20463 algSccascl 21398 Poly₁cpl1 21692 Mat cmat 21898 ConstPolyMat ccpmat 22196

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-ot 4636 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7666 df-ofr 7667 df-om 7852 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-pm 8819 df-ixp 8888 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-sup 9433 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-fz 13481 df-fzo 13624 df-seq 13963 df-hash 14287 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-sca 17209 df-vsca 17210 df-ip 17211 df-tset 17212 df-ple 17213 df-ds 17215 df-hom 17217 df-cco 17218 df-0g 17383 df-gsum 17384 df-prds 17389 df-pws 17391 df-mre 17526 df-mrc 17527 df-acs 17529 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-mhm 18667 df-submnd 18668 df-grp 18818 df-minusg 18819 df-sbg 18820 df-mulg 18945 df-subg 18997 df-ghm 19084 df-cntz 19175 df-cmn 19644 df-abl 19645 df-mgp 19982 df-ur 19999 df-srg 20003 df-ring 20051 df-subrg 20353 df-lmod 20465 df-lss 20535 df-sra 20777 df-rgmod 20778 df-dsmm 21278 df-frlm 21293 df-ascl 21401 df-psr 21453 df-mvr 21454 df-mpl 21455 df-opsr 21457 df-psr1 21695 df-vr1 21696 df-ply1 21697 df-coe1 21698 df-mamu 21877 df-mat 21899 df-cpmat 22199

This theorem is referenced by: cpmatsubgpmat 22213

W3C validator