| 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 7376 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 +o 𝑥) = (𝐴 +o 𝐵)) | |
| 2 | 1 | eleq1d 2822 | . . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o 𝐵) ∈ ω)) |
| 3 | 2 | imbi2d 340 | . . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 +o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 +o 𝐵) ∈ ω))) |
| 4 | oveq2 7376 | . . . . 5 ⊢ (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅)) | |
| 5 | 4 | eleq1d 2822 | . . . 4 ⊢ (𝑥 = ∅ → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o ∅) ∈ ω)) |
| 6 | oveq2 7376 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o 𝑦)) | |
| 7 | 6 | eleq1d 2822 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o 𝑦) ∈ ω)) |
| 8 | oveq2 7376 | . . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o suc 𝑦)) | |
| 9 | 8 | eleq1d 2822 | . . . 4 ⊢ (𝑥 = suc 𝑦 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o suc 𝑦) ∈ ω)) |
| 10 | nna0 8542 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴) | |
| 11 | 10 | eleq1d 2822 | . . . . 5 ⊢ (𝐴 ∈ ω → ((𝐴 +o ∅) ∈ ω ↔ 𝐴 ∈ ω)) |
| 12 | 11 | ibir 268 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) ∈ ω) |
| 13 | peano2 7842 | . . . . . 6 ⊢ ((𝐴 +o 𝑦) ∈ ω → suc (𝐴 +o 𝑦) ∈ ω) | |
| 14 | nnasuc 8544 | . . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦)) | |
| 15 | 14 | eleq1d 2822 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o suc 𝑦) ∈ ω ↔ suc (𝐴 +o 𝑦) ∈ ω)) |
| 16 | 13, 15 | imbitrrid 246 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o 𝑦) ∈ ω → (𝐴 +o suc 𝑦) ∈ ω)) |
| 17 | 16 | expcom 413 | . . . 4 ⊢ (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴 +o 𝑦) ∈ ω → (𝐴 +o suc 𝑦) ∈ ω))) |
| 18 | 5, 7, 9, 12, 17 | finds2 7850 | . . 3 ⊢ (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 +o 𝑥) ∈ ω)) |
| 19 | 3, 18 | vtoclga 3534 | . 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 +o 𝐵) ∈ ω)) |
| 20 | 19 | impcom 407 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∅c0 4287 suc csuc 6327 (class class class)co 7368 ωcom 7818 +o coa 8404 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-oadd 8411 |
| This theorem is referenced by: nnmcl 8550 nnacli 8552 nnarcl 8554 nnaord 8557 nnawordi 8559 nnaass 8560 nndi 8561 nnaword 8565 nnawordex 8575 oaabslem 8585 eldifsucnn 8602 omnaddcl 8641 unfilem1 9217 ttrcltr 9637 nnadju 10120 nnadjuALT 10121 ficardun 10123 ficardun2 10124 pwsdompw 10125 addclpi 10815 hashgadd 14312 hashdom 14314 precsexlem6 28220 precsexlem7 28221 om2noseqlt 28307 finxpreclem4 37646 nnamecl 43641 naddcnff 43716 naddwordnexlem3 43753 finona1cl 43806 |
| Copyright terms: Public domain | W3C validator |