| 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 2836, ax-8 2147. (Revised by GG, 2-Sep-2024.) |
| Ref | Expression |
|---|---|
| rexn0 | ⊢ (∃𝑥 ∈ 𝐴 𝜑 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrex2 3090 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑) | |
| 2 | rzal 4450 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ¬ 𝜑) | |
| 3 | 2 | con3i 155 | . . 3 ⊢ (¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑 → ¬ 𝐴 = ∅) |
| 4 | 1, 3 | sylbi 220 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → ¬ 𝐴 = ∅) |
| 5 | 4 | neqned 2963 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ≠ wne 2956 ∀wral 3077 ∃wrex 3087 ∅c0 4279 |
| 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 1943 ax-6 2000 ax-7 2041 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-ne 2957 df-ral 3078 df-rex 3088 df-dif 3902 df-nul 4280 |
| This theorem is used by: r19.2zb 4456 2reu4 4480 reusv2lem3 5362 eusvobj2 7412 isdrs2 18480 ismnd 18926 slwn0 19829 lbsexg 21442 iunconn 23746 ltsn0 28292 grpon0 31104 filbcmb 38674 isbnd2 38717 rencldnfi 43827 iunconnlem2 45916 stoweidlem14 47023 hoidmvval0 47596 thinciso 50577 ralsn0d 50892 alsralrex 50907 alsraln0 50908 |
| Copyright terms: Public domain | W3C validator |