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

Theorem peano3nninf 16716
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 5647 . . . . . . . . . 10  |-  ( p  =  A  ->  (
p `  U. i )  =  ( A `  U. i ) )
21ifeq2d 3628 . . . . . . . . 9  |-  ( p  =  A  ->  if ( i  =  (/) ,  1o ,  ( p `
 U. i ) )  =  if ( i  =  (/) ,  1o ,  ( A `  U. i ) ) )
32mpteq2dv 4185 . . . . . . . 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 4697 . . . . . . . . 9  |-  om  e.  _V
65mptex 5890 . . . . . . . 8  |-  ( i  e.  om  |->  if ( i  =  (/) ,  1o ,  ( A `  U. i ) ) )  e.  _V
73, 4, 6fvmpt 5732 . . . . . . 7  |-  ( A  e.  ->  ( S `  A
)  =  ( i  e.  om  |->  if ( i  =  (/) ,  1o ,  ( A `  U. i ) ) ) )
8 eqeq1 2238 . . . . . . . . 9  |-  ( i  =  (/)  ->  ( i  =  (/)  <->  (/)  =  (/) ) )
9 unieq 3907 . . . . . . . . . 10  |-  ( i  =  (/)  ->  U. i  =  U. (/) )
109fveq2d 5652 . . . . . . . . 9  |-  ( i  =  (/)  ->  ( A `
 U. i )  =  ( A `  U. (/) ) )
118, 10ifbieq2d 3634 . . . . . . . 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 4698 . . . . . . . 8  |-  (/)  e.  om
1413a1i 9 . . . . . . 7  |-  ( A  e.  -> 
(/)  e.  om )
15 eqid 2231 . . . . . . . . . 10  |-  (/)  =  (/)
1615iftruei 3615 . . . . . . . . 9  |-  if (
(/)  =  (/) ,  1o ,  ( A `  U. (/) ) )  =  1o
17 1onn 6731 . . . . . . . . 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 5736 . . . . . 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 5647 . . . . . 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 5731 . . . . . 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 6643 . . . . 5  |-  1o  =/=  (/)
3231neii 2405 . . . 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 2410 1  |-  ( A  e.  ->  ( S `  A
)  =/=  ( x  e.  om  |->  (/) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202    =/= wne 2403   (/)c0 3496   ifcif 3607   U.cuni 3898    |-> cmpt 4155   omcom 4694   ` cfv 5333   1oc1o 6618  ℕxnninf 7361
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1o 6625
This theorem is referenced by:  exmidsbthrlem  16733
  Copyright terms: Public domain W3C validator