Theorem peano3nninf 17050

Description: The successor function on ℕ_∞ is never zero. Half of Lemma 3.4 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 1-Aug-2022.)

Hypothesis

Ref	Expression
peano3nninf.s	|- S = ( p e. ℕ∞ |-> ( i e. om |-> if ( i = (/) , 1o , ( p ` U. i ) ) ) )

Assertion

Ref	Expression
peano3nninf	|- ( A e. ℕ∞ -> ( S ` A ) =/= ( x e. om |-> (/) ) )

Distinct variable groups:   A, i, p   S, i, x   x, p

Allowed substitution hints:   A( x)   S( p)

Proof of Theorem peano3nninf

Step	Hyp	Ref	Expression
1		fveq1 5694	. . . . . . . . . 10 |- ( p = A -> ( p ` U. i ) = ( A ` U. i ) )
2	1	ifeq2d 3659	. . . . . . . . 9 |- ( p = A -> if ( i = (/) , 1o , ( p ` U. i ) ) = if ( i = (/) , 1o , ( A ` U. i ) ) )
3	2	mpteq2dv 4222	. . . . . . . 8 |- ( p = A -> ( i e. om |-> if ( i = (/) , 1o , ( p ` U. i ) ) ) = ( i e. om |-> if ( i = (/) , 1o , ( A ` U. i ) ) ) )
4		peano3nninf.s	. . . . . . . 8 |- S = ( p e. ℕ∞ |-> ( i e. om |-> if ( i = (/) , 1o , ( p ` U. i ) ) ) )
5		omex 4740	. . . . . . . . 9 |- om e. _V
6	5	mptex 5943	. . . . . . . 8 |- ( i e. om |-> if ( i = (/) , 1o , ( A ` U. i ) ) ) e. _V
7	3, 4, 6	fvmpt 5782	. . . . . . 7 |- ( A e. ℕ∞ -> ( S ` A ) = ( i e. om |-> if ( i = (/) , 1o , ( A ` U. i ) ) ) )
8		eqeq1 2245	. . . . . . . . 9 |- ( i = (/) -> ( i = (/) <-> (/) = (/) ) )
9		unieq 3944	. . . . . . . . . 10 |- ( i = (/) -> U. i = U. (/) )
10	9	fveq2d 5699	. . . . . . . . 9 |- ( i = (/) -> ( A ` U. i ) = ( A ` U. (/) ) )
11	8, 10	ifbieq2d 3665	. . . . . . . 8 |- ( i = (/) -> if ( i = (/) , 1o , ( A ` U. i ) ) = if ( (/) = (/) , 1o , ( A ` U. (/) ) ) )
12	11	adantl 277	. . . . . . 7 |- ( ( A e. ℕ∞ /\ i = (/) ) -> if ( i = (/) , 1o , ( A ` U. i ) ) = if ( (/) = (/) , 1o , ( A ` U. (/) ) ) )
13		peano1 4741	. . . . . . . 8 |- (/) e. om
14	13	a1i 9	. . . . . . 7 |- ( A e. ℕ∞ -> (/) e. om )
15		eqid 2238	. . . . . . . . . 10 |- (/) = (/)
16	15	iftruei 3646	. . . . . . . . 9 |- if ( (/) = (/) , 1o , ( A ` U. (/) ) ) = 1o
17		1onn 6793	. . . . . . . . 9 |- 1o e. om
18	16, 17	eqeltri 2311	. . . . . . . 8 |- if ( (/) = (/) , 1o , ( A ` U. (/) ) ) e. om
19	18	a1i 9	. . . . . . 7 |- ( A e. ℕ∞ -> if ( (/) = (/) , 1o , ( A ` U. (/) ) ) e. om )
20	7, 12, 14, 19	fvmptd 5786	. . . . . 6 |- ( A e. ℕ∞ -> ( ( S ` A ) ` (/) ) = if ( (/) = (/) , 1o , ( A ` U. (/) ) ) )
21	20, 16	eqtrdi 2287	. . . . 5 |- ( A e. ℕ∞ -> ( ( S ` A ) ` (/) ) = 1o )
22	21	adantr 276	. . . 4 |- ( ( A e. ℕ∞ /\ ( S ` A ) = ( x e. om |-> (/) ) ) -> ( ( S ` A ) ` (/) ) = 1o )
23		fveq1 5694	. . . . . 6 |- ( ( S ` A ) = ( x e. om |-> (/) ) -> ( ( S ` A ) ` (/) ) = ( ( x e. om |-> (/) ) ` (/) ) )
24	23	adantl 277	. . . . 5 |- ( ( A e. ℕ∞ /\ ( S ` A ) = ( x e. om |-> (/) ) ) -> ( ( S ` A ) ` (/) ) = ( ( x e. om |-> (/) ) ` (/) ) )
25	15	a1i 9	. . . . . . 7 |- ( x = (/) -> (/) = (/) )
26		eqid 2238	. . . . . . 7 |- ( x e. om |-> (/) ) = ( x e. om |-> (/) )
27	25, 26	fvmptg 5781	. . . . . 6 |- ( ( (/) e. om /\ (/) e. om ) -> ( ( x e. om |-> (/) ) ` (/) ) = (/) )
28	13, 13, 27	mp2an 430	. . . . 5 |- ( ( x e. om |-> (/) ) ` (/) ) = (/)
29	24, 28	eqtrdi 2287	. . . 4 |- ( ( A e. ℕ∞ /\ ( S ` A ) = ( x e. om |-> (/) ) ) -> ( ( S ` A ) ` (/) ) = (/) )
30	22, 29	eqtr3d 2273	. . 3 |- ( ( A e. ℕ∞ /\ ( S ` A ) = ( x e. om |-> (/) ) ) -> 1o = (/) )
31		1n0 6705	. . . . 5 |- 1o =/= (/)
32	31	neii 2422	. . . 4 |- -. 1o = (/)
33	32	a1i 9	. . 3 |- ( ( A e. ℕ∞ /\ ( S ` A ) = ( x e. om |-> (/) ) ) -> -. 1o = (/) )
34	30, 33	pm2.65da 671	. 2 |- ( A e. ℕ∞ -> -. ( S ` A ) = ( x e. om |-> (/) ) )
35	34	neqned 2427	1 |- ( A e. ℕ∞ -> ( S ` A ) =/= ( x e. om |-> (/) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   =/= wne 2420   (/)c0 3520   ifcif 3638   U.cuni 3935   |-> cmpt 4192   omcom 4737   ` cfv 5377   1oc1o 6680  ℕ_∞xnninf 7459

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687

This theorem is used by:  exmidsbthrlem  17067