| 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 9015 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ) | |
| 2 | nncn 9015 | . . 3 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℂ) | |
| 3 | ax-1cn 7989 | . . . 4 ⊢ 1 ∈ ℂ | |
| 4 | addsub 8254 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) | |
| 5 | 3, 4 | mp3an3 1337 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) |
| 6 | 1, 2, 5 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) |
| 7 | nnm1nn0 9307 | . . 3 ⊢ (𝐴 ∈ ℕ → (𝐴 − 1) ∈ ℕ0) | |
| 8 | nn0nnaddcl 9297 | . . 3 ⊢ (((𝐴 − 1) ∈ ℕ0 ∧ 𝐵 ∈ ℕ) → ((𝐴 − 1) + 𝐵) ∈ ℕ) | |
| 9 | 7, 8 | sylan 283 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 − 1) + 𝐵) ∈ ℕ) |
| 10 | 6, 9 | eqeltrd 2273 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 + 𝐵) − 1) ∈ ℕ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2167 (class class class)co 5925 ℂcc 7894 1c1 7897 + caddc 7899 − cmin 8214 ℕcn 9007 ℕ0cn0 9266 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-setind 4574 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-addcom 7996 ax-addass 7998 ax-distr 8000 ax-i2m1 8001 ax-0id 8004 ax-rnegex 8005 ax-cnre 8007 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-br 4035 df-opab 4096 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-iota 5220 df-fun 5261 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-sub 8216 df-inn 9008 df-n0 9267 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |