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

Theorem sucprcregOLD 9608
Description: Obsolete version of sucprcreg 9607 as of 31-Dec-2025. (Contributed by NM, 9-Jul-2004.) (Proof shortened by BJ, 16-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
sucprcregOLD (¬ 𝐴 ∈ V ↔ suc 𝐴 = 𝐴)

Proof of Theorem sucprcregOLD
StepHypRef Expression
1 sucprc 6444 . 2 (¬ 𝐴 ∈ V → suc 𝐴 = 𝐴)
2 elirr 9601 . . . 4 ¬ 𝐴 ∈ 𝐴
3 df-suc 6371 . . . . . . 7 suc 𝐴 = (𝐴 ∪ {𝐴})
43eqeq1i 2765 . . . . . 6 (suc 𝐴 = 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴)
5 ssequn2 4186 . . . . . 6 ({𝐴} ⊆ 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴)
64, 5sylbb2 241 . . . . 5 (suc 𝐴 = 𝐴 → {𝐴} ⊆ 𝐴)
7 snidg 4617 . . . . 5 (𝐴 ∈ V → 𝐴 ∈ {𝐴})
8 ssel2 3904 . . . . 5 (({𝐴} ⊆ 𝐴 ∧ 𝐴 ∈ {𝐴}) → 𝐴 ∈ 𝐴)
96, 7, 8syl2an 608 . . . 4 ((suc 𝐴 = 𝐴 ∧ 𝐴 ∈ V) → 𝐴 ∈ 𝐴)
102, 9mto 200 . . 3 ¬ (suc 𝐴 = 𝐴 ∧ 𝐴 ∈ V)
1110imnani 406 . 2 (suc 𝐴 = 𝐴 → ¬ 𝐴 ∈ V)
121, 11impbii 212 1 (¬ 𝐴 ∈ V ↔ suc 𝐴 = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3896   ∪ cun 4148  {csn 4584  suc csuc 6367
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-reg 9593
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-sn 4585  df-suc 6371
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator