Theorem nnpredcl 4624

Description: The predecessor of a natural number is a natural number. This theorem is most interesting when the natural number is a successor (as seen in theorems like onsucuni2 4565) but also holds when it is (/) by uni0 3838. (Contributed by Jim Kingdon, 31-Jul-2022.)

Assertion

Ref	Expression
nnpredcl	|- ( A e. om -> U. A e. om )

Proof of Theorem nnpredcl

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unieq 3820	. . . 4 |- ( A = (/) -> U. A = U. (/) )
2		uni0 3838	. . . . 5 |- U. (/) = (/)
3		peano1 4595	. . . . 5 |- (/) e. om
4	2, 3	eqeltri 2250	. . . 4 |- U. (/) e. om
5	1, 4	eqeltrdi 2268	. . 3 |- ( A = (/) -> U. A e. om )
6	5	adantl 277	. 2 |- ( ( A e. om /\ A = (/) ) -> U. A e. om )
7		nnon 4611	. . . . . 6 |- ( A e. om -> A e. On )
8	7	adantr 276	. . . . 5 |- ( ( A e. om /\ E. x e. om A = suc x ) -> A e. On )
9		simpr 110	. . . . 5 |- ( ( A e. om /\ E. x e. om A = suc x ) -> E. x e. om A = suc x )
10		onsucuni2 4565	. . . . . . 7 |- ( ( A e. On /\ A = suc x ) -> suc U. A = A )
11	10	ex 115	. . . . . 6 |- ( A e. On -> ( A = suc x -> suc U. A = A ) )
12	11	rexlimdvw 2598	. . . . 5 |- ( A e. On -> ( E. x e. om A = suc x -> suc U. A = A ) )
13	8, 9, 12	sylc 62	. . . 4 |- ( ( A e. om /\ E. x e. om A = suc x ) -> suc U. A = A )
14		simpl 109	. . . 4 |- ( ( A e. om /\ E. x e. om A = suc x ) -> A e. om )
15	13, 14	eqeltrd 2254	. . 3 |- ( ( A e. om /\ E. x e. om A = suc x ) -> suc U. A e. om )
16		peano2b 4616	. . 3 |- ( U. A e. om <-> suc U. A e. om )
17	15, 16	sylibr 134	. 2 |- ( ( A e. om /\ E. x e. om A = suc x ) -> U. A e. om )
18		nn0suc 4605	. 2 |- ( A e. om -> ( A = (/) \/ E. x e. om A = suc x ) )
19	6, 17, 18	mpjaodan 798	1 |- ( A e. om -> U. A e. om )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1353   e. wcel 2148   E.wrex 2456   (/)c0 3424   U.cuni 3811   Oncon0 4365   suc csuc 4367   omcom 4591

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-iinf 4589

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-uni 3812  df-int 3847  df-tr 4104  df-iord 4368  df-on 4370  df-suc 4373  df-iom 4592

This theorem is referenced by:  nnpredlt  4625  omp1eomlem  7095  ctmlemr  7109  nnnninfeq2  7129  nninfisollemne  7131  nninfisol  7133  nnsf  14839  peano4nninf  14840