| 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 6068 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝐵)) | |
| 2 | 1 | eleq1d 2303 | . . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝐵) ∈ ω)) |
| 3 | 2 | imbi2d 230 | . . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω))) |
| 4 | oveq2 6068 | . . . . 5 ⊢ (𝑥 = ∅ → (𝐴 ·o 𝑥) = (𝐴 ·o ∅)) | |
| 5 | 4 | eleq1d 2303 | . . . 4 ⊢ (𝑥 = ∅ → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o ∅) ∈ ω)) |
| 6 | oveq2 6068 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑦)) | |
| 7 | 6 | eleq1d 2303 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝑦) ∈ ω)) |
| 8 | oveq2 6068 | . . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o suc 𝑦)) | |
| 9 | 8 | eleq1d 2303 | . . . 4 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o suc 𝑦) ∈ ω)) |
| 10 | nnm0 6723 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 ·o ∅) = ∅) | |
| 11 | peano1 4723 | . . . . 5 ⊢ ∅ ∈ ω | |
| 12 | 10, 11 | eqeltrdi 2325 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 ·o ∅) ∈ ω) |
| 13 | nnacl 6728 | . . . . . . . 8 ⊢ (((𝐴 ·o 𝑦) ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω) | |
| 14 | 13 | expcom 116 | . . . . . . 7 ⊢ (𝐴 ∈ ω → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 15 | 14 | adantr 276 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)) |
| 16 | nnmsuc 6725 | . . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴)) | |
| 17 | 16 | eleq1d 2303 | . . . . . 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 4730 | . . 3 ⊢ (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω)) |
| 21 | 3, 20 | vtoclga 2883 | . 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω)) |
| 22 | 21 | impcom 125 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ∅c0 3512 suc csuc 4492 ωcom 4719 (class class class)co 6060 +o coa 6659 ·o comu 6660 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2208 ax-ext 2216 ax-coll 4231 ax-sep 4234 ax-nul 4242 ax-pow 4293 ax-pr 4328 ax-un 4560 ax-setind 4666 ax-iinf 4717 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3677 df-sn 3701 df-pr 3702 df-op 3704 df-uni 3921 df-int 3956 df-iun 3999 df-br 4116 df-opab 4178 df-mpt 4179 df-tr 4215 df-id 4420 df-iord 4493 df-on 4495 df-suc 4498 df-iom 4720 df-xp 4762 df-rel 4763 df-cnv 4764 df-co 4765 df-dm 4766 df-rn 4767 df-res 4768 df-ima 4769 df-iota 5319 df-fun 5361 df-fn 5362 df-f 5363 df-f1 5364 df-fo 5365 df-f1o 5366 df-fv 5367 df-ov 6063 df-oprab 6064 df-mpo 6065 df-1st 6349 df-2nd 6350 df-recs 6551 df-irdg 6616 df-oadd 6666 df-omul 6667 |
| This theorem is referenced by: nnmcli 6731 nndi 6734 nnmass 6735 nnmsucr 6736 nnmordi 6764 nnmord 6765 nnmword 6766 mulclpi 7661 enq0tr 7767 addcmpblnq0 7776 mulcmpblnq0 7777 mulcanenq0ec 7778 addclnq0 7784 mulclnq0 7785 nqpnq0nq 7786 distrnq0 7792 addassnq0lemcl 7794 addassnq0 7795 |
| Copyright terms: Public domain | W3C validator |