Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  suc11reg Structured version   Visualization version   GIF version

Theorem suc11reg 8399
 Description: The successor operation behaves like a one-to-one function (assuming the Axiom of Regularity). Exercise 35 of [Enderton] p. 208 and its converse. (Contributed by NM, 25-Oct-2003.)
Assertion
Ref Expression
suc11reg (suc 𝐴 = suc 𝐵𝐴 = 𝐵)

Proof of Theorem suc11reg
StepHypRef Expression
1 en2lp 8393 . . . . 5 ¬ (𝐴𝐵𝐵𝐴)
2 ianor 508 . . . . 5 (¬ (𝐴𝐵𝐵𝐴) ↔ (¬ 𝐴𝐵 ∨ ¬ 𝐵𝐴))
31, 2mpbi 219 . . . 4 𝐴𝐵 ∨ ¬ 𝐵𝐴)
4 sucidg 5720 . . . . . . . . . . 11 (𝐴 ∈ V → 𝐴 ∈ suc 𝐴)
5 eleq2 2677 . . . . . . . . . . 11 (suc 𝐴 = suc 𝐵 → (𝐴 ∈ suc 𝐴𝐴 ∈ suc 𝐵))
64, 5syl5ibcom 234 . . . . . . . . . 10 (𝐴 ∈ V → (suc 𝐴 = suc 𝐵𝐴 ∈ suc 𝐵))
7 elsucg 5709 . . . . . . . . . 10 (𝐴 ∈ V → (𝐴 ∈ suc 𝐵 ↔ (𝐴𝐵𝐴 = 𝐵)))
86, 7sylibd 228 . . . . . . . . 9 (𝐴 ∈ V → (suc 𝐴 = suc 𝐵 → (𝐴𝐵𝐴 = 𝐵)))
98imp 444 . . . . . . . 8 ((𝐴 ∈ V ∧ suc 𝐴 = suc 𝐵) → (𝐴𝐵𝐴 = 𝐵))
109ord 391 . . . . . . 7 ((𝐴 ∈ V ∧ suc 𝐴 = suc 𝐵) → (¬ 𝐴𝐵𝐴 = 𝐵))
1110ex 449 . . . . . 6 (𝐴 ∈ V → (suc 𝐴 = suc 𝐵 → (¬ 𝐴𝐵𝐴 = 𝐵)))
1211com23 84 . . . . 5 (𝐴 ∈ V → (¬ 𝐴𝐵 → (suc 𝐴 = suc 𝐵𝐴 = 𝐵)))
13 sucidg 5720 . . . . . . . . . . . 12 (𝐵 ∈ V → 𝐵 ∈ suc 𝐵)
14 eleq2 2677 . . . . . . . . . . . 12 (suc 𝐴 = suc 𝐵 → (𝐵 ∈ suc 𝐴𝐵 ∈ suc 𝐵))
1513, 14syl5ibrcom 236 . . . . . . . . . . 11 (𝐵 ∈ V → (suc 𝐴 = suc 𝐵𝐵 ∈ suc 𝐴))
16 elsucg 5709 . . . . . . . . . . 11 (𝐵 ∈ V → (𝐵 ∈ suc 𝐴 ↔ (𝐵𝐴𝐵 = 𝐴)))
1715, 16sylibd 228 . . . . . . . . . 10 (𝐵 ∈ V → (suc 𝐴 = suc 𝐵 → (𝐵𝐴𝐵 = 𝐴)))
1817imp 444 . . . . . . . . 9 ((𝐵 ∈ V ∧ suc 𝐴 = suc 𝐵) → (𝐵𝐴𝐵 = 𝐴))
1918ord 391 . . . . . . . 8 ((𝐵 ∈ V ∧ suc 𝐴 = suc 𝐵) → (¬ 𝐵𝐴𝐵 = 𝐴))
20 eqcom 2617 . . . . . . . 8 (𝐵 = 𝐴𝐴 = 𝐵)
2119, 20syl6ib 240 . . . . . . 7 ((𝐵 ∈ V ∧ suc 𝐴 = suc 𝐵) → (¬ 𝐵𝐴𝐴 = 𝐵))
2221ex 449 . . . . . 6 (𝐵 ∈ V → (suc 𝐴 = suc 𝐵 → (¬ 𝐵𝐴𝐴 = 𝐵)))
2322com23 84 . . . . 5 (𝐵 ∈ V → (¬ 𝐵𝐴 → (suc 𝐴 = suc 𝐵𝐴 = 𝐵)))
2412, 23jaao 530 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ((¬ 𝐴𝐵 ∨ ¬ 𝐵𝐴) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵)))
253, 24mpi 20 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
26 sucexb 6901 . . . . 5 (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
27 sucexb 6901 . . . . . 6 (𝐵 ∈ V ↔ suc 𝐵 ∈ V)
2827notbii 309 . . . . 5 𝐵 ∈ V ↔ ¬ suc 𝐵 ∈ V)
29 nelneq 2712 . . . . 5 ((suc 𝐴 ∈ V ∧ ¬ suc 𝐵 ∈ V) → ¬ suc 𝐴 = suc 𝐵)
3026, 28, 29syl2anb 495 . . . 4 ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → ¬ suc 𝐴 = suc 𝐵)
3130pm2.21d 117 . . 3 ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
32 eqcom 2617 . . . 4 (suc 𝐴 = suc 𝐵 ↔ suc 𝐵 = suc 𝐴)
3326notbii 309 . . . . . . 7 𝐴 ∈ V ↔ ¬ suc 𝐴 ∈ V)
34 nelneq 2712 . . . . . . 7 ((suc 𝐵 ∈ V ∧ ¬ suc 𝐴 ∈ V) → ¬ suc 𝐵 = suc 𝐴)
3527, 33, 34syl2anb 495 . . . . . 6 ((𝐵 ∈ V ∧ ¬ 𝐴 ∈ V) → ¬ suc 𝐵 = suc 𝐴)
3635ancoms 468 . . . . 5 ((¬ 𝐴 ∈ V ∧ 𝐵 ∈ V) → ¬ suc 𝐵 = suc 𝐴)
3736pm2.21d 117 . . . 4 ((¬ 𝐴 ∈ V ∧ 𝐵 ∈ V) → (suc 𝐵 = suc 𝐴𝐴 = 𝐵))
3832, 37syl5bi 231 . . 3 ((¬ 𝐴 ∈ V ∧ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
39 sucprc 5717 . . . . 5 𝐴 ∈ V → suc 𝐴 = 𝐴)
40 sucprc 5717 . . . . 5 𝐵 ∈ V → suc 𝐵 = 𝐵)
4139, 40eqeqan12d 2626 . . . 4 ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
4241biimpd 218 . . 3 ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
4325, 31, 38, 424cases 987 . 2 (suc 𝐴 = suc 𝐵𝐴 = 𝐵)
44 suceq 5707 . 2 (𝐴 = 𝐵 → suc 𝐴 = suc 𝐵)
4543, 44impbii 198 1 (suc 𝐴 = suc 𝐵𝐴 = 𝐵)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  suc csuc 5642 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833  ax-un 6847  ax-reg 8380 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-eprel 4949  df-fr 4997  df-suc 5646 This theorem is referenced by:  rankxpsuc  8628  bnj551  30066  1oequni2o  32392  clsk1indlem1  37363
 Copyright terms: Public domain W3C validator