| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nnacl | Structured version Visualization version GIF version | ||
| Description: Closure of addition of natural numbers. Proposition 8.9 of [TakeutiZaring] p. 59. Theorem 2.20 of [Schloeder] p. 6. (Contributed by NM, 20-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| nnacl | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 7364 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 +o 𝑥) = (𝐴 +o 𝐵)) | |
| 2 | 1 | eleq1d 2824 | . . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o 𝐵) ∈ ω)) |
| 3 | 2 | imbi2d 341 | . . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 +o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 +o 𝐵) ∈ ω))) |
| 4 | oveq2 7364 | . . . . 5 ⊢ (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅)) | |
| 5 | 4 | eleq1d 2824 | . . . 4 ⊢ (𝑥 = ∅ → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o ∅) ∈ ω)) |
| 6 | oveq2 7364 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o 𝑦)) | |
| 7 | 6 | eleq1d 2824 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o 𝑦) ∈ ω)) |
| 8 | oveq2 7364 | . . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o suc 𝑦)) | |
| 9 | 8 | eleq1d 2824 | . . . 4 ⊢ (𝑥 = suc 𝑦 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o suc 𝑦) ∈ ω)) |
| 10 | nna0 8530 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴) | |
| 11 | 10 | eleq1d 2824 | . . . . 5 ⊢ (𝐴 ∈ ω → ((𝐴 +o ∅) ∈ ω ↔ 𝐴 ∈ ω)) |
| 12 | 11 | ibir 269 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) ∈ ω) |
| 13 | peano2 7830 | . . . . . 6 ⊢ ((𝐴 +o 𝑦) ∈ ω → suc (𝐴 +o 𝑦) ∈ ω) | |
| 14 | nnasuc 8532 | . . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦)) | |
| 15 | 14 | eleq1d 2824 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o suc 𝑦) ∈ ω ↔ suc (𝐴 +o 𝑦) ∈ ω)) |
| 16 | 13, 15 | imbitrrid 247 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o 𝑦) ∈ ω → (𝐴 +o suc 𝑦) ∈ ω)) |
| 17 | 16 | expcom 414 | . . . 4 ⊢ (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴 +o 𝑦) ∈ ω → (𝐴 +o suc 𝑦) ∈ ω))) |
| 18 | 5, 7, 9, 12, 17 | finds2 7838 | . . 3 ⊢ (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 +o 𝑥) ∈ ω)) |
| 19 | 3, 18 | vtoclga 3520 | . 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 +o 𝐵) ∈ ω)) |
| 20 | 19 | impcom 408 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∅c0 4261 suc csuc 6312 (class class class)co 7356 ωcom 7806 +o coa 8392 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-oadd 8399 |
| This theorem is referenced by: nnmcl 8538 nnacli 8540 nnarcl 8542 nnaord 8545 nnawordi 8547 nnaass 8548 nndi 8549 nnaword 8553 nnawordex 8563 oaabslem 8573 eldifsucnn 8590 omnaddcl 8629 unfilem1 9205 ttrcltr 9628 nnadju 10111 nnadjuALT 10112 ficardun 10114 ficardun2 10115 pwsdompw 10116 addclpi 10806 hashgadd 14330 hashdom 14332 precsexlem6 28222 precsexlem7 28223 om2noseqlt 28309 mh-inf3f1 36769 finxpreclem4 37756 nnamecl 43732 naddcnff 43807 naddwordnexlem3 43844 finona1cl 43897 |
| Copyright terms: Public domain | W3C validator |