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

Theorem mulcanapd 8415
Description: Cancellation law for multiplication. (Contributed by Jim Kingdon, 21-Feb-2020.)
Hypotheses
Ref Expression
mulcand.1  |-  ( ph  ->  A  e.  CC )
mulcand.2  |-  ( ph  ->  B  e.  CC )
mulcand.3  |-  ( ph  ->  C  e.  CC )
mulcand.4  |-  ( ph  ->  C #  0 )
Assertion
Ref Expression
mulcanapd  |-  ( ph  ->  ( ( C  x.  A )  =  ( C  x.  B )  <-> 
A  =  B ) )

Proof of Theorem mulcanapd
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 mulcand.3 . . . 4  |-  ( ph  ->  C  e.  CC )
2 mulcand.4 . . . 4  |-  ( ph  ->  C #  0 )
3 recexap 8407 . . . 4  |-  ( ( C  e.  CC  /\  C #  0 )  ->  E. x  e.  CC  ( C  x.  x )  =  1 )
41, 2, 3syl2anc 408 . . 3  |-  ( ph  ->  E. x  e.  CC  ( C  x.  x
)  =  1 )
5 oveq2 5775 . . . 4  |-  ( ( C  x.  A )  =  ( C  x.  B )  ->  (
x  x.  ( C  x.  A ) )  =  ( x  x.  ( C  x.  B
) ) )
6 simprl 520 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  x  e.  CC )
71adantr 274 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  C  e.  CC )
86, 7mulcomd 7780 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  C
)  =  ( C  x.  x ) )
9 simprr 521 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( C  x.  x
)  =  1 )
108, 9eqtrd 2170 . . . . . . 7  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  C
)  =  1 )
1110oveq1d 5782 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  A
)  =  ( 1  x.  A ) )
12 mulcand.1 . . . . . . . 8  |-  ( ph  ->  A  e.  CC )
1312adantr 274 . . . . . . 7  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  A  e.  CC )
146, 7, 13mulassd 7782 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  A
)  =  ( x  x.  ( C  x.  A ) ) )
1513mulid2d 7777 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( 1  x.  A
)  =  A )
1611, 14, 153eqtr3d 2178 . . . . 5  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  ( C  x.  A )
)  =  A )
1710oveq1d 5782 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  B
)  =  ( 1  x.  B ) )
18 mulcand.2 . . . . . . . 8  |-  ( ph  ->  B  e.  CC )
1918adantr 274 . . . . . . 7  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  B  e.  CC )
206, 7, 19mulassd 7782 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  B
)  =  ( x  x.  ( C  x.  B ) ) )
2119mulid2d 7777 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( 1  x.  B
)  =  B )
2217, 20, 213eqtr3d 2178 . . . . 5  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  ( C  x.  B )
)  =  B )
2316, 22eqeq12d 2152 . . . 4  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  ( C  x.  A
) )  =  ( x  x.  ( C  x.  B ) )  <-> 
A  =  B ) )
245, 23syl5ib 153 . . 3  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( C  x.  A )  =  ( C  x.  B )  ->  A  =  B ) )
254, 24rexlimddv 2552 . 2  |-  ( ph  ->  ( ( C  x.  A )  =  ( C  x.  B )  ->  A  =  B ) )
26 oveq2 5775 . 2  |-  ( A  =  B  ->  ( C  x.  A )  =  ( C  x.  B ) )
2725, 26impbid1 141 1  |-  ( ph  ->  ( ( C  x.  A )  =  ( C  x.  B )  <-> 
A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331    e. wcel 1480   E.wrex 2415   class class class wbr 3924  (class class class)co 5767   CCcc 7611   0cc0 7613   1c1 7614    x. cmul 7618   # cap 8336
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-1re 7707  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-mulrcl 7712  ax-addcom 7713  ax-mulcom 7714  ax-addass 7715  ax-mulass 7716  ax-distr 7717  ax-i2m1 7718  ax-0lt1 7719  ax-1rid 7720  ax-0id 7721  ax-rnegex 7722  ax-precex 7723  ax-cnre 7724  ax-pre-ltirr 7725  ax-pre-ltwlin 7726  ax-pre-lttrn 7727  ax-pre-apti 7728  ax-pre-ltadd 7729  ax-pre-mulgt0 7730  ax-pre-mulext 7731
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-id 4210  df-po 4213  df-iso 4214  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-iota 5083  df-fun 5120  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929  df-reap 8330  df-ap 8337
This theorem is referenced by:  mulcanap2d  8416  mulcanapad  8417  mulcanap  8419  div11ap  8453  eqneg  8485  dvdscmulr  11511  qredeq  11766  cncongr1  11773
  Copyright terms: Public domain W3C validator