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

Theorem suc11reg 9616
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 9603 . . . . 5 ¬ (𝐴𝐵𝐵𝐴)
2 ianor 978 . . . . 5 (¬ (𝐴𝐵𝐵𝐴) ↔ (¬ 𝐴𝐵 ∨ ¬ 𝐵𝐴))
31, 2mpbi 229 . . . 4 𝐴𝐵 ∨ ¬ 𝐵𝐴)
4 sucidg 6444 . . . . . . . . . . 11 (𝐴 ∈ V → 𝐴 ∈ suc 𝐴)
5 eleq2 2820 . . . . . . . . . . 11 (suc 𝐴 = suc 𝐵 → (𝐴 ∈ suc 𝐴𝐴 ∈ suc 𝐵))
64, 5syl5ibcom 244 . . . . . . . . . 10 (𝐴 ∈ V → (suc 𝐴 = suc 𝐵𝐴 ∈ suc 𝐵))
7 elsucg 6431 . . . . . . . . . 10 (𝐴 ∈ V → (𝐴 ∈ suc 𝐵 ↔ (𝐴𝐵𝐴 = 𝐵)))
86, 7sylibd 238 . . . . . . . . 9 (𝐴 ∈ V → (suc 𝐴 = suc 𝐵 → (𝐴𝐵𝐴 = 𝐵)))
98imp 405 . . . . . . . 8 ((𝐴 ∈ V ∧ suc 𝐴 = suc 𝐵) → (𝐴𝐵𝐴 = 𝐵))
109ord 860 . . . . . . 7 ((𝐴 ∈ V ∧ suc 𝐴 = suc 𝐵) → (¬ 𝐴𝐵𝐴 = 𝐵))
1110ex 411 . . . . . 6 (𝐴 ∈ V → (suc 𝐴 = suc 𝐵 → (¬ 𝐴𝐵𝐴 = 𝐵)))
1211com23 86 . . . . 5 (𝐴 ∈ V → (¬ 𝐴𝐵 → (suc 𝐴 = suc 𝐵𝐴 = 𝐵)))
13 sucidg 6444 . . . . . . . . . . . 12 (𝐵 ∈ V → 𝐵 ∈ suc 𝐵)
14 eleq2 2820 . . . . . . . . . . . 12 (suc 𝐴 = suc 𝐵 → (𝐵 ∈ suc 𝐴𝐵 ∈ suc 𝐵))
1513, 14syl5ibrcom 246 . . . . . . . . . . 11 (𝐵 ∈ V → (suc 𝐴 = suc 𝐵𝐵 ∈ suc 𝐴))
16 elsucg 6431 . . . . . . . . . . 11 (𝐵 ∈ V → (𝐵 ∈ suc 𝐴 ↔ (𝐵𝐴𝐵 = 𝐴)))
1715, 16sylibd 238 . . . . . . . . . 10 (𝐵 ∈ V → (suc 𝐴 = suc 𝐵 → (𝐵𝐴𝐵 = 𝐴)))
1817imp 405 . . . . . . . . 9 ((𝐵 ∈ V ∧ suc 𝐴 = suc 𝐵) → (𝐵𝐴𝐵 = 𝐴))
1918ord 860 . . . . . . . 8 ((𝐵 ∈ V ∧ suc 𝐴 = suc 𝐵) → (¬ 𝐵𝐴𝐵 = 𝐴))
20 eqcom 2737 . . . . . . . 8 (𝐵 = 𝐴𝐴 = 𝐵)
2119, 20imbitrdi 250 . . . . . . 7 ((𝐵 ∈ V ∧ suc 𝐴 = suc 𝐵) → (¬ 𝐵𝐴𝐴 = 𝐵))
2221ex 411 . . . . . 6 (𝐵 ∈ V → (suc 𝐴 = suc 𝐵 → (¬ 𝐵𝐴𝐴 = 𝐵)))
2322com23 86 . . . . 5 (𝐵 ∈ V → (¬ 𝐵𝐴 → (suc 𝐴 = suc 𝐵𝐴 = 𝐵)))
2412, 23jaao 951 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ((¬ 𝐴𝐵 ∨ ¬ 𝐵𝐴) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵)))
253, 24mpi 20 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
26 sucexb 7794 . . . . 5 (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
27 sucexb 7794 . . . . . 6 (𝐵 ∈ V ↔ suc 𝐵 ∈ V)
2827notbii 319 . . . . 5 𝐵 ∈ V ↔ ¬ suc 𝐵 ∈ V)
29 nelneq 2855 . . . . 5 ((suc 𝐴 ∈ V ∧ ¬ suc 𝐵 ∈ V) → ¬ suc 𝐴 = suc 𝐵)
3026, 28, 29syl2anb 596 . . . 4 ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → ¬ suc 𝐴 = suc 𝐵)
3130pm2.21d 121 . . 3 ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
32 eqcom 2737 . . . 4 (suc 𝐴 = suc 𝐵 ↔ suc 𝐵 = suc 𝐴)
3326notbii 319 . . . . . . 7 𝐴 ∈ V ↔ ¬ suc 𝐴 ∈ V)
34 nelneq 2855 . . . . . . 7 ((suc 𝐵 ∈ V ∧ ¬ suc 𝐴 ∈ V) → ¬ suc 𝐵 = suc 𝐴)
3527, 33, 34syl2anb 596 . . . . . 6 ((𝐵 ∈ V ∧ ¬ 𝐴 ∈ V) → ¬ suc 𝐵 = suc 𝐴)
3635ancoms 457 . . . . 5 ((¬ 𝐴 ∈ V ∧ 𝐵 ∈ V) → ¬ suc 𝐵 = suc 𝐴)
3736pm2.21d 121 . . . 4 ((¬ 𝐴 ∈ V ∧ 𝐵 ∈ V) → (suc 𝐵 = suc 𝐴𝐴 = 𝐵))
3832, 37biimtrid 241 . . 3 ((¬ 𝐴 ∈ V ∧ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
39 sucprc 6439 . . . . 5 𝐴 ∈ V → suc 𝐴 = 𝐴)
40 sucprc 6439 . . . . 5 𝐵 ∈ V → suc 𝐵 = 𝐵)
4139, 40eqeqan12d 2744 . . . 4 ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
4241biimpd 228 . . 3 ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → (suc 𝐴 = suc 𝐵𝐴 = 𝐵))
4325, 31, 38, 424cases 1037 . 2 (suc 𝐴 = suc 𝐵𝐴 = 𝐵)
44 suceq 6429 . 2 (𝐴 = 𝐵 → suc 𝐴 = suc 𝐵)
4543, 44impbii 208 1 (suc 𝐴 = suc 𝐵𝐴 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 394  wo 843   = wceq 1539  wcel 2104  Vcvv 3472  suc csuc 6365
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7727  ax-reg 9589
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-eprel 5579  df-fr 5630  df-suc 6369
This theorem is referenced by:  rankxpsuc  9879  unidifsnel  32039  unidifsnne  32040  bnj551  34051  suceqsneq  37406  clsk1indlem1  43098
  Copyright terms: Public domain W3C validator