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

Theorem mulcanapd 8819
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 8811 . . . 4  |-  ( ( C  e.  CC  /\  C #  0 )  ->  E. x  e.  CC  ( C  x.  x )  =  1 )
41, 2, 3syl2anc 411 . . 3  |-  ( ph  ->  E. x  e.  CC  ( C  x.  x
)  =  1 )
5 oveq2 6015 . . . 4  |-  ( ( C  x.  A )  =  ( C  x.  B )  ->  (
x  x.  ( C  x.  A ) )  =  ( x  x.  ( C  x.  B
) ) )
6 simprl 529 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  x  e.  CC )
71adantr 276 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  C  e.  CC )
86, 7mulcomd 8179 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  C
)  =  ( C  x.  x ) )
9 simprr 531 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( C  x.  x
)  =  1 )
108, 9eqtrd 2262 . . . . . . 7  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  C
)  =  1 )
1110oveq1d 6022 . . . . . 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 276 . . . . . . 7  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  A  e.  CC )
146, 7, 13mulassd 8181 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  A
)  =  ( x  x.  ( C  x.  A ) ) )
1513mulid2d 8176 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( 1  x.  A
)  =  A )
1611, 14, 153eqtr3d 2270 . . . . 5  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  ( C  x.  A )
)  =  A )
1710oveq1d 6022 . . . . . 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 276 . . . . . . 7  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  ->  B  e.  CC )
206, 7, 19mulassd 8181 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  C )  x.  B
)  =  ( x  x.  ( C  x.  B ) ) )
2119mulid2d 8176 . . . . . 6  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( 1  x.  B
)  =  B )
2217, 20, 213eqtr3d 2270 . . . . 5  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( x  x.  ( C  x.  B )
)  =  B )
2316, 22eqeq12d 2244 . . . 4  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( x  x.  ( C  x.  A
) )  =  ( x  x.  ( C  x.  B ) )  <-> 
A  =  B ) )
245, 23imbitrid 154 . . 3  |-  ( (
ph  /\  ( x  e.  CC  /\  ( C  x.  x )  =  1 ) )  -> 
( ( C  x.  A )  =  ( C  x.  B )  ->  A  =  B ) )
254, 24rexlimddv 2653 . 2  |-  ( ph  ->  ( ( C  x.  A )  =  ( C  x.  B )  ->  A  =  B ) )
26 oveq2 6015 . 2  |-  ( A  =  B  ->  ( C  x.  A )  =  ( C  x.  B ) )
2725, 26impbid1 142 1  |-  ( ph  ->  ( ( C  x.  A )  =  ( C  x.  B )  <-> 
A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   E.wrex 2509   class class class wbr 4083  (class class class)co 6007   CCcc 8008   0cc0 8010   1c1 8011    x. cmul 8015   # cap 8739
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740
This theorem is referenced by:  mulcanap2d  8820  mulcanapad  8821  mulcanap  8823  div11ap  8858  eqneg  8890  dvdscmulr  12346  qredeq  12633  cncongr1  12640  lgseisenlem2  15765
  Copyright terms: Public domain W3C validator