Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mulclpi | GIF version |
Description: Closure of multiplication of positive integers. (Contributed by NM, 18-Oct-1995.) |
Ref | Expression |
---|---|
mulclpi | ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·N 𝐵) ∈ N) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mulpiord 6415 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·N 𝐵) = (𝐴 ·𝑜 𝐵)) | |
2 | pinn 6407 | . . . 4 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
3 | pinn 6407 | . . . 4 ⊢ (𝐵 ∈ N → 𝐵 ∈ ω) | |
4 | nnmcl 6060 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 𝐵) ∈ ω) | |
5 | 2, 3, 4 | syl2an 273 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·𝑜 𝐵) ∈ ω) |
6 | elni2 6412 | . . . . . . 7 ⊢ (𝐵 ∈ N ↔ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) | |
7 | 6 | simprbi 260 | . . . . . 6 ⊢ (𝐵 ∈ N → ∅ ∈ 𝐵) |
8 | 7 | adantl 262 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ∅ ∈ 𝐵) |
9 | 3 | adantl 262 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → 𝐵 ∈ ω) |
10 | 2 | adantr 261 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → 𝐴 ∈ ω) |
11 | elni2 6412 | . . . . . . . 8 ⊢ (𝐴 ∈ N ↔ (𝐴 ∈ ω ∧ ∅ ∈ 𝐴)) | |
12 | 11 | simprbi 260 | . . . . . . 7 ⊢ (𝐴 ∈ N → ∅ ∈ 𝐴) |
13 | 12 | adantr 261 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ∅ ∈ 𝐴) |
14 | nnmordi 6089 | . . . . . 6 ⊢ (((𝐵 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (∅ ∈ 𝐵 → (𝐴 ·𝑜 ∅) ∈ (𝐴 ·𝑜 𝐵))) | |
15 | 9, 10, 13, 14 | syl21anc 1134 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (∅ ∈ 𝐵 → (𝐴 ·𝑜 ∅) ∈ (𝐴 ·𝑜 𝐵))) |
16 | 8, 15 | mpd 13 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·𝑜 ∅) ∈ (𝐴 ·𝑜 𝐵)) |
17 | ne0i 3230 | . . . 4 ⊢ ((𝐴 ·𝑜 ∅) ∈ (𝐴 ·𝑜 𝐵) → (𝐴 ·𝑜 𝐵) ≠ ∅) | |
18 | 16, 17 | syl 14 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·𝑜 𝐵) ≠ ∅) |
19 | elni 6406 | . . 3 ⊢ ((𝐴 ·𝑜 𝐵) ∈ N ↔ ((𝐴 ·𝑜 𝐵) ∈ ω ∧ (𝐴 ·𝑜 𝐵) ≠ ∅)) | |
20 | 5, 18, 19 | sylanbrc 394 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·𝑜 𝐵) ∈ N) |
21 | 1, 20 | eqeltrd 2114 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·N 𝐵) ∈ N) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ∈ wcel 1393 ≠ wne 2204 ∅c0 3224 ωcom 4313 (class class class)co 5512 ·𝑜 comu 5999 Ncnpi 6370 ·N cmi 6372 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-id 4030 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-irdg 5957 df-oadd 6005 df-omul 6006 df-ni 6402 df-mi 6404 |
This theorem is referenced by: mulasspig 6430 distrpig 6431 ltmpig 6437 enqer 6456 enqdc 6459 addcmpblnq 6465 mulcmpblnq 6466 addpipqqslem 6467 mulpipq2 6469 mulpipqqs 6471 ordpipqqs 6472 addclnq 6473 mulclnq 6474 addcomnqg 6479 addassnqg 6480 mulassnqg 6482 mulcanenq 6483 distrnqg 6485 recexnq 6488 nqtri3or 6494 ltdcnq 6495 ltsonq 6496 ltanqg 6498 ltmnqg 6499 1lt2nq 6504 ltexnqq 6506 archnqq 6515 addcmpblnq0 6541 mulcmpblnq0 6542 mulcanenq0ec 6543 addclnq0 6549 mulclnq0 6550 nqpnq0nq 6551 nqnq0a 6552 nqnq0m 6553 nq0m0r 6554 distrnq0 6557 addassnq0lemcl 6559 |
Copyright terms: Public domain | W3C validator |