| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > issetri | Structured version Visualization version GIF version | ||
| Description: A way to say "𝐴 is a set" (inference form). (Contributed by NM, 21-Jun-1993.) |
| Ref | Expression |
|---|---|
| issetri.1 | ⊢ ∃𝑥 𝑥 = 𝐴 |
| Ref | Expression |
|---|---|
| issetri | ⊢ 𝐴 ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | issetri.1 | . 2 ⊢ ∃𝑥 𝑥 = 𝐴 | |
| 2 | isset 3471 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 3 | 1, 2 | mpbir 234 | 1 ⊢ 𝐴 ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∃wex 1812 ∈ wcel 2146 Vcvv 3457 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 |
| This theorem is used by: zfrep4 5256 0ex 5272 inex1 5288 vpwex 5350 zfpair2 5407 prex 5411 vuniex 7747 bj-snsetex 37656 |
| Copyright terms: Public domain | W3C validator |