| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnmcl | GIF version | ||
| Description: Closure of multiplication of natural numbers. Proposition 8.17 of [TakeutiZaring] p. 63. (Contributed by NM, 20-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| nnmcl | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 6008 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝐵)) | |
| 2 | 1 | eleq1d 2298 | . . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝐵) ∈ ω)) |
| 3 | 2 | imbi2d 230 | . . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω))) |
| 4 | oveq2 6008 | . . . . 5 ⊢ (𝑥 = ∅ → (𝐴 ·o 𝑥) = (𝐴 ·o ∅)) | |
| 5 | 4 | eleq1d 2298 | . . . 4 ⊢ (𝑥 = ∅ → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o ∅) ∈ ω)) |
| 6 | oveq2 6008 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑦)) | |
| 7 | 6 | eleq1d 2298 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝑦) ∈ ω)) |
| 8 | oveq2 6008 | . . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o suc 𝑦)) | |
| 9 | 8 | eleq1d 2298 | . . . 4 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o suc 𝑦) ∈ ω)) |
| 10 | nnm0 6619 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 ·o ∅) = ∅) | |
| 11 | peano1 4685 | . . . . 5 ⊢ ∅ ∈ ω | |
| 12 | 10, 11 | eqeltrdi 2320 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 ·o ∅) ∈ ω) |
| 13 | nnacl 6624 | . . . . . . . 8 ⊢ (((𝐴 ·o 𝑦) ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω) | |
| 14 | 13 | expcom 116 | . . . . . . 7 ⊢ (𝐴 ∈ ω → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 15 | 14 | adantr 276 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 16 | nnmsuc 6621 | . . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴)) | |
| 17 | 16 | eleq1d 2298 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o suc 𝑦) ∈ ω ↔ ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 18 | 15, 17 | sylibrd 169 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o 𝑦) ∈ ω → (𝐴 ·o suc 𝑦) ∈ ω)) |
| 19 | 18 | expcom 116 | . . . 4 ⊢ (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴 ·o 𝑦) ∈ ω → (𝐴 ·o suc 𝑦) ∈ ω))) |
| 20 | 5, 7, 9, 12, 19 | finds2 4692 | . . 3 ⊢ (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω)) |
| 21 | 3, 20 | vtoclga 2867 | . 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω)) |
| 22 | 21 | impcom 125 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ∅c0 3491 suc csuc 4455 ωcom 4681 (class class class)co 6000 +o coa 6557 ·o comu 6558 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-iinf 4679 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-tr 4182 df-id 4383 df-iord 4456 df-on 4458 df-suc 4461 df-iom 4682 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-ov 6003 df-oprab 6004 df-mpo 6005 df-1st 6284 df-2nd 6285 df-recs 6449 df-irdg 6514 df-oadd 6564 df-omul 6565 |
| This theorem is referenced by: nnmcli 6627 nndi 6630 nnmass 6631 nnmsucr 6632 nnmordi 6660 nnmord 6661 nnmword 6662 mulclpi 7511 enq0tr 7617 addcmpblnq0 7626 mulcmpblnq0 7627 mulcanenq0ec 7628 addclnq0 7634 mulclnq0 7635 nqpnq0nq 7636 distrnq0 7642 addassnq0lemcl 7644 addassnq0 7645 |
| Copyright terms: Public domain | W3C validator |