Theorem spcimgf 2905

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	spcimgft 2901	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝑉 → (∀𝑥𝜑 → 𝜓)))
4		spcimgf.3	. 2 ⊢ (𝑥 = 𝐴 → (𝜑 → 𝜓))
5	3, 4	mpg 1504	1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥𝜑 → 𝜓))

Syntax hints:   → wi 4  ∀wal 1400   = wceq 1402  Ⅎwnf 1513   ∈ wcel 2209  Ⅎwnfc 2379

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823

This theorem is referenced by:  bj-nn0sucALT  16918