Theorem negcncf 14841

Description: The negative function is continuous. (Contributed by Mario Carneiro, 30-Dec-2016.)

Hypothesis

Ref	Expression
negcncf.1	|- F = ( x e. A |-> -u x )

Assertion

Ref	Expression
negcncf	|- ( A C_ CC -> F e. ( A -cn-> CC ) )

Distinct variable group:   x, A

Allowed substitution hint:   F( x)

Proof of Theorem negcncf

Dummy variables e u v are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 19	. 2 |- ( A C_ CC -> A C_ CC )
2		ssidd 3204	. 2 |- ( A C_ CC -> CC C_ CC )
3		ssel2 3178	. . . . 5 |- ( ( A C_ CC /\ x e. A ) -> x e. CC )
4	3	negcld 8324	. . . 4 |- ( ( A C_ CC /\ x e. A ) -> -u x e. CC )
5		negcncf.1	. . . 4 |- F = ( x e. A |-> -u x )
6	4, 5	fmptd 5716	. . 3 |- ( A C_ CC -> F : A --> CC )
7		simpr 110	. . . 4 |- ( ( u e. A /\ e e. RR+ ) -> e e. RR+ )
8	7	a1i 9	. . 3 |- ( A C_ CC -> ( ( u e. A /\ e e. RR+ ) -> e e. RR+ ) )
9		negeq 8219	. . . . . . . . . 10 |- ( x = u -> -u x = -u u )
10		simprll 537	. . . . . . . . . 10 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> u e. A )
11		simpl 109	. . . . . . . . . . . 12 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> A C_ CC )
12	11, 10	sseldd 3184	. . . . . . . . . . 11 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> u e. CC )
13	12	negcld 8324	. . . . . . . . . 10 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> -u u e. CC )
14	5, 9, 10, 13	fvmptd3 5655	. . . . . . . . 9 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( F ` u ) = -u u )
15		negeq 8219	. . . . . . . . . 10 |- ( x = v -> -u x = -u v )
16		simprlr 538	. . . . . . . . . 10 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> v e. A )
17	11, 16	sseldd 3184	. . . . . . . . . . 11 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> v e. CC )
18	17	negcld 8324	. . . . . . . . . 10 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> -u v e. CC )
19	5, 15, 16, 18	fvmptd3 5655	. . . . . . . . 9 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( F ` v ) = -u v )
20	14, 19	oveq12d 5940	. . . . . . . 8 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( ( F ` u ) - ( F ` v ) ) = ( -u u - -u v ) )
21	12, 17	neg2subd 8354	. . . . . . . 8 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( -u u - -u v ) = ( v - u ) )
22	20, 21	eqtrd 2229	. . . . . . 7 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( ( F ` u ) - ( F ` v ) ) = ( v - u ) )
23	22	fveq2d 5562	. . . . . 6 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( abs ` ( ( F ` u ) - ( F ` v ) ) ) = ( abs ` ( v - u ) ) )
24	17, 12	abssubd 11358	. . . . . 6 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( abs ` ( v - u ) ) = ( abs ` ( u - v ) ) )
25	23, 24	eqtrd 2229	. . . . 5 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( abs ` ( ( F ` u ) - ( F ` v ) ) ) = ( abs ` ( u - v ) ) )
26	25	breq1d 4043	. . . 4 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( ( abs ` ( ( F ` u ) - ( F ` v ) ) ) < e <-> ( abs ` ( u - v ) ) < e ) )
27	26	exbiri 382	. . 3 |- ( A C_ CC -> ( ( ( u e. A /\ v e. A ) /\ e e. RR+ ) -> ( ( abs ` ( u - v ) ) < e -> ( abs ` ( ( F ` u ) - ( F ` v ) ) ) < e ) ) )
28	6, 8, 27	elcncf1di 14815	. 2 |- ( A C_ CC -> ( ( A C_ CC /\ CC C_ CC ) -> F e. ( A -cn-> CC ) ) )
29	1, 2, 28	mp2and 433	1 |- ( A C_ CC -> F e. ( A -cn-> CC ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2167   C_ wss 3157   class class class wbr 4033   |-> cmpt 4094   ` cfv 5258  (class class class)co 5922   CCcc 7877   < clt 8061   - cmin 8197   -ucneg 8198   RR+crp 9728   abscabs 11162   -cn->ccncf 14806

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-coll 4148  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-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997

This theorem depends on definitions:  df-bi 117  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-rmo 2483  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-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-po 4331  df-iso 4332  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-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-map 6709  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-2 9049  df-cj 11007  df-re 11008  df-im 11009  df-rsqrt 11163  df-abs 11164  df-cncf 14807

This theorem is referenced by:  negfcncf  14842