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

Theorem spimevw 2020
Description: Existential introduction, using implicit substitution. This is to spimew 2006 what spimvw 2021 is to spimw 2005. Version of spimev 2424 and spimefv 2238 with an additional disjoint variable condition, using only Tarski's FOL axiom schemes. (Contributed by NM, 10-Jan-1993.) (Revised by BJ, 17-Mar-2020.)
Hypothesis
Ref Expression
spimevw.1 (𝑥 = 𝑦 → (𝜑 → 𝜓))
Assertion
Ref Expression
spimevw (𝜑 → ∃𝑥𝜓)
Distinct variable groups:   𝑥,𝑦   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑥, 𝑦)

Proof of Theorem spimevw
StepHypRef Expression
1 ax-5 1945 . 2 (𝜑 → ∀𝑥𝜑)
2 spimevw.1 . 2 (𝑥 = 𝑦 → (𝜑 → 𝜓))
31, 2spimew 2006 1 (𝜑 → ∃𝑥𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∃wex 1812
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 1945  ax-6 2002
This proof depends on definitions:  df-bi 210  df-ex 1813
This theorem is used by:  dtruALT2  5339  zfpair  5390  axprlem3  5394  exneq  5411  fvn0ssdmfun  7106  axnulregtco  37483  onsupmaxb  44563  refimssco  44929  rlimdmafv  48581  rlimdmafv2  48662  elsprel  48891
  Copyright terms: Public domain W3C validator