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

Theorem addccncf 15394
Description: Adding a constant is a continuous function. (Contributed by Jeff Madsen, 2-Sep-2009.)
Hypothesis
Ref Expression
addccncf.1  |-  F  =  ( x  e.  CC  |->  ( x  +  A
) )
Assertion
Ref Expression
addccncf  |-  ( A  e.  CC  ->  F  e.  ( CC -cn-> CC ) )
Distinct variable group:    x, A
Allowed substitution hint:    F( x)

Proof of Theorem addccncf
Dummy variables  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssid 3248 . 2  |-  CC  C_  CC
2 addcl 8200 . . . . 5  |-  ( ( x  e.  CC  /\  A  e.  CC )  ->  ( x  +  A
)  e.  CC )
32ancoms 268 . . . 4  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  ( x  +  A
)  e.  CC )
4 addccncf.1 . . . 4  |-  F  =  ( x  e.  CC  |->  ( x  +  A
) )
53, 4fmptd 5809 . . 3  |-  ( A  e.  CC  ->  F : CC --> CC )
6 simpr 110 . . . 4  |-  ( ( y  e.  CC  /\  w  e.  RR+ )  ->  w  e.  RR+ )
76a1i 9 . . 3  |-  ( A  e.  CC  ->  (
( y  e.  CC  /\  w  e.  RR+ )  ->  w  e.  RR+ )
)
8 oveq1 6035 . . . . . . . . 9  |-  ( x  =  y  ->  (
x  +  A )  =  ( y  +  A ) )
9 simprll 539 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
y  e.  CC )
10 simpl 109 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  ->  A  e.  CC )
119, 10addcld 8241 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( y  +  A
)  e.  CC )
124, 8, 9, 11fvmptd3 5749 . . . . . . . 8  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( F `  y
)  =  ( y  +  A ) )
13 oveq1 6035 . . . . . . . . 9  |-  ( x  =  z  ->  (
x  +  A )  =  ( z  +  A ) )
14 simprlr 540 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
z  e.  CC )
1514, 10addcld 8241 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( z  +  A
)  e.  CC )
164, 13, 14, 15fvmptd3 5749 . . . . . . . 8  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( F `  z
)  =  ( z  +  A ) )
1712, 16oveq12d 6046 . . . . . . 7  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( F `  y )  -  ( F `  z )
)  =  ( ( y  +  A )  -  ( z  +  A ) ) )
189, 14, 10pnpcan2d 8570 . . . . . . 7  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( y  +  A )  -  (
z  +  A ) )  =  ( y  -  z ) )
1917, 18eqtrd 2264 . . . . . 6  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( F `  y )  -  ( F `  z )
)  =  ( y  -  z ) )
2019fveq2d 5652 . . . . 5  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( abs `  (
( F `  y
)  -  ( F `
 z ) ) )  =  ( abs `  ( y  -  z
) ) )
2120breq1d 4103 . . . 4  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( abs `  (
( F `  y
)  -  ( F `
 z ) ) )  <  w  <->  ( abs `  ( y  -  z
) )  <  w
) )
2221exbiri 382 . . 3  |-  ( A  e.  CC  ->  (
( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ )  ->  (
( abs `  (
y  -  z ) )  <  w  -> 
( abs `  (
( F `  y
)  -  ( F `
 z ) ) )  <  w ) ) )
235, 7, 22elcncf1di 15373 . 2  |-  ( A  e.  CC  ->  (
( CC  C_  CC  /\  CC  C_  CC )  ->  F  e.  ( CC
-cn-> CC ) ) )
241, 1, 23mp2ani 432 1  |-  ( A  e.  CC  ->  F  e.  ( CC -cn-> CC ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202    C_ wss 3201   class class class wbr 4093    |-> cmpt 4155   ` cfv 5333  (class class class)co 6028   CCcc 8073    + caddc 8078    < clt 8256    - cmin 8392   RR+crp 9932   abscabs 11620   -cn->ccncf 15364
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-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-distr 8179  ax-i2m1 8180  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186
This theorem depends on definitions:  df-bi 117  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-ral 2516  df-rex 2517  df-reu 2518  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-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  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-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-map 6862  df-sub 8394  df-cncf 15365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator