Theorem mul0eqap 8990

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

Step	Hyp	Ref	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 8309	. . . . 5 |- ( ph -> 0 e. CC )
5		apcotr 8925	. . . . 5 |- ( ( A e. CC /\ B e. CC /\ 0 e. CC ) -> ( A # B -> ( A # 0 \/ B # 0 ) ) )
6	2, 3, 4, 5	syl3anc 1278	. . . 4 |- ( ph -> ( A # B -> ( A # 0 \/ B # 0 ) ) )
7	1, 6	mpd 13	. . 3 |- ( ph -> ( A # 0 \/ B # 0 ) )
8		mul0eqap.0	. . . . . . 7 |- ( ph -> ( A x. B ) = 0 )
9	8	adantr 276	. . . . . 6 |- ( ( ph /\ A # 0 ) -> ( A x. B ) = 0 )
10	3	adantr 276	. . . . . . 7 |- ( ( ph /\ A # 0 ) -> B e. CC )
11		0cnd 8309	. . . . . . 7 |- ( ( ph /\ A # 0 ) -> 0 e. CC )
12	2, 3	mulcld 8336	. . . . . . . 8 |- ( ph -> ( A x. B ) e. CC )
13	12	adantr 276	. . . . . . 7 |- ( ( ph /\ A # 0 ) -> ( A x. B ) e. CC )
14		ibar 301	. . . . . . . 8 |- ( A # 0 -> ( B # 0 <-> ( A # 0 /\ B # 0 ) ) )
15	2, 3	mulap0bd 8975	. . . . . . . 8 |- ( ph -> ( ( A # 0 /\ B # 0 ) <-> ( A x. B ) # 0 ) )
16	14, 15	sylan9bbr 467	. . . . . . 7 |- ( ( ph /\ A # 0 ) -> ( B # 0 <-> ( A x. B ) # 0 ) )
17	10, 11, 13, 11, 16	apcon4bid 8942	. . . . . 6 |- ( ( ph /\ A # 0 ) -> ( B = 0 <-> ( A x. B ) = 0 ) )
18	9, 17	mpbird 167	. . . . 5 |- ( ( ph /\ A # 0 ) -> B = 0 )
19	18	ex 115	. . . 4 |- ( ph -> ( A # 0 -> B = 0 ) )
20	8	adantr 276	. . . . . 6 |- ( ( ph /\ B # 0 ) -> ( A x. B ) = 0 )
21	2	adantr 276	. . . . . . 7 |- ( ( ph /\ B # 0 ) -> A e. CC )
22		0cnd 8309	. . . . . . 7 |- ( ( ph /\ B # 0 ) -> 0 e. CC )
23	12	adantr 276	. . . . . . 7 |- ( ( ph /\ B # 0 ) -> ( A x. B ) e. CC )
24		iba 300	. . . . . . . 8 |- ( B # 0 -> ( A # 0 <-> ( A # 0 /\ B # 0 ) ) )
25	24, 15	sylan9bbr 467	. . . . . . 7 |- ( ( ph /\ B # 0 ) -> ( A # 0 <-> ( A x. B ) # 0 ) )
26	21, 22, 23, 22, 25	apcon4bid 8942	. . . . . 6 |- ( ( ph /\ B # 0 ) -> ( A = 0 <-> ( A x. B ) = 0 ) )
27	20, 26	mpbird 167	. . . . 5 |- ( ( ph /\ B # 0 ) -> A = 0 )
28	27	ex 115	. . . 4 |- ( ph -> ( B # 0 -> A = 0 ) )
29	19, 28	orim12d 798	. . 3 |- ( ph -> ( ( A # 0 \/ B # 0 ) -> ( B = 0 \/ A = 0 ) ) )
30	7, 29	mpd 13	. 2 |- ( ph -> ( B = 0 \/ A = 0 ) )
31	30	orcomd 741	1 |- ( ph -> ( A = 0 \/ B = 0 ) )

Syntax hints:   -> wi 4   /\ wa 104   \/ wo 720   = wceq 1402   e. wcel 2209   class class class wbr 4125  (class class class)co 6075   CCcc 8167   0cc0 8169   x. cmul 8174   # cap 8899

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900

This theorem is referenced by: (None)