| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elnn0nn | GIF version | ||
| Description: The nonnegative integer property expressed in terms of positive integers. (Contributed by NM, 10-May-2004.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
| Ref | Expression |
|---|---|
| elnn0nn | ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0cn 9454 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 2 | nn0p1nn 9483 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ) | |
| 3 | 1, 2 | jca 306 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) |
| 4 | simpl 109 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → 𝑁 ∈ ℂ) | |
| 5 | ax-1cn 8168 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | pncan 8427 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
| 7 | 4, 5, 6 | sylancl 413 | . . 3 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((𝑁 + 1) − 1) = 𝑁) |
| 8 | nnm1nn0 9485 | . . . 4 ⊢ ((𝑁 + 1) ∈ ℕ → ((𝑁 + 1) − 1) ∈ ℕ0) | |
| 9 | 8 | adantl 277 | . . 3 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((𝑁 + 1) − 1) ∈ ℕ0) |
| 10 | 7, 9 | eqeltrrd 2309 | . 2 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → 𝑁 ∈ ℕ0) |
| 11 | 3, 10 | impbii 126 | 1 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2202 (class class class)co 6028 ℂcc 8073 1c1 8076 + caddc 8078 − cmin 8392 ℕcn 9185 ℕ0cn0 9444 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-sub 8394 df-inn 9186 df-n0 9445 |
| This theorem is referenced by: elnnnn0 9487 peano2z 9559 |
| Copyright terms: Public domain | W3C validator |