| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sucprcregOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of sucprcreg 9515 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.) |
| Ref | Expression |
|---|---|
| sucprcregOLD | ⊢ (¬ 𝐴 ∈ V ↔ suc 𝐴 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sucprc 6392 | . 2 ⊢ (¬ 𝐴 ∈ V → suc 𝐴 = 𝐴) | |
| 2 | elirr 9509 | . . . 4 ⊢ ¬ 𝐴 ∈ 𝐴 | |
| 3 | df-suc 6320 | . . . . . . 7 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 4 | 3 | eqeq1i 2746 | . . . . . 6 ⊢ (suc 𝐴 = 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴) |
| 5 | ssequn2 4121 | . . . . . 6 ⊢ ({𝐴} ⊆ 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴) | |
| 6 | 4, 5 | sylbb2 240 | . . . . 5 ⊢ (suc 𝐴 = 𝐴 → {𝐴} ⊆ 𝐴) |
| 7 | snidg 4595 | . . . . 5 ⊢ (𝐴 ∈ V → 𝐴 ∈ {𝐴}) | |
| 8 | ssel2 3912 | . . . . 5 ⊢ (({𝐴} ⊆ 𝐴 ∧ 𝐴 ∈ {𝐴}) → 𝐴 ∈ 𝐴) | |
| 9 | 6, 7, 8 | syl2an 603 | . . . 4 ⊢ ((suc 𝐴 = 𝐴 ∧ 𝐴 ∈ V) → 𝐴 ∈ 𝐴) |
| 10 | 2, 9 | mto 199 | . . 3 ⊢ ¬ (suc 𝐴 = 𝐴 ∧ 𝐴 ∈ V) |
| 11 | 10 | imnani 402 | . 2 ⊢ (suc 𝐴 = 𝐴 → ¬ 𝐴 ∈ V) |
| 12 | 1, 11 | impbii 211 | 1 ⊢ (¬ 𝐴 ∈ V ↔ suc 𝐴 = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 Vcvv 3433 ∪ cun 3883 ⊆ wss 3885 {csn 4558 suc csuc 6316 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5221 ax-reg 9501 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-v 3435 df-dif 3888 df-un 3890 df-ss 3902 df-nul 4265 df-sn 4559 df-suc 6320 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |