Theorem limcmpted 15764

Description: Express the limit operator for a function defined by a mapping, via epsilon-delta. (Contributed by Jim Kingdon, 3-Nov-2023.)

Hypotheses

Ref	Expression
limcmpted.a	|- ( ph -> A C_ CC )
limcmpted.b	|- ( ph -> B e. CC )
limcmpted.f	|- ( ( ph /\ z e. A ) -> D e. CC )

Assertion

Ref	Expression
limcmpted	|- ( ph -> ( C e. ( ( z e. A |-> D ) lim CC B ) <-> ( C e. CC /\ A. x e. RR+ E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( D - C ) ) < x ) ) ) )

Distinct variable groups:   x, A, y, z   x, B, y, z   x, C, y, z   x, D, y   ph, x, y, z

Allowed substitution hint:   D( z)

Proof of Theorem limcmpted

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2392	. . . . . 6 |- F/_ w D
2		nfcsb1v 3180	. . . . . 6 |- F/_ z [_ w / z ]_ D
3		csbeq1a 3156	. . . . . 6 |- ( z = w -> D = [_ w / z ]_ D )
4	1, 2, 3	cbvmpt 4226	. . . . 5 |- ( z e. A |-> D ) = ( w e. A |-> [_ w / z ]_ D )
5	4	a1i 9	. . . 4 |- ( ph -> ( z e. A |-> D ) = ( w e. A |-> [_ w / z ]_ D ) )
6	5	oveq1d 6100	. . 3 |- ( ph -> ( ( z e. A |-> D ) lim CC B ) = ( ( w e. A |-> [_ w / z ]_ D ) lim CC B ) )
7	6	eleq2d 2308	. 2 |- ( ph -> ( C e. ( ( z e. A |-> D ) lim CC B ) <-> C e. ( ( w e. A |-> [_ w / z ]_ D ) lim CC B ) ) )
8		limcmpted.f	. . . . 5 |- ( ( ph /\ z e. A ) -> D e. CC )
9	8	fmpttd 5863	. . . 4 |- ( ph -> ( z e. A |-> D ) : A --> CC )
10	4	feq1i 5526	. . . 4 |- ( ( z e. A |-> D ) : A --> CC <-> ( w e. A |-> [_ w / z ]_ D ) : A --> CC )
11	9, 10	sylib 122	. . 3 |- ( ph -> ( w e. A |-> [_ w / z ]_ D ) : A --> CC )
12		limcmpted.a	. . 3 |- ( ph -> A C_ CC )
13		limcmpted.b	. . 3 |- ( ph -> B e. CC )
14		nfcv 2392	. . . 4 |- F/_ z A
15	14, 2	nfmpt 4223	. . 3 |- F/_ z ( w e. A |-> [_ w / z ]_ D )
16	11, 12, 13, 15	ellimc3apf 15761	. 2 |- ( ph -> ( C e. ( ( w e. A |-> [_ w / z ]_ D ) lim CC B ) <-> ( C e. CC /\ A. x e. RR+ E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) < x ) ) ) )
17		eqid 2238	. . . . . . . . . 10 |- ( w e. A |-> [_ w / z ]_ D ) = ( w e. A |-> [_ w / z ]_ D )
18		eqcom 2240	. . . . . . . . . . 11 |- ( z = w <-> w = z )
19		eqcom 2240	. . . . . . . . . . 11 |- ( D = [_ w / z ]_ D <-> [_ w / z ]_ D = D )
20	3, 18, 19	3imtr3i 200	. . . . . . . . . 10 |- ( w = z -> [_ w / z ]_ D = D )
21		simpr 110	. . . . . . . . . 10 |- ( ( ph /\ z e. A ) -> z e. A )
22	17, 20, 21, 8	fvmptd3 5799	. . . . . . . . 9 |- ( ( ph /\ z e. A ) -> ( ( w e. A |-> [_ w / z ]_ D ) ` z ) = D )
23	22	fvoveq1d 6107	. . . . . . . 8 |- ( ( ph /\ z e. A ) -> ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) = ( abs ` ( D - C ) ) )
24	23	breq1d 4140	. . . . . . 7 |- ( ( ph /\ z e. A ) -> ( ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) < x <-> ( abs ` ( D - C ) ) < x ) )
25	24	imbi2d 230	. . . . . 6 |- ( ( ph /\ z e. A ) -> ( ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) < x ) <-> ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( D - C ) ) < x ) ) )
26	25	ralbidva 2546	. . . . 5 |- ( ph -> ( A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) < x ) <-> A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( D - C ) ) < x ) ) )
27	26	rexbidv 2551	. . . 4 |- ( ph -> ( E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) < x ) <-> E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( D - C ) ) < x ) ) )
28	27	ralbidv 2550	. . 3 |- ( ph -> ( A. x e. RR+ E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) < x ) <-> A. x e. RR+ E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( D - C ) ) < x ) ) )
29	28	anbi2d 468	. 2 |- ( ph -> ( ( C e. CC /\ A. x e. RR+ E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( ( ( w e. A |-> [_ w / z ]_ D ) ` z ) - C ) ) < x ) ) <-> ( C e. CC /\ A. x e. RR+ E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( D - C ) ) < x ) ) ) )
30	7, 16, 29	3bitrd 214	1 |- ( ph -> ( C e. ( ( z e. A |-> D ) lim CC B ) <-> ( C e. CC /\ A. x e. RR+ E. y e. RR+ A. z e. A ( ( z # B /\ ( abs ` ( z - B ) ) < y ) -> ( abs ` ( D - C ) ) < x ) ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   [_csb 3147   C_ wss 3220   class class class wbr 4130   |-> cmpt 4192   -->wf 5373   ` cfv 5377  (class class class)co 6085   CCcc 8177   < clt 8360   - cmin 8497   # cap 8909   RR+crp 10054   abscabs 11763   lim CC climc 15755

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pm 6925  df-limced 15757

This theorem is used by:  limccnp2cntop  15778  limccoap  15779