Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  peano3nninf Unicode version

Theorem peano3nninf 16609
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
StepHypRef Expression
1 fveq1 5638 . . . . . . . . . 10  |-  ( p  =  A  ->  (
p `  U. i )  =  ( A `  U. i ) )
21ifeq2d 3624 . . . . . . . . 9  |-  ( p  =  A  ->  if ( i  =  (/) ,  1o ,  ( p `
 U. i ) )  =  if ( i  =  (/) ,  1o ,  ( A `  U. i ) ) )
32mpteq2dv 4180 . . . . . . . 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 4691 . . . . . . . . 9  |-  om  e.  _V
65mptex 5879 . . . . . . . 8  |-  ( i  e.  om  |->  if ( i  =  (/) ,  1o ,  ( A `  U. i ) ) )  e.  _V
73, 4, 6fvmpt 5723 . . . . . . 7  |-  ( A  e.  ->  ( S `  A
)  =  ( i  e.  om  |->  if ( i  =  (/) ,  1o ,  ( A `  U. i ) ) ) )
8 eqeq1 2238 . . . . . . . . 9  |-  ( i  =  (/)  ->  ( i  =  (/)  <->  (/)  =  (/) ) )
9 unieq 3902 . . . . . . . . . 10  |-  ( i  =  (/)  ->  U. i  =  U. (/) )
109fveq2d 5643 . . . . . . . . 9  |-  ( i  =  (/)  ->  ( A `
 U. i )  =  ( A `  U. (/) ) )
118, 10ifbieq2d 3630 . . . . . . . 8  |-  ( i  =  (/)  ->  if ( i  =  (/) ,  1o ,  ( A `  U. i ) )  =  if ( (/)  =  (/) ,  1o ,  ( A `
 U. (/) ) ) )
1211adantl 277 . . . . . . 7  |-  ( ( A  e.  /\  i  =  (/) )  ->  if ( i  =  (/) ,  1o , 
( A `  U. i ) )  =  if ( (/)  =  (/) ,  1o ,  ( A `
 U. (/) ) ) )
13 peano1 4692 . . . . . . . 8  |-  (/)  e.  om
1413a1i 9 . . . . . . 7  |-  ( A  e.  -> 
(/)  e.  om )
15 eqid 2231 . . . . . . . . . 10  |-  (/)  =  (/)
1615iftruei 3611 . . . . . . . . 9  |-  if (
(/)  =  (/) ,  1o ,  ( A `  U. (/) ) )  =  1o
17 1onn 6687 . . . . . . . . 9  |-  1o  e.  om
1816, 17eqeltri 2304 . . . . . . . 8  |-  if (
(/)  =  (/) ,  1o ,  ( A `  U. (/) ) )  e. 
om
1918a1i 9 . . . . . . 7  |-  ( A  e.  ->  if ( (/)  =  (/) ,  1o ,  ( A `
 U. (/) ) )  e.  om )
207, 12, 14, 19fvmptd 5727 . . . . . 6  |-  ( A  e.  ->  ( ( S `  A ) `  (/) )  =  if ( (/)  =  (/) ,  1o ,  ( A `
 U. (/) ) ) )
2120, 16eqtrdi 2280 . . . . 5  |-  ( A  e.  ->  ( ( S `  A ) `  (/) )  =  1o )
2221adantr 276 . . . 4  |-  ( ( A  e.  /\  ( S `  A )  =  ( x  e.  om  |->  (/) ) )  ->  (
( S `  A
) `  (/) )  =  1o )
23 fveq1 5638 . . . . . 6  |-  ( ( S `  A )  =  ( x  e. 
om  |->  (/) )  ->  (
( S `  A
) `  (/) )  =  ( ( x  e. 
om  |->  (/) ) `  (/) ) )
2423adantl 277 . . . . 5  |-  ( ( A  e.  /\  ( S `  A )  =  ( x  e.  om  |->  (/) ) )  ->  (
( S `  A
) `  (/) )  =  ( ( x  e. 
om  |->  (/) ) `  (/) ) )
2515a1i 9 . . . . . . 7  |-  ( x  =  (/)  ->  (/)  =  (/) )
26 eqid 2231 . . . . . . 7  |-  ( x  e.  om  |->  (/) )  =  ( x  e.  om  |->  (/) )
2725, 26fvmptg 5722 . . . . . 6  |-  ( (
(/)  e.  om  /\  (/)  e.  om )  ->  ( ( x  e.  om  |->  (/) ) `  (/) )  =  (/) )
2813, 13, 27mp2an 426 . . . . 5  |-  ( ( x  e.  om  |->  (/) ) `  (/) )  =  (/)
2924, 28eqtrdi 2280 . . . 4  |-  ( ( A  e.  /\  ( S `  A )  =  ( x  e.  om  |->  (/) ) )  ->  (
( S `  A
) `  (/) )  =  (/) )
3022, 29eqtr3d 2266 . . 3  |-  ( ( A  e.  /\  ( S `  A )  =  ( x  e.  om  |->  (/) ) )  ->  1o  =  (/) )
31 1n0 6599 . . . . 5  |-  1o  =/=  (/)
3231neii 2404 . . . 4  |-  -.  1o  =  (/)
3332a1i 9 . . 3  |-  ( ( A  e.  /\  ( S `  A )  =  ( x  e.  om  |->  (/) ) )  ->  -.  1o  =  (/) )
3430, 33pm2.65da 667 . 2  |-  ( A  e.  ->  -.  ( S `  A )  =  ( x  e.  om  |->  (/) ) )
3534neqned 2409 1  |-  ( A  e.  ->  ( S `  A
)  =/=  ( x  e.  om  |->  (/) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202    =/= wne 2402   (/)c0 3494   ifcif 3605   U.cuni 3893    |-> cmpt 4150   omcom 4688   ` cfv 5326   1oc1o 6574  ℕxnninf 7317
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-1o 6581
This theorem is referenced by:  exmidsbthrlem  16626
  Copyright terms: Public domain W3C validator