Theorem lmff 14796

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 4883	. . . . . . 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 4052	. . . . . 6 |- ( F ( ~~> t ` J ) y <-> <. F , y >. e. ( ~~> t ` J ) )
6	5	exbii 1629	. . . . 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 14792	. . . . . 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 2270	. . . . . . 7 |- ( j = X -> ( y e. j <-> y e. X ) )
12		feq3 5420	. . . . . . . 8 |- ( j = X -> ( ( F |` x ) : x --> j <-> ( F |` x ) : x --> X ) )
13	12	rexbidv 2508	. . . . . . 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 14760	. . . . . . . 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 1014	. . . . . 6 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> A. j e. J ( y e. j -> E. x e. ran ZZ>= ( F |` x ) : x --> j ) )
18		toponmax 14572	. . . . . . . 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 2886	. . . . 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 1923	. . 3 |- ( ph -> E. x e. ran ZZ>= ( F |` x ) : x --> X )
24		uzf 9671	. . . 4 |- ZZ>= : ZZ --> ~P ZZ
25		ffn 5435	. . . 4 |- ( ZZ>= : ZZ --> ~P ZZ -> ZZ>= Fn ZZ )
26		reseq2 4963	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> ( F |` x ) = ( F |` ( ZZ>= ` j ) ) )
27		id 19	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> x = ( ZZ>= ` j ) )
28	26, 27	feq12d 5425	. . . . 5 |- ( x = ( ZZ>= ` j ) -> ( ( F |` x ) : x --> X <-> ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X ) )
29	28	rexrn 5730	. . . 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 11376	. . . 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 1012	. . . . . . 7 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> F e. ( X ^pm CC ) )
37	7, 36	exlimddv 1923	. . . . . 6 |- ( ph -> F e. ( X ^pm CC ) )
38		pmfun 6768	. . . . . 6 |- ( F e. ( X ^pm CC ) -> Fun F )
39	37, 38	syl 14	. . . . 5 |- ( ph -> Fun F )
40		ffvresb 5756	. . . . 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 2508	. . 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 2508	. . 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 981   = wceq 1373   E.wex 1516   e. wcel 2177   A.wral 2485   E.wrex 2486   ~Pcpw 3621   <.cop 3641   class class class wbr 4051   dom cdm 4683   ran crn 4684   |` cres 4685   Fun wfun 5274   Fn wfn 5275   -->wf 5276   ` cfv 5280  (class class class)co 5957   ^pm cpm 6749   CCcc 7943   ZZcz 9392   ZZ>=cuz 9668  TopOnctopon 14557   ~~> tclm 14734

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-cnex 8036  ax-resscn 8037  ax-1cn 8038  ax-1re 8039  ax-icn 8040  ax-addcl 8041  ax-addrcl 8042  ax-mulcl 8043  ax-addcom 8045  ax-addass 8047  ax-distr 8049  ax-i2m1 8050  ax-0lt1 8051  ax-0id 8053  ax-rnegex 8054  ax-cnre 8056  ax-pre-ltirr 8057  ax-pre-ltwlin 8058  ax-pre-lttrn 8059  ax-pre-apti 8060  ax-pre-ltadd 8061

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-if 3576  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-iun 3935  df-br 4052  df-opab 4114  df-mpt 4115  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-fv 5288  df-riota 5912  df-ov 5960  df-oprab 5961  df-mpo 5962  df-1st 6239  df-2nd 6240  df-pm 6751  df-pnf 8129  df-mnf 8130  df-xr 8131  df-ltxr 8132  df-le 8133  df-sub 8265  df-neg 8266  df-inn 9057  df-n0 9316  df-z 9393  df-uz 9669  df-top 14545  df-topon 14558  df-lm 14737

This theorem is referenced by: (None)