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 7125 | . 2 | |
2 | pinn 7117 | . . . 4 | |
3 | pinn 7117 | . . . 4 | |
4 | nnmcl 6377 | . . . 4 | |
5 | 2, 3, 4 | syl2an 287 | . . 3 |
6 | elni2 7122 | . . . . . . 7 | |
7 | 6 | simprbi 273 | . . . . . 6 |
8 | 7 | adantl 275 | . . . . 5 |
9 | 3 | adantl 275 | . . . . . 6 |
10 | 2 | adantr 274 | . . . . . 6 |
11 | elni2 7122 | . . . . . . . 8 | |
12 | 11 | simprbi 273 | . . . . . . 7 |
13 | 12 | adantr 274 | . . . . . 6 |
14 | nnmordi 6412 | . . . . . 6 | |
15 | 9, 10, 13, 14 | syl21anc 1215 | . . . . 5 |
16 | 8, 15 | mpd 13 | . . . 4 |
17 | ne0i 3369 | . . . 4 | |
18 | 16, 17 | syl 14 | . . 3 |
19 | elni 7116 | . . 3 | |
20 | 5, 18, 19 | sylanbrc 413 | . 2 |
21 | 1, 20 | eqeltrd 2216 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wcel 1480 wne 2308 c0 3363 com 4504 (class class class)co 5774 comu 6311 cnpi 7080 cmi 7082 |
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 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-iord 4288 df-on 4290 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-irdg 6267 df-oadd 6317 df-omul 6318 df-ni 7112 df-mi 7114 |
This theorem is referenced by: mulasspig 7140 distrpig 7141 ltmpig 7147 enqer 7166 enqdc 7169 addcmpblnq 7175 mulcmpblnq 7176 addpipqqslem 7177 mulpipq2 7179 mulpipqqs 7181 ordpipqqs 7182 addclnq 7183 mulclnq 7184 addcomnqg 7189 addassnqg 7190 mulassnqg 7192 mulcanenq 7193 distrnqg 7195 recexnq 7198 nqtri3or 7204 ltdcnq 7205 ltsonq 7206 ltanqg 7208 ltmnqg 7209 1lt2nq 7214 ltexnqq 7216 archnqq 7225 addcmpblnq0 7251 mulcmpblnq0 7252 mulcanenq0ec 7253 addclnq0 7259 mulclnq0 7260 nqpnq0nq 7261 nqnq0a 7262 nqnq0m 7263 nq0m0r 7264 distrnq0 7267 addassnq0lemcl 7269 |
Copyright terms: Public domain | W3C validator |