Theorem spcimgf 3517

Description: Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

Ref	Expression
spcimgf.1	⊢ Ⅎ𝑥𝐴
spcimgf.2	⊢ Ⅎ𝑥𝜓
spcimgf.3	⊢ (𝑥 = 𝐴 → (𝜑 → 𝜓))

Assertion

Ref	Expression
spcimgf	⊢ (𝐴 ∈ 𝑉 → (∀𝑥𝜑 → 𝜓))

Proof of Theorem spcimgf

Step	Hyp	Ref	Expression
1		spcimgf.2	. . 3 ⊢ Ⅎ𝑥𝜓
2		spcimgf.1	. . 3 ⊢ Ⅎ𝑥𝐴
3	1, 2	spcimgfi1 3514	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝑉 → (∀𝑥𝜑 → 𝜓)))
4		spcimgf.3	. 2 ⊢ (𝑥 = 𝐴 → (𝜑 → 𝜓))
5	3, 4	mpg 1825	1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥𝜑 → 𝜓))

Syntax hints:   → wi 4  ∀wal 1566   = wceq 1568  Ⅎwnf 1811   ∈ wcel 2141  Ⅎwnfc 2908

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1808  df-nf 1812  df-cleq 2753  df-clel 2836  df-nfc 2910

This theorem is referenced by:  spcimegf  3518  iooelexlt  37952