Theorem spimv 2389

Description: A version of spim 2386 with a distinct variable requirement instead of a bound-variable hypothesis. See spimfv 2232 and spimvw 1999 for versions requiring fewer axioms. (Contributed by NM, 31-Jul-1993.) Usage of this theorem is discouraged because it depends on ax-13 2371. Use spimvw 1999 instead. (New usage is discouraged.)

Hypothesis

Ref	Expression
spimv.1	⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))

Assertion

Ref	Expression
spimv	⊢ (∀𝑥𝜑 → 𝜓)

Distinct variable group:   𝜓,𝑥

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

Proof of Theorem spimv

Step	Hyp	Ref	Expression
1		nfv 1917	. 2 ⊢ Ⅎ𝑥𝜓
2		spimv.1	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))
3	1, 2	spim 2386	1 ⊢ (∀𝑥𝜑 → 𝜓)

Syntax hints:   → wi 4  ∀wal 1539

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-12 2171  ax-13 2371

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1782  df-nf 1786

This theorem is referenced by:  spv  2392