Theorem bj-nn0suc0 15596

Description: Constructive proof of a variant of nn0suc 4640. For a constructive proof of nn0suc 4640, see bj-nn0suc 15610. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-nn0suc0	|- ( A e. om -> ( A = (/) \/ E. x e. A A = suc x ) )

Distinct variable group:   x, A

Proof of Theorem bj-nn0suc0

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2203	. . 3 |- ( y = A -> ( y = (/) <-> A = (/) ) )
2		eqeq1 2203	. . . 4 |- ( y = A -> ( y = suc x <-> A = suc x ) )
3	2	rexeqbi1dv 2706	. . 3 |- ( y = A -> ( E. x e. y y = suc x <-> E. x e. A A = suc x ) )
4	1, 3	orbi12d 794	. 2 |- ( y = A -> ( ( y = (/) \/ E. x e. y y = suc x ) <-> ( A = (/) \/ E. x e. A A = suc x ) ) )
5		tru 1368	. . 3 |- T.
6		trud 1380	. . . 4 |- ( T. -> T. )
7	6	rgenw 2552	. . 3 |- A. z e. om ( T. -> T. )
8		bdeq0 15513	. . . . 5 |- BOUNDED y = (/)
9		bdeqsuc 15527	. . . . . 6 |- BOUNDED y = suc x
10	9	ax-bdex 15465	. . . . 5 |- BOUNDED E. x e. y y = suc x
11	8, 10	ax-bdor 15462	. . . 4 |- BOUNDED ( y = (/) \/ E. x e. y y = suc x )
12		nfv 1542	. . . 4 |- F/ y T.
13		orc 713	. . . . 5 |- ( y = (/) -> ( y = (/) \/ E. x e. y y = suc x ) )
14	13	a1d 22	. . . 4 |- ( y = (/) -> ( T. -> ( y = (/) \/ E. x e. y y = suc x ) ) )
15		trud 1380	. . . . 5 |- ( -. ( y = z -> -. ( y = (/) \/ E. x e. y y = suc x ) ) -> T. )
16	15	expi 639	. . . 4 |- ( y = z -> ( ( y = (/) \/ E. x e. y y = suc x ) -> T. ) )
17		vex 2766	. . . . . . . . 9 |- z e. _V
18	17	sucid 4452	. . . . . . . 8 |- z e. suc z
19		eleq2 2260	. . . . . . . 8 |- ( y = suc z -> ( z e. y <-> z e. suc z ) )
20	18, 19	mpbiri 168	. . . . . . 7 |- ( y = suc z -> z e. y )
21		suceq 4437	. . . . . . . . 9 |- ( x = z -> suc x = suc z )
22	21	eqeq2d 2208	. . . . . . . 8 |- ( x = z -> ( y = suc x <-> y = suc z ) )
23	22	rspcev 2868	. . . . . . 7 |- ( ( z e. y /\ y = suc z ) -> E. x e. y y = suc x )
24	20, 23	mpancom 422	. . . . . 6 |- ( y = suc z -> E. x e. y y = suc x )
25	24	olcd 735	. . . . 5 |- ( y = suc z -> ( y = (/) \/ E. x e. y y = suc x ) )
26	25	a1d 22	. . . 4 |- ( y = suc z -> ( T. -> ( y = (/) \/ E. x e. y y = suc x ) ) )
27	11, 12, 12, 12, 14, 16, 26	bj-bdfindis 15593	. . 3 |- ( ( T. /\ A. z e. om ( T. -> T. ) ) -> A. y e. om ( y = (/) \/ E. x e. y y = suc x ) )
28	5, 7, 27	mp2an 426	. 2 |- A. y e. om ( y = (/) \/ E. x e. y y = suc x )
29	4, 28	vtoclri 2839	1 |- ( A e. om -> ( A = (/) \/ E. x e. A A = suc x ) )

Syntax hints:   -. wn 3   -> wi 4   \/ wo 709   = wceq 1364   T. wtru 1365   e. wcel 2167   A.wral 2475   E.wrex 2476   (/)c0 3450   suc csuc 4400   omcom 4626

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-in1 615  ax-in2 616  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-13 2169  ax-14 2170  ax-ext 2178  ax-nul 4159  ax-pr 4242  ax-un 4468  ax-bd0 15459  ax-bdim 15460  ax-bdan 15461  ax-bdor 15462  ax-bdn 15463  ax-bdal 15464  ax-bdex 15465  ax-bdeq 15466  ax-bdel 15467  ax-bdsb 15468  ax-bdsep 15530  ax-infvn 15587

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  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-rab 2484  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-sn 3628  df-pr 3629  df-uni 3840  df-int 3875  df-suc 4406  df-iom 4627  df-bdc 15487  df-bj-ind 15573

This theorem is referenced by:  bj-nn0suc  15610