Theorem negcncf 15328

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 3248	. 2 |- ( A C_ CC -> CC C_ CC )
3		ssel2 3222	. . . . 5 |- ( ( A C_ CC /\ x e. A ) -> x e. CC )
4	3	negcld 8476	. . . 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 5801	. . 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 8371	. . . . . . . . . 10 |- ( x = u -> -u x = -u u )
10		simprll 539	. . . . . . . . . 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 3228	. . . . . . . . . . 11 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> u e. CC )
13	12	negcld 8476	. . . . . . . . . 10 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> -u u e. CC )
14	5, 9, 10, 13	fvmptd3 5740	. . . . . . . . 9 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( F ` u ) = -u u )
15		negeq 8371	. . . . . . . . . 10 |- ( x = v -> -u x = -u v )
16		simprlr 540	. . . . . . . . . 10 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> v e. A )
17	11, 16	sseldd 3228	. . . . . . . . . . 11 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> v e. CC )
18	17	negcld 8476	. . . . . . . . . 10 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> -u v e. CC )
19	5, 15, 16, 18	fvmptd3 5740	. . . . . . . . 9 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( F ` v ) = -u v )
20	14, 19	oveq12d 6035	. . . . . . . 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 8506	. . . . . . . 8 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( -u u - -u v ) = ( v - u ) )
22	20, 21	eqtrd 2264	. . . . . . 7 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( ( F ` u ) - ( F ` v ) ) = ( v - u ) )
23	22	fveq2d 5643	. . . . . 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 11753	. . . . . 6 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( abs ` ( v - u ) ) = ( abs ` ( u - v ) ) )
25	23, 24	eqtrd 2264	. . . . 5 |- ( ( A C_ CC /\ ( ( u e. A /\ v e. A ) /\ e e. RR+ ) ) -> ( abs ` ( ( F ` u ) - ( F ` v ) ) ) = ( abs ` ( u - v ) ) )
26	25	breq1d 4098	. . . 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 15302	. 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 1397   e. wcel 2202   C_ wss 3200   class class class wbr 4088   |-> cmpt 4150   ` cfv 5326  (class class class)co 6017   CCcc 8029   < clt 8213   - cmin 8349   -ucneg 8350   RR+crp 9887   abscabs 11557   -cn->ccncf 15293

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-coll 4204  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-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149

This theorem depends on definitions:  df-bi 117  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-rmo 2518  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-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-po 4393  df-iso 4394  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-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-map 6818  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-2 9201  df-cj 11402  df-re 11403  df-im 11404  df-rsqrt 11558  df-abs 11559  df-cncf 15294

This theorem is referenced by:  negfcncf  15329