| 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 3468 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 3 | 1, 2 | mpbir 233 | 1 ⊢ 𝐴 ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1560 ∃wex 1799 ∈ wcel 2142 Vcvv 3454 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1563 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3456 |
| This theorem is referenced by: zfrep4 5243 0ex 5257 inex1 5273 vpwex 5334 zfpair2 5391 prex 5395 vuniex 7722 bj-snsetex 37445 |
| Copyright terms: Public domain | W3C validator |