| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Restricted existential quantification implies its restriction is nonempty. (Contributed by Szymon Jaroszewicz, 3-Apr-2007.) |
| Ref | Expression |
|---|---|
| rexn0 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ne0i 2276 |
. . 3
| |
| 2 | 1 | a1d 12 |
. 2
|
| 3 | 2 | r19.23aiv 1735 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: grpn0 7980 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-10 963 ax-12 965 ax-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-16 1206 ax-11o 1213 ax-ext 1452 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 978 df-sb 1168 df-clab 1457 df-cleq 1462 df-clel 1465 df-ne 1579 df-rex 1642 df-v 1803 df-dif 2039 df-nul 2271 |