| 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 5820 | . 2 ⊢ (𝐴 ∈ V → 𝐴 I 𝐴) | |
| 2 | reli 5792 | . . 3 ⊢ Rel I | |
| 3 | 2 | brrelex1i 5697 | . 2 ⊢ (𝐴 I 𝐴 → 𝐴 ∈ V) |
| 4 | 1, 3 | impbii 209 | 1 ⊢ (𝐴 ∈ V ↔ 𝐴 I 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2109 Vcvv 3450 class class class wbr 5110 I cid 5535 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-br 5111 df-opab 5173 df-id 5536 df-xp 5647 df-rel 5648 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |