MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  spimed Structured version   Visualization version   GIF version

Theorem spimed 2387
Description: Deduction version of spime 2388. Usage of this theorem is discouraged because it depends on ax-13 2371. Use the weaker spimedv 2197 if possible. (Contributed by NM, 14-May-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) (Proof shortened by Wolf Lammen, 19-Feb-2018.) (New usage is discouraged.)
Hypotheses
Ref Expression
spimed.1 (𝜒 → Ⅎ𝑥𝜑)
spimed.2 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
spimed (𝜒 → (𝜑 → ∃𝑥𝜓))

Proof of Theorem spimed
StepHypRef Expression
1 spimed.1 . . 3 (𝜒 → Ⅎ𝑥𝜑)
21nf5rd 2196 . 2 (𝜒 → (𝜑 → ∀𝑥𝜑))
3 ax6e 2382 . . . 4 𝑥 𝑥 = 𝑦
4 spimed.2 . . . 4 (𝑥 = 𝑦 → (𝜑𝜓))
53, 4eximii 1844 . . 3 𝑥(𝜑𝜓)
6519.35i 1886 . 2 (∀𝑥𝜑 → ∃𝑥𝜓)
72, 6syl6 35 1 (𝜒 → (𝜑 → ∃𝑥𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1541  wex 1787  wnf 1791
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-12 2177  ax-13 2371
This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1788  df-nf 1792
This theorem is referenced by:  spime  2388  2ax6elem  2469
  Copyright terms: Public domain W3C validator