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

Theorem suc11 3773
Description: The successor operation behaves like a one-to-one function. Compare Exercise 16 of [Enderton] p. 194.
Assertion
Ref Expression
suc11 |- ((A e. On /\ B e. On) -> (suc A = suc B <-> A = B))

Proof of Theorem suc11
StepHypRef Expression
1 eloni 3667 . . . . 5 |- (A e. On -> Ord A)
2 ordn2lp 3678 . . . . . 6 |- (Ord A -> -. (A e. B /\ B e. A))
3 ianor 329 . . . . . 6 |- (-. (A e. B /\ B e. A) <-> (-. A e. B \/ -. B e. A))
42, 3sylib 215 . . . . 5 |- (Ord A -> (-. A e. B \/ -. B e. A))
51, 4syl 12 . . . 4 |- (A e. On -> (-. A e. B \/ -. B e. A))
65adantr 425 . . 3 |- ((A e. On /\ B e. On) -> (-. A e. B \/ -. B e. A))
7 sucssel 3763 . . . . . 6 |- (A e. On -> (suc A C_ suc B -> A e. suc B))
8 eqimss 2665 . . . . . 6 |- (suc A = suc B -> suc A C_ suc B)
97, 8syl5 20 . . . . 5 |- (A e. On -> (suc A = suc B -> A e. suc B))
10 elsuci 3731 . . . . . . 7 |- (A e. suc B -> (A e. B \/ A = B))
1110ord 249 . . . . . 6 |- (A e. suc B -> (-. A e. B -> A = B))
1211com12 14 . . . . 5 |- (-. A e. B -> (A e. suc B -> A = B))
139, 12syl9 71 . . . 4 |- (A e. On -> (-. A e. B -> (suc A = suc B -> A = B)))
14 sucssel 3763 . . . . . 6 |- (B e. On -> (suc B C_ suc A -> B e. suc A))
15 eqimss2 2667 . . . . . 6 |- (suc A = suc B -> suc B C_ suc A)
1614, 15syl5 20 . . . . 5 |- (B e. On -> (suc A = suc B -> B e. suc A))
17 elsuci 3731 . . . . . . . 8 |- (B e. suc A -> (B e. A \/ B = A))
1817ord 249 . . . . . . 7 |- (B e. suc A -> (-. B e. A -> B = A))
1918com12 14 . . . . . 6 |- (-. B e. A -> (B e. suc A -> B = A))
20 eqcom 1886 . . . . . 6 |- (B = A <-> A = B)
2119, 20syl6ib 229 . . . . 5 |- (-. B e. A -> (B e. suc A -> A = B))
2216, 21syl9 71 . . . 4 |- (B e. On -> (-. B e. A -> (suc A = suc B -> A = B)))
2313, 22jaao 472 . . 3 |- ((A e. On /\ B e. On) -> ((-. A e. B \/ -. B e. A) -> (suc A = suc B -> A = B)))
246, 23mpd 29 . 2 |- ((A e. On /\ B e. On) -> (suc A = suc B -> A = B))
25 suceq 3729 . 2 |- (A = B -> suc A = suc B)
2624, 25impbid1 575 1 |- ((A e. On /\ B e. On) -> (suc A = suc B <-> A = B))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 163   \/ wo 239   /\ wa 240   = wceq 1298   e. wcel 1300   C_ wss 2593  Ord word 3656  Oncon0 3657  suc csuc 3659
This theorem is referenced by:  peano4 3974  limenpsi 5599  dif1enOLD 10173  findcardOLD 10179  sltval2 13997  axsltsolem1 14006
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-tr 3412  df-eprel 3583  df-po 3591  df-so 3604  df-fr 3625  df-we 3644  df-ord 3660  df-on 3661  df-suc 3663
Copyright terms: Public domain