| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nnmcl | Structured version Visualization version GIF version | ||
| Description: Closure of multiplication of natural numbers. Proposition 8.17 of [TakeutiZaring] p. 63. Theorem 2.20 of [Schloeder] p. 6. (Contributed by NM, 20-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| nnmcl | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 7360 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝐵)) | |
| 2 | 1 | eleq1d 2818 | . . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝐵) ∈ ω)) |
| 3 | 2 | imbi2d 340 | . . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω))) |
| 4 | oveq2 7360 | . . . . 5 ⊢ (𝑥 = ∅ → (𝐴 ·o 𝑥) = (𝐴 ·o ∅)) | |
| 5 | 4 | eleq1d 2818 | . . . 4 ⊢ (𝑥 = ∅ → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o ∅) ∈ ω)) |
| 6 | oveq2 7360 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑦)) | |
| 7 | 6 | eleq1d 2818 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝑦) ∈ ω)) |
| 8 | oveq2 7360 | . . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o suc 𝑦)) | |
| 9 | 8 | eleq1d 2818 | . . . 4 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o suc 𝑦) ∈ ω)) |
| 10 | nnm0 8526 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 ·o ∅) = ∅) | |
| 11 | peano1 7825 | . . . . 5 ⊢ ∅ ∈ ω | |
| 12 | 10, 11 | eqeltrdi 2841 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 ·o ∅) ∈ ω) |
| 13 | nnacl 8532 | . . . . . . . 8 ⊢ (((𝐴 ·o 𝑦) ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω) | |
| 14 | 13 | expcom 413 | . . . . . . 7 ⊢ (𝐴 ∈ ω → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 15 | 14 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 16 | nnmsuc 8528 | . . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴)) | |
| 17 | 16 | eleq1d 2818 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o suc 𝑦) ∈ ω ↔ ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 18 | 15, 17 | sylibrd 259 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o 𝑦) ∈ ω → (𝐴 ·o suc 𝑦) ∈ ω)) |
| 19 | 18 | expcom 413 | . . . 4 ⊢ (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴 ·o 𝑦) ∈ ω → (𝐴 ·o suc 𝑦) ∈ ω))) |
| 20 | 5, 7, 9, 12, 19 | finds2 7834 | . . 3 ⊢ (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω)) |
| 21 | 3, 20 | vtoclga 3529 | . 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω)) |
| 22 | 21 | impcom 407 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∅c0 4282 suc csuc 6313 (class class class)co 7352 ωcom 7802 +o coa 8388 ·o comu 8389 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pr 5372 ax-un 7674 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-oadd 8395 df-omul 8396 |
| This theorem is referenced by: nnecl 8534 nnmcli 8536 nndi 8544 nnmass 8545 nnmsucr 8546 nnmordi 8552 nnmord 8553 nnmword 8554 omabslem 8571 nnneo 8576 nneob 8577 fin1a2lem4 10301 mulclpi 10791 nnamecl 43404 |
| Copyright terms: Public domain | W3C validator |