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

Theorem nnpredcl 4744
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 4685) but also holds when it is by uni0 3940. (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 3922 . . . 4 (𝐴 = ∅ → 𝐴 = ∅)
2 uni0 3940 . . . . 5 ∅ = ∅
3 peano1 4715 . . . . 5 ∅ ∈ ω
42, 3eqeltri 2305 . . . 4 ∅ ∈ ω
51, 4eqeltrdi 2323 . . 3 (𝐴 = ∅ → 𝐴 ∈ ω)
65adantl 277 . 2 ((𝐴 ∈ ω ∧ 𝐴 = ∅) → 𝐴 ∈ ω)
7 nnon 4731 . . . . . 6 (𝐴 ∈ ω → 𝐴 ∈ On)
87adantr 276 . . . . 5 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ On)
9 simpr 110 . . . . 5 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)
10 onsucuni2 4685 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐴 = suc 𝑥) → suc 𝐴 = 𝐴)
1110ex 115 . . . . . 6 (𝐴 ∈ On → (𝐴 = suc 𝑥 → suc 𝐴 = 𝐴))
1211rexlimdvw 2664 . . . . 5 (𝐴 ∈ On → (∃𝑥 ∈ ω 𝐴 = suc 𝑥 → suc 𝐴 = 𝐴))
138, 9, 12sylc 62 . . . 4 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → suc 𝐴 = 𝐴)
14 simpl 109 . . . 4 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
1513, 14eqeltrd 2309 . . 3 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → suc 𝐴 ∈ ω)
16 peano2b 4736 . . 3 ( 𝐴 ∈ ω ↔ suc 𝐴 ∈ ω)
1715, 16sylibr 134 . 2 ((𝐴 ∈ ω ∧ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
18 nn0suc 4725 . 2 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
196, 17, 18mpjaodan 806 1 (𝐴 ∈ ω → 𝐴 ∈ ω)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  wrex 2521  c0 3507   cuni 3913  Oncon0 4483  suc csuc 4485  ωcom 4711
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-iinf 4709
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 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-uni 3914  df-int 3949  df-tr 4208  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712
This theorem is referenced by:  nnpredlt  4745  omp1eomlem  7384  ctmlemr  7398  nnnninfeq2  7419  nninfisollemne  7421  nninfisol  7423  nnsf  16775  peano4nninf  16776
  Copyright terms: Public domain W3C validator