| 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 3469 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 3 | 1, 2 | mpbir 234 | 1 ⊢ 𝐴 ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∃wex 1809 ∈ wcel 2143 Vcvv 3455 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3457 |
| This theorem is referenced by: zfrep4 5254 0ex 5270 inex1 5286 vpwex 5348 zfpair2 5405 prex 5409 vuniex 7737 bj-snsetex 37599 |
| Copyright terms: Public domain | W3C validator |