| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnaddm1cl | GIF version | ||
| Description: Closure of addition of positive integers minus one. (Contributed by NM, 6-Aug-2003.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
| Ref | Expression |
|---|---|
| nnaddm1cl | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 + 𝐵) − 1) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nncn 9141 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ) | |
| 2 | nncn 9141 | . . 3 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℂ) | |
| 3 | ax-1cn 8115 | . . . 4 ⊢ 1 ∈ ℂ | |
| 4 | addsub 8380 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) | |
| 5 | 3, 4 | mp3an3 1360 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) |
| 6 | 1, 2, 5 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) |
| 7 | nnm1nn0 9433 | . . 3 ⊢ (𝐴 ∈ ℕ → (𝐴 − 1) ∈ ℕ0) | |
| 8 | nn0nnaddcl 9423 | . . 3 ⊢ (((𝐴 − 1) ∈ ℕ0 ∧ 𝐵 ∈ ℕ) → ((𝐴 − 1) + 𝐵) ∈ ℕ) | |
| 9 | 7, 8 | sylan 283 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 − 1) + 𝐵) ∈ ℕ) |
| 10 | 6, 9 | eqeltrd 2306 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 + 𝐵) − 1) ∈ ℕ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 (class class class)co 6013 ℂcc 8020 1c1 8023 + caddc 8025 − cmin 8340 ℕcn 9133 ℕ0cn0 9392 |
| 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-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 |
| 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 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-iota 5284 df-fun 5326 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-sub 8342 df-inn 9134 df-n0 9393 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |