| 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 9511 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 6388 | . 2 ⊢ (¬ 𝐴 ∈ V → suc 𝐴 = 𝐴) | |
| 2 | elirr 9505 | . . . 4 ⊢ ¬ 𝐴 ∈ 𝐴 | |
| 3 | df-suc 6316 | . . . . . . 7 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 4 | 3 | eqeq1i 2744 | . . . . . 6 ⊢ (suc 𝐴 = 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴) |
| 5 | ssequn2 4118 | . . . . . 6 ⊢ ({𝐴} ⊆ 𝐴 ↔ (𝐴 ∪ {𝐴}) = 𝐴) | |
| 6 | 4, 5 | sylbb2 239 | . . . . 5 ⊢ (suc 𝐴 = 𝐴 → {𝐴} ⊆ 𝐴) |
| 7 | snidg 4592 | . . . . 5 ⊢ (𝐴 ∈ V → 𝐴 ∈ {𝐴}) | |
| 8 | ssel2 3910 | . . . . 5 ⊢ (({𝐴} ⊆ 𝐴 ∧ 𝐴 ∈ {𝐴}) → 𝐴 ∈ 𝐴) | |
| 9 | 6, 7, 8 | syl2an 602 | . . . 4 ⊢ ((suc 𝐴 = 𝐴 ∧ 𝐴 ∈ V) → 𝐴 ∈ 𝐴) |
| 10 | 2, 9 | mto 198 | . . 3 ⊢ ¬ (suc 𝐴 = 𝐴 ∧ 𝐴 ∈ V) |
| 11 | 10 | imnani 401 | . 2 ⊢ (suc 𝐴 = 𝐴 → ¬ 𝐴 ∈ V) |
| 12 | 1, 11 | impbii 210 | 1 ⊢ (¬ 𝐴 ∈ V ↔ suc 𝐴 = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Vcvv 3431 ∪ cun 3881 ⊆ wss 3883 {csn 4555 suc csuc 6312 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-reg 9497 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-v 3433 df-dif 3886 df-un 3888 df-ss 3900 df-nul 4262 df-sn 4556 df-suc 6316 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |