Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mulclpi | Unicode version |
Description: Closure of multiplication of positive integers. (Contributed by NM, 18-Oct-1995.) |
Ref | Expression |
---|---|
mulclpi |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mulpiord 6507 | . 2 | |
2 | pinn 6499 | . . . 4 | |
3 | pinn 6499 | . . . 4 | |
4 | nnmcl 6083 | . . . 4 | |
5 | 2, 3, 4 | syl2an 283 | . . 3 |
6 | elni2 6504 | . . . . . . 7 | |
7 | 6 | simprbi 269 | . . . . . 6 |
8 | 7 | adantl 271 | . . . . 5 |
9 | 3 | adantl 271 | . . . . . 6 |
10 | 2 | adantr 270 | . . . . . 6 |
11 | elni2 6504 | . . . . . . . 8 | |
12 | 11 | simprbi 269 | . . . . . . 7 |
13 | 12 | adantr 270 | . . . . . 6 |
14 | nnmordi 6112 | . . . . . 6 | |
15 | 9, 10, 13, 14 | syl21anc 1168 | . . . . 5 |
16 | 8, 15 | mpd 13 | . . . 4 |
17 | ne0i 3257 | . . . 4 | |
18 | 16, 17 | syl 14 | . . 3 |
19 | elni 6498 | . . 3 | |
20 | 5, 18, 19 | sylanbrc 408 | . 2 |
21 | 1, 20 | eqeltrd 2155 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wcel 1433 wne 2245 c0 3251 com 4331 (class class class)co 5532 comu 6022 cnpi 6462 cmi 6464 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 |
This theorem depends on definitions: df-bi 115 df-dc 776 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-id 4048 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-irdg 5980 df-oadd 6028 df-omul 6029 df-ni 6494 df-mi 6496 |
This theorem is referenced by: mulasspig 6522 distrpig 6523 ltmpig 6529 enqer 6548 enqdc 6551 addcmpblnq 6557 mulcmpblnq 6558 addpipqqslem 6559 mulpipq2 6561 mulpipqqs 6563 ordpipqqs 6564 addclnq 6565 mulclnq 6566 addcomnqg 6571 addassnqg 6572 mulassnqg 6574 mulcanenq 6575 distrnqg 6577 recexnq 6580 nqtri3or 6586 ltdcnq 6587 ltsonq 6588 ltanqg 6590 ltmnqg 6591 1lt2nq 6596 ltexnqq 6598 archnqq 6607 addcmpblnq0 6633 mulcmpblnq0 6634 mulcanenq0ec 6635 addclnq0 6641 mulclnq0 6642 nqpnq0nq 6643 nqnq0a 6644 nqnq0m 6645 nq0m0r 6646 distrnq0 6649 addassnq0lemcl 6651 |
Copyright terms: Public domain | W3C validator |