ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nnpredcl GIF version

Theorem nnpredcl 4750
Description: The predecessor of a natural number is a natural number. This theorem is most interesting when the natural number is a successor (as seen in theorems like onsucuni2 4691) but also holds when it is by uni0 3946. (Contributed by Jim Kingdon, 31-Jul-2022.)
Assertion
Ref Expression
nnpredcl (𝐴 ∈ ω → 𝐴 ∈ ω)

Proof of Theorem nnpredcl
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 unieq 3928 . . . 4 (𝐴 = ∅ → 𝐴 = ∅)
2 uni0 3946 . . . . 5 ∅ = ∅
3 peano1 4721 . . . . 5 ∅ ∈ ω
42, 3eqeltri 2307 . . . 4 ∅ ∈ ω
51, 4eqeltrdi 2325 . . 3 (𝐴 = ∅ → 𝐴 ∈ ω)
65adantl 277 . 2 ((𝐴 ∈ ω ∧ 𝐴 = ∅) → 𝐴 ∈ ω)
7 nnon 4737 . . . . . 6 (𝐴 ∈ ω → 𝐴 ∈ On)
87adantr 276 . . . . 5 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ On)
9 simpr 110 . . . . 5 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)
10 onsucuni2 4691 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐴 = suc 𝑥) → suc 𝐴 = 𝐴)
1110ex 115 . . . . . 6 (𝐴 ∈ On → (𝐴 = suc 𝑥 → suc 𝐴 = 𝐴))
1211rexlimdvw 2666 . . . . 5 (𝐴 ∈ On → (∃𝑥 ∈ ω 𝐴 = suc 𝑥 → suc 𝐴 = 𝐴))
138, 9, 12sylc 62 . . . 4 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → suc 𝐴 = 𝐴)
14 simpl 109 . . . 4 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
1513, 14eqeltrd 2311 . . 3 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → suc 𝐴 ∈ ω)
16 peano2b 4742 . . 3 ( 𝐴 ∈ ω ↔ suc 𝐴 ∈ ω)
1715, 16sylibr 134 . 2 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
18 nn0suc 4731 . 2 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
196, 17, 18mpjaodan 806 1 (𝐴 ∈ ω → 𝐴 ∈ ω)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  wrex 2523  c0 3512   cuni 3919  Oncon0 4489  suc csuc 4491  ωcom 4717
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-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-tr 4214  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718
This theorem is referenced by:  nnpredlt  4751  omp1eomlem  7398  ctmlemr  7412  nnnninfeq2  7433  nninfisollemne  7435  nninfisol  7437  nnsf  16895  peano4nninf  16896
  Copyright terms: Public domain W3C validator