| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > issetid | Structured version Visualization version GIF version | ||
| Description: Two ways of expressing set existence. (Contributed by NM, 16-Feb-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| issetid | ⊢ (𝐴 ∈ V ↔ 𝐴 I 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ididg 5840 | . 2 ⊢ (𝐴 ∈ V → 𝐴 I 𝐴) | |
| 2 | reli 5814 | . . 3 ⊢ Rel I | |
| 3 | 2 | brrelex1i 5718 | . 2 ⊢ (𝐴 I 𝐴 → 𝐴 ∈ V) |
| 4 | 1, 3 | impbii 212 | 1 ⊢ (𝐴 ∈ V ↔ 𝐴 I 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∈ wcel 2149 Vcvv 3463 class class class wbr 5113 I cid 5556 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |