![]() |
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 3481 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 | issetf.1 | . 2 ⊢ Ⅎ𝑥𝐴 | |
2 | issetft 3482 | . 2 ⊢ (Ⅎ𝑥𝐴 → (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1533 ∃wex 1773 ∈ wcel 2098 Ⅎwnfc 2877 Vcvv 3468 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1536 df-ex 1774 df-nf 1778 df-sb 2060 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-v 3470 |
This theorem is referenced by: vtoclgf 3552 spcimgft 3571 fineqvrep 34624 |
Copyright terms: Public domain | W3C validator |