| 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 9552 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 2 | nn0p1nn 9581 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ) | |
| 3 | 1, 2 | jca 306 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) |
| 4 | simpl 109 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → 𝑁 ∈ ℂ) | |
| 5 | ax-1cn 8262 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | pncan 8522 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
| 7 | 4, 5, 6 | sylancl 417 | . . 3 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((𝑁 + 1) − 1) = 𝑁) |
| 8 | nnm1nn0 9583 | . . . 4 ⊢ ((𝑁 + 1) ∈ ℕ → ((𝑁 + 1) − 1) ∈ ℕ0) | |
| 9 | 8 | adantl 277 | . . 3 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((𝑁 + 1) − 1) ∈ ℕ0) |
| 10 | 7, 9 | eqeltrrd 2316 | . 2 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → 𝑁 ∈ ℕ0) |
| 11 | 3, 10 | impbii 126 | 1 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 (class class class)co 6075 ℂcc 8167 1c1 8170 + caddc 8172 − cmin 8487 ℕcn 9283 ℕ0cn0 9542 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-addass 8271 ax-distr 8273 ax-i2m1 8274 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-sub 8489 df-inn 9284 df-n0 9543 |
| This theorem is referenced by: elnnnn0 9585 peano2z 9659 |
| Copyright terms: Public domain | W3C validator |