Theorem bj-inf2vnlem3 15618

Description: Lemma for bj-inf2vn 15620. (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 15617	. . 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 15492	. . . . 5 |- BOUNDED z e. A
4		bj-inf2vnlem3.bd2	. . . . . 6 |- BOUNDED Z
5	4	bdeli 15492	. . . . 5 |- BOUNDED z e. Z
6	3, 5	ax-bdim 15460	. . . 4 |- BOUNDED ( z e. A -> z e. Z )
7		nfv 1542	. . . 4 |- F/ z ( t e. A -> t e. Z )
8		nfv 1542	. . . 4 |- F/ z ( u e. A -> u e. Z )
9		nfv 1542	. . . 4 |- F/ u ( z e. A -> z e. Z )
10		nfv 1542	. . . 4 |- F/ u ( t e. A -> t e. Z )
11		eleq1 2259	. . . . . 6 |- ( z = t -> ( z e. A <-> t e. A ) )
12		eleq1 2259	. . . . . 6 |- ( z = t -> ( z e. Z <-> t e. Z ) )
13	11, 12	imbi12d 234	. . . . 5 |- ( z = t -> ( ( z e. A -> z e. Z ) <-> ( t e. A -> t e. Z ) ) )
14	13	biimpd 144	. . . 4 |- ( z = t -> ( ( z e. A -> z e. Z ) -> ( t e. A -> t e. Z ) ) )
15		eleq1 2259	. . . . . 6 |- ( z = u -> ( z e. A <-> u e. A ) )
16		eleq1 2259	. . . . . 6 |- ( z = u -> ( z e. Z <-> u e. Z ) )
17	15, 16	imbi12d 234	. . . . 5 |- ( z = u -> ( ( z e. A -> z e. Z ) <-> ( u e. A -> u e. Z ) ) )
18	17	biimprd 158	. . . 4 |- ( z = u -> ( ( u e. A -> u e. Z ) -> ( z e. A -> z e. Z ) ) )
19	6, 7, 8, 9, 10, 14, 18	bdsetindis 15615	. . 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 3172	. 2 |- ( A C_ Z <-> A. z ( z e. A -> z e. Z ) )
22	20, 21	imbitrrdi 162	1 |- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A C_ Z ) )

Syntax hints:   -> wi 4   \/ wo 709   A.wal 1362   = wceq 1364   e. wcel 2167   A.wral 2475   E.wrex 2476   C_ wss 3157   (/)c0 3450   suc csuc 4400  BOUNDED wbdc 15486  Ind wind 15572

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  ax-bdim 15460  ax-bdsetind 15614

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-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3628  df-suc 4406  df-bdc 15487  df-bj-ind 15573

This theorem is referenced by:  bj-inf2vn  15620