MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mulid1 Unicode version

Theorem mulid1 9044
Description:  1 is an identity element for multiplication. Based on ideas by Eric Schmidt. (Contributed by Scott Fenton, 3-Jan-2013.)
Assertion
Ref Expression
mulid1  |-  ( A  e.  CC  ->  ( A  x.  1 )  =  A )

Proof of Theorem mulid1
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnre 9043 . 2  |-  ( A  e.  CC  ->  E. x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
2 recn 9036 . . . . . 6  |-  ( x  e.  RR  ->  x  e.  CC )
3 ax-icn 9005 . . . . . . 7  |-  _i  e.  CC
4 recn 9036 . . . . . . 7  |-  ( y  e.  RR  ->  y  e.  CC )
5 mulcl 9030 . . . . . . 7  |-  ( ( _i  e.  CC  /\  y  e.  CC )  ->  ( _i  x.  y
)  e.  CC )
63, 4, 5sylancr 645 . . . . . 6  |-  ( y  e.  RR  ->  (
_i  x.  y )  e.  CC )
7 ax-1cn 9004 . . . . . . 7  |-  1  e.  CC
8 adddir 9039 . . . . . . 7  |-  ( ( x  e.  CC  /\  ( _i  x.  y
)  e.  CC  /\  1  e.  CC )  ->  ( ( x  +  ( _i  x.  y
) )  x.  1 )  =  ( ( x  x.  1 )  +  ( ( _i  x.  y )  x.  1 ) ) )
97, 8mp3an3 1268 . . . . . 6  |-  ( ( x  e.  CC  /\  ( _i  x.  y
)  e.  CC )  ->  ( ( x  +  ( _i  x.  y ) )  x.  1 )  =  ( ( x  x.  1 )  +  ( ( _i  x.  y )  x.  1 ) ) )
102, 6, 9syl2an 464 . . . . 5  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( ( x  +  ( _i  x.  y
) )  x.  1 )  =  ( ( x  x.  1 )  +  ( ( _i  x.  y )  x.  1 ) ) )
11 ax-1rid 9016 . . . . . 6  |-  ( x  e.  RR  ->  (
x  x.  1 )  =  x )
12 mulass 9034 . . . . . . . . 9  |-  ( ( _i  e.  CC  /\  y  e.  CC  /\  1  e.  CC )  ->  (
( _i  x.  y
)  x.  1 )  =  ( _i  x.  ( y  x.  1 ) ) )
133, 7, 12mp3an13 1270 . . . . . . . 8  |-  ( y  e.  CC  ->  (
( _i  x.  y
)  x.  1 )  =  ( _i  x.  ( y  x.  1 ) ) )
144, 13syl 16 . . . . . . 7  |-  ( y  e.  RR  ->  (
( _i  x.  y
)  x.  1 )  =  ( _i  x.  ( y  x.  1 ) ) )
15 ax-1rid 9016 . . . . . . . 8  |-  ( y  e.  RR  ->  (
y  x.  1 )  =  y )
1615oveq2d 6056 . . . . . . 7  |-  ( y  e.  RR  ->  (
_i  x.  ( y  x.  1 ) )  =  ( _i  x.  y
) )
1714, 16eqtrd 2436 . . . . . 6  |-  ( y  e.  RR  ->  (
( _i  x.  y
)  x.  1 )  =  ( _i  x.  y ) )
1811, 17oveqan12d 6059 . . . . 5  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( ( x  x.  1 )  +  ( ( _i  x.  y
)  x.  1 ) )  =  ( x  +  ( _i  x.  y ) ) )
1910, 18eqtrd 2436 . . . 4  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( ( x  +  ( _i  x.  y
) )  x.  1 )  =  ( x  +  ( _i  x.  y ) ) )
20 oveq1 6047 . . . . 5  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  ( A  x.  1 )  =  ( ( x  +  ( _i  x.  y ) )  x.  1 ) )
21 id 20 . . . . 5  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  A  =  ( x  +  ( _i  x.  y
) ) )
2220, 21eqeq12d 2418 . . . 4  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  (
( A  x.  1 )  =  A  <->  ( (
x  +  ( _i  x.  y ) )  x.  1 )  =  ( x  +  ( _i  x.  y ) ) ) )
2319, 22syl5ibrcom 214 . . 3  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( A  =  ( x  +  ( _i  x.  y ) )  ->  ( A  x.  1 )  =  A ) )
2423rexlimivv 2795 . 2  |-  ( E. x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y
) )  ->  ( A  x.  1 )  =  A )
251, 24syl 16 1  |-  ( A  e.  CC  ->  ( A  x.  1 )  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1649    e. wcel 1721   E.wrex 2667  (class class class)co 6040   CCcc 8944   RRcr 8945   1c1 8947   _ici 8948    + caddc 8949    x. cmul 8951
This theorem is referenced by:  mulid2  9045  mulid1i  9048  mulid1d  9061  muleqadd  9622  divdiv1  9681  conjmul  9687  nnmulcl  9979  expmul  11380  binom21  11452  sq01  11456  bernneq  11460  hashiun  12556  efexp  12657  cncrng  16677  cnfld1  16681  0dgr  20117  ecxp  20517  dvcxp1  20579  efrlim  20761  lgsdilem2  21068  gxnn0mul  21818  cnrngo  21944  ipasslem2  22286  addltmulALT  23902  zrhnm  24306  fprodcvg  25209  prodmolem2a  25213  axcontlem7  25813
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-resscn 9003  ax-1cn 9004  ax-icn 9005  ax-addcl 9006  ax-mulcl 9008  ax-mulcom 9010  ax-mulass 9012  ax-distr 9013  ax-1rid 9016  ax-cnre 9019
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-br 4173  df-iota 5377  df-fv 5421  df-ov 6043
  Copyright terms: Public domain W3C validator