Metamath Proof Explorer

Theorem cnlmodlem1

Description: Lemma 1 for cnlmod . (Contributed by AV, 20-Sep-2021)

Ref Expression
Hypothesis cnlmod.w 
|- W = ( { <. ( Base ` ndx ) , CC >. , <. ( +g ` ndx ) , + >. } u. { <. ( Scalar ` ndx ) , CCfld >. , <. ( .s ` ndx ) , x. >. } )
Assertion cnlmodlem1 
|- ( Base ` W ) = CC

Proof

Step Hyp Ref Expression
1 cnlmod.w 
 |-  W = ( { <. ( Base ` ndx ) , CC >. , <. ( +g ` ndx ) , + >. } u. { <. ( Scalar ` ndx ) , CCfld >. , <. ( .s ` ndx ) , x. >. } )
2 cnex 
 |-  CC e. _V
3 qdass 
 |-  ( { <. ( Base ` ndx ) , CC >. , <. ( +g ` ndx ) , + >. } u. { <. ( Scalar ` ndx ) , CCfld >. , <. ( .s ` ndx ) , x. >. } ) = ( { <. ( Base ` ndx ) , CC >. , <. ( +g ` ndx ) , + >. , <. ( Scalar ` ndx ) , CCfld >. } u. { <. ( .s ` ndx ) , x. >. } )
4 1 3 eqtri 
 |-  W = ( { <. ( Base ` ndx ) , CC >. , <. ( +g ` ndx ) , + >. , <. ( Scalar ` ndx ) , CCfld >. } u. { <. ( .s ` ndx ) , x. >. } )
5 4 lmodbase 
 |-  ( CC e. _V -> CC = ( Base ` W ) )
6 5 eqcomd 
 |-  ( CC e. _V -> ( Base ` W ) = CC )
7 2 6 ax-mp 
 |-  ( Base ` W ) = CC