Theorem lmff 14485

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 4862	. . . . . . 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 4034	. . . . . 6 |- ( F ( ~~> t ` J ) y <-> <. F , y >. e. ( ~~> t ` J ) )
6	5	exbii 1619	. . . . 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 14481	. . . . . 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 2260	. . . . . . 7 |- ( j = X -> ( y e. j <-> y e. X ) )
12		feq3 5392	. . . . . . . 8 |- ( j = X -> ( ( F |` x ) : x --> j <-> ( F |` x ) : x --> X ) )
13	12	rexbidv 2498	. . . . . . 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 14449	. . . . . . . 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 1013	. . . . . 6 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> A. j e. J ( y e. j -> E. x e. ran ZZ>= ( F |` x ) : x --> j ) )
18		toponmax 14261	. . . . . . . 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 2873	. . . . 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 1913	. . 3 |- ( ph -> E. x e. ran ZZ>= ( F |` x ) : x --> X )
24		uzf 9604	. . . 4 |- ZZ>= : ZZ --> ~P ZZ
25		ffn 5407	. . . 4 |- ( ZZ>= : ZZ --> ~P ZZ -> ZZ>= Fn ZZ )
26		reseq2 4941	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> ( F |` x ) = ( F |` ( ZZ>= ` j ) ) )
27		id 19	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> x = ( ZZ>= ` j ) )
28	26, 27	feq12d 5397	. . . . 5 |- ( x = ( ZZ>= ` j ) -> ( ( F |` x ) : x --> X <-> ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X ) )
29	28	rexrn 5699	. . . 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 11155	. . . 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 1011	. . . . . . 7 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> F e. ( X ^pm CC ) )
37	7, 36	exlimddv 1913	. . . . . 6 |- ( ph -> F e. ( X ^pm CC ) )
38		pmfun 6727	. . . . . 6 |- ( F e. ( X ^pm CC ) -> Fun F )
39	37, 38	syl 14	. . . . 5 |- ( ph -> Fun F )
40		ffvresb 5725	. . . . 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 2498	. . 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 2498	. . 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 980   = wceq 1364   E.wex 1506   e. wcel 2167   A.wral 2475   E.wrex 2476   ~Pcpw 3605   <.cop 3625   class class class wbr 4033   dom cdm 4663   ran crn 4664   |` cres 4665   Fun wfun 5252   Fn wfn 5253   -->wf 5254   ` cfv 5258  (class class class)co 5922   ^pm cpm 6708   CCcc 7877   ZZcz 9326   ZZ>=cuz 9601  TopOnctopon 14246   ~~> tclm 14423

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-pm 6710  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-inn 8991  df-n0 9250  df-z 9327  df-uz 9602  df-top 14234  df-topon 14247  df-lm 14426

This theorem is referenced by: (None)