| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfnn2 | GIF version | ||
| Description: Definition of the set of positive integers. Another name for df-inn 9305. (Contributed by Jeff Hankins, 12-Sep-2013.) (Revised by Mario Carneiro, 3-May-2014.) |
| Ref | Expression |
|---|---|
| dfnn2 | ⊢ ℕ = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-inn 9305 | 1 ⊢ ℕ = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 = wceq 1402 ∈ wcel 2209 {cab 2224 ∀wral 2528 ∩ cint 3970 (class class class)co 6085 1c1 8180 + caddc 8182 ℕcn 9304 |
| This proof depends on definitions: df-inn 9305 |
| This theorem is used by: peano5nni 9307 1nn 9315 peano2nn 9316 arch 9560 caucvgre 11747 |
| Copyright terms: Public domain | W3C validator |