ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnfldmulg Unicode version

Theorem cnfldmulg 14913
Description: The group multiple function in the field of complex numbers. (Contributed by Mario Carneiro, 14-Jun-2015.)
Assertion
Ref Expression
cnfldmulg  |-  ( ( A  e.  ZZ  /\  B  e.  CC )  ->  ( A (.g ` fld ) B )  =  ( A  x.  B
) )

Proof of Theorem cnfldmulg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 6092 . . . 4  |-  ( x  =  0  ->  (
x (.g ` fld ) B )  =  ( 0 (.g ` fld ) B ) )
2 oveq1 6092 . . . 4  |-  ( x  =  0  ->  (
x  x.  B )  =  ( 0  x.  B ) )
31, 2eqeq12d 2253 . . 3  |-  ( x  =  0  ->  (
( x (.g ` fld ) B )  =  ( x  x.  B
)  <->  ( 0 (.g ` fld ) B )  =  ( 0  x.  B ) ) )
4 oveq1 6092 . . . 4  |-  ( x  =  y  ->  (
x (.g ` fld ) B )  =  ( y (.g ` fld ) B ) )
5 oveq1 6092 . . . 4  |-  ( x  =  y  ->  (
x  x.  B )  =  ( y  x.  B ) )
64, 5eqeq12d 2253 . . 3  |-  ( x  =  y  ->  (
( x (.g ` fld ) B )  =  ( x  x.  B
)  <->  ( y (.g ` fld ) B )  =  ( y  x.  B ) ) )
7 oveq1 6092 . . . 4  |-  ( x  =  ( y  +  1 )  ->  (
x (.g ` fld ) B )  =  ( ( y  +  1 ) (.g ` fld ) B ) )
8 oveq1 6092 . . . 4  |-  ( x  =  ( y  +  1 )  ->  (
x  x.  B )  =  ( ( y  +  1 )  x.  B ) )
97, 8eqeq12d 2253 . . 3  |-  ( x  =  ( y  +  1 )  ->  (
( x (.g ` fld ) B )  =  ( x  x.  B
)  <->  ( ( y  +  1 ) (.g ` fld ) B )  =  ( ( y  +  1 )  x.  B ) ) )
10 oveq1 6092 . . . 4  |-  ( x  =  -u y  ->  (
x (.g ` fld ) B )  =  ( -u y (.g ` fld ) B ) )
11 oveq1 6092 . . . 4  |-  ( x  =  -u y  ->  (
x  x.  B )  =  ( -u y  x.  B ) )
1210, 11eqeq12d 2253 . . 3  |-  ( x  =  -u y  ->  (
( x (.g ` fld ) B )  =  ( x  x.  B
)  <->  ( -u y
(.g ` fld ) B )  =  ( -u y  x.  B ) ) )
13 oveq1 6092 . . . 4  |-  ( x  =  A  ->  (
x (.g ` fld ) B )  =  ( A (.g ` fld ) B ) )
14 oveq1 6092 . . . 4  |-  ( x  =  A  ->  (
x  x.  B )  =  ( A  x.  B ) )
1513, 14eqeq12d 2253 . . 3  |-  ( x  =  A  ->  (
( x (.g ` fld ) B )  =  ( x  x.  B
)  <->  ( A (.g ` fld ) B )  =  ( A  x.  B ) ) )
16 cnfldbas 14897 . . . . 5  |-  CC  =  ( Base ` fld )
17 cnfld0 14908 . . . . 5  |-  0  =  ( 0g ` fld )
18 eqid 2238 . . . . 5  |-  (.g ` fld )  =  (.g ` fld )
1916, 17, 18mulg0 13928 . . . 4  |-  ( B  e.  CC  ->  (
0 (.g ` fld ) B )  =  0 )
20 mul02 8714 . . . 4  |-  ( B  e.  CC  ->  (
0  x.  B )  =  0 )
2119, 20eqtr4d 2274 . . 3  |-  ( B  e.  CC  ->  (
0 (.g ` fld ) B )  =  ( 0  x.  B
) )
22 oveq1 6092 . . . . 5  |-  ( ( y (.g ` fld ) B )  =  ( y  x.  B
)  ->  ( (
y (.g ` fld ) B )  +  B )  =  ( ( y  x.  B
)  +  B ) )
23 cnring 14907 . . . . . . . 8  |-fld  e.  Ring
24 ringmnd 14310 . . . . . . . 8  |-  (fld  e.  Ring  ->fld  e.  Mnd )
2523, 24ax-mp 5 . . . . . . 7  |-fld  e.  Mnd
26 cnfldadd 14899 . . . . . . . 8  |-  +  =  ( +g  ` fld )
2716, 18, 26mulgnn0p1 13936 . . . . . . 7  |-  ( (fld  e. 
Mnd  /\  y  e.  NN0 
/\  B  e.  CC )  ->  ( ( y  +  1 ) (.g ` fld ) B )  =  ( ( y (.g ` fld ) B )  +  B ) )
2825, 27mp3an1 1365 . . . . . 6  |-  ( ( y  e.  NN0  /\  B  e.  CC )  ->  ( ( y  +  1 ) (.g ` fld ) B )  =  ( ( y (.g ` fld ) B )  +  B
) )
29 nn0cn 9573 . . . . . . . 8  |-  ( y  e.  NN0  ->  y  e.  CC )
3029adantr 276 . . . . . . 7  |-  ( ( y  e.  NN0  /\  B  e.  CC )  ->  y  e.  CC )
31 simpr 110 . . . . . . 7  |-  ( ( y  e.  NN0  /\  B  e.  CC )  ->  B  e.  CC )
3230, 31adddirp1d 8352 . . . . . 6  |-  ( ( y  e.  NN0  /\  B  e.  CC )  ->  ( ( y  +  1 )  x.  B
)  =  ( ( y  x.  B )  +  B ) )
3328, 32eqeq12d 2253 . . . . 5  |-  ( ( y  e.  NN0  /\  B  e.  CC )  ->  ( ( ( y  +  1 ) (.g ` fld ) B )  =  ( ( y  +  1 )  x.  B )  <-> 
( ( y (.g ` fld ) B )  +  B
)  =  ( ( y  x.  B )  +  B ) ) )
3422, 33imbitrrid 156 . . . 4  |-  ( ( y  e.  NN0  /\  B  e.  CC )  ->  ( ( y (.g ` fld ) B )  =  ( y  x.  B )  ->  ( ( y  +  1 ) (.g ` fld ) B )  =  ( ( y  +  1 )  x.  B ) ) )
3534expcom 116 . . 3  |-  ( B  e.  CC  ->  (
y  e.  NN0  ->  ( ( y (.g ` fld ) B )  =  ( y  x.  B
)  ->  ( (
y  +  1 ) (.g ` fld ) B )  =  ( ( y  +  1 )  x.  B
) ) ) )
36 fveq2 5695 . . . . 5  |-  ( ( y (.g ` fld ) B )  =  ( y  x.  B
)  ->  ( ( invg ` fld ) `  ( y (.g ` fld ) B ) )  =  ( ( invg ` fld ) `  ( y  x.  B ) ) )
37 eqid 2238 . . . . . . 7  |-  ( invg ` fld )  =  ( invg ` fld )
3816, 18, 37mulgnegnn 13935 . . . . . 6  |-  ( ( y  e.  NN  /\  B  e.  CC )  ->  ( -u y (.g ` fld ) B )  =  ( ( invg ` fld ) `  ( y (.g ` fld ) B ) ) )
39 nncn 9312 . . . . . . . 8  |-  ( y  e.  NN  ->  y  e.  CC )
40 mulneg1 8722 . . . . . . . 8  |-  ( ( y  e.  CC  /\  B  e.  CC )  ->  ( -u y  x.  B )  =  -u ( y  x.  B
) )
4139, 40sylan 283 . . . . . . 7  |-  ( ( y  e.  NN  /\  B  e.  CC )  ->  ( -u y  x.  B )  =  -u ( y  x.  B
) )
42 mulcl 8306 . . . . . . . . 9  |-  ( ( y  e.  CC  /\  B  e.  CC )  ->  ( y  x.  B
)  e.  CC )
4339, 42sylan 283 . . . . . . . 8  |-  ( ( y  e.  NN  /\  B  e.  CC )  ->  ( y  x.  B
)  e.  CC )
44 cnfldneg 14910 . . . . . . . 8  |-  ( ( y  x.  B )  e.  CC  ->  (
( invg ` fld ) `  ( y  x.  B
) )  =  -u ( y  x.  B
) )
4543, 44syl 14 . . . . . . 7  |-  ( ( y  e.  NN  /\  B  e.  CC )  ->  ( ( invg ` fld ) `  ( y  x.  B ) )  = 
-u ( y  x.  B ) )
4641, 45eqtr4d 2274 . . . . . 6  |-  ( ( y  e.  NN  /\  B  e.  CC )  ->  ( -u y  x.  B )  =  ( ( invg ` fld ) `  ( y  x.  B
) ) )
4738, 46eqeq12d 2253 . . . . 5  |-  ( ( y  e.  NN  /\  B  e.  CC )  ->  ( ( -u y
(.g ` fld ) B )  =  ( -u y  x.  B )  <->  ( ( invg ` fld ) `  ( y (.g ` fld ) B ) )  =  ( ( invg ` fld ) `  ( y  x.  B ) ) ) )
4836, 47imbitrrid 156 . . . 4  |-  ( ( y  e.  NN  /\  B  e.  CC )  ->  ( ( y (.g ` fld ) B )  =  ( y  x.  B )  ->  ( -u y
(.g ` fld ) B )  =  ( -u y  x.  B ) ) )
4948expcom 116 . . 3  |-  ( B  e.  CC  ->  (
y  e.  NN  ->  ( ( y (.g ` fld ) B )  =  ( y  x.  B
)  ->  ( -u y
(.g ` fld ) B )  =  ( -u y  x.  B ) ) ) )
503, 6, 9, 12, 15, 21, 35, 49zindd 9764 . 2  |-  ( B  e.  CC  ->  ( A  e.  ZZ  ->  ( A (.g ` fld ) B )  =  ( A  x.  B
) ) )
5150impcom 125 1  |-  ( ( A  e.  ZZ  /\  B  e.  CC )  ->  ( A (.g ` fld ) B )  =  ( A  x.  B
) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   ` cfv 5377  (class class class)co 6085   CCcc 8177   0cc0 8179   1c1 8180    + caddc 8182    x. cmul 8184   -ucneg 8498   NNcn 9304   NN0cn0 9563   ZZcz 9644   Mndcmnd 13729   invgcminusg 13806  .gcmg 13922   Ringcrg 14300  ℂfldccnfld 14893
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-addf 8301  ax-mulf 8302
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-z 9645  df-dec 9778  df-uz 9922  df-rp 10055  df-fz 10412  df-seqfrec 10885  df-cj 11607  df-abs 11765  df-struct 13354  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-starv 13446  df-tset 13450  df-ple 13451  df-ds 13453  df-unif 13454  df-0g 13612  df-topgen 13614  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-mulg 13923  df-cmn 14089  df-mgp 14218  df-ring 14302  df-cring 14303  df-bl 14883  df-mopn 14884  df-fg 14886  df-metu 14887  df-cnfld 14894
This theorem is used by:  zsssubrg  14922  zringmulg  14933  mulgrhm2  14945
  Copyright terms: Public domain W3C validator