Theorem mul0eqap 9000

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 8319	. . . . 5 |- ( ph -> 0 e. CC )
5		apcotr 8935	. . . . 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 8319	. . . . . . 7 |- ( ( ph /\ A # 0 ) -> 0 e. CC )
12	2, 3	mulcld 8346	. . . . . . . 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 8985	. . . . . . . 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 8952	. . . . . 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 8319	. . . . . . 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 8952	. . . . . 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 ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   \/ wo 720   = wceq 1402   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   0cc0 8179   x. cmul 8184   # cap 8909

This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910

This theorem is used by: (None)