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

Theorem ennnfonelemr 13191
Description: Lemma for ennnfone 13193. 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 2793 . . 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 5672 . . . . . . . . 9  |-  ( j  =  f  ->  ( F `  j )  =  ( F `  f ) )
1110neeq2d 2433 . . . . . . . 8  |-  ( j  =  f  ->  (
( F `  k
)  =/=  ( F `
 j )  <->  ( F `  k )  =/=  ( F `  f )
) )
1211cbvralv 2780 . . . . . . 7  |-  ( A. j  e.  ( 0 ... n ) ( F `  k )  =/=  ( F `  j )  <->  A. f  e.  ( 0 ... n
) ( F `  k )  =/=  ( F `  f )
)
1312rexbii 2551 . . . . . 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 5672 . . . . . . . . 9  |-  ( k  =  e  ->  ( F `  k )  =  ( F `  e ) )
1514neeq1d 2432 . . . . . . . 8  |-  ( k  =  e  ->  (
( F `  k
)  =/=  ( F `
 f )  <->  ( F `  e )  =/=  ( F `  f )
) )
1615ralbidv 2544 . . . . . . 7  |-  ( k  =  e  ->  ( A. f  e.  (
0 ... n ) ( F `  k )  =/=  ( F `  f )  <->  A. f  e.  ( 0 ... n
) ( F `  e )  =/=  ( F `  f )
) )
1716cbvrexv 2781 . . . . . 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 2550 . . . 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 6060 . . . . . . 7  |-  ( n  =  d  ->  (
0 ... n )  =  ( 0 ... d
) )
2120raleqdv 2749 . . . . . 6  |-  ( n  =  d  ->  ( A. f  e.  (
0 ... n ) ( F `  e )  =/=  ( F `  f )  <->  A. f  e.  ( 0 ... d
) ( F `  e )  =/=  ( F `  f )
) )
2221rexbidv 2545 . . . . 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 2780 . . . 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 6059 . . . 4  |-  ( c  =  a  ->  (
c  +  1 )  =  ( a  +  1 ) )
2726cbvmptv 4208 . . 3  |-  ( c  e.  ZZ  |->  ( c  +  1 ) )  =  ( a  e.  ZZ  |->  ( a  +  1 ) )
28 freceq1 6625 . . 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 13190 1  |-  ( ph  ->  A  ~~  NN )
Colors of variables: wff set class
Syntax hints:    -> wi 4  DECID wdc 842    = wceq 1398    =/= wne 2414   A.wral 2522   E.wrex 2523   class class class wbr 4111    |-> cmpt 4173   -onto->wfo 5352   ` cfv 5354  (class class class)co 6052  freccfrec 6623    ~~ cen 6975   0cc0 8129   1c1 8130    + caddc 8132   NNcn 9239   NN0cn0 9498   ZZcz 9579   ...cfz 10345
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-ltadd 8245
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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-er 6769  df-pm 6887  df-en 6978  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-n0 9499  df-z 9580  df-uz 9857  df-fz 10346  df-seqfrec 10814
This theorem is referenced by:  ennnfone  13193
  Copyright terms: Public domain W3C validator