![]() |
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 3492 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 3494 | . 2 ⊢ (Ⅎ𝑥𝐴 → (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 = wceq 1537 ∃wex 1776 ∈ wcel 2106 Ⅎwnfc 2888 Vcvv 3478 |
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 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1540 df-ex 1777 df-nf 1781 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-v 3480 |
This theorem is referenced by: spcimgfi1OLD 3548 vtoclgf 3569 fineqvrep 35088 |
Copyright terms: Public domain | W3C validator |