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

Theorem sucprcregOLD 9638
Description: Obsolete version of sucprcreg 9637 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 6467 . 2 (¬ 𝐴 ∈ V → suc 𝐴 = 𝐴)
2 elirr 9631 . . . 4 ¬ 𝐴 ∈ 𝐴
3 df-suc 6394 . . . . . . 7 suc 𝐴 = (𝐴 ∪ {𝐴})
43eqeq1i 2768 . . . . . 6 (suc 𝐴 = 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴)
5 ssequn2 4190 . . . . . 6 ({𝐴} ⊆ 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴)
64, 5sylbb2 241 . . . . 5 (suc 𝐴 = 𝐴 → {𝐴} ⊆ 𝐴)
7 snidg 4622 . . . . 5 (𝐴 ∈ V → 𝐴 ∈ {𝐴})
8 ssel2 3908 . . . . 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 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  {csn 4588  suc csuc 6390
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-reg 9623
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-sn 4589  df-suc 6394
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator