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 3506 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
3 | 1, 2 | mpbir 233 | 1 ⊢ 𝐴 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∃wex 1780 ∈ wcel 2114 Vcvv 3494 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1781 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-v 3496 |
This theorem is referenced by: zfrep4 5200 0ex 5211 inex1 5221 vpwex 5278 zfpair2 5331 vuniex 7465 bj-snsetex 34278 |
Copyright terms: Public domain | W3C validator |