P. 422 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 42101-42200   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	fldcALTV 42101*	The restriction of the category of division rings to the set of field homomorphisms is a category, the "category of fields". (Contributed by AV, 20-Feb-2020.) (New usage is discouraged.)
|- C = ( U i^i DivRing )   &    |- J = ( r e. C , s e. C |-> ( r RingHom s ) )   &    |- D = ( U i^i Field )   &    |- F = ( r e. D , s e. D |-> ( r RingHom s ) )   =>    |- ( U e. V -> ( ( (RingCatALTV ` U ) |`cat J ) |`cat F ) e. Cat )
Theorem	fldhmsubcALTV 42102*	According to df-subc 16472, the subcategories (Subcat ` C ) of a category C are subsets of the homomorphisms of C ( see subcssc 16500 and subcss2 16503). Therefore, the set of field homomorphisms is a "subcategory" of the category of division rings. (Contributed by AV, 20-Feb-2020.) (New usage is discouraged.)
|- C = ( U i^i DivRing )   &    |- J = ( r e. C , s e. C |-> ( r RingHom s ) )   &    |- D = ( U i^i Field )   &    |- F = ( r e. D , s e. D |-> ( r RingHom s ) )   =>    |- ( U e. V -> F e. (Subcat ` ( (RingCatALTV ` U ) |`cat J ) ) )
Theorem	rngcrescrhmALTV 42103	The category of non-unital rings (in a universe) restricted to the ring homomorphisms between unital rings (in the same universe). (Contributed by AV, 1-Mar-2020.) (New usage is discouraged.)
|- ( ph -> U e. V )   &    |- C = (RngCatALTV ` U )   &    |- ( ph -> R = ( Ring i^i U ) )   &    |- H = ( RingHom |` ( R X. R ) )   =>    |- ( ph -> ( C |`cat H ) = ( ( C ↾s R ) sSet <. ( Hom ` ndx ) , H >. ) )
Theorem	rhmsubcALTVlem1 42104	Lemma 1 for rhmsubcALTV 42108. (Contributed by AV, 2-Mar-2020.) (New usage is discouraged.)
|- ( ph -> U e. V )   &    |- C = (RngCatALTV ` U )   &    |- ( ph -> R = ( Ring i^i U ) )   &    |- H = ( RingHom |` ( R X. R ) )   =>    |- ( ph -> H Fn ( R X. R ) )
Theorem	rhmsubcALTVlem2 42105	Lemma 2 for rhmsubcALTV 42108. (Contributed by AV, 2-Mar-2020.) (New usage is discouraged.)
|- ( ph -> U e. V )   &    |- C = (RngCatALTV ` U )   &    |- ( ph -> R = ( Ring i^i U ) )   &    |- H = ( RingHom |` ( R X. R ) )   =>    |- ( ( ph /\ X e. R /\ Y e. R ) -> ( X H Y ) = ( X RingHom Y ) )
Theorem	rhmsubcALTVlem3 42106*	Lemma 3 for rhmsubcALTV 42108. (Contributed by AV, 2-Mar-2020.) (New usage is discouraged.)
|- ( ph -> U e. V )   &    |- C = (RngCatALTV ` U )   &    |- ( ph -> R = ( Ring i^i U ) )   &    |- H = ( RingHom |` ( R X. R ) )   =>    |- ( ( ph /\ x e. R ) -> ( ( Id ` (RngCatALTV ` U ) ) ` x ) e. ( x H x ) )
Theorem	rhmsubcALTVlem4 42107*	Lemma 4 for rhmsubcALTV 42108. (Contributed by AV, 2-Mar-2020.) (New usage is discouraged.)
|- ( ph -> U e. V )   &    |- C = (RngCatALTV ` U )   &    |- ( ph -> R = ( Ring i^i U ) )   &    |- H = ( RingHom |` ( R X. R ) )   =>    |- ( ( ( ( ph /\ x e. R ) /\ ( y e. R /\ z e. R ) ) /\ ( f e. ( x H y ) /\ g e. ( y H z ) ) ) -> ( g ( <. x , y >. (comp ` (RngCatALTV ` U ) ) z ) f ) e. ( x H z ) )
Theorem	rhmsubcALTV 42108	According to df-subc 16472, the subcategories (Subcat ` C ) of a category C are subsets of the homomorphisms of C ( see subcssc 16500 and subcss2 16503). Therefore, the set of unital ring homomorphisms is a "subcategory" of the category of non-unital rings. (Contributed by AV, 2-Mar-2020.) (New usage is discouraged.)
|- ( ph -> U e. V )   &    |- C = (RngCatALTV ` U )   &    |- ( ph -> R = ( Ring i^i U ) )   &    |- H = ( RingHom |` ( R X. R ) )   =>    |- ( ph -> H e. (Subcat ` (RngCatALTV ` U ) ) )
Theorem	rhmsubcALTVcat 42109	The restriction of the category of non-unital rings to the set of unital ring homomorphisms is a category. (Contributed by AV, 4-Mar-2020.) (New usage is discouraged.)
|- ( ph -> U e. V )   &    |- C = (RngCatALTV ` U )   &    |- ( ph -> R = ( Ring i^i U ) )   &    |- H = ( RingHom |` ( R X. R ) )   =>    |- ( ph -> ( (RngCatALTV ` U ) |`cat H ) e. Cat )
20.35.15  Basic algebraic structures (extension)
20.35.15.1  Auxiliary theorems
Theorem	xpprsng 42110	The Cartesian product of an unordered pair and a singleton. (Contributed by AV, 20-May-2019.)
|- ( ( A e. V /\ B e. W /\ C e. U ) -> ( { A , B } X. { C } ) = { <. A , C >. , <. B , C >. } )
Theorem	opeliun2xp 42111	Membership of an ordered pair in a union of Cartesian products over its second component, analogous to opeliunxp 5170. (Contributed by AV, 30-Mar-2019.)
|- ( <. C , y >. e. U_ y e. B ( A X. { y } ) <-> ( y e. B /\ C e. A ) )
Theorem	eliunxp2 42112*	Membership in a union of Cartesian products over its second component, analogous to eliunxp 5259. (Contributed by AV, 30-Mar-2019.)
|- ( C e. U_ y e. B ( A X. { y } ) <-> E. x E. y ( C = <. x , y >. /\ ( x e. A /\ y e. B ) ) )
Theorem	mpt2mptx2 42113*	Express a two-argument function as a one-argument function, or vice-versa. In this version A ( y ) is not assumed to be constant w.r.t y, analogous to mpt2mptx 6751. (Contributed by AV, 30-Mar-2019.)
|- ( z = <. x , y >. -> C = D )   =>    |- ( z e. U_ y e. B ( A X. { y } ) |-> C ) = ( x e. A , y e. B |-> D )
Theorem	cbvmpt2x2 42114*	Rule to change the bound variable in a maps-to function, using implicit substitution. This version of cbvmpt2 6734 allows A to be a function of y, analogous to cbvmpt2x 6733. (Contributed by AV, 30-Mar-2019.)
|- F/_ z A   &    |- F/_ y D   &    |- F/_ z C   &    |- F/_ w C   &    |- F/_ x E   &    |- F/_ y E   &    |- ( y = z -> A = D )   &    |- ( ( y = z /\ x = w ) -> C = E )   =>    |- ( x e. A , y e. B |-> C ) = ( w e. D , z e. B |-> E )
Theorem	dmmpt2ssx2 42115*	The domain of a mapping is a subset of its base classes expressed as union of Cartesian products over its second component, analogous to dmmpt2ssx 7235. (Contributed by AV, 30-Mar-2019.)
|- F = ( x e. A , y e. B |-> C )   =>    |- dom F C_ U_ y e. B ( A X. { y } )
Theorem	mpt2exxg2 42116*	Existence of an operation class abstraction (version for dependent domains, i.e. the first base class may depend on the second base class), analogous to mpt2exxg 7244. (Contributed by AV, 30-Mar-2019.)
|- F = ( x e. A , y e. B |-> C )   =>    |- ( ( B e. R /\ A. y e. B A e. S ) -> F e. _V )
Theorem	ovmpt2rdxf 42117*	Value of an operation given by a maps-to rule, deduction form, with substitution of second argument, analogous to ovmpt2dxf 6786. (Contributed by AV, 30-Mar-2019.)
|- ( ph -> F = ( x e. C , y e. D |-> R ) )   &    |- ( ( ph /\ ( x = A /\ y = B ) ) -> R = S )   &    |- ( ( ph /\ y = B ) -> C = L )   &    |- ( ph -> A e. L )   &    |- ( ph -> B e. D )   &    |- ( ph -> S e. X )   &    |- F/ x ph   &    |- F/ y ph   &    |- F/_ y A   &    |- F/_ x B   &    |- F/_ x S   &    |- F/_ y S   =>    |- ( ph -> ( A F B ) = S )
Theorem	ovmpt2rdx 42118*	Value of an operation given by a maps-to rule, deduction form, with substitution of second argument, analogous to ovmpt2dxf 6786. (Contributed by AV, 30-Mar-2019.)
|- ( ph -> F = ( x e. C , y e. D |-> R ) )   &    |- ( ( ph /\ ( x = A /\ y = B ) ) -> R = S )   &    |- ( ( ph /\ y = B ) -> C = L )   &    |- ( ph -> A e. L )   &    |- ( ph -> B e. D )   &    |- ( ph -> S e. X )   =>    |- ( ph -> ( A F B ) = S )
Theorem	ovmpt2x2 42119*	The value of an operation class abstraction. Variant of ovmpt2ga 6790 which does not require D and x to be distinct. (Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro, 20-Dec-2013.)
|- ( ( x = A /\ y = B ) -> R = S )   &    |- ( y = B -> C = L )   &    |- F = ( x e. C , y e. D |-> R )   =>    |- ( ( A e. L /\ B e. D /\ S e. H ) -> ( A F B ) = S )
Theorem	fdmdifeqresdif 42120*	The restriction of a conditional mapping to function values of a function having a domain which is a difference with a singleton equals this function. (Contributed by AV, 23-Apr-2019.)
|- F = ( x e. D |-> if ( x = Y , X , ( G ` x ) ) )   =>    |- ( G : ( D \ { Y } ) --> R -> G = ( F |` ( D \ { Y } ) ) )
Theorem	offvalfv 42121*	The function operation expressed as a mapping with function values. (Contributed by AV, 6-Apr-2019.)
|- ( ph -> A e. V )   &    |- ( ph -> F Fn A )   &    |- ( ph -> G Fn A )   =>    |- ( ph -> ( F oF R G ) = ( x e. A |-> ( ( F ` x ) R ( G ` x ) ) ) )
Theorem	ofaddmndmap 42122	The function operation applied to the addition for functions (with the same domain) into a monoid is a function (with the same domain) into the monoid. (Contributed by AV, 6-Apr-2019.)
|- R = ( Base ` M )   &    |- .+ = ( +g ` M )   =>    |- ( ( M e. Mnd /\ V e. Y /\ ( A e. ( R ^m V ) /\ B e. ( R ^m V ) ) ) -> ( A oF .+ B ) e. ( R ^m V ) )
Theorem	mapsnop 42123	A singleton of an ordered pair as an element of the mapping operation. (Contributed by AV, 12-Apr-2019.)
|- F = { <. X , Y >. }   =>    |- ( ( X e. V /\ Y e. R /\ R e. W ) -> F e. ( R ^m { X } ) )
Theorem	mapprop 42124	An unordered pair containing two ordered pairs as an element of the mapping operation. (Contributed by AV, 16-Apr-2019.)
|- F = { <. X , A >. , <. Y , B >. }   =>    |- ( ( ( X e. V /\ A e. R ) /\ ( Y e. V /\ B e. R ) /\ ( X =/= Y /\ R e. W ) ) -> F e. ( R ^m { X , Y } ) )
Theorem	ztprmneprm 42125	A prime is not an integer multiple of another prime. (Contributed by AV, 23-May-2019.)
|- ( ( Z e. ZZ /\ A e. Prime /\ B e. Prime ) -> ( ( Z x. A ) = B -> A = B ) )
Theorem	2t6m3t4e0 42126	2 times 6 minus 3 times 4 equals 0. (Contributed by AV, 24-May-2019.)
|- ( ( 2 x. 6 ) - ( 3 x. 4 ) ) = 0
Theorem	ssnn0ssfz 42127*	For any finite subset of NN0, find a superset in the form of a set of sequential integers, analogous to ssnnssfz 29549. (Contributed by AV, 30-Sep-2019.)
|- ( A e. ( ~P NN0 i^i Fin ) -> E. n e. NN0 A C_ ( 0 ... n ) )
Theorem	nn0sumltlt 42128	If the sum of two nonnegative integers is less than a third integer, then one of the summands is already less than this third integer. (Contributed by AV, 19-Oct-2019.)
|- ( ( a e. NN0 /\ b e. NN0 /\ c e. NN0 ) -> ( ( a + b ) < c -> b < c ) )
20.35.15.2  The binomial coefficient operation (extension)
Theorem	bcpascm1 42129	Pascal's rule for the binomial coefficient, generalized to all integers K, shifted down by 1. (Contributed by AV, 8-Sep-2019.)
|- ( ( N e. NN /\ K e. ZZ ) -> ( ( ( N - 1 ) _C K ) + ( ( N - 1 ) _C ( K - 1 ) ) ) = ( N _C K ) )
Theorem	altgsumbc 42130*	The sum of binomial coefficients for a fixed positive N with alternating signs is zero. Notice that this is not valid for N = 0 (since ( ( -u 1 ^ 0 ) x. ( 0 _C 0 ) ) = ( 1 x. 1 ) = 1). For a proof using Pascal's rule (bcpascm1 42129) instead of the binomial theorem (binom 14562) , see altgsumbcALT 42131. (Contributed by AV, 13-Sep-2019.)
|- ( N e. NN -> sum_ k e. ( 0 ... N ) ( ( -u 1 ^ k ) x. ( N _C k ) ) = 0 )
Theorem	altgsumbcALT 42131*	Alternate proof of altgsumbc 42130, using Pascal's rule (bcpascm1 42129) instead of the binomial theorem (binom 14562). (Contributed by AV, 8-Sep-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
|- ( N e. NN -> sum_ k e. ( 0 ... N ) ( ( -u 1 ^ k ) x. ( N _C k ) ) = 0 )
20.35.15.3  The ` ZZ `-module ` ZZ X. ZZ `
Theorem	zlmodzxzlmod 42132	The ZZ-module ZZ X. ZZ is a (left) module with the ring of integers as base set. (Contributed by AV, 20-May-2019.) (Revised by AV, 10-Jun-2019.)
|- Z = (ℤring freeLMod { 0 , 1 } )   =>    |- ( Z e. LMod /\ ℤring = (Scalar ` Z ) )
Theorem	zlmodzxzel 42133	An element of the (base set of the) ZZ-module ZZ X. ZZ. (Contributed by AV, 21-May-2019.) (Revised by AV, 10-Jun-2019.)
|- Z = (ℤring freeLMod { 0 , 1 } )   =>    |- ( ( A e. ZZ /\ B e. ZZ ) -> { <. 0 , A >. , <. 1 , B >. } e. ( Base ` Z ) )
Theorem	zlmodzxz0 42134	The 0 of the ZZ-module ZZ X. ZZ. (Contributed by AV, 20-May-2019.) (Revised by AV, 10-Jun-2019.)
|- Z = (ℤring freeLMod { 0 , 1 } )   &    |- .0. = { <. 0 , 0 >. , <. 1 , 0 >. }   =>    |- .0. = ( 0g ` Z )
Theorem	zlmodzxzscm 42135	The scalar multiplication of the ZZ-module ZZ X. ZZ. (Contributed by AV, 20-May-2019.) (Revised by AV, 10-Jun-2019.)
|- Z = (ℤring freeLMod { 0 , 1 } )   &    |- .xb = ( .s ` Z )   =>    |- ( ( A e. ZZ /\ B e. ZZ /\ C e. ZZ ) -> ( A .xb { <. 0 , B >. , <. 1 , C >. } ) = { <. 0 , ( A x. B ) >. , <. 1 , ( A x. C ) >. } )
Theorem	zlmodzxzadd 42136	The addition of the ZZ-module ZZ X. ZZ. (Contributed by AV, 22-May-2019.) (Revised by AV, 10-Jun-2019.)
|- Z = (ℤring freeLMod { 0 , 1 } )   &    |- .+ = ( +g ` Z )   =>    |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( C e. ZZ /\ D e. ZZ ) ) -> ( { <. 0 , A >. , <. 1 , C >. } .+ { <. 0 , B >. , <. 1 , D >. } ) = { <. 0 , ( A + B ) >. , <. 1 , ( C + D ) >. } )
Theorem	zlmodzxzsubm 42137	The subtraction of the ZZ-module ZZ X. ZZ expressed as addition. (Contributed by AV, 24-May-2019.) (Revised by AV, 10-Jun-2019.)
|- Z = (ℤring freeLMod { 0 , 1 } )   &    |- .- = ( -g ` Z )   =>    |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( C e. ZZ /\ D e. ZZ ) ) -> ( { <. 0 , A >. , <. 1 , C >. } .- { <. 0 , B >. , <. 1 , D >. } ) = ( { <. 0 , A >. , <. 1 , C >. } ( +g ` Z ) ( -u 1 ( .s ` Z ) { <. 0 , B >. , <. 1 , D >. } ) ) )
Theorem	zlmodzxzsub 42138	The subtraction of the ZZ-module ZZ X. ZZ. (Contributed by AV, 22-May-2019.) (Revised by AV, 10-Jun-2019.)
|- Z = (ℤring freeLMod { 0 , 1 } )   &    |- .- = ( -g ` Z )   =>    |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( C e. ZZ /\ D e. ZZ ) ) -> ( { <. 0 , A >. , <. 1 , C >. } .- { <. 0 , B >. , <. 1 , D >. } ) = { <. 0 , ( A - B ) >. , <. 1 , ( C - D ) >. } )
20.35.15.4  Ordered group sum operation (extension)
Theorem	gsumpr 42139*	Group sum of a pair. (Contributed by AV, 6-Dec-2018.) (Proof shortened by AV, 28-Jul-2019.)
|- B = ( Base ` G )   &    |- .+ = ( +g ` G )   &    |- ( k = M -> A = C )   &    |- ( k = N -> A = D )   =>    |- ( ( G e. CMnd /\ ( M e. V /\ N e. W /\ M =/= N ) /\ ( C e. B /\ D e. B ) ) -> ( G gsumg ( k e. { M , N } |-> A ) ) = ( C .+ D ) )
Theorem	mgpsumunsn 42140*	Extract a summand/factor from the group sum for the multiplicative group of a unital ring. (Contributed by AV, 29-Dec-2018.)
|- M = (mulGrp ` R )   &    |- .x. = ( .r ` R )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> N e. Fin )   &    |- ( ph -> I e. N )   &    |- ( ( ph /\ k e. N ) -> A e. ( Base ` R ) )   &    |- ( ph -> X e. ( Base ` R ) )   &    |- ( k = I -> A = X )   =>    |- ( ph -> ( M gsumg ( k e. N |-> A ) ) = ( ( M gsumg ( k e. ( N \ { I } ) |-> A ) ) .x. X ) )
Theorem	mgpsumz 42141*	If the group sum for the multiplicative group of a unital ring contains a summand/factor that is the zero of the ring, the group sum itself is zero. (Contributed by AV, 29-Dec-2018.)
|- M = (mulGrp ` R )   &    |- .x. = ( .r ` R )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> N e. Fin )   &    |- ( ph -> I e. N )   &    |- ( ( ph /\ k e. N ) -> A e. ( Base ` R ) )   &    |- .0. = ( 0g ` R )   &    |- ( k = I -> A = .0. )   =>    |- ( ph -> ( M gsumg ( k e. N |-> A ) ) = .0. )
Theorem	mgpsumn 42142*	If the group sum for the multiplicative group of a unital ring contains a summand/factor that is the one of the ring, this summand/ factor can be removed from the group sum. (Contributed by AV, 29-Dec-2018.)
|- M = (mulGrp ` R )   &    |- .x. = ( .r ` R )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> N e. Fin )   &    |- ( ph -> I e. N )   &    |- ( ( ph /\ k e. N ) -> A e. ( Base ` R ) )   &    |- .1. = ( 1r ` R )   &    |- ( k = I -> A = .1. )   =>    |- ( ph -> ( M gsumg ( k e. N |-> A ) ) = ( M gsumg ( k e. ( N \ { I } ) |-> A ) ) )
Theorem	gsumsplit2f 42143*	Split a group sum into two parts. (Contributed by AV, 4-Sep-2019.)
|- F/ k ph   &    |- B = ( Base ` G )   &    |- .0. = ( 0g ` G )   &    |- .+ = ( +g ` G )   &    |- ( ph -> G e. CMnd )   &    |- ( ph -> A e. V )   &    |- ( ( ph /\ k e. A ) -> X e. B )   &    |- ( ph -> ( k e. A |-> X ) finSupp .0. )   &    |- ( ph -> ( C i^i D ) = (/) )   &    |- ( ph -> A = ( C u. D ) )   =>    |- ( ph -> ( G gsumg ( k e. A |-> X ) ) = ( ( G gsumg ( k e. C |-> X ) ) .+ ( G gsumg ( k e. D |-> X ) ) ) )
Theorem	gsumdifsndf 42144*	Extract a summand from a finitely supported group sum. (Contributed by AV, 4-Sep-2019.)
|- F/_ k Y   &    |- F/ k ph   &    |- B = ( Base ` G )   &    |- .+ = ( +g ` G )   &    |- ( ph -> G e. CMnd )   &    |- ( ph -> A e. W )   &    |- ( ph -> ( k e. A |-> X ) finSupp ( 0g ` G ) )   &    |- ( ( ph /\ k e. A ) -> X e. B )   &    |- ( ph -> M e. A )   &    |- ( ph -> Y e. B )   &    |- ( ( ph /\ k = M ) -> X = Y )   =>    |- ( ph -> ( G gsumg ( k e. A |-> X ) ) = ( ( G gsumg ( k e. ( A \ { M } ) |-> X ) ) .+ Y ) )
20.35.15.5  Symmetric groups (extension)
Theorem	exple2lt6 42145	A nonnegative integer to the power of itself is less than 6 if it is less than or equal to 2. (Contributed by AV, 16-Mar-2019.)
|- ( ( N e. NN0 /\ N <_ 2 ) -> ( N ^ N ) < 6 )
Theorem	pgrple2abl 42146	Every symmetric group on a set with at most 2 elements is abelian. (Contributed by AV, 16-Mar-2019.)
|- G = ( SymGrp ` A )   =>    |- ( ( A e. V /\ ( # ` A ) <_ 2 ) -> G e. Abel )
Theorem	pgrpgt2nabl 42147	Every symmetric group on a set with more than 2 elements is not abelian, see also the remark in [Rotman] p. 28. (Contributed by AV, 21-Mar-2019.)
|- G = ( SymGrp ` A )   =>    |- ( ( A e. V /\ 2 < ( # ` A ) ) -> G e/ Abel )
20.35.15.6  Divisibility (extension)
Theorem	invginvrid 42148	Identity for a multiplication with additive and multiplicative inverses in a ring. (Contributed by AV, 18-May-2018.)
|- B = ( Base ` R )   &    |- U = (Unit ` R )   &    |- N = ( invg ` R )   &    |- I = ( invr ` R )   &    |- .x. = ( .r ` R )   =>    |- ( ( R e. Ring /\ X e. B /\ Y e. U ) -> ( ( N ` Y ) .x. ( ( I ` ( N ` Y ) ) .x. X ) ) = X )
20.35.15.7  The support of functions (extension)
Theorem	rmsupp0 42149*	The support of a mapping of a multiplication of zero with a function into a ring is empty. (Contributed by AV, 10-Apr-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Ring /\ V e. X /\ C = ( 0g ` M ) ) /\ A e. ( R ^m V ) ) -> ( ( v e. V |-> ( C ( .r ` M ) ( A ` v ) ) ) supp ( 0g ` M ) ) = (/) )
Theorem	domnmsuppn0 42150*	The support of a mapping of a multiplication of a nonzero constant with a function into a (ring theoretic) domain equals the support of the function. (Contributed by AV, 11-Apr-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Domn /\ V e. X ) /\ ( C e. R /\ C =/= ( 0g ` M ) ) /\ A e. ( R ^m V ) ) -> ( ( v e. V |-> ( C ( .r ` M ) ( A ` v ) ) ) supp ( 0g ` M ) ) = ( A supp ( 0g ` M ) ) )
Theorem	rmsuppss 42151*	The support of a mapping of a multiplication of a constant with a function into a ring is a subset of the support of the function. (Contributed by AV, 11-Apr-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Ring /\ V e. X /\ C e. R ) /\ A e. ( R ^m V ) ) -> ( ( v e. V |-> ( C ( .r ` M ) ( A ` v ) ) ) supp ( 0g ` M ) ) C_ ( A supp ( 0g ` M ) ) )
Theorem	mndpsuppss 42152	The support of a mapping of a scalar multiplication with a function of scalars is a subset of the support of the function of scalars. (Contributed by AV, 5-Apr-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Mnd /\ V e. X ) /\ ( A e. ( R ^m V ) /\ B e. ( R ^m V ) ) ) -> ( ( A oF ( +g ` M ) B ) supp ( 0g ` M ) ) C_ ( ( A supp ( 0g ` M ) ) u. ( B supp ( 0g ` M ) ) ) )
Theorem	scmsuppss 42153*	The support of a mapping of a scalar multiplication with a function of scalars is a subset of the support of the function of scalars. (Contributed by AV, 5-Apr-2019.)
|- S = (Scalar ` M )   &    |- R = ( Base ` S )   =>    |- ( ( M e. LMod /\ V e. ~P ( Base ` M ) /\ A e. ( R ^m V ) ) -> ( ( v e. V |-> ( ( A ` v ) ( .s ` M ) v ) ) supp ( 0g ` M ) ) C_ ( A supp ( 0g ` S ) ) )
20.35.15.8  Finitely supported functions (extension)
Theorem	rmsuppfi 42154*	The support of a mapping of a multiplication of a constant with a function into a ring is finite if the support of the function is finite. (Contributed by AV, 11-Apr-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Ring /\ V e. X /\ C e. R ) /\ A e. ( R ^m V ) /\ ( A supp ( 0g ` M ) ) e. Fin ) -> ( ( v e. V |-> ( C ( .r ` M ) ( A ` v ) ) ) supp ( 0g ` M ) ) e. Fin )
Theorem	rmfsupp 42155*	A mapping of a multiplication of a constant with a function into a ring is finitely supported if the function is finitely supported. (Contributed by AV, 9-Jun-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Ring /\ V e. X /\ C e. R ) /\ A e. ( R ^m V ) /\ A finSupp ( 0g ` M ) ) -> ( v e. V |-> ( C ( .r ` M ) ( A ` v ) ) ) finSupp ( 0g ` M ) )
Theorem	mndpsuppfi 42156	The support of a mapping of a scalar multiplication with a function of scalars is finite if the support of the function of scalars is finite. (Contributed by AV, 5-Apr-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Mnd /\ V e. X ) /\ ( A e. ( R ^m V ) /\ B e. ( R ^m V ) ) /\ ( ( A supp ( 0g ` M ) ) e. Fin /\ ( B supp ( 0g ` M ) ) e. Fin ) ) -> ( ( A oF ( +g ` M ) B ) supp ( 0g ` M ) ) e. Fin )
Theorem	mndpfsupp 42157	A mapping of a scalar multiplication with a function of scalars is finitely supported if the function of scalars is finitely supported. (Contributed by AV, 9-Jun-2019.)
|- R = ( Base ` M )   =>    |- ( ( ( M e. Mnd /\ V e. X ) /\ ( A e. ( R ^m V ) /\ B e. ( R ^m V ) ) /\ ( A finSupp ( 0g ` M ) /\ B finSupp ( 0g ` M ) ) ) -> ( A oF ( +g ` M ) B ) finSupp ( 0g ` M ) )
Theorem	scmsuppfi 42158*	The support of a mapping of a scalar multiplication with a function of scalars is finite if the support of the function of scalars is finite. (Contributed by AV, 5-Apr-2019.)
|- S = (Scalar ` M )   &    |- R = ( Base ` S )   =>    |- ( ( ( M e. LMod /\ V e. ~P ( Base ` M ) ) /\ A e. ( R ^m V ) /\ ( A supp ( 0g ` S ) ) e. Fin ) -> ( ( v e. V |-> ( ( A ` v ) ( .s ` M ) v ) ) supp ( 0g ` M ) ) e. Fin )
Theorem	scmfsupp 42159*	A mapping of a scalar multiplication with a function of scalars is finitely supported if the function of scalars is finitely supported. (Contributed by AV, 9-Jun-2019.)
|- S = (Scalar ` M )   &    |- R = ( Base ` S )   =>    |- ( ( ( M e. LMod /\ V e. ~P ( Base ` M ) ) /\ A e. ( R ^m V ) /\ A finSupp ( 0g ` S ) ) -> ( v e. V |-> ( ( A ` v ) ( .s ` M ) v ) ) finSupp ( 0g ` M ) )
Theorem	suppmptcfin 42160*	The support of a mapping with value 0 except of one is finite. (Contributed by AV, 27-Apr-2019.)
|- B = ( Base ` M )   &    |- R = (Scalar ` M )   &    |- .0. = ( 0g ` R )   &    |- .1. = ( 1r ` R )   &    |- F = ( x e. V |-> if ( x = X , .1. , .0. ) )   =>    |- ( ( M e. LMod /\ V e. ~P B /\ X e. V ) -> ( F supp .0. ) e. Fin )
Theorem	mptcfsupp 42161*	A mapping with value 0 except of one is finitely supported. (Contributed by AV, 9-Jun-2019.)
|- B = ( Base ` M )   &    |- R = (Scalar ` M )   &    |- .0. = ( 0g ` R )   &    |- .1. = ( 1r ` R )   &    |- F = ( x e. V |-> if ( x = X , .1. , .0. ) )   =>    |- ( ( M e. LMod /\ V e. ~P B /\ X e. V ) -> F finSupp .0. )
Theorem	fsuppmptdmf 42162*	A mapping with a finite domain is finitely supported. (Contributed by AV, 4-Sep-2019.)
|- F/ x ph   &    |- F = ( x e. A |-> Y )   &    |- ( ph -> A e. Fin )   &    |- ( ( ph /\ x e. A ) -> Y e. V )   &    |- ( ph -> Z e. W )   =>    |- ( ph -> F finSupp Z )
20.35.15.9  Left modules (extension)
Theorem	lmodvsmdi 42163	Multiple distributive law for scalar product (left-distributivity). (Contributed by AV, 5-Sep-2019.)
|- V = ( Base ` W )   &    |- F = (Scalar ` W )   &    |- .x. = ( .s ` W )   &    |- K = ( Base ` F )   &    |- .^ = (.g ` W )   &    |- E = (.g ` F )   =>    |- ( ( W e. LMod /\ ( R e. K /\ N e. NN0 /\ X e. V ) ) -> ( R .x. ( N .^ X ) ) = ( ( N E R ) .x. X ) )
Theorem	gsumlsscl 42164*	Closure of a group sum in a linear subspace: A (finitely supported) sum of scalar multiplications of vectors of a subset of a linear subspace is also contained in the linear subspace. (Contributed by AV, 20-Apr-2019.) (Revised by AV, 28-Jul-2019.)
|- S = ( LSubSp ` M )   &    |- R = (Scalar ` M )   &    |- B = ( Base ` R )   =>    |- ( ( M e. LMod /\ Z e. S /\ V C_ Z ) -> ( ( F e. ( B ^m V ) /\ F finSupp ( 0g ` R ) ) -> ( M gsumg ( v e. V |-> ( ( F ` v ) ( .s ` M ) v ) ) ) e. Z ) )
20.35.15.10  Associative algebras (extension)
Theorem	ascl0 42165	The scalar 0 embedded into a left module corresponds to the 0 of the left module if the left module is also a ring. (Contributed by AV, 31-Jul-2019.)
|- A = (algSc ` W )   &    |- F = (Scalar ` W )   &    |- ( ph -> W e. LMod )   &    |- ( ph -> W e. Ring )   =>    |- ( ph -> ( A ` ( 0g ` F ) ) = ( 0g ` W ) )
Theorem	ascl1 42166	The scalar 1 embedded into a left module corresponds to the 1 of the left module if the left module is also a ring. (Contributed by AV, 31-Jul-2019.)
|- A = (algSc ` W )   &    |- F = (Scalar ` W )   &    |- ( ph -> W e. LMod )   &    |- ( ph -> W e. Ring )   =>    |- ( ph -> ( A ` ( 1r ` F ) ) = ( 1r ` W ) )
Theorem	assaascl0 42167	The scalar 0 embedded into an associative algebra corresponds to the 0 of the associative algebra. (Contributed by AV, 31-Jul-2019.)
|- A = (algSc ` W )   &    |- F = (Scalar ` W )   &    |- ( ph -> W e. AssAlg )   =>    |- ( ph -> ( A ` ( 0g ` F ) ) = ( 0g ` W ) )
Theorem	assaascl1 42168	The scalar 1 embedded into an associative algebra corresponds to the 1 of the an associative algebra. (Contributed by AV, 31-Jul-2019.)
|- A = (algSc ` W )   &    |- F = (Scalar ` W )   &    |- ( ph -> W e. AssAlg )   =>    |- ( ph -> ( A ` ( 1r ` F ) ) = ( 1r ` W ) )
20.35.15.11  Univariate polynomials (extension)
Theorem	ply1vr1smo 42169	The variable in a polynomial expressed as scaled monomial. (Contributed by AV, 12-Aug-2019.)
|- P = (Poly1 ` R )   &    |- .1. = ( 1r ` R )   &    |- .x. = ( .s ` P )   &    |- G = (mulGrp ` P )   &    |- .^ = (.g ` G )   &    |- X = (var1 ` R )   =>    |- ( R e. Ring -> ( .1. .x. ( 1 .^ X ) ) = X )
Theorem	ply1ass23l 42170	Associative identity with scalar and ring multiplication for the polynomial ring. (Contributed by AV, 14-Aug-2019.)
|- P = (Poly1 ` R )   &    |- .X. = ( .r ` P )   &    |- B = ( Base ` P )   &    |- K = ( Base ` R )   &    |- .x. = ( .s ` P )   =>    |- ( ( R e. Ring /\ ( A e. K /\ X e. B /\ Y e. B ) ) -> ( ( A .x. X ) .X. Y ) = ( A .x. ( X .X. Y ) ) )
Theorem	ply1sclrmsm 42171	The ring multiplication of a polynomial with a scalar polynomial is equal to the scalar multiplication of the polynomial with the corresponding scalar. (Contributed by AV, 14-Aug-2019.)
|- K = ( Base ` R )   &    |- P = (Poly1 ` R )   &    |- E = ( Base ` P )   &    |- X = (var1 ` R )   &    |- .x. = ( .s ` P )   &    |- .X. = ( .r ` P )   &    |- N = (mulGrp ` P )   &    |- .^ = (.g ` N )   &    |- A = (algSc ` P )   =>    |- ( ( R e. Ring /\ F e. K /\ Z e. E ) -> ( ( A ` F ) .X. Z ) = ( F .x. Z ) )
Theorem	coe1id 42172*	Coefficient vector of the unit polynomial. (Contributed by AV, 9-Aug-2019.)
|- P = (Poly1 ` R )   &    |- I = ( 1r ` P )   &    |- .0. = ( 0g ` R )   &    |- .1. = ( 1r ` R )   =>    |- ( R e. Ring -> (coe1 ` I ) = ( x e. NN0 |-> if ( x = 0 , .1. , .0. ) ) )
Theorem	coe1sclmulval 42173	The value of the coefficient vector of a polynomial multiplied on the left by a scalar. (Contributed by AV, 14-Aug-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- K = ( Base ` R )   &    |- A = (algSc ` P )   &    |- S = ( .s ` P )   &    |- .xb = ( .r ` P )   &    |- .x. = ( .r ` R )   =>    |- ( ( R e. Ring /\ ( Y e. K /\ Z e. B ) /\ N e. NN0 ) -> ( (coe1 ` ( Y S Z ) ) ` N ) = ( Y .x. ( (coe1 ` Z ) ` N ) ) )
Theorem	ply1mulgsumlem1 42174*	Lemma 1 for ply1mulgsum 42178. (Contributed by AV, 19-Oct-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- A = (coe1 ` K )   &    |- C = (coe1 ` L )   &    |- X = (var1 ` R )   &    |- .X. = ( .r ` P )   &    |- .x. = ( .s ` P )   &    |- .* = ( .r ` R )   &    |- M = (mulGrp ` P )   &    |- .^ = (.g ` M )   =>    |- ( ( R e. Ring /\ K e. B /\ L e. B ) -> E. s e. NN0 A. n e. NN0 ( s < n -> ( ( A ` n ) = ( 0g ` R ) /\ ( C ` n ) = ( 0g ` R ) ) ) )
Theorem	ply1mulgsumlem2 42175*	Lemma 2 for ply1mulgsum 42178. (Contributed by AV, 19-Oct-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- A = (coe1 ` K )   &    |- C = (coe1 ` L )   &    |- X = (var1 ` R )   &    |- .X. = ( .r ` P )   &    |- .x. = ( .s ` P )   &    |- .* = ( .r ` R )   &    |- M = (mulGrp ` P )   &    |- .^ = (.g ` M )   =>    |- ( ( R e. Ring /\ K e. B /\ L e. B ) -> E. s e. NN0 A. n e. NN0 ( s < n -> ( R gsumg ( l e. ( 0 ... n ) |-> ( ( A ` l ) .* ( C ` ( n - l ) ) ) ) ) = ( 0g ` R ) ) )
Theorem	ply1mulgsumlem3 42176*	Lemma 3 for ply1mulgsum 42178. (Contributed by AV, 20-Oct-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- A = (coe1 ` K )   &    |- C = (coe1 ` L )   &    |- X = (var1 ` R )   &    |- .X. = ( .r ` P )   &    |- .x. = ( .s ` P )   &    |- .* = ( .r ` R )   &    |- M = (mulGrp ` P )   &    |- .^ = (.g ` M )   =>    |- ( ( R e. Ring /\ K e. B /\ L e. B ) -> ( k e. NN0 |-> ( R gsumg ( l e. ( 0 ... k ) |-> ( ( A ` l ) .* ( C ` ( k - l ) ) ) ) ) ) finSupp ( 0g ` R ) )
Theorem	ply1mulgsumlem4 42177*	Lemma 4 for ply1mulgsum 42178. (Contributed by AV, 19-Oct-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- A = (coe1 ` K )   &    |- C = (coe1 ` L )   &    |- X = (var1 ` R )   &    |- .X. = ( .r ` P )   &    |- .x. = ( .s ` P )   &    |- .* = ( .r ` R )   &    |- M = (mulGrp ` P )   &    |- .^ = (.g ` M )   =>    |- ( ( R e. Ring /\ K e. B /\ L e. B ) -> ( k e. NN0 |-> ( ( R gsumg ( l e. ( 0 ... k ) |-> ( ( A ` l ) .* ( C ` ( k - l ) ) ) ) ) .x. ( k .^ X ) ) ) finSupp ( 0g ` P ) )
Theorem	ply1mulgsum 42178*	The product of two polynomials expressed as group sum of scaled monomials. (Contributed by AV, 20-Oct-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- A = (coe1 ` K )   &    |- C = (coe1 ` L )   &    |- X = (var1 ` R )   &    |- .X. = ( .r ` P )   &    |- .x. = ( .s ` P )   &    |- .* = ( .r ` R )   &    |- M = (mulGrp ` P )   &    |- .^ = (.g ` M )   =>    |- ( ( R e. Ring /\ K e. B /\ L e. B ) -> ( K .X. L ) = ( P gsumg ( k e. NN0 |-> ( ( R gsumg ( l e. ( 0 ... k ) |-> ( ( A ` l ) .* ( C ` ( k - l ) ) ) ) ) .x. ( k .^ X ) ) ) ) )
Theorem	evl1at0 42179	Polynomial evaluation for the 0 scalar. (Contributed by AV, 10-Aug-2019.)
|- O = (eval1 ` R )   &    |- P = (Poly1 ` R )   &    |- .0. = ( 0g ` R )   &    |- Z = ( 0g ` P )   =>    |- ( R e. CRing -> ( ( O ` Z ) ` .0. ) = .0. )
Theorem	evl1at1 42180	Polynomial evaluation for the 1 scalar. (Contributed by AV, 10-Aug-2019.)
|- O = (eval1 ` R )   &    |- P = (Poly1 ` R )   &    |- .1. = ( 1r ` R )   &    |- I = ( 1r ` P )   =>    |- ( R e. CRing -> ( ( O ` I ) ` .1. ) = .1. )
20.35.15.12  Univariate polynomials (examples)
Theorem	linply1 42181	A term of the form x - C is a (univariate) polynomial, also called "linear polynomial". (Part of ply1remlem 23922). (Contributed by AV, 3-Jul-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- K = ( Base ` R )   &    |- X = (var1 ` R )   &    |- .- = ( -g ` P )   &    |- A = (algSc ` P )   &    |- G = ( X .- ( A ` C ) )   &    |- ( ph -> C e. K )   &    |- ( ph -> R e. Ring )   =>    |- ( ph -> G e. B )
Theorem	lineval 42182	A term of the form x - C evaluated for x = V results in V - C (part of ply1remlem 23922). (Contributed by AV, 3-Jul-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- K = ( Base ` R )   &    |- X = (var1 ` R )   &    |- .- = ( -g ` P )   &    |- A = (algSc ` P )   &    |- G = ( X .- ( A ` C ) )   &    |- ( ph -> C e. K )   &    |- O = (eval1 ` R )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> V e. K )   =>    |- ( ph -> ( ( O ` G ) ` V ) = ( V ( -g ` R ) C ) )
Theorem	zringsubgval 42183	Subtraction in the ring of integers. (Contributed by AV, 3-Aug-2019.)
|- .- = ( -g ` ℤring )   =>    |- ( ( X e. ZZ /\ Y e. ZZ ) -> ( X - Y ) = ( X .- Y ) )
Theorem	linevalexample 42184	The polynomial x - 3 over ZZ evaluated for x = 5 results in 2. (Contributed by AV, 3-Jul-2019.)
|- P = (Poly1 ` ℤring )   &    |- B = ( Base ` P )   &    |- X = (var1 ` ℤring )   &    |- .- = ( -g ` P )   &    |- A = (algSc ` P )   &    |- G = ( X .- ( A ` 3 ) )   &    |- O = (eval1 ` ℤring )   =>    |- ( ( O ` ( X .- ( A ` 3 ) ) ) ` 5 ) = 2
20.35.16  Linear algebra (extension)
20.35.16.1  The subalgebras of diagonal and scalar matrices (extension) In the following, alternative definitions for diagonal and scalar matrices are provided. These definitions define diagonal and scalar matrices as extensible structures, whereas the definitions df-dmat 20296 and df-scmat 20297 define diagonal and scalar matrices as sets.
Syntax	cdmatalt 42185	Alternative notation for the algebra of diagonal matrices.
class DMatALT
Syntax	cscmatalt 42186	Alternative notation for the algebra of scalar matrices.
class ScMatALT
Definition	df-dmatalt 42187*	Define the set of n x n diagonal (square) matrices over a set (usually a ring) r, see definition in [Roman] p. 4 or Definition 3.12 in [Hefferon] p. 240. (Contributed by AV, 8-Dec-2019.)
|- DMatALT = ( n e. Fin , r e. _V |-> [_ ( n Mat r ) / a ]_ ( a ↾s { m e. ( Base ` a ) | A. i e. n A. j e. n ( i =/= j -> ( i m j ) = ( 0g ` r ) ) } ) )
Definition	df-scmatalt 42188*	Define the algebra of n x n scalar matrices over a set (usually a ring) r, see definition in [Connell] p. 57: "A scalar matrix is a diagonal matrix for which all the diagonal terms are equal, i.e., a matrix of the form cIn";. (Contributed by AV, 8-Dec-2019.)
|- ScMatALT = ( n e. Fin , r e. _V |-> [_ ( n Mat r ) / a ]_ ( a ↾s { m e. ( Base ` a ) | E. c e. ( Base ` r ) A. i e. n A. j e. n ( i m j ) = if ( i = j , c , ( 0g ` r ) ) } ) )
Theorem	dmatALTval 42189*	The algebra of N x N diagonal matrices over a ring R. (Contributed by AV, 8-Dec-2019.)
|- A = ( N Mat R )   &    |- B = ( Base ` A )   &    |- .0. = ( 0g ` R )   &    |- D = ( N DMatALT R )   =>    |- ( ( N e. Fin /\ R e. _V ) -> D = ( A ↾s { m e. B | A. i e. N A. j e. N ( i =/= j -> ( i m j ) = .0. ) } ) )
Theorem	dmatALTbas 42190*	The base set of the algebra of N x N diagonal matrices over a ring R, i.e. the set of all N x N diagonal matrices over the ring R. (Contributed by AV, 8-Dec-2019.)
|- A = ( N Mat R )   &    |- B = ( Base ` A )   &    |- .0. = ( 0g ` R )   &    |- D = ( N DMatALT R )   =>    |- ( ( N e. Fin /\ R e. _V ) -> ( Base ` D ) = { m e. B | A. i e. N A. j e. N ( i =/= j -> ( i m j ) = .0. ) } )
Theorem	dmatALTbasel 42191*	An element of the base set of the algebra of N x N diagonal matrices over a ring R, i.e. an N x N diagonal matrix over the ring R. (Contributed by AV, 8-Dec-2019.)
|- A = ( N Mat R )   &    |- B = ( Base ` A )   &    |- .0. = ( 0g ` R )   &    |- D = ( N DMatALT R )   =>    |- ( ( N e. Fin /\ R e. _V ) -> ( M e. ( Base ` D ) <-> ( M e. B /\ A. i e. N A. j e. N ( i =/= j -> ( i M j ) = .0. ) ) ) )
Theorem	dmatbas 42192	The set of all N x N diagonal matrices over (the ring) R is the base set of the algebra of N x N diagonal matrices over (the ring) R. (Contributed by AV, 8-Dec-2019.)
|- A = ( N Mat R )   &    |- B = ( Base ` A )   &    |- .0. = ( 0g ` R )   &    |- D = ( N DMat R )   =>    |- ( ( N e. Fin /\ R e. V ) -> D = ( Base ` ( N DMatALT R ) ) )
20.35.16.2  Linear combinations According to Wikipedia ("Linear combination", 29-Mar-2019, https://en.wikipedia.org/wiki/Linear_combination) "In mathematics, a linear combination is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g., a linear combination of x and y would be any expression of the form ax + by, where a and b are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics." In linear algebra, these "terms" are "vectors" (elements from vector spaces or left modules), and the constants are elements of the underlying field resp. ring. This corresponds to the definition in [Lang] p. 129: "Let M be a module over a ring A and let S be a subset of M. By a linear combination of elements of S (with coefficients in A) one means a sum ∑x ∈S axx where {ax} is a set of elements of A, ...". In the definition in [Lang] p. 129, it is additionally claimed that "..., almost all of which [elements of A] are equal to 0.". This is not necessarily required in the following definition df-linc 42195, but it is essential if additions and scalar multiplications of linear combinations are considered. Therefore, we define the set of all linear combinations with finite support in df-lco 42196, so that we can show that such sets are submodules of the corresponding modules, see lincolss 42223. Remark:According to Wikipedia ("Linear span", 28-Apr-2019, https://en.wikipedia.org/wiki/Linear_span) "In linear algebra, the linear span (also called the linear hull or just span) of a set of vectors in a vector space [or module] is the intersection of all linear subspaces which each contain every vector in that set.", and "Alternately, the span of [a set] S may be defined as the set of all finite linear combinations of elements (vectors) of S". Whereas spans are defined according to the first approach in df-lsp 18972, the set of all linear combinations as defined by df-lco 42196 follows the alternative approach. That both definitions are equivalent is shown by lspeqlco 42228.
Syntax	clinc 42193	Extend class notation with the operation constructing a linear combination (of vectors from a left module).
class linC
Syntax	clinco 42194	Extend class notation with the operation constructing a set of linear combinations (of vectors from a left module) with finite support.
class LinCo
Definition	df-linc 42195*	Define the operation constructing a linear combination. Although this definition is taylored for linear combinations of vectors from left modules, it can be used for any structure having a Base, Scalar s and a scalar multiplication .s. (Contributed by AV, 29-Mar-2019.)
|- linC = ( m e. _V |-> ( s e. ( ( Base ` (Scalar ` m ) ) ^m v ) , v e. ~P ( Base ` m ) |-> ( m gsumg ( x e. v |-> ( ( s ` x ) ( .s ` m ) x ) ) ) ) )
Definition	df-lco 42196*	Define the operation constructing the set of all linear combinations for a set of vectors. (Contributed by AV, 31-Mar-2019.) (Revised by AV, 28-Jul-2019.)
|- LinCo = ( m e. _V , v e. ~P ( Base ` m ) |-> { c e. ( Base ` m ) | E. s e. ( ( Base ` (Scalar ` m ) ) ^m v ) ( s finSupp ( 0g ` (Scalar ` m ) ) /\ c = ( s ( linC ` m ) v ) ) } )
Theorem	lincop 42197*	A linear combination as operation. (Contributed by AV, 30-Mar-2019.)
|- ( M e. X -> ( linC ` M ) = ( s e. ( ( Base ` (Scalar ` M ) ) ^m v ) , v e. ~P ( Base ` M ) |-> ( M gsumg ( x e. v |-> ( ( s ` x ) ( .s ` M ) x ) ) ) ) )
Theorem	lincval 42198*	The value of a linear combination. (Contributed by AV, 30-Mar-2019.)
|- ( ( M e. X /\ S e. ( ( Base ` (Scalar ` M ) ) ^m V ) /\ V e. ~P ( Base ` M ) ) -> ( S ( linC ` M ) V ) = ( M gsumg ( x e. V |-> ( ( S ` x ) ( .s ` M ) x ) ) ) )
Theorem	dflinc2 42199*	Alternative definition of linear combinations using the function operation. (Contributed by AV, 1-Apr-2019.)
|- linC = ( m e. _V |-> ( s e. ( ( Base ` (Scalar ` m ) ) ^m v ) , v e. ~P ( Base ` m ) |-> ( m gsumg ( s oF ( .s ` m ) ( _I |` v ) ) ) ) )
Theorem	lcoop 42200*	A linear combination as operation. (Contributed by AV, 5-Apr-2019.) (Revised by AV, 28-Jul-2019.)
|- B = ( Base ` M )   &    |- S = (Scalar ` M )   &    |- R = ( Base ` S )   =>    |- ( ( M e. X /\ V e. ~P B ) -> ( M LinCo V ) = { c e. B | E. s e. ( R ^m V ) ( s finSupp ( 0g ` S ) /\ c = ( s ( linC ` M ) V ) ) } )