Metamath Proof Explorer


Theorem elrgspn

Description: Membership in the subring generated by the subset A . An element X lies in that subring if and only if X is a linear combination with integer coefficients of products of elements of A . (Contributed by Thierry Arnoux, 5-Oct-2025)

Ref Expression
Hypotheses elrgspn.b B = Base R
elrgspn.m M = mulGrp R
elrgspn.x · ˙ = R
elrgspn.n N = RingSpan R
elrgspn.f F = f Word A | finSupp 0 f
elrgspn.r φ R Ring
elrgspn.a φ A B
Assertion elrgspn φ X N A g F X = R w Word A g w · ˙ M w

Proof

Step Hyp Ref Expression
1 elrgspn.b B = Base R
2 elrgspn.m M = mulGrp R
3 elrgspn.x · ˙ = R
4 elrgspn.n N = RingSpan R
5 elrgspn.f F = f Word A | finSupp 0 f
6 elrgspn.r φ R Ring
7 elrgspn.a φ A B
8 1 a1i φ B = Base R
9 4 a1i φ N = RingSpan R
10 eqidd φ N A = N A
11 6 8 7 9 10 rgspncl φ N A SubRing R
12 1 subrgss N A SubRing R N A B
13 11 12 syl φ N A B
14 13 sselda φ X N A X B
15 simpr φ g F X = R w Word A g w · ˙ M w X = R w Word A g w · ˙ M w
16 eqid 0 R = 0 R
17 6 ringcmnd φ R CMnd
18 17 adantr φ g F R CMnd
19 1 fvexi B V
20 19 a1i φ B V
21 20 7 ssexd φ A V
22 21 adantr φ g F A V
23 wrdexg A V Word A V
24 22 23 syl φ g F Word A V
25 6 ringgrpd φ R Grp
26 25 ad2antrr φ g F w Word A R Grp
27 breq1 f = g finSupp 0 f finSupp 0 g
28 27 5 elrab2 g F g Word A finSupp 0 g
29 28 biimpi g F g Word A finSupp 0 g
30 29 simpld g F g Word A
31 30 adantl φ g F g Word A
32 31 elmaprd φ g F g : Word A
33 32 ffvelcdmda φ g F w Word A g w
34 2 ringmgp R Ring M Mnd
35 6 34 syl φ M Mnd
36 35 ad2antrr φ g F w Word A M Mnd
37 sswrd A B Word A Word B
38 7 37 syl φ Word A Word B
39 38 adantr φ g F Word A Word B
40 39 sselda φ g F w Word A w Word B
41 2 1 mgpbas B = Base M
42 41 gsumwcl M Mnd w Word B M w B
43 36 40 42 syl2anc φ g F w Word A M w B
44 1 3 26 33 43 mulgcld φ g F w Word A g w · ˙ M w B
45 44 fmpttd φ g F w Word A g w · ˙ M w : Word A B
46 32 feqmptd φ g F g = w Word A g w
47 29 simprd g F finSupp 0 g
48 47 adantl φ g F finSupp 0 g
49 46 48 eqbrtrrd φ g F finSupp 0 w Word A g w
50 1 16 3 mulg0 y B 0 · ˙ y = 0 R
51 50 adantl φ g F y B 0 · ˙ y = 0 R
52 fvexd φ g F 0 R V
53 49 51 33 43 52 fsuppssov1 φ g F finSupp 0 R w Word A g w · ˙ M w
54 1 16 18 24 45 53 gsumcl φ g F R w Word A g w · ˙ M w B
55 54 adantr φ g F X = R w Word A g w · ˙ M w R w Word A g w · ˙ M w B
56 15 55 eqeltrd φ g F X = R w Word A g w · ˙ M w X B
57 56 r19.29an φ g F X = R w Word A g w · ˙ M w X B
58 6 adantr φ X B R Ring
59 7 adantr φ X B A B
60 fveq1 h = i h w = i w
61 60 oveq1d h = i h w · ˙ M w = i w · ˙ M w
62 61 mpteq2dv h = i w Word A h w · ˙ M w = w Word A i w · ˙ M w
63 fveq2 w = v i w = i v
64 oveq2 w = v M w = M v
65 63 64 oveq12d w = v i w · ˙ M w = i v · ˙ M v
66 65 cbvmptv w Word A i w · ˙ M w = v Word A i v · ˙ M v
67 62 66 eqtrdi h = i w Word A h w · ˙ M w = v Word A i v · ˙ M v
68 67 oveq2d h = i R w Word A h w · ˙ M w = R v Word A i v · ˙ M v
69 68 cbvmptv h F R w Word A h w · ˙ M w = i F R v Word A i v · ˙ M v
70 69 rneqi ran h F R w Word A h w · ˙ M w = ran i F R v Word A i v · ˙ M v
71 1 2 3 4 5 58 59 70 elrgspnlem4 φ X B N A = ran h F R w Word A h w · ˙ M w
72 71 eleq2d φ X B X N A X ran h F R w Word A h w · ˙ M w
73 fveq1 h = g h w = g w
74 73 oveq1d h = g h w · ˙ M w = g w · ˙ M w
75 74 mpteq2dv h = g w Word A h w · ˙ M w = w Word A g w · ˙ M w
76 75 oveq2d h = g R w Word A h w · ˙ M w = R w Word A g w · ˙ M w
77 76 cbvmptv h F R w Word A h w · ˙ M w = g F R w Word A g w · ˙ M w
78 77 elrnmpt X B X ran h F R w Word A h w · ˙ M w g F X = R w Word A g w · ˙ M w
79 78 adantl φ X B X ran h F R w Word A h w · ˙ M w g F X = R w Word A g w · ˙ M w
80 72 79 bitrd φ X B X N A g F X = R w Word A g w · ˙ M w
81 14 57 80 bibiad φ X N A g F X = R w Word A g w · ˙ M w