Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > speiv | Structured version Visualization version GIF version |
Description: Inference from existential specialization. (Contributed by NM, 19-Aug-1993.) (Revised by Wolf Lammen, 22-Oct-2023.) |
Ref | Expression |
---|---|
speiv.1 | ⊢ (𝑥 = 𝑦 → (𝜓 → 𝜑)) |
speiv.2 | ⊢ 𝜓 |
Ref | Expression |
---|---|
speiv | ⊢ ∃𝑥𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | speiv.2 | . 2 ⊢ 𝜓 | |
2 | 1 | hbth 1806 | . . 3 ⊢ (𝜓 → ∀𝑥𝜓) |
3 | speiv.1 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜓 → 𝜑)) | |
4 | 2, 3 | spimew 1975 | . 2 ⊢ (𝜓 → ∃𝑥𝜑) |
5 | 1, 4 | ax-mp 5 | 1 ⊢ ∃𝑥𝜑 |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∃wex 1782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-6 1971 |
This theorem depends on definitions: df-bi 206 df-ex 1783 |
This theorem is referenced by: speivw 1977 exgen 1978 |
Copyright terms: Public domain | W3C validator |