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

Theorem mul0eqap 8966
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 8285 . . . . 5  |-  ( ph  ->  0  e.  CC )
5 apcotr 8901 . . . . 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 8285 . . . . . . 7  |-  ( (
ph  /\  A #  0
)  ->  0  e.  CC )
122, 3mulcld 8312 . . . . . . . 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 8951 . . . . . . . 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 8918 . . . . . 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 8285 . . . . . . 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 8918 . . . . . 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 2205   class class class wbr 4115  (class class class)co 6060   CCcc 8143   0cc0 8145    x. cmul 8150   # cap 8875
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-14 2208  ax-ext 2216  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4666  ax-cnex 8236  ax-resscn 8237  ax-1cn 8238  ax-1re 8239  ax-icn 8240  ax-addcl 8241  ax-addrcl 8242  ax-mulcl 8243  ax-mulrcl 8244  ax-addcom 8245  ax-mulcom 8246  ax-addass 8247  ax-mulass 8248  ax-distr 8249  ax-i2m1 8250  ax-0lt1 8251  ax-1rid 8252  ax-0id 8253  ax-rnegex 8254  ax-precex 8255  ax-cnre 8256  ax-pre-ltirr 8257  ax-pre-ltwlin 8258  ax-pre-lttrn 8259  ax-pre-apti 8260  ax-pre-ltadd 8261  ax-pre-mulgt0 8262  ax-pre-mulext 8263
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-br 4116  df-opab 4178  df-id 4420  df-po 4423  df-iso 4424  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-iota 5319  df-fun 5361  df-fv 5367  df-riota 6013  df-ov 6063  df-oprab 6064  df-mpo 6065  df-pnf 8328  df-mnf 8329  df-xr 8330  df-ltxr 8331  df-le 8332  df-sub 8465  df-neg 8466  df-reap 8869  df-ap 8876
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator