Theorem lmff 14972

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 4927	. . . . . . 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 4089	. . . . . 6 |- ( F ( ~~> t ` J ) y <-> <. F , y >. e. ( ~~> t ` J ) )
6	5	exbii 1653	. . . . 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 14968	. . . . . 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 2295	. . . . . . 7 |- ( j = X -> ( y e. j <-> y e. X ) )
12		feq3 5467	. . . . . . . 8 |- ( j = X -> ( ( F |` x ) : x --> j <-> ( F |` x ) : x --> X ) )
13	12	rexbidv 2533	. . . . . . 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 14936	. . . . . . . 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 1037	. . . . . 6 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> A. j e. J ( y e. j -> E. x e. ran ZZ>= ( F |` x ) : x --> j ) )
18		toponmax 14748	. . . . . . . 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 2915	. . . . 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 1947	. . 3 |- ( ph -> E. x e. ran ZZ>= ( F |` x ) : x --> X )
24		uzf 9757	. . . 4 |- ZZ>= : ZZ --> ~P ZZ
25		ffn 5482	. . . 4 |- ( ZZ>= : ZZ --> ~P ZZ -> ZZ>= Fn ZZ )
26		reseq2 5008	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> ( F |` x ) = ( F |` ( ZZ>= ` j ) ) )
27		id 19	. . . . . 6 |- ( x = ( ZZ>= ` j ) -> x = ( ZZ>= ` j ) )
28	26, 27	feq12d 5472	. . . . 5 |- ( x = ( ZZ>= ` j ) -> ( ( F |` x ) : x --> X <-> ( F |` ( ZZ>= ` j ) ) : ( ZZ>= ` j ) --> X ) )
29	28	rexrn 5784	. . . 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 11550	. . . 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 1035	. . . . . . 7 |- ( ( ph /\ F ( ~~> t ` J ) y ) -> F e. ( X ^pm CC ) )
37	7, 36	exlimddv 1947	. . . . . 6 |- ( ph -> F e. ( X ^pm CC ) )
38		pmfun 6836	. . . . . 6 |- ( F e. ( X ^pm CC ) -> Fun F )
39	37, 38	syl 14	. . . . 5 |- ( ph -> Fun F )
40		ffvresb 5810	. . . . 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 2533	. . 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 2533	. . 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 1004   = wceq 1397   E.wex 1540   e. wcel 2202   A.wral 2510   E.wrex 2511   ~Pcpw 3652   <.cop 3672   class class class wbr 4088   dom cdm 4725   ran crn 4726   |` cres 4727   Fun wfun 5320   Fn wfn 5321   -->wf 5322   ` cfv 5326  (class class class)co 6017   ^pm cpm 6817   CCcc 8029   ZZcz 9478   ZZ>=cuz 9754  TopOnctopon 14733   ~~> tclm 14910

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-pm 6819  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-top 14721  df-topon 14734  df-lm 14913

This theorem is referenced by: (None)