| 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 3456 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 3 | 1, 2 | mpbir 231 | 1 ⊢ 𝐴 ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∃wex 1781 ∈ wcel 2114 Vcvv 3442 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-v 3444 |
| This theorem is referenced by: zfrep4 5240 0ex 5254 inex1 5264 vpwex 5324 zfpair2 5380 prex 5384 vuniex 7694 bj-snsetex 37211 |
| Copyright terms: Public domain | W3C validator |