Theorem spcimgft 2629

Description: A closed version of spcimgf 2633. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

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

Assertion

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

Proof of Theorem spcimgft

Step	Hyp	Ref	Expression
1		elex 2566	. 2 |- ( A e. B -> A e. _V )
2		spcimgft.2	. . . . 5 |- F/_ x A
3	2	issetf 2562	. . . 4 |- ( A e. _V <-> E. x x = A )
4		exim 1490	. . . 4 |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( E. x x = A -> E. x ( ph -> ps ) ) )
5	3, 4	syl5bi 141	. . 3 |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( A e. _V -> E. x ( ph -> ps ) ) )
6		spcimgft.1	. . . 4 |- F/ x ps
7	6	19.36-1 1563	. . 3 |- ( E. x ( ph -> ps ) -> ( A. x ph -> ps ) )
8	5, 7	syl6 29	. 2 |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( A e. _V -> ( A. x ph -> ps ) ) )
9	1, 8	syl5 28	1 |- ( A. x ( x = A -> ( ph -> ps ) ) -> ( A e. B -> ( A. x ph -> ps ) ) )

Syntax hints:   -> wi 4   A.wal 1241   = wceq 1243   F/wnf 1349   E.wex 1381   e. wcel 1393   F/_wnfc 2165   _Vcvv 2557

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559

This theorem is referenced by:  spcgft  2630  spcimgf  2633  spcimdv  2637