| 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 9335 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 2 | nn0p1nn 9364 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ) | |
| 3 | 1, 2 | jca 306 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) |
| 4 | simpl 109 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → 𝑁 ∈ ℂ) | |
| 5 | ax-1cn 8048 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | pncan 8308 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
| 7 | 4, 5, 6 | sylancl 413 | . . 3 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((𝑁 + 1) − 1) = 𝑁) |
| 8 | nnm1nn0 9366 | . . . 4 ⊢ ((𝑁 + 1) ∈ ℕ → ((𝑁 + 1) − 1) ∈ ℕ0) | |
| 9 | 8 | adantl 277 | . . 3 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((𝑁 + 1) − 1) ∈ ℕ0) |
| 10 | 7, 9 | eqeltrrd 2284 | . 2 ⊢ ((𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → 𝑁 ∈ ℕ0) |
| 11 | 3, 10 | impbii 126 | 1 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2177 (class class class)co 5962 ℂcc 7953 1c1 7956 + caddc 7958 − cmin 8273 ℕcn 9066 ℕ0cn0 9325 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4173 ax-pow 4229 ax-pr 4264 ax-setind 4598 ax-cnex 8046 ax-resscn 8047 ax-1cn 8048 ax-1re 8049 ax-icn 8050 ax-addcl 8051 ax-addrcl 8052 ax-mulcl 8053 ax-addcom 8055 ax-addass 8057 ax-distr 8059 ax-i2m1 8060 ax-0id 8063 ax-rnegex 8064 ax-cnre 8066 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3860 df-int 3895 df-br 4055 df-opab 4117 df-id 4353 df-xp 4694 df-rel 4695 df-cnv 4696 df-co 4697 df-dm 4698 df-iota 5246 df-fun 5287 df-fv 5293 df-riota 5917 df-ov 5965 df-oprab 5966 df-mpo 5967 df-sub 8275 df-inn 9067 df-n0 9326 |
| This theorem is referenced by: elnnnn0 9368 peano2z 9438 |
| Copyright terms: Public domain | W3C validator |