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 7249 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·N 𝐵) = (𝐴 ·o 𝐵)) | |
2 | pinn 7241 | . . . 4 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
3 | pinn 7241 | . . . 4 ⊢ (𝐵 ∈ N → 𝐵 ∈ ω) | |
4 | nnmcl 6440 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω) | |
5 | 2, 3, 4 | syl2an 287 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·o 𝐵) ∈ ω) |
6 | elni2 7246 | . . . . . . 7 ⊢ (𝐵 ∈ N ↔ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) | |
7 | 6 | simprbi 273 | . . . . . 6 ⊢ (𝐵 ∈ N → ∅ ∈ 𝐵) |
8 | 7 | adantl 275 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ∅ ∈ 𝐵) |
9 | 3 | adantl 275 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → 𝐵 ∈ ω) |
10 | 2 | adantr 274 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → 𝐴 ∈ ω) |
11 | elni2 7246 | . . . . . . . 8 ⊢ (𝐴 ∈ N ↔ (𝐴 ∈ ω ∧ ∅ ∈ 𝐴)) | |
12 | 11 | simprbi 273 | . . . . . . 7 ⊢ (𝐴 ∈ N → ∅ ∈ 𝐴) |
13 | 12 | adantr 274 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ∅ ∈ 𝐴) |
14 | nnmordi 6475 | . . . . . 6 ⊢ (((𝐵 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (∅ ∈ 𝐵 → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵))) | |
15 | 9, 10, 13, 14 | syl21anc 1226 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (∅ ∈ 𝐵 → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵))) |
16 | 8, 15 | mpd 13 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵)) |
17 | ne0i 3410 | . . . 4 ⊢ ((𝐴 ·o ∅) ∈ (𝐴 ·o 𝐵) → (𝐴 ·o 𝐵) ≠ ∅) | |
18 | 16, 17 | syl 14 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·o 𝐵) ≠ ∅) |
19 | elni 7240 | . . 3 ⊢ ((𝐴 ·o 𝐵) ∈ N ↔ ((𝐴 ·o 𝐵) ∈ ω ∧ (𝐴 ·o 𝐵) ≠ ∅)) | |
20 | 5, 18, 19 | sylanbrc 414 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·o 𝐵) ∈ N) |
21 | 1, 20 | eqeltrd 2241 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·N 𝐵) ∈ N) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∈ wcel 2135 ≠ wne 2334 ∅c0 3404 ωcom 4561 (class class class)co 5836 ·o comu 6373 Ncnpi 7204 ·N cmi 7206 |
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 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-coll 4091 ax-sep 4094 ax-nul 4102 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-iinf 4559 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-ral 2447 df-rex 2448 df-reu 2449 df-rab 2451 df-v 2723 df-sbc 2947 df-csb 3041 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-nul 3405 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-iun 3862 df-br 3977 df-opab 4038 df-mpt 4039 df-tr 4075 df-id 4265 df-iord 4338 df-on 4340 df-suc 4343 df-iom 4562 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-f1 5187 df-fo 5188 df-f1o 5189 df-fv 5190 df-ov 5839 df-oprab 5840 df-mpo 5841 df-1st 6100 df-2nd 6101 df-recs 6264 df-irdg 6329 df-oadd 6379 df-omul 6380 df-ni 7236 df-mi 7238 |
This theorem is referenced by: mulasspig 7264 distrpig 7265 ltmpig 7271 enqer 7290 enqdc 7293 addcmpblnq 7299 mulcmpblnq 7300 addpipqqslem 7301 mulpipq2 7303 mulpipqqs 7305 ordpipqqs 7306 addclnq 7307 mulclnq 7308 addcomnqg 7313 addassnqg 7314 mulassnqg 7316 mulcanenq 7317 distrnqg 7319 recexnq 7322 nqtri3or 7328 ltdcnq 7329 ltsonq 7330 ltanqg 7332 ltmnqg 7333 1lt2nq 7338 ltexnqq 7340 archnqq 7349 addcmpblnq0 7375 mulcmpblnq0 7376 mulcanenq0ec 7377 addclnq0 7383 mulclnq0 7384 nqpnq0nq 7385 nqnq0a 7386 nqnq0m 7387 nq0m0r 7388 distrnq0 7391 addassnq0lemcl 7393 |
Copyright terms: Public domain | W3C validator |