Theorem spcgft 2841

Description: A closed version of spcgf 2846. (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		biimp 118	. . . 4 |- ( ( ph <-> ps ) -> ( ph -> ps ) )
2	1	imim2i 12	. . 3 |- ( ( x = A -> ( ph <-> ps ) ) -> ( x = A -> ( ph -> ps ) ) )
3	2	alimi 1469	. 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 2840	. 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 105   A.wal 1362   = wceq 1364   F/wnf 1474   e. wcel 2167   F/_wnfc 2326

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765

This theorem is referenced by:  spcgf  2846  rspct  2861