| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rexn0 | Structured version Visualization version GIF version | ||
| Description: Restricted existential quantification implies its restriction is nonempty. (Contributed by Szymon Jaroszewicz, 3-Apr-2007.) Avoid df-clel 2839, ax-8 2149. (Revised by GG, 2-Sep-2024.) |
| Ref | Expression |
|---|---|
| rexn0 | ⊢ (∃𝑥 ∈ 𝐴 𝜑 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrex2 3093 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑) | |
| 2 | rzal 4453 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ¬ 𝜑) | |
| 3 | 2 | con3i 155 | . . 3 ⊢ (¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑 → ¬ 𝐴 = ∅) |
| 4 | 1, 3 | sylbi 220 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → ¬ 𝐴 = ∅) |
| 5 | 4 | neqned 2966 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 ∅c0 4281 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-ne 2960 df-ral 3081 df-rex 3091 df-dif 4050 df-nul 4282 |
| This theorem is used by: r19.2zb 4459 2reu4 4483 reusv2lem3 5367 eusvobj2 7438 isdrs2 18512 ismnd 18958 slwn0 19862 lbsexg 21475 iunconn 23779 ltsn0 28325 grpon0 31137 filbcmb 38877 isbnd2 38920 rencldnfi 44032 iunconnlem2 46119 stoweidlem14 47239 hoidmvval0 47812 thinciso 50820 ralsn0d 51205 alsralrex 51220 alsraln0 51221 |
| Copyright terms: Public domain | W3C validator |