| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > issetssr | Structured version Visualization version GIF version | ||
| Description: Two ways of expressing set existence. (Contributed by Peter Mazsa, 1-Aug-2019.) |
| Ref | Expression |
|---|---|
| issetssr | ⊢ (𝐴 ∈ V ↔ 𝐴 S 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brssrid 39660 | . 2 ⊢ (𝐴 ∈ V → 𝐴 S 𝐴) | |
| 2 | relssr 39658 | . . 3 ⊢ Rel S | |
| 3 | 2 | brrelex1i 5711 | . 2 ⊢ (𝐴 S 𝐴 → 𝐴 ∈ V) |
| 4 | 1, 3 | impbii 212 | 1 ⊢ (𝐴 ∈ V ↔ 𝐴 S 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2146 Vcvv 3454 class class class wbr 5106 S cssr 39264 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5252 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-br 5107 df-opab 5171 df-xp 5661 df-rel 5662 df-ssr 39656 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |