| 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 7416 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 +o 𝑥) = (𝐴 +o 𝐵)) | |
| 2 | 1 | eleq1d 2854 | . . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o 𝐵) ∈ ω)) |
| 3 | 2 | imbi2d 343 | . . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 +o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 +o 𝐵) ∈ ω))) |
| 4 | oveq2 7416 | . . . . 5 ⊢ (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅)) | |
| 5 | 4 | eleq1d 2854 | . . . 4 ⊢ (𝑥 = ∅ → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o ∅) ∈ ω)) |
| 6 | oveq2 7416 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o 𝑦)) | |
| 7 | 6 | eleq1d 2854 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o 𝑦) ∈ ω)) |
| 8 | oveq2 7416 | . . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o suc 𝑦)) | |
| 9 | 8 | eleq1d 2854 | . . . 4 ⊢ (𝑥 = suc 𝑦 → ((𝐴 +o 𝑥) ∈ ω ↔ (𝐴 +o suc 𝑦) ∈ ω)) |
| 10 | nna0 8586 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴) | |
| 11 | 10 | eleq1d 2854 | . . . . 5 ⊢ (𝐴 ∈ ω → ((𝐴 +o ∅) ∈ ω ↔ 𝐴 ∈ ω)) |
| 12 | 11 | ibir 271 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) ∈ ω) |
| 13 | peano2 7882 | . . . . . 6 ⊢ ((𝐴 +o 𝑦) ∈ ω → suc (𝐴 +o 𝑦) ∈ ω) | |
| 14 | nnasuc 8588 | . . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦)) | |
| 15 | 14 | eleq1d 2854 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o suc 𝑦) ∈ ω ↔ suc (𝐴 +o 𝑦) ∈ ω)) |
| 16 | 13, 15 | imbitrrid 249 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o 𝑦) ∈ ω → (𝐴 +o suc 𝑦) ∈ ω)) |
| 17 | 16 | expcom 418 | . . . 4 ⊢ (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴 +o 𝑦) ∈ ω → (𝐴 +o suc 𝑦) ∈ ω))) |
| 18 | 5, 7, 9, 12, 17 | finds2 7891 | . . 3 ⊢ (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 +o 𝑥) ∈ ω)) |
| 19 | 3, 18 | vtoclga 3550 | . 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 +o 𝐵) ∈ ω)) |
| 20 | 19 | impcom 412 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∅c0 4294 suc csuc 6359 (class class class)co 7408 ωcom 7858 +o coa 8446 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-oadd 8453 |
| This theorem is referenced by: nnmcl 8594 nnacli 8596 nnarcl 8598 nnaord 8601 nnawordi 8603 nnaass 8604 nndi 8605 nnaword 8609 nnawordex 8619 oaabslem 8629 eldifsucnn 8646 omnaddcl 8686 unfilem1 9261 ttrcltr 9681 nnadju 10177 nnadjuALT 10178 ficardun 10180 ficardun2 10181 pwsdompw 10182 addclpi 10873 hashgadd 14409 hashdom 14411 precsexlem6 28367 precsexlem7 28368 om2noseqlt 28454 mh-inf3f1 36937 finxpreclem4 37923 nnamecl 43899 naddcnff 43974 naddwordnexlem3 44011 finona1cl 44064 hashnna 45613 |
| Copyright terms: Public domain | W3C validator |