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

Theorem apmul1 8548
Description: Multiplication of both sides of complex apartness by a complex number apart from zero. (Contributed by Jim Kingdon, 20-Mar-2020.)
Assertion
Ref Expression
apmul1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( A #  B  <->  ( A  x.  C ) #  ( B  x.  C ) ) )

Proof of Theorem apmul1
StepHypRef Expression
1 simp1 981 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  ->  A  e.  CC )
2 simp3l 1009 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  ->  C  e.  CC )
3 simp3r 1010 . . . . . . 7  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  ->  C #  0 )
42, 3recclapd 8541 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( 1  /  C
)  e.  CC )
51, 2, 4mulassd 7789 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( ( A  x.  C )  x.  (
1  /  C ) )  =  ( A  x.  ( C  x.  ( 1  /  C
) ) ) )
62, 3recidapd 8543 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( C  x.  (
1  /  C ) )  =  1 )
76oveq2d 5790 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( A  x.  ( C  x.  ( 1  /  C ) ) )  =  ( A  x.  1 ) )
81mulid1d 7783 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( A  x.  1 )  =  A )
95, 7, 83eqtrd 2176 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( ( A  x.  C )  x.  (
1  /  C ) )  =  A )
10 simp2 982 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  ->  B  e.  CC )
1110, 2, 4mulassd 7789 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( ( B  x.  C )  x.  (
1  /  C ) )  =  ( B  x.  ( C  x.  ( 1  /  C
) ) ) )
126oveq2d 5790 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( B  x.  ( C  x.  ( 1  /  C ) ) )  =  ( B  x.  1 ) )
1310mulid1d 7783 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( B  x.  1 )  =  B )
1411, 12, 133eqtrd 2176 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( ( B  x.  C )  x.  (
1  /  C ) )  =  B )
159, 14breq12d 3942 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( ( ( A  x.  C )  x.  ( 1  /  C
) ) #  ( ( B  x.  C )  x.  ( 1  /  C ) )  <->  A #  B
) )
161, 2mulcld 7786 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( A  x.  C
)  e.  CC )
1710, 2mulcld 7786 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( B  x.  C
)  e.  CC )
18 mulext1 8374 . . . 4  |-  ( ( ( A  x.  C
)  e.  CC  /\  ( B  x.  C
)  e.  CC  /\  ( 1  /  C
)  e.  CC )  ->  ( ( ( A  x.  C )  x.  ( 1  /  C ) ) #  ( ( B  x.  C
)  x.  ( 1  /  C ) )  ->  ( A  x.  C ) #  ( B  x.  C ) ) )
1916, 17, 4, 18syl3anc 1216 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( ( ( A  x.  C )  x.  ( 1  /  C
) ) #  ( ( B  x.  C )  x.  ( 1  /  C ) )  -> 
( A  x.  C
) #  ( B  x.  C ) ) )
2015, 19sylbird 169 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( A #  B  -> 
( A  x.  C
) #  ( B  x.  C ) ) )
21 mulext1 8374 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  C
) #  ( B  x.  C )  ->  A #  B ) )
22213adant3r 1213 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( ( A  x.  C ) #  ( B  x.  C )  ->  A #  B ) )
2320, 22impbid 128 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) )  -> 
( A #  B  <->  ( A  x.  C ) #  ( B  x.  C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 962    e. wcel 1480   class class class wbr 3929  (class class class)co 5774   CCcc 7618   0cc0 7620   1c1 7621    x. cmul 7625   # cap 8343    / cdiv 8432
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 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-mulrcl 7719  ax-addcom 7720  ax-mulcom 7721  ax-addass 7722  ax-mulass 7723  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-1rid 7727  ax-0id 7728  ax-rnegex 7729  ax-precex 7730  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-apti 7735  ax-pre-ltadd 7736  ax-pre-mulgt0 7737  ax-pre-mulext 7738
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 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-po 4218  df-iso 4219  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-reap 8337  df-ap 8344  df-div 8433
This theorem is referenced by:  apmul2  8549  divap1d  8561  apdivmuld  8573  qapne  9431
  Copyright terms: Public domain W3C validator