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

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

Proof of Theorem nsuceq0
StepHypRef Expression
1 noel 1711 . . 3 |- -. A e. (/)
2 eleq2 1150 . . . . 5 |- (suc A = (/) -> (A e. suc A <-> A e. (/)))
3 sucidg 2305 . . . . 5 |- (A e. V -> A e. suc A)
42, 3syl5bi 183 . . . 4 |- (suc A = (/) -> (A e. V -> A e. (/)))
54com12 13 . . 3 |- (A e. V -> (suc A = (/) -> A e. (/)))
61, 5mtoi 94 . 2 |- (A e. V -> -. suc A = (/))
7 sucprc 2297 . . . . . 6 |- (-. A e. V -> suc A = A)
87cleq1d 1109 . . . . 5 |- (-. A e. V -> (suc A = (/) <-> A = (/)))
9 0ex 1745 . . . . . 6 |- (/) e. V
10 eleq1 1149 . . . . . 6 |- (A = (/) -> (A e. V <-> (/) e. V))
119, 10mpbiri 169 . . . . 5 |- (A = (/) -> A e. V)
128, 11syl6bi 187 . . . 4 |- (-. A e. V -> (suc A = (/) -> A e. V))
1312con3d 87 . . 3 |- (-. A e. V -> (-. A e. V -> -. suc A = (/)))
1413pm2.43i 58 . 2 |- (-. A e. V -> -. suc A = (/))
156, 14pm2.61i 110 1 |- -. suc A = (/)
Colors of variables: wff set class
Syntax hints:  -. wn 1   = wceq 1091   e. wcel 1092  Vcvv 1348  (/)c0 1707  suc csuc 2201
This theorem is referenced by:  0elsuc 2340  peano3 2392  tz7.44-2 2967  limenpsi 3400  cfsuc 3709  1pi 3805
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-nul 1708  df-sn 1811  df-pr 1812  df-suc 2205
metamath.org