Theorem spcegft 2632

Description: A closed version of spcegf 2636. (Contributed by Jim Kingdon, 22-Jun-2018.)

Hypotheses

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

Assertion

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

Proof of Theorem spcegft

Step	Hyp	Ref	Expression
1		bi2 121	. . . 4 |- ( ( ph <-> ps ) -> ( ps -> ph ) )
2	1	imim2i 12	. . 3 |- ( ( x = A -> ( ph <-> ps ) ) -> ( x = A -> ( ps -> ph ) ) )
3	2	alimi 1344	. 2 |- ( A. x ( x = A -> ( ph <-> ps ) ) -> A. x ( x = A -> ( ps -> ph ) ) )
4		spcimgft.1	. . 3 |- F/ x ps
5		spcimgft.2	. . 3 |- F/_ x A
6	4, 5	spcimegft 2631	. 2 |- ( A. x ( x = A -> ( ps -> ph ) ) -> ( A e. B -> ( ps -> E. x ph ) ) )
7	3, 6	syl 14	1 |- ( A. x ( x = A -> ( ph <-> ps ) ) -> ( A e. B -> ( ps -> E. x ph ) ) )

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

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:  spcegf  2636