![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > reximdva0 | Structured version Visualization version GIF version |
Description: Restricted existence deduced from nonempty class. (Contributed by NM, 1-Feb-2012.) |
Ref | Expression |
---|---|
reximdva0.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝜓) |
Ref | Expression |
---|---|
reximdva0 | ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 4376 | . . 3 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
2 | reximdva0.1 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝜓) | |
3 | 2 | ex 412 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝜓)) |
4 | 3 | ancld 550 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 ∧ 𝜓))) |
5 | 4 | eximdv 1916 | . . . 4 ⊢ (𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))) |
6 | 5 | imp 406 | . . 3 ⊢ ((𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) |
7 | 1, 6 | sylan2b 593 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) |
8 | df-rex 3077 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
9 | 7, 8 | sylibr 234 | 1 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∃wex 1777 ∈ wcel 2108 ≠ wne 2946 ∃wrex 3076 ∅c0 4352 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-ne 2947 df-rex 3077 df-dif 3979 df-nul 4353 |
This theorem is referenced by: n0snor2el 4858 f1cdmsn 7318 hashgt12el 14471 refun0 23544 cstucnd 24314 supxrnemnf 32775 kerunit 33314 ssdifidllem 33449 ssmxidllem 33466 elpaddn0 39757 thinciso 48727 |
Copyright terms: Public domain | W3C validator |