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

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

Proof of Theorem nsuceq0
StepHypRef Expression
1 noel 2287 . . . 4 |- -. A e. (/)
2 eleq2 1538 . . . . 5 |- (suc A = (/) -> (A e. suc A <-> A e. (/)))
3 sucidg 3058 . . . . 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 3050 . . . . . . 7 |- (-. A e. V -> suc A = A)
76eqeq1d 1486 . . . . . 6 |- (-. A e. V -> (suc A = (/) <-> A = (/)))
8 0ex 2716 . . . . . . 7 |- (/) e. V
9 eleq1 1537 . . . . . . 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 1590 . 2 |- (suc A =/= (/) <-> -. suc A = (/))
1614, 15mpbir 190 1 |- suc A =/= (/)
Colors of variables: wff set class
Syntax hints:  -. wn 2   = wceq 958   e. wcel 960   =/= wne 1588  Vcvv 1814  (/)c0 2283  suc csuc 2956
This theorem is referenced by:  0elsuc 3098  peano3 3157  tz7.44-2 3935  oelim2 4228  limenpsi 4511  cfsuc 4927  top2usne 10535
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-nul 2715
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-nul 2284  df-sn 2416  df-pr 2417  df-suc 2960
Copyright terms: Public domain