Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > issetf | Structured version Visualization version GIF version |
Description: A version of isset 3506 that does not require 𝑥 and 𝐴 to be distinct. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 10-Oct-2016.) |
Ref | Expression |
---|---|
issetf.1 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
issetf | ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isset 3506 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑦 𝑦 = 𝐴) | |
2 | issetf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | nfeq2 2995 | . . 3 ⊢ Ⅎ𝑥 𝑦 = 𝐴 |
4 | nfv 1911 | . . 3 ⊢ Ⅎ𝑦 𝑥 = 𝐴 | |
5 | eqeq1 2825 | . . 3 ⊢ (𝑦 = 𝑥 → (𝑦 = 𝐴 ↔ 𝑥 = 𝐴)) | |
6 | 3, 4, 5 | cbvexv1 2358 | . 2 ⊢ (∃𝑦 𝑦 = 𝐴 ↔ ∃𝑥 𝑥 = 𝐴) |
7 | 1, 6 | bitri 277 | 1 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 = wceq 1533 ∃wex 1776 ∈ wcel 2110 Ⅎwnfc 2961 Vcvv 3494 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 |
This theorem is referenced by: vtoclgf 3565 spcimgft 3585 |
Copyright terms: Public domain | W3C validator |