ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ennnfonelemr Unicode version

Theorem ennnfonelemr 13124
Description: Lemma for ennnfone 13126. The interesting direction, expressed in deduction form. (Contributed by Jim Kingdon, 27-Oct-2022.)
Hypotheses
Ref Expression
ennnfonelemr.dceq  |-  ( ph  ->  A. x  e.  A  A. y  e.  A DECID  x  =  y )
ennnfonelemr.f  |-  ( ph  ->  F : NN0 -onto-> A
)
ennnfonelemr.n  |-  ( ph  ->  A. n  e.  NN0  E. k  e.  NN0  A. j  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  j )
)
Assertion
Ref Expression
ennnfonelemr  |-  ( ph  ->  A  ~~  NN )
Distinct variable groups:    y, A, x   
n, F, j, k
Allowed substitution hints:    ph( x, y, j, k, n)    A( j,
k, n)    F( x, y)

Proof of Theorem ennnfonelemr
Dummy variables  a  b  d  e  f  c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ennnfonelemr.dceq . . 3  |-  ( ph  ->  A. x  e.  A  A. y  e.  A DECID  x  =  y )
2 equequ1 1760 . . . . 5  |-  ( x  =  a  ->  (
x  =  y  <->  a  =  y ) )
32dcbid 846 . . . 4  |-  ( x  =  a  ->  (DECID  x  =  y  <-> DECID  a  =  y )
)
4 equequ2 1761 . . . . 5  |-  ( y  =  b  ->  (
a  =  y  <->  a  =  b ) )
54dcbid 846 . . . 4  |-  ( y  =  b  ->  (DECID  a  =  y  <-> DECID  a  =  b )
)
63, 5cbvral2v 2781 . . 3  |-  ( A. x  e.  A  A. y  e.  A DECID  x  =  y 
<-> 
A. a  e.  A  A. b  e.  A DECID  a  =  b )
71, 6sylib 122 . 2  |-  ( ph  ->  A. a  e.  A  A. b  e.  A DECID  a  =  b )
8 ennnfonelemr.f . 2  |-  ( ph  ->  F : NN0 -onto-> A
)
9 ennnfonelemr.n . . 3  |-  ( ph  ->  A. n  e.  NN0  E. k  e.  NN0  A. j  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  j )
)
10 fveq2 5648 . . . . . . . . 9  |-  ( j  =  f  ->  ( F `  j )  =  ( F `  f ) )
1110neeq2d 2422 . . . . . . . 8  |-  ( j  =  f  ->  (
( F `  k
)  =/=  ( F `
 j )  <->  ( F `  k )  =/=  ( F `  f )
) )
1211cbvralv 2768 . . . . . . 7  |-  ( A. j  e.  ( 0 ... n ) ( F `  k )  =/=  ( F `  j )  <->  A. f  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  f )
)
1312rexbii 2540 . . . . . 6  |-  ( E. k  e.  NN0  A. j  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  j )  <->  E. k  e.  NN0  A. f  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  f )
)
14 fveq2 5648 . . . . . . . . 9  |-  ( k  =  e  ->  ( F `  k )  =  ( F `  e ) )
1514neeq1d 2421 . . . . . . . 8  |-  ( k  =  e  ->  (
( F `  k
)  =/=  ( F `
 f )  <->  ( F `  e )  =/=  ( F `  f )
) )
1615ralbidv 2533 . . . . . . 7  |-  ( k  =  e  ->  ( A. f  e.  (
0 ... n ) ( F `  k )  =/=  ( F `  f )  <->  A. f  e.  ( 0 ... n
) ( F `  e )  =/=  ( F `  f )
) )
1716cbvrexv 2769 . . . . . 6  |-  ( E. k  e.  NN0  A. f  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  f )  <->  E. e  e.  NN0  A. f  e.  ( 0 ... n
) ( F `  e )  =/=  ( F `  f )
)
1813, 17bitri 184 . . . . 5  |-  ( E. k  e.  NN0  A. j  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  j )  <->  E. e  e.  NN0  A. f  e.  ( 0 ... n
) ( F `  e )  =/=  ( F `  f )
)
1918ralbii 2539 . . . 4  |-  ( A. n  e.  NN0  E. k  e.  NN0  A. j  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  j )  <->  A. n  e.  NN0  E. e  e.  NN0  A. f  e.  ( 0 ... n
) ( F `  e )  =/=  ( F `  f )
)
20 oveq2 6036 . . . . . . 7  |-  ( n  =  d  ->  (
0 ... n )  =  ( 0 ... d
) )
2120raleqdv 2737 . . . . . 6  |-  ( n  =  d  ->  ( A. f  e.  (
0 ... n ) ( F `  e )  =/=  ( F `  f )  <->  A. f  e.  ( 0 ... d
) ( F `  e )  =/=  ( F `  f )
) )
2221rexbidv 2534 . . . . 5  |-  ( n  =  d  ->  ( E. e  e.  NN0  A. f  e.  ( 0 ... n ) ( F `  e )  =/=  ( F `  f )  <->  E. e  e.  NN0  A. f  e.  ( 0 ... d
) ( F `  e )  =/=  ( F `  f )
) )
2322cbvralv 2768 . . . 4  |-  ( A. n  e.  NN0  E. e  e.  NN0  A. f  e.  ( 0 ... n
) ( F `  e )  =/=  ( F `  f )  <->  A. d  e.  NN0  E. e  e.  NN0  A. f  e.  ( 0 ... d
) ( F `  e )  =/=  ( F `  f )
)
2419, 23bitri 184 . . 3  |-  ( A. n  e.  NN0  E. k  e.  NN0  A. j  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  j )  <->  A. d  e.  NN0  E. e  e.  NN0  A. f  e.  ( 0 ... d
) ( F `  e )  =/=  ( F `  f )
)
259, 24sylib 122 . 2  |-  ( ph  ->  A. d  e.  NN0  E. e  e.  NN0  A. f  e.  ( 0 ... d
) ( F `  e )  =/=  ( F `  f )
)
26 oveq1 6035 . . . 4  |-  ( c  =  a  ->  (
c  +  1 )  =  ( a  +  1 ) )
2726cbvmptv 4190 . . 3  |-  ( c  e.  ZZ  |->  ( c  +  1 ) )  =  ( a  e.  ZZ  |->  ( a  +  1 ) )
28 freceq1 6601 . . 3  |-  ( ( c  e.  ZZ  |->  ( c  +  1 ) )  =  ( a  e.  ZZ  |->  ( a  +  1 ) )  -> frec ( ( c  e.  ZZ  |->  ( c  +  1 ) ) ,  0 )  = frec ( ( a  e.  ZZ  |->  ( a  +  1 ) ) ,  0 ) )
2927, 28ax-mp 5 . 2  |- frec ( ( c  e.  ZZ  |->  ( c  +  1 ) ) ,  0 )  = frec ( ( a  e.  ZZ  |->  ( a  +  1 ) ) ,  0 )
307, 8, 25, 29ennnfonelemnn0 13123 1  |-  ( ph  ->  A  ~~  NN )
Colors of variables: wff set class
Syntax hints:    -> wi 4  DECID wdc 842    = wceq 1398    =/= wne 2403   A.wral 2511   E.wrex 2512   class class class wbr 4093    |-> cmpt 4155   -onto->wfo 5331   ` cfv 5333  (class class class)co 6028  freccfrec 6599    ~~ cen 6950   0cc0 8092   1c1 8093    + caddc 8095   NNcn 9202   NN0cn0 9461   ZZcz 9540   ...cfz 10305
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-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  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-nel 2499  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-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  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-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-er 6745  df-pm 6863  df-en 6953  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-inn 9203  df-n0 9462  df-z 9541  df-uz 9817  df-fz 10306  df-seqfrec 10773
This theorem is referenced by:  ennnfone  13126
  Copyright terms: Public domain W3C validator