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

Theorem nnm00 6803
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
StepHypRef Expression
1 simpl 109 . . . . . . 7 ((𝐴 = ∅ ∧ 𝐵 = ∅) → 𝐴 = ∅)
2 simpl 109 . . . . . . 7 ((𝐴 = ∅ ∧ ∅ ∈ 𝐵) → 𝐴 = ∅)
31, 2jaoi 728 . . . . . 6 (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) → 𝐴 = ∅)
43orcd 745 . . . . 5 (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅))
54a1i 9 . . . 4 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
6 simpr 110 . . . . . . 7 ((∅ ∈ 𝐴𝐵 = ∅) → 𝐵 = ∅)
76olcd 746 . . . . . 6 ((∅ ∈ 𝐴𝐵 = ∅) → (𝐴 = ∅ ∨ 𝐵 = ∅))
87a1i 9 . . . . 5 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → ((∅ ∈ 𝐴𝐵 = ∅) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
9 simplr 533 . . . . . . 7 ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → (𝐴 ·o 𝐵) = ∅)
10 nnmordi 6789 . . . . . . . . . . . . 13 (((𝐵 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (∅ ∈ 𝐵 → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵)))
1110expimpd 363 . . . . . . . . . . . 12 ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵)))
1211ancoms 268 . . . . . . . . . . 11 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵)))
13 nnm0 6748 . . . . . . . . . . . . 13 (𝐴 ∈ ω → (𝐴 ·o ∅) = ∅)
1413adantr 276 . . . . . . . . . . . 12 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o ∅) = ∅)
1514eleq1d 2307 . . . . . . . . . . 11 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵) ↔ ∅ ∈ (𝐴 ·o 𝐵)))
1612, 15sylibd 149 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → ∅ ∈ (𝐴 ·o 𝐵)))
1716adantr 276 . . . . . . . . 9 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → ∅ ∈ (𝐴 ·o 𝐵)))
1817imp 124 . . . . . . . 8 ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → ∅ ∈ (𝐴 ·o 𝐵))
19 n0i 3527 . . . . . . . 8 (∅ ∈ (𝐴 ·o 𝐵) → ¬ (𝐴 ·o 𝐵) = ∅)
2018, 19syl 14 . . . . . . 7 ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → ¬ (𝐴 ·o 𝐵) = ∅)
219, 20pm2.21dd 629 . . . . . 6 ((((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) ∧ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅))
2221ex 115 . . . . 5 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → ((∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
238, 22jaod 729 . . . 4 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (((∅ ∈ 𝐴𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵)) → (𝐴 = ∅ ∨ 𝐵 = ∅)))
24 0elnn 4766 . . . . . . 7 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴))
25 0elnn 4766 . . . . . . 7 (𝐵 ∈ ω → (𝐵 = ∅ ∨ ∅ ∈ 𝐵))
2624, 25anim12i 338 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) ∧ (𝐵 = ∅ ∨ ∅ ∈ 𝐵)))
27 anddi 833 . . . . . 6 (((𝐴 = ∅ ∨ ∅ ∈ 𝐴) ∧ (𝐵 = ∅ ∨ ∅ ∈ 𝐵)) ↔ (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) ∨ ((∅ ∈ 𝐴𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵))))
2826, 27sylib 122 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) ∨ ((∅ ∈ 𝐴𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵))))
2928adantr 276 . . . 4 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (((𝐴 = ∅ ∧ 𝐵 = ∅) ∨ (𝐴 = ∅ ∧ ∅ ∈ 𝐵)) ∨ ((∅ ∈ 𝐴𝐵 = ∅) ∨ (∅ ∈ 𝐴 ∧ ∅ ∈ 𝐵))))
305, 23, 29mpjaod 730 . . 3 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐴 ·o 𝐵) = ∅) → (𝐴 = ∅ ∨ 𝐵 = ∅))
3130ex 115 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o 𝐵) = ∅ → (𝐴 = ∅ ∨ 𝐵 = ∅)))
32 oveq1 6092 . . . . . 6 (𝐴 = ∅ → (𝐴 ·o 𝐵) = (∅ ·o 𝐵))
33 nnm0r 6752 . . . . . 6 (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
3432, 33sylan9eqr 2293 . . . . 5 ((𝐵 ∈ ω ∧ 𝐴 = ∅) → (𝐴 ·o 𝐵) = ∅)
3534ex 115 . . . 4 (𝐵 ∈ ω → (𝐴 = ∅ → (𝐴 ·o 𝐵) = ∅))
3635adantl 277 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 = ∅ → (𝐴 ·o 𝐵) = ∅))
37 oveq2 6093 . . . . . 6 (𝐵 = ∅ → (𝐴 ·o 𝐵) = (𝐴 ·o ∅))
3837, 13sylan9eqr 2293 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 = ∅) → (𝐴 ·o 𝐵) = ∅)
3938ex 115 . . . 4 (𝐴 ∈ ω → (𝐵 = ∅ → (𝐴 ·o 𝐵) = ∅))
4039adantr 276 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 = ∅ → (𝐴 ·o 𝐵) = ∅))
4136, 40jaod 729 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 = ∅ ∨ 𝐵 = ∅) → (𝐴 ·o 𝐵) = ∅))
4231, 41impbid 129 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o 𝐵) = ∅ ↔ (𝐴 = ∅ ∨ 𝐵 = ∅)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 104  wb 105  wo 720   = wceq 1402  wcel 2209  c0 3520  ωcom 4737  (class class class)co 6085   ·o comu 6685
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-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-oadd 6691  df-omul 6692
This theorem is used by:  enq0tr  7801  nqnq0pi  7805
  Copyright terms: Public domain W3C validator