Theorem spimfv 2276

Description: Specialization, using implicit substitution. Version of spim 2417 with a disjoint variable condition, which does not require ax-13 2402. See spimvw 2019 for a version with two disjoint variable conditions, requiring fewer axioms, and spimv 2420 for another variant. (Contributed by NM, 10-Jan-1993.) (Revised by BJ, 31-May-2019.)

Hypotheses

Ref	Expression
spimfv.nf	⊢ Ⅎ𝑥𝜓
spimfv.1	⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))

Assertion

Ref	Expression
spimfv	⊢ (∀𝑥𝜑 → 𝜓)

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)

Proof of Theorem spimfv

Step	Hyp	Ref	Expression
1		spimfv.nf	. 2 ⊢ Ⅎ𝑥𝜓
2		ax6ev 2002	. . 3 ⊢ ∃𝑥 𝑥 = 𝑦
3		spimfv.1	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))
4	2, 3	eximii 1870	. 2 ⊢ ∃𝑥(𝜑 → 𝜓)
5	1, 4	19.36i 2268	1 ⊢ (∀𝑥𝜑 → 𝜓)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568  Ⅎwnf 1816

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 1943  ax-6 2000  ax-7 2041  ax-12 2213

This proof depends on definitions:  df-bi 210  df-ex 1813  df-nf 1817

This theorem is used by:  chvarfv  2277  cbv3v2  2278  cbv3v  2365  setrec2fun  9966