ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cn1lem Unicode version

Theorem cn1lem 11954
Description: A sufficient condition for a function to be continuous. (Contributed by Mario Carneiro, 9-Feb-2014.)
Hypotheses
Ref Expression
cn1lem.1  |-  F : CC
--> CC
cn1lem.2  |-  ( ( z  e.  CC  /\  A  e.  CC )  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <_  ( abs `  ( z  -  A
) ) )
Assertion
Ref Expression
cn1lem  |-  ( ( A  e.  CC  /\  x  e.  RR+ )  ->  E. y  e.  RR+  A. z  e.  CC  ( ( abs `  ( z  -  A
) )  <  y  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) )
Distinct variable groups:    x, y, z   
y, A, z    y, F
Allowed substitution hints:    A( x)    F( x, z)

Proof of Theorem cn1lem
StepHypRef Expression
1 simpr 110 . 2  |-  ( ( A  e.  CC  /\  x  e.  RR+ )  ->  x  e.  RR+ )
2 simpr 110 . . . . 5  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  z  e.  CC )
3 simpll 527 . . . . 5  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  A  e.  CC )
4 cn1lem.2 . . . . 5  |-  ( ( z  e.  CC  /\  A  e.  CC )  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <_  ( abs `  ( z  -  A
) ) )
52, 3, 4syl2anc 411 . . . 4  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <_  ( abs `  ( z  -  A
) ) )
6 cn1lem.1 . . . . . . . . 9  |-  F : CC
--> CC
76ffvelcdmi 5789 . . . . . . . 8  |-  ( z  e.  CC  ->  ( F `  z )  e.  CC )
82, 7syl 14 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( F `  z )  e.  CC )
96ffvelcdmi 5789 . . . . . . . 8  |-  ( A  e.  CC  ->  ( F `  A )  e.  CC )
103, 9syl 14 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( F `  A )  e.  CC )
118, 10subcld 8549 . . . . . 6  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( ( F `
 z )  -  ( F `  A ) )  e.  CC )
1211abscld 11821 . . . . 5  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  e.  RR )
132, 3subcld 8549 . . . . . 6  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( z  -  A )  e.  CC )
1413abscld 11821 . . . . 5  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( abs `  (
z  -  A ) )  e.  RR )
15 rpre 9956 . . . . . 6  |-  ( x  e.  RR+  ->  x  e.  RR )
1615ad2antlr 489 . . . . 5  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  x  e.  RR )
17 lelttr 8327 . . . . 5  |-  ( ( ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  e.  RR  /\  ( abs `  ( z  -  A ) )  e.  RR  /\  x  e.  RR )  ->  (
( ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <_  ( abs `  ( z  -  A
) )  /\  ( abs `  ( z  -  A ) )  < 
x )  ->  ( abs `  ( ( F `
 z )  -  ( F `  A ) ) )  <  x
) )
1812, 14, 16, 17syl3anc 1274 . . . 4  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( ( ( abs `  ( ( F `  z )  -  ( F `  A ) ) )  <_  ( abs `  (
z  -  A ) )  /\  ( abs `  ( z  -  A
) )  <  x
)  ->  ( abs `  ( ( F `  z )  -  ( F `  A )
) )  <  x
) )
195, 18mpand 429 . . 3  |-  ( ( ( A  e.  CC  /\  x  e.  RR+ )  /\  z  e.  CC )  ->  ( ( abs `  ( z  -  A
) )  <  x  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) )
2019ralrimiva 2606 . 2  |-  ( ( A  e.  CC  /\  x  e.  RR+ )  ->  A. z  e.  CC  ( ( abs `  (
z  -  A ) )  <  x  -> 
( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) )
21 breq2 4097 . . . . 5  |-  ( y  =  x  ->  (
( abs `  (
z  -  A ) )  <  y  <->  ( abs `  ( z  -  A
) )  <  x
) )
2221imbi1d 231 . . . 4  |-  ( y  =  x  ->  (
( ( abs `  (
z  -  A ) )  <  y  -> 
( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x )  <-> 
( ( abs `  (
z  -  A ) )  <  x  -> 
( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) ) )
2322ralbidv 2533 . . 3  |-  ( y  =  x  ->  ( A. z  e.  CC  ( ( abs `  (
z  -  A ) )  <  y  -> 
( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x )  <->  A. z  e.  CC  ( ( abs `  (
z  -  A ) )  <  x  -> 
( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) ) )
2423rspcev 2911 . 2  |-  ( ( x  e.  RR+  /\  A. z  e.  CC  (
( abs `  (
z  -  A ) )  <  x  -> 
( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) )  ->  E. y  e.  RR+  A. z  e.  CC  ( ( abs `  ( z  -  A
) )  <  y  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) )
251, 20, 24syl2anc 411 1  |-  ( ( A  e.  CC  /\  x  e.  RR+ )  ->  E. y  e.  RR+  A. z  e.  CC  ( ( abs `  ( z  -  A
) )  <  y  ->  ( abs `  (
( F `  z
)  -  ( F `
 A ) ) )  <  x ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2202   A.wral 2511   E.wrex 2512   class class class wbr 4093   -->wf 5329   ` cfv 5333  (class class class)co 6028   CCcc 8090   RRcr 8091    < clt 8273    <_ cle 8274    - cmin 8409   RR+crp 9949   abscabs 11637
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210  ax-arch 8211  ax-caucvg 8212
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-n0 9462  df-z 9541  df-uz 9817  df-rp 9950  df-seqfrec 10773  df-exp 10864  df-cj 11482  df-re 11483  df-im 11484  df-rsqrt 11638  df-abs 11639
This theorem is referenced by:  abscn2  11955  cjcn2  11956  recn2  11957  imcn2  11958
  Copyright terms: Public domain W3C validator