![]() |
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 8992 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ) | |
2 | nncn 8992 | . . 3 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℂ) | |
3 | ax-1cn 7967 | . . . 4 ⊢ 1 ∈ ℂ | |
4 | addsub 8232 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) | |
5 | 3, 4 | mp3an3 1337 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) |
6 | 1, 2, 5 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 + 𝐵) − 1) = ((𝐴 − 1) + 𝐵)) |
7 | nnm1nn0 9284 | . . 3 ⊢ (𝐴 ∈ ℕ → (𝐴 − 1) ∈ ℕ0) | |
8 | nn0nnaddcl 9274 | . . 3 ⊢ (((𝐴 − 1) ∈ ℕ0 ∧ 𝐵 ∈ ℕ) → ((𝐴 − 1) + 𝐵) ∈ ℕ) | |
9 | 7, 8 | sylan 283 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 − 1) + 𝐵) ∈ ℕ) |
10 | 6, 9 | eqeltrd 2270 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 + 𝐵) − 1) ∈ ℕ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 (class class class)co 5919 ℂcc 7872 1c1 7875 + caddc 7877 − cmin 8192 ℕcn 8984 ℕ0cn0 9243 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-addcom 7974 ax-addass 7976 ax-distr 7978 ax-i2m1 7979 ax-0id 7982 ax-rnegex 7983 ax-cnre 7985 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-br 4031 df-opab 4092 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-iota 5216 df-fun 5257 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-sub 8194 df-inn 8985 df-n0 9244 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |