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 5726 | . 2 ⊢ (𝐴 ∈ V → 𝐴 I 𝐴) | |
2 | reli 5700 | . . 3 ⊢ Rel I | |
3 | 2 | brrelex1i 5610 | . 2 ⊢ (𝐴 I 𝐴 → 𝐴 ∈ V) |
4 | 1, 3 | impbii 211 | 1 ⊢ (𝐴 ∈ V ↔ 𝐴 I 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∈ wcel 2114 Vcvv 3496 class class class wbr 5068 I cid 5461 |
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-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-opab 5131 df-id 5462 df-xp 5563 df-rel 5564 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |