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

Theorem mulcanapd 8558
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 8550 . . . 4  |-  ( ( C  e.  CC  /\  C #  0 )  ->  E. x  e.  CC  ( C  x.  x )  =  1 )
41, 2, 3syl2anc 409 . . 3  |-  ( ph  ->  E. x  e.  CC  ( C  x.  x
)  =  1 )
5 oveq2 5850 . . . 4  |-  ( ( C  x.  A )  =  ( C  x.  B )  ->  (
x  x.  ( C  x.  A ) )  =  ( x  x.  ( C  x.  B
) ) )
6 simprl 521 . . . . . . . . 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 7920 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  C
)  =  ( C  x.  x ) )
9 simprr 522 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( C  x.  x
)  =  1 )
108, 9eqtrd 2198 . . . . . . 7  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  C
)  =  1 )
1110oveq1d 5857 . . . . . 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 7922 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  A
)  =  ( x  x.  ( C  x.  A ) ) )
1513mulid2d 7917 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( 1  x.  A
)  =  A )
1611, 14, 153eqtr3d 2206 . . . . 5  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  ( C  x.  A )
)  =  A )
1710oveq1d 5857 . . . . . 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 7922 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  B
)  =  ( x  x.  ( C  x.  B ) ) )
2119mulid2d 7917 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( 1  x.  B
)  =  B )
2217, 20, 213eqtr3d 2206 . . . . 5  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  ( C  x.  B )
)  =  B )
2316, 22eqeq12d 2180 . . . 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 2588 . 2  |-  ( ph  ->  ( ( C  x.  A )  =  ( C  x.  B )  ->  A  =  B ) )
26 oveq2 5850 . 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 1343    e. wcel 2136   E.wrex 2445   class class class wbr 3982  (class class class)co 5842   CCcc 7751   0cc0 7753   1c1 7754    x. cmul 7758   # cap 8479
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-po 4274  df-iso 4275  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480
This theorem is referenced by:  mulcanap2d  8559  mulcanapad  8560  mulcanap  8562  div11ap  8596  eqneg  8628  dvdscmulr  11760  qredeq  12028  cncongr1  12035
  Copyright terms: Public domain W3C validator