Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > spei | Structured version Visualization version GIF version |
Description: Inference from existential specialization, using implicit substitution. Remove a distinct variable constraint. Usage of this theorem is discouraged because it depends on ax-13 2372. Use the weaker speiv 1977 if possible. (Contributed by NM, 19-Aug-1993.) (Proof shortened by Wolf Lammen, 12-May-2018.) (New usage is discouraged.) |
Ref | Expression |
---|---|
spei.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
spei.2 | ⊢ 𝜓 |
Ref | Expression |
---|---|
spei | ⊢ ∃𝑥𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax6e 2383 | . 2 ⊢ ∃𝑥 𝑥 = 𝑦 | |
2 | spei.2 | . . 3 ⊢ 𝜓 | |
3 | spei.1 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
4 | 2, 3 | mpbiri 257 | . 2 ⊢ (𝑥 = 𝑦 → 𝜑) |
5 | 1, 4 | eximii 1840 | 1 ⊢ ∃𝑥𝜑 |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∃wex 1783 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-12 2173 ax-13 2372 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1784 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |