Theorem lmff 15114

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.

Step	Hyp	Ref	Expression
1		lmff.5	. . . . . 6 |- ( ph -> F e. dom ( ~~> t ` J ) )
2		eldm2g 4952	. . . . . . 7 |- ( F e. dom ( ~~> t ` J ) -> ( F e. dom ( ~~> t ` J ) <-> E. y <. F , y >. e. ( ~~> t ` J ) ) )
3	2	ibi 176	. . . . . 6 |- ( F e. dom ( ~~> t ` J ) -> E. y <. F , y >. e. ( ~~> t ` J ) )
4	1, 3	syl 14	. . . . 5 |- ( ph -> E. y <. F , y >. e. ( ~~> t ` J ) )
5		df-br 4110	. . . . . 6 |- ( F ( ~~> t ` J ) y <-> <. F , y >. e. ( ~~> t ` J ) )
6	5	exbii 1654	. . . . 5 |- ( E. y F ( ~~> t ` J ) y <-> E. y <. F , y >. e. ( ~~> t ` J ) )
7	4, 6	sylibr 134	. . . 4 |- ( ph -> E. y F ( ~~> t ` J ) y )
8		lmff.3	. . . . . 6 |- ( ph -> J e. (TopOn ` X ) )
9		lmcl 15110	. . . . . 6 |- ( ( J e. (TopOn ` X ) /\ F ( ~~> t ` J ) y ) -> y e. X )
10	8, 9	sylan 283	. . . . 5 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> y e. X )
11		eleq2 2296	. . . . . . 7 |- ( j = X -> ( y e. j <-> y e. X ) )
12		feq3 5493	. . . . . . . 8 |- ( j = X -> ( ( F |` x ) : x --> j <-> ( F |` x ) : x --> X ) )
13	12	rexbidv 2543	. . . . . . 7 |- ( j = X -> ( E. x e. ran ZZ>= ( F |` x ) : x --> j <-> E. x e. ran ZZ>= ( F |` x ) : x --> X ) )
14	11, 13	imbi12d 234	. . . . . 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 ) ) )
15	8	lmbr 15078	. . . . . . . 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 ) ) ) )
16	15	biimpa 296	. . . . . . 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 ) ) )
17	16	simp3d 1038	. . . . . 6 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> A. j e. J ( y e. j -> E. x e. ran ZZ>= ( F |` x ) : x --> j ) )
18		toponmax 14890	. . . . . . . 8 |- ( J e. (TopOn ` X ) -> X e. J )
19	8, 18	syl 14	. . . . . . 7 |- ( ph -> X e. J )
20	19	adantr 276	. . . . . 6 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> X e. J )
21	14, 17, 20	rspcdva 2926	. . . . 5 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> ( y e. X -> E. x e. ran ZZ>= ( F |` x ) : x --> X ) )
22	10, 21	mpd 13	. . . 4 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> E. x e. ran ZZ>= ( F |` x ) : x --> X )
23	7, 22	exlimddv 1948	. . 3 |- ( ph -> E. x e. ran ZZ>= ( F |` x ) : x --> X )
24		uzf 9856	. . . 4 |- ZZ>= : ZZ --> ~P ZZ
25		ffn 5508	. . . 4 |- ( ZZ>= : ZZ --> ~P ZZ -> ZZ>= Fn ZZ )
26		reseq2 5033	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> ( F |` x ) = ( F |` ( ZZ>= ` j ) ) )
27		id 19	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> x = ( ZZ>= ` j ) )
28	26, 27	feq12d 5498	. . . . 5 |- ( x = ( ZZ>= ` j ) -> ( ( F |` x ) : x --> X <-> ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X ) )
29	28	rexrn 5814	. . . 4 |- ( ZZ>= Fn ZZ -> ( E. x e. ran ZZ>= ( F |` x ) : x --> X <-> E. j e. ZZ ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X ) )
30	24, 25, 29	mp2b 8	. . 3 |- ( E. x e. ran ZZ>= ( F |` x ) : x --> X <-> E. j e. ZZ ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X )
31	23, 30	sylib 122	. 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 )
34	33	rexuz3 11675	. . . 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 ) ) )
35	32, 34	syl 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 ) ) )
36	16	simp1d 1036	. . . . . . 7 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> F e. ( X ^pm CC ) )
37	7, 36	exlimddv 1948	. . . . . 6 |- ( ph -> F e. ( X ^pm CC ) )
38		pmfun 6902	. . . . . 6 |- ( F e. ( X ^pm CC ) -> Fun F )
39	37, 38	syl 14	. . . . 5 |- ( ph -> Fun F )
40		ffvresb 5840	. . . . 5 |- ( Fun F -> ( ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X <-> A. x e. ( ZZ>= ` j ) ( x e. dom F /\ ( F ` x ) e. X ) ) )
41	39, 40	syl 14	. . . 4 |- ( ph -> ( ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X <-> A. x e. ( ZZ>= ` j ) ( x e. dom F /\ ( F ` x ) e. X ) ) )
42	41	rexbidv 2543	. . 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 ) ) )
43	41	rexbidv 2543	. . 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 ) ) )
44	35, 42, 43	3bitr4d 220	. 2 |- ( ph -> ( E. j e. Z ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X <-> E. j e. ZZ ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X ) )
45	31, 44	mpbird 167	1 |- ( ph -> E. j e. Z ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1005   = wceq 1398   E.wex 1541   e. wcel 2203   A.wral 2520   E.wrex 2521   ~Pcpw 3669   <.cop 3692   class class class wbr 4109   dom cdm 4749   ran crn 4750   |` cres 4751   Fun wfun 5346   Fn wfn 5347   -->wf 5348   ` cfv 5352  (class class class)co 6050   ^pm cpm 6883   CCcc 8125   ZZcz 9577   ZZ>=cuz 9853  TopOnctopon 14875   ~~> tclm 15052

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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243

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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-pm 6885  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-top 14863  df-topon 14876  df-lm 15055

This theorem is referenced by: (None)