Theorem bdsetindis 14004

Description: Axiom of bounded set induction using implicit substitutions. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bdsetindis.bd	|- BOUNDED ph
bdsetindis.nf0	|- F/ x ps
bdsetindis.nf1	|- F/ x ch
bdsetindis.nf2	|- F/ y ph
bdsetindis.nf3	|- F/ y ps
bdsetindis.1	|- ( x = z -> ( ph -> ps ) )
bdsetindis.2	|- ( x = y -> ( ch -> ph ) )

Assertion

Ref	Expression
bdsetindis	|- ( A. y ( A. z e. y ps -> ch ) -> A. x ph )

Distinct variable groups:   x, y, z   ph, z

Allowed substitution hints:   ph( x, y)   ps( x, y, z)   ch( x, y, z)

Proof of Theorem bdsetindis

Step	Hyp	Ref	Expression
1		nfcv 2312	. . . . 5 |- F/_ x y
2		bdsetindis.nf0	. . . . 5 |- F/ x ps
3	1, 2	nfralxy 2508	. . . 4 |- F/ x A. z e. y ps
4		bdsetindis.nf1	. . . 4 |- F/ x ch
5	3, 4	nfim 1565	. . 3 |- F/ x ( A. z e. y ps -> ch )
6		nfcv 2312	. . . . 5 |- F/_ y x
7		bdsetindis.nf3	. . . . 5 |- F/ y ps
8	6, 7	nfralxy 2508	. . . 4 |- F/ y A. z e. x ps
9		bdsetindis.nf2	. . . 4 |- F/ y ph
10	8, 9	nfim 1565	. . 3 |- F/ y ( A. z e. x ps -> ph )
11		raleq 2665	. . . . 5 |- ( y = x -> ( A. z e. y ps <-> A. z e. x ps ) )
12	11	biimprd 157	. . . 4 |- ( y = x -> ( A. z e. x ps -> A. z e. y ps ) )
13		bdsetindis.2	. . . . 5 |- ( x = y -> ( ch -> ph ) )
14	13	equcoms 1701	. . . 4 |- ( y = x -> ( ch -> ph ) )
15	12, 14	imim12d 74	. . 3 |- ( y = x -> ( ( A. z e. y ps -> ch ) -> ( A. z e. x ps -> ph ) ) )
16	5, 10, 15	cbv3 1735	. 2 |- ( A. y ( A. z e. y ps -> ch ) -> A. x ( A. z e. x ps -> ph ) )
17		bdsetindis.1	. . . . . 6 |- ( x = z -> ( ph -> ps ) )
18	2, 17	bj-sbime 13808	. . . . 5 |- ( [ z / x ] ph -> ps )
19	18	ralimi 2533	. . . 4 |- ( A. z e. x [ z / x ] ph -> A. z e. x ps )
20	19	imim1i 60	. . 3 |- ( ( A. z e. x ps -> ph ) -> ( A. z e. x [ z / x ] ph -> ph ) )
21	20	alimi 1448	. 2 |- ( A. x ( A. z e. x ps -> ph ) -> A. x ( A. z e. x [ z / x ] ph -> ph ) )
22		bdsetindis.bd	. . 3 |- BOUNDED ph
23	22	ax-bdsetind 14003	. 2 |- ( A. x ( A. z e. x [ z / x ] ph -> ph ) -> A. x ph )
24	16, 21, 23	3syl 17	1 |- ( A. y ( A. z e. y ps -> ch ) -> A. x ph )

Syntax hints:   -> wi 4   A.wal 1346   F/wnf 1453   [wsb 1755   A.wral 2448  BOUNDED wbd 13847

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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-bdsetind 14003

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453

This theorem is referenced by:  bj-inf2vnlem3  14007