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

Theorem addccncf 12744
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 3112 . 2  |-  CC  C_  CC
2 addcl 7738 . . . . 5  |-  ( ( x  e.  CC  /\  A  e.  CC )  ->  ( x  +  A
)  e.  CC )
32ancoms 266 . . . 4  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  ( x  +  A
)  e.  CC )
4 addccncf.1 . . . 4  |-  F  =  ( x  e.  CC  |->  ( x  +  A
) )
53, 4fmptd 5567 . . 3  |-  ( A  e.  CC  ->  F : CC --> CC )
6 simpr 109 . . . 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 5774 . . . . . . . . 9  |-  ( x  =  y  ->  (
x  +  A )  =  ( y  +  A ) )
9 simprll 526 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
y  e.  CC )
10 simpl 108 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  ->  A  e.  CC )
119, 10addcld 7778 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( y  +  A
)  e.  CC )
124, 8, 9, 11fvmptd3 5507 . . . . . . . 8  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( F `  y
)  =  ( y  +  A ) )
13 oveq1 5774 . . . . . . . . 9  |-  ( x  =  z  ->  (
x  +  A )  =  ( z  +  A ) )
14 simprlr 527 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
z  e.  CC )
1514, 10addcld 7778 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( z  +  A
)  e.  CC )
164, 13, 14, 15fvmptd3 5507 . . . . . . . 8  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( F `  z
)  =  ( z  +  A ) )
1712, 16oveq12d 5785 . . . . . . 7  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( F `  y )  -  ( F `  z )
)  =  ( ( y  +  A )  -  ( z  +  A ) ) )
189, 14, 10pnpcan2d 8104 . . . . . . 7  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( y  +  A )  -  (
z  +  A ) )  =  ( y  -  z ) )
1917, 18eqtrd 2170 . . . . . 6  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( F `  y )  -  ( F `  z )
)  =  ( y  -  z ) )
2019fveq2d 5418 . . . . 5  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( abs `  (
( F `  y
)  -  ( F `
 z ) ) )  =  ( abs `  ( y  -  z
) ) )
2120breq1d 3934 . . . 4  |-  ( ( A  e.  CC  /\  ( ( y  e.  CC  /\  z  e.  CC )  /\  w  e.  RR+ ) )  -> 
( ( abs `  (
( F `  y
)  -  ( F `
 z ) ) )  <  w  <->  ( abs `  ( y  -  z
) )  <  w
) )
2221exbiri 379 . . 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 12724 . 2  |-  ( A  e.  CC  ->  (
( CC  C_  CC  /\  CC  C_  CC )  ->  F  e.  ( CC
-cn-> CC ) ) )
241, 1, 23mp2ani 428 1  |-  ( A  e.  CC  ->  F  e.  ( CC -cn-> CC ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480    C_ wss 3066   class class class wbr 3924    |-> cmpt 3984   ` cfv 5118  (class class class)co 5767   CCcc 7611    + caddc 7616    < clt 7793    - cmin 7926   RR+crp 9434   abscabs 10762   -cn->ccncf 12715
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-addcom 7713  ax-addass 7715  ax-distr 7717  ax-i2m1 7718  ax-0id 7721  ax-rnegex 7722  ax-cnre 7724
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-map 6537  df-sub 7928  df-cncf 12716
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator