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

Theorem mul0eqap 8849
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 8171 . . . . 5  |-  ( ph  ->  0  e.  CC )
5 apcotr 8786 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  0  e.  CC )  ->  ( A #  B  ->  ( A #  0  \/  B #  0 ) ) )
62, 3, 4, 5syl3anc 1273 . . . 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 8171 . . . . . . 7  |-  ( (
ph  /\  A #  0
)  ->  0  e.  CC )
122, 3mulcld 8199 . . . . . . . 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 8836 . . . . . . . 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 8803 . . . . . 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 8171 . . . . . . 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 8803 . . . . . 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 793 . . 3  |-  ( ph  ->  ( ( A #  0  \/  B #  0 )  ->  ( B  =  0  \/  A  =  0 ) ) )
307, 29mpd 13 . 2  |-  ( ph  ->  ( B  =  0  \/  A  =  0 ) )
3130orcomd 736 1  |-  ( ph  ->  ( A  =  0  \/  B  =  0 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 715    = wceq 1397    e. wcel 2202   class class class wbr 4088  (class class class)co 6017   CCcc 8029   0cc0 8031    x. cmul 8036   # cap 8760
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator