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

Theorem spimvw 2021
Description: A weak form of specialization. Lemma 8 of [KalishMontague] p. 87. Uses only Tarski's FOL axiom schemes. For stronger forms using more axioms, see spimv 2422 and spimfv 2279. (Contributed by NM, 9-Apr-2017.)
Hypothesis
Ref Expression
spimvw.1 (𝑥 = 𝑦 → (𝜑 → 𝜓))
Assertion
Ref Expression
spimvw (∀𝑥𝜑 → 𝜓)
Distinct variable groups:   𝑥,𝑦   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑦)

Proof of Theorem spimvw
StepHypRef Expression
1 ax-5 1945 . 2 (¬ 𝜓 → ∀𝑥 ¬ 𝜓)
2 spimvw.1 . 2 (𝑥 = 𝑦 → (𝜑 → 𝜓))
31, 2spimw 2005 1 (∀𝑥𝜑 → 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568
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:  spsv  2022  spvv  2023  cbvalivw  2042  alcomimw  2078  axc16i  2468  ax9ALT  2758  reu6  3687  exnelv  5273  elALT2  5338  el  5413  fvn0ssdmfun  7106  reu6f  35820  axtco1from2  37478  wl-dfcleq  38705  aev-o  40254  axc11next  45712  funressnvmo  48449
  Copyright terms: Public domain W3C validator