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

Theorem mul0eqap 8944
Description: If two numbers are apart from each other and their product is zero, one of them must be zero. (Contributed by Jim Kingdon, 31-Jul-2023.)
Hypotheses
Ref Expression
mul0eqap.a  |-  ( ph  ->  A  e.  CC )
mul0eqap.b  |-  ( ph  ->  B  e.  CC )
mul0eqap.ab  |-  ( ph  ->  A #  B )
mul0eqap.0  |-  ( ph  ->  ( A  x.  B
)  =  0 )
Assertion
Ref Expression
mul0eqap  |-  ( ph  ->  ( A  =  0  \/  B  =  0 ) )

Proof of Theorem mul0eqap
StepHypRef Expression
1 mul0eqap.ab . . . 4  |-  ( ph  ->  A #  B )
2 mul0eqap.a . . . . 5  |-  ( ph  ->  A  e.  CC )
3 mul0eqap.b . . . . 5  |-  ( ph  ->  B  e.  CC )
4 0cnd 8267 . . . . 5  |-  ( ph  ->  0  e.  CC )
5 apcotr 8881 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  0  e.  CC )  ->  ( A #  B  ->  ( A #  0  \/  B #  0 ) ) )
62, 3, 4, 5syl3anc 1274 . . . 4  |-  ( ph  ->  ( A #  B  -> 
( A #  0  \/  B #  0 ) ) )
71, 6mpd 13 . . 3  |-  ( ph  ->  ( A #  0  \/  B #  0 ) )
8 mul0eqap.0 . . . . . . 7  |-  ( ph  ->  ( A  x.  B
)  =  0 )
98adantr 276 . . . . . 6  |-  ( (
ph  /\  A #  0
)  ->  ( A  x.  B )  =  0 )
103adantr 276 . . . . . . 7  |-  ( (
ph  /\  A #  0
)  ->  B  e.  CC )
11 0cnd 8267 . . . . . . 7  |-  ( (
ph  /\  A #  0
)  ->  0  e.  CC )
122, 3mulcld 8294 . . . . . . . 8  |-  ( ph  ->  ( A  x.  B
)  e.  CC )
1312adantr 276 . . . . . . 7  |-  ( (
ph  /\  A #  0
)  ->  ( A  x.  B )  e.  CC )
14 ibar 301 . . . . . . . 8  |-  ( A #  0  ->  ( B #  0 
<->  ( A #  0  /\  B #  0 ) ) )
152, 3mulap0bd 8931 . . . . . . . 8  |-  ( ph  ->  ( ( A #  0  /\  B #  0 )  <-> 
( A  x.  B
) #  0 ) )
1614, 15sylan9bbr 463 . . . . . . 7  |-  ( (
ph  /\  A #  0
)  ->  ( B #  0 
<->  ( A  x.  B
) #  0 ) )
1710, 11, 13, 11, 16apcon4bid 8898 . . . . . 6  |-  ( (
ph  /\  A #  0
)  ->  ( B  =  0  <->  ( A  x.  B )  =  0 ) )
189, 17mpbird 167 . . . . 5  |-  ( (
ph  /\  A #  0
)  ->  B  = 
0 )
1918ex 115 . . . 4  |-  ( ph  ->  ( A #  0  ->  B  =  0 ) )
208adantr 276 . . . . . 6  |-  ( (
ph  /\  B #  0
)  ->  ( A  x.  B )  =  0 )
212adantr 276 . . . . . . 7  |-  ( (
ph  /\  B #  0
)  ->  A  e.  CC )
22 0cnd 8267 . . . . . . 7  |-  ( (
ph  /\  B #  0
)  ->  0  e.  CC )
2312adantr 276 . . . . . . 7  |-  ( (
ph  /\  B #  0
)  ->  ( A  x.  B )  e.  CC )
24 iba 300 . . . . . . . 8  |-  ( B #  0  ->  ( A #  0 
<->  ( A #  0  /\  B #  0 ) ) )
2524, 15sylan9bbr 463 . . . . . . 7  |-  ( (
ph  /\  B #  0
)  ->  ( A #  0 
<->  ( A  x.  B
) #  0 ) )
2621, 22, 23, 22, 25apcon4bid 8898 . . . . . 6  |-  ( (
ph  /\  B #  0
)  ->  ( A  =  0  <->  ( A  x.  B )  =  0 ) )
2720, 26mpbird 167 . . . . 5  |-  ( (
ph  /\  B #  0
)  ->  A  = 
0 )
2827ex 115 . . . 4  |-  ( ph  ->  ( B #  0  ->  A  =  0 ) )
2919, 28orim12d 794 . . 3  |-  ( ph  ->  ( ( A #  0  \/  B #  0 )  ->  ( B  =  0  \/  A  =  0 ) ) )
307, 29mpd 13 . 2  |-  ( ph  ->  ( B  =  0  \/  A  =  0 ) )
3130orcomd 737 1  |-  ( ph  ->  ( A  =  0  \/  B  =  0 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 716    = wceq 1398    e. wcel 2203   class class class wbr 4109  (class class class)co 6050   CCcc 8125   0cc0 8127    x. cmul 8132   # cap 8855
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-po 4417  df-iso 4418  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator