Theorem bj-inf2vnlem3 12853

Description: Lemma for bj-inf2vn 12855. (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-inf2vnlem3.bd1	|- BOUNDED A
bj-inf2vnlem3.bd2	|- BOUNDED Z

Assertion

Ref	Expression
bj-inf2vnlem3	|- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A C_ Z ) )

Distinct variable groups:   x, y, A   x, Z, y

Proof of Theorem bj-inf2vnlem3

Dummy variables z t u are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bj-inf2vnlem2 12852	. . 3 |- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A. u ( A. t e. u ( t e. A -> t e. Z ) -> ( u e. A -> u e. Z ) ) ) )
2		bj-inf2vnlem3.bd1	. . . . . 6 |- BOUNDED A
3	2	bdeli 12727	. . . . 5 |- BOUNDED z e. A
4		bj-inf2vnlem3.bd2	. . . . . 6 |- BOUNDED Z
5	4	bdeli 12727	. . . . 5 |- BOUNDED z e. Z
6	3, 5	ax-bdim 12695	. . . 4 |- BOUNDED ( z e. A -> z e. Z )
7		nfv 1489	. . . 4 |- F/ z ( t e. A -> t e. Z )
8		nfv 1489	. . . 4 |- F/ z ( u e. A -> u e. Z )
9		nfv 1489	. . . 4 |- F/ u ( z e. A -> z e. Z )
10		nfv 1489	. . . 4 |- F/ u ( t e. A -> t e. Z )
11		eleq1 2175	. . . . . 6 |- ( z = t -> ( z e. A <-> t e. A ) )
12		eleq1 2175	. . . . . 6 |- ( z = t -> ( z e. Z <-> t e. Z ) )
13	11, 12	imbi12d 233	. . . . 5 |- ( z = t -> ( ( z e. A -> z e. Z ) <-> ( t e. A -> t e. Z ) ) )
14	13	biimpd 143	. . . 4 |- ( z = t -> ( ( z e. A -> z e. Z ) -> ( t e. A -> t e. Z ) ) )
15		eleq1 2175	. . . . . 6 |- ( z = u -> ( z e. A <-> u e. A ) )
16		eleq1 2175	. . . . . 6 |- ( z = u -> ( z e. Z <-> u e. Z ) )
17	15, 16	imbi12d 233	. . . . 5 |- ( z = u -> ( ( z e. A -> z e. Z ) <-> ( u e. A -> u e. Z ) ) )
18	17	biimprd 157	. . . 4 |- ( z = u -> ( ( u e. A -> u e. Z ) -> ( z e. A -> z e. Z ) ) )
19	6, 7, 8, 9, 10, 14, 18	bdsetindis 12850	. . 3 |- ( A. u ( A. t e. u ( t e. A -> t e. Z ) -> ( u e. A -> u e. Z ) ) -> A. z ( z e. A -> z e. Z ) )
20	1, 19	syl6 33	. 2 |- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A. z ( z e. A -> z e. Z ) ) )
21		dfss2 3050	. 2 |- ( A C_ Z <-> A. z ( z e. A -> z e. Z ) )
22	20, 21	syl6ibr 161	1 |- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A C_ Z ) )

Syntax hints:   -> wi 4   \/ wo 680   A.wal 1310   = wceq 1312   e. wcel 1461   A.wral 2388   E.wrex 2389   C_ wss 3035   (/)c0 3327   suc csuc 4245  BOUNDED wbdc 12721  Ind wind 12807

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-bdim 12695  ax-bdsetind 12849

This theorem depends on definitions:  df-bi 116  df-tru 1315  df-nf 1418  df-sb 1717  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ral 2393  df-rex 2394  df-v 2657  df-un 3039  df-in 3041  df-ss 3048  df-sn 3497  df-suc 4251  df-bdc 12722  df-bj-ind 12808

This theorem is referenced by:  bj-inf2vn  12855