Theorem nnm00 6418

Description: The product of two natural numbers is zero iff at least one of them is zero. (Contributed by Jim Kingdon, 11-Nov-2004.)

Assertion

Ref	Expression
nnm00	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o 𝐵) = ∅ ↔ (𝐴 = ∅ ∨ 𝐵 = ∅)))

Proof of Theorem nnm00

Step	Hyp	Ref	Expression
1		simpl 108	. . . . . . 7 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → 𝐴 = ∅)
2		simpl 108	. . . . . . 7 ⊢ ((𝐴 = ∅ ∧ ∅ ∈ 𝐵) → 𝐴 = ∅)
3	1, 2	jaoi 705	. . . . . 6 ⊢ (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) → 𝐴 = ∅)
4	3	orcd 722	. . . . 5 ⊢ (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅))
5	4	a1i 9	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
6		simpr 109	. . . . . . 7 ⊢ ((∅ ∈ 𝐴 ∧ 𝐵 = ∅) → 𝐵 = ∅)
7	6	olcd 723	. . . . . 6 ⊢ ((∅ ∈ 𝐴 ∧ 𝐵 = ∅) → (𝐴 = ∅ ∨ 𝐵 = ∅))
8	7	a1i 9	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → ((∅ ∈ 𝐴 ∧ 𝐵 = ∅) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
9		simplr 519	. . . . . . 7 ⊢ ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → (𝐴 ·o 𝐵) = ∅)
10		nnmordi 6405	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (∅ ∈ 𝐵 → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵)))
11	10	expimpd 360	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵)))
12	11	ancoms 266	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵)))
13		nnm0 6364	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ω → (𝐴 ·o ∅) = ∅)
14	13	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o ∅) = ∅)
15	14	eleq1d 2206	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵) ↔ ∅ ∈ (𝐴 ·o 𝐵)))
16	12, 15	sylibd 148	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → ∅ ∈ (𝐴 ·o 𝐵)))
17	16	adantr 274	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → ∅ ∈ (𝐴 ·o 𝐵)))
18	17	imp 123	. . . . . . . 8 ⊢ ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → ∅ ∈ (𝐴 ·o 𝐵))
19		n0i 3363	. . . . . . . 8 ⊢ (∅ ∈ (𝐴 ·o 𝐵) → ¬ (𝐴 ·o 𝐵) = ∅)
20	18, 19	syl 14	. . . . . . 7 ⊢ ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → ¬ (𝐴 ·o 𝐵) = ∅)
21	9, 20	pm2.21dd 609	. . . . . 6 ⊢ ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅))
22	21	ex 114	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
23	8, 22	jaod 706	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (((∅ ∈ 𝐴 ∧ 𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
24		0elnn 4527	. . . . . . 7 ⊢ (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴))
25		0elnn 4527	. . . . . . 7 ⊢ (𝐵 ∈ ω → (𝐵 = ∅ ∨ ∅ ∈ 𝐵))
26	24, 25	anim12i 336	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) ∧ (𝐵 = ∅ ∨ ∅ ∈ 𝐵)))
27		anddi 810	. . . . . 6 ⊢ (((𝐴 = ∅ ∨ ∅ ∈ 𝐴) ∧ (𝐵 = ∅ ∨ ∅ ∈ 𝐵)) ↔ (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) ∨ ((∅ ∈ 𝐴 ∧ 𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵))))
28	26, 27	sylib 121	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) ∨ ((∅ ∈ 𝐴 ∧ 𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵))))
29	28	adantr 274	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) ∨ ((∅ ∈ 𝐴 ∧ 𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵))))
30	5, 23, 29	mpjaod 707	. . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (𝐴 = ∅ ∨ 𝐵 = ∅))
31	30	ex 114	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o 𝐵) = ∅ → (𝐴 = ∅ ∨ 𝐵 = ∅)))
32		oveq1 5774	. . . . . 6 ⊢ (𝐴 = ∅ → (𝐴 ·o 𝐵) = (∅ ·o 𝐵))
33		nnm0r 6368	. . . . . 6 ⊢ (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
34	32, 33	sylan9eqr 2192	. . . . 5 ⊢ ((𝐵 ∈ ω ∧ 𝐴 = ∅) → (𝐴 ·o 𝐵) = ∅)
35	34	ex 114	. . . 4 ⊢ (𝐵 ∈ ω → (𝐴 = ∅ → (𝐴 ·o 𝐵) = ∅))
36	35	adantl 275	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 = ∅ → (𝐴 ·o 𝐵) = ∅))
37		oveq2 5775	. . . . . 6 ⊢ (𝐵 = ∅ → (𝐴 ·o 𝐵) = (𝐴 ·o ∅))
38	37, 13	sylan9eqr 2192	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 = ∅) → (𝐴 ·o 𝐵) = ∅)
39	38	ex 114	. . . 4 ⊢ (𝐴 ∈ ω → (𝐵 = ∅ → (𝐴 ·o 𝐵) = ∅))
40	39	adantr 274	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 = ∅ → (𝐴 ·o 𝐵) = ∅))
41	36, 40	jaod 706	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 = ∅ ∨ 𝐵 = ∅) → (𝐴 ·o 𝐵) = ∅))
42	31, 41	impbid 128	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o 𝐵) = ∅ ↔ (𝐴 = ∅ ∨ 𝐵 = ∅)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 697   = wceq 1331   ∈ wcel 1480  ∅c0 3358  ωcom 4499  (class class class)co 5767   ·_o comu 6304

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-id 4210  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-oadd 6310  df-omul 6311

This theorem is referenced by:  enq0tr  7235  nqnq0pi  7239