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

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

Proof of Theorem nsuceq0
StepHypRef Expression
1 noel 2255 . . . 4 |- -. A e. (/)
2 eleq2 1511 . . . . 5 |- (suc A = (/) -> (A e. suc A <-> A e. (/)))
3 sucidg 3015 . . . . 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 3007 . . . . . . 7 |- (-. A e. V -> suc A = A)
76eqeq1d 1459 . . . . . 6 |- (-. A e. V -> (suc A = (/) <-> A = (/)))
8 0ex 2679 . . . . . . 7 |- (/) e. V
9 eleq1 1510 . . . . . . 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 1563 . 2 |- (suc A =/= (/) <-> -. suc A = (/))
1614, 15mpbir 190 1 |- suc A =/= (/)
Colors of variables: wff set class
Syntax hints:  -. wn 2   = wceq 1099   e. wcel 1105   =/= wne 1561  Vcvv 1786  (/)c0 2251  suc csuc 2913
This theorem is referenced by:  0elsuc 3055  peano3 3114  tz7.44-2 3868  oelim2 4160  limenpsi 4437  cfsuc 4838
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-14 1108  ax-11 1180  ax-17 1190  ax-16 1194  ax-11o 1202  ax-ext 1436  ax-nul 2678
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 957  df-sb 1155  df-eu 1359  df-mo 1360  df-clab 1441  df-cleq 1446  df-clel 1449  df-ne 1563  df-v 1787  df-dif 2020  df-un 2021  df-nul 2252  df-sn 2383  df-pr 2384  df-suc 2917
Copyright terms: Public domain