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

Theorem lmff 12421
Description: If  F converges, there is some upper integer set on which  F is a total function. (Contributed by Mario Carneiro, 31-Dec-2013.)
Hypotheses
Ref Expression
lmff.1  |-  Z  =  ( ZZ>= `  M )
lmff.3  |-  ( ph  ->  J  e.  (TopOn `  X ) )
lmff.4  |-  ( ph  ->  M  e.  ZZ )
lmff.5  |-  ( ph  ->  F  e.  dom  ( ~~> t `  J )
)
Assertion
Ref Expression
lmff  |-  ( ph  ->  E. j  e.  Z  ( F  |`  ( ZZ>= `  j ) ) : ( ZZ>= `  j ) --> X )
Distinct variable groups:    j, F    j, J    j, M    ph, j    j, X    j, Z

Proof of Theorem lmff
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lmff.5 . . . . . 6  |-  ( ph  ->  F  e.  dom  ( ~~> t `  J )
)
2 eldm2g 4735 . . . . . . 7  |-  ( F  e.  dom  ( ~~> t `  J )  ->  ( F  e.  dom  ( ~~> t `  J )  <->  E. y <. F ,  y >.  e.  ( ~~> t `  J
) ) )
32ibi 175 . . . . . 6  |-  ( F  e.  dom  ( ~~> t `  J )  ->  E. y <. F ,  y >.  e.  ( ~~> t `  J
) )
41, 3syl 14 . . . . 5  |-  ( ph  ->  E. y <. F , 
y >.  e.  ( ~~> t `  J ) )
5 df-br 3930 . . . . . 6  |-  ( F ( ~~> t `  J
) y  <->  <. F , 
y >.  e.  ( ~~> t `  J ) )
65exbii 1584 . . . . 5  |-  ( E. y  F ( ~~> t `  J ) y  <->  E. y <. F ,  y >.  e.  ( ~~> t `  J
) )
74, 6sylibr 133 . . . 4  |-  ( ph  ->  E. y  F ( ~~> t `  J ) y )
8 lmff.3 . . . . . 6  |-  ( ph  ->  J  e.  (TopOn `  X ) )
9 lmcl 12417 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  F
( ~~> t `  J
) y )  -> 
y  e.  X )
108, 9sylan 281 . . . . 5  |-  ( (
ph  /\  F ( ~~> t `  J )
y )  ->  y  e.  X )
11 eleq2 2203 . . . . . . 7  |-  ( j  =  X  ->  (
y  e.  j  <->  y  e.  X ) )
12 feq3 5257 . . . . . . . 8  |-  ( j  =  X  ->  (
( F  |`  x
) : x --> j  <->  ( F  |`  x ) : x --> X ) )
1312rexbidv 2438 . . . . . . 7  |-  ( j  =  X  ->  ( E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> j  <->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> X ) )
1411, 13imbi12d 233 . . . . . 6  |-  ( j  =  X  ->  (
( y  e.  j  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> j )  <-> 
( y  e.  X  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> X ) ) )
158lmbr 12385 . . . . . . . 8  |-  ( ph  ->  ( F ( ~~> t `  J ) y  <->  ( F  e.  ( X  ^pm  CC )  /\  y  e.  X  /\  A. j  e.  J  ( y  e.  j  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> j ) ) ) )
1615biimpa 294 . . . . . . 7  |-  ( (
ph  /\  F ( ~~> t `  J )
y )  ->  ( F  e.  ( X  ^pm  CC )  /\  y  e.  X  /\  A. j  e.  J  ( y  e.  j  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> j ) ) )
1716simp3d 995 . . . . . 6  |-  ( (
ph  /\  F ( ~~> t `  J )
y )  ->  A. j  e.  J  ( y  e.  j  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> j ) )
18 toponmax 12195 . . . . . . . 8  |-  ( J  e.  (TopOn `  X
)  ->  X  e.  J )
198, 18syl 14 . . . . . . 7  |-  ( ph  ->  X  e.  J )
2019adantr 274 . . . . . 6  |-  ( (
ph  /\  F ( ~~> t `  J )
y )  ->  X  e.  J )
2114, 17, 20rspcdva 2794 . . . . 5  |-  ( (
ph  /\  F ( ~~> t `  J )
y )  ->  (
y  e.  X  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> X ) )
2210, 21mpd 13 . . . 4  |-  ( (
ph  /\  F ( ~~> t `  J )
y )  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> X )
237, 22exlimddv 1870 . . 3  |-  ( ph  ->  E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> X )
24 uzf 9332 . . . 4  |-  ZZ>= : ZZ --> ~P ZZ
25 ffn 5272 . . . 4  |-  ( ZZ>= : ZZ --> ~P ZZ  ->  ZZ>=  Fn  ZZ )
26 reseq2 4814 . . . . . 6  |-  ( x  =  ( ZZ>= `  j
)  ->  ( F  |`  x )  =  ( F  |`  ( ZZ>= `  j ) ) )
27 id 19 . . . . . 6  |-  ( x  =  ( ZZ>= `  j
)  ->  x  =  ( ZZ>= `  j )
)
2826, 27feq12d 5262 . . . . 5  |-  ( x  =  ( ZZ>= `  j
)  ->  ( ( F  |`  x ) : x --> X  <->  ( F  |`  ( ZZ>= `  j )
) : ( ZZ>= `  j ) --> X ) )
2928rexrn 5557 . . . 4  |-  ( ZZ>=  Fn  ZZ  ->  ( E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> X  <->  E. j  e.  ZZ  ( F  |`  ( ZZ>= `  j ) ) : ( ZZ>= `  j ) --> X ) )
3024, 25, 29mp2b 8 . . 3  |-  ( E. x  e.  ran  ZZ>= ( F  |`  x ) : x --> X  <->  E. j  e.  ZZ  ( F  |`  ( ZZ>= `  j )
) : ( ZZ>= `  j ) --> X )
3123, 30sylib 121 . 2  |-  ( ph  ->  E. j  e.  ZZ  ( F  |`  ( ZZ>= `  j ) ) : ( ZZ>= `  j ) --> X )
32 lmff.4 . . . 4  |-  ( ph  ->  M  e.  ZZ )
33 lmff.1 . . . . 5  |-  Z  =  ( ZZ>= `  M )
3433rexuz3 10765 . . . 4  |-  ( M  e.  ZZ  ->  ( E. j  e.  Z  A. x  e.  ( ZZ>=
`  j ) ( x  e.  dom  F  /\  ( F `  x
)  e.  X )  <->  E. j  e.  ZZ  A. x  e.  ( ZZ>= `  j ) ( x  e.  dom  F  /\  ( F `  x )  e.  X ) ) )
3532, 34syl 14 . . 3  |-  ( ph  ->  ( E. j  e.  Z  A. x  e.  ( ZZ>= `  j )
( x  e.  dom  F  /\  ( F `  x )  e.  X
)  <->  E. j  e.  ZZ  A. x  e.  ( ZZ>= `  j ) ( x  e.  dom  F  /\  ( F `  x )  e.  X ) ) )
3616simp1d 993 . . . . . . 7  |-  ( (
ph  /\  F ( ~~> t `  J )
y )  ->  F  e.  ( X  ^pm  CC ) )
377, 36exlimddv 1870 . . . . . 6  |-  ( ph  ->  F  e.  ( X 
^pm  CC ) )
38 pmfun 6562 . . . . . 6  |-  ( F  e.  ( X  ^pm  CC )  ->  Fun  F )
3937, 38syl 14 . . . . 5  |-  ( ph  ->  Fun  F )
40 ffvresb 5583 . . . . 5  |-  ( Fun 
F  ->  ( ( F  |`  ( ZZ>= `  j
) ) : (
ZZ>= `  j ) --> X  <->  A. x  e.  ( ZZ>=
`  j ) ( x  e.  dom  F  /\  ( F `  x
)  e.  X ) ) )
4139, 40syl 14 . . . 4  |-  ( ph  ->  ( ( F  |`  ( ZZ>= `  j )
) : ( ZZ>= `  j ) --> X  <->  A. x  e.  ( ZZ>= `  j )
( x  e.  dom  F  /\  ( F `  x )  e.  X
) ) )
4241rexbidv 2438 . . 3  |-  ( ph  ->  ( E. j  e.  Z  ( F  |`  ( ZZ>= `  j )
) : ( ZZ>= `  j ) --> X  <->  E. j  e.  Z  A. x  e.  ( ZZ>= `  j )
( x  e.  dom  F  /\  ( F `  x )  e.  X
) ) )
4341rexbidv 2438 . . 3  |-  ( ph  ->  ( E. j  e.  ZZ  ( F  |`  ( ZZ>= `  j )
) : ( ZZ>= `  j ) --> X  <->  E. j  e.  ZZ  A. x  e.  ( ZZ>= `  j )
( x  e.  dom  F  /\  ( F `  x )  e.  X
) ) )
4435, 42, 433bitr4d 219 . 2  |-  ( ph  ->  ( E. j  e.  Z  ( F  |`  ( ZZ>= `  j )
) : ( ZZ>= `  j ) --> X  <->  E. j  e.  ZZ  ( F  |`  ( ZZ>= `  j )
) : ( ZZ>= `  j ) --> X ) )
4531, 44mpbird 166 1  |-  ( ph  ->  E. j  e.  Z  ( F  |`  ( ZZ>= `  j ) ) : ( ZZ>= `  j ) --> X )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 962    = wceq 1331   E.wex 1468    e. wcel 1480   A.wral 2416   E.wrex 2417   ~Pcpw 3510   <.cop 3530   class class class wbr 3929   dom cdm 4539   ran crn 4540    |` cres 4541   Fun wfun 5117    Fn wfn 5118   -->wf 5119   ` cfv 5123  (class class class)co 5774    ^pm cpm 6543   CCcc 7621   ZZcz 9057   ZZ>=cuz 9329  TopOnctopon 12180   ~~> tclm 12359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7714  ax-resscn 7715  ax-1cn 7716  ax-1re 7717  ax-icn 7718  ax-addcl 7719  ax-addrcl 7720  ax-mulcl 7721  ax-addcom 7723  ax-addass 7725  ax-distr 7727  ax-i2m1 7728  ax-0lt1 7729  ax-0id 7731  ax-rnegex 7732  ax-cnre 7734  ax-pre-ltirr 7735  ax-pre-ltwlin 7736  ax-pre-lttrn 7737  ax-pre-apti 7738  ax-pre-ltadd 7739
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-pm 6545  df-pnf 7805  df-mnf 7806  df-xr 7807  df-ltxr 7808  df-le 7809  df-sub 7938  df-neg 7939  df-inn 8724  df-n0 8981  df-z 9058  df-uz 9330  df-top 12168  df-topon 12181  df-lm 12362
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator