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

Theorem nsuceq0 3048
Description: No successor is empty.
Assertion
Ref Expression
nsuceq0 |- suc A =/= (/)

Proof of Theorem nsuceq0
StepHypRef Expression
1 noel 2280 . . . 4 |- -. A e. (/)
2 eleq2 1532 . . . . 5 |- (suc A = (/) -> (A e. suc A <-> A e. (/)))
3 sucidg 3047 . . . . 5 |- (A e. V -> A e. suc A)
42, 3syl5cbi 209 . . . 4 |- (A e. V -> (suc A = (/) -> A e. (/)))
51, 4mtoi 107 . . 3 |- (A e. V -> -. suc A = (/))
6 sucprc 3039 . . . . . . 7 |- (-. A e. V -> suc A = A)
76eqeq1d 1480 . . . . . 6 |- (-. A e. V -> (suc A = (/) <-> A = (/)))
8 0ex 2706 . . . . . . 7 |- (/) e. V
9 eleq1 1531 . . . . . . 7 |- (A = (/) -> (A e. V <-> (/) e. V))
108, 9mpbiri 194 . . . . . 6 |- (A = (/) -> A e. V)
117, 10syl6bi 214 . . . . 5 |- (-. A e. V -> (suc A = (/) -> A e. V))
1211con3d 95 . . . 4 |- (-. A e. V -> (-. A e. V -> -. suc A = (/)))
1312pm2.43i 64 . . 3 |- (-. A e. V -> -. suc A = (/))
145, 13pm2.61i 126 . 2 |- -. suc A = (/)
15 df-ne 1584 . 2 |- (suc A =/= (/) <-> -. suc A = (/))
1614, 15mpbir 190 1 |- suc A =/= (/)
Colors of variables: wff set class
Syntax hints:  -. wn 2   = wceq 954   e. wcel 956   =/= wne 1582  Vcvv 1807  (/)c0 2276  suc csuc 2945
This theorem is referenced by:  0elsuc 3087  peano3 3146  tz7.44-2 3920  oelim2 4212  limenpsi 4491  cfsuc 4895
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-nul 2705
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-v 1808  df-dif 2045  df-un 2046  df-nul 2277  df-sn 2408  df-pr 2409  df-suc 2949
Copyright terms: Public domain