HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem nnsuc 3148
Description: A non-zero natural number is a successor.
Assertion
Ref Expression
nnsuc |- ((A e. om /\ A =/= (/)) -> E.x e. om A = suc x)
Distinct variable group:   x,A

Proof of Theorem nnsuc
StepHypRef Expression
1 nnlim 3144 . . . 4 |- (A e. om -> -. Lim A)
21adantr 389 . . 3 |- ((A e. om /\ A =/= (/)) -> -. Lim A)
3 orduninsuc 3114 . . . . . 6 |- (Ord A -> (A = U.A <-> -. E.x e. On A = suc x))
43adantr 389 . . . . 5 |- ((Ord A /\ A =/= (/)) -> (A = U.A <-> -. E.x e. On A = suc x))
5 df-lim 2953 . . . . . . 7 |- (Lim A <-> (Ord A /\ A =/= (/) /\ A = U.A))
65biimpr 152 . . . . . 6 |- ((Ord A /\ A =/= (/) /\ A = U.A) -> Lim A)
763expia 835 . . . . 5 |- ((Ord A /\ A =/= (/)) -> (A = U.A -> Lim A))
84, 7sylbird 205 . . . 4 |- ((Ord A /\ A =/= (/)) -> (-. E.x e. On A = suc x -> Lim A))
9 nnord 3140 . . . 4 |- (A e. om -> Ord A)
108, 9sylan 448 . . 3 |- ((A e. om /\ A =/= (/)) -> (-. E.x e. On A = suc x -> Lim A))
112, 10mt3d 114 . 2 |- ((A e. om /\ A =/= (/)) -> E.x e. On A = suc x)
12 eleq1 1534 . . . . . . . 8 |- (A = suc x -> (A e. om <-> suc x e. om))
1312biimpcd 155 . . . . . . 7 |- (A e. om -> (A = suc x -> suc x e. om))
14 peano2b 3147 . . . . . . 7 |- (x e. om <-> suc x e. om)
1513, 14syl6ibr 213 . . . . . 6 |- (A e. om -> (A = suc x -> x e. om))
1615ancrd 299 . . . . 5 |- (A e. om -> (A = suc x -> (x e. om /\ A = suc x)))
1716adantld 390 . . . 4 |- (A e. om -> ((x e. On /\ A = suc x) -> (x e. om /\ A = suc x)))
1817r19.22dv2 1736 . . 3 |- (A e. om -> (E.x e. On A = suc x -> E.x e. om A = suc x))
1918adantr 389 . 2 |- ((A e. om /\ A =/= (/)) -> (E.x e. On A = suc x -> E.x e. om A = suc x))
2011, 19mpd 26 1 |- ((A e. om /\ A =/= (/)) -> E.x e. om A = suc x)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223   /\ w3a 775   = wceq 956   e. wcel 958   =/= wne 1585  E.wrex 1646  (/)c0 2280  U.cuni 2503  Ord word 2947  Oncon0 2948  Lim wlim 2949  suc csuc 2950  omcom 3131
This theorem is referenced by:  peano5 3153  nn0suc 3154  inf3lemd 4612
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-if 2362  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952  df-lim 2953  df-suc 2954  df-om 3132
Copyright terms: Public domain