Theorem spcgft 2766

Description: A closed version of spcgf 2771. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 4-Jan-2017.)

Hypotheses

Ref	Expression
spcimgft.1	|- F/ x ps
spcimgft.2	|- F/_ x A

Assertion

Ref	Expression
spcgft	|- ( A. x ( x = A -> ( ph <-> ps ) ) -> ( A e. B -> ( A. x ph -> ps ) ) )

Proof of Theorem spcgft

Step	Hyp	Ref	Expression
1		bi1 117	. . . 4 |- ( ( ph <-> ps ) -> ( ph -> ps ) )
2	1	imim2i 12	. . 3 |- ( ( x = A -> ( ph <-> ps ) ) -> ( x = A -> ( ph -> ps ) ) )
3	2	alimi 1432	. 2 |- ( A. x ( x = A -> ( ph <-> ps ) ) -> A. x ( x = A -> ( ph -> ps ) ) )
4		spcimgft.1	. . 3 |- F/ x ps
5		spcimgft.2	. . 3 |- F/_ x A
6	4, 5	spcimgft 2765	. 2 |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( A e. B -> ( A. x ph -> ps ) ) )
7	3, 6	syl 14	1 |- ( A. x ( x = A -> ( ph <-> ps ) ) -> ( A e. B -> ( A. x ph -> ps ) ) )

Syntax hints:   -> wi 4   <-> wb 104   A.wal 1330   = wceq 1332   F/wnf 1437   e. wcel 1481   F/_wnfc 2269

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122

This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691

This theorem is referenced by:  spcgf  2771  rspct  2786