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

Theorem axaddf 8199
Description: Addition is an operation on the complex numbers. This theorem can be used as an alternate axiom for complex numbers in place of the less specific axaddcl 8195. This construction-dependent theorem should not be referenced directly; instead, use ax-addf 8265. (Contributed by NM, 8-Feb-2005.) (New usage is discouraged.)
Assertion
Ref Expression
axaddf  |-  +  :
( CC  X.  CC )
--> CC

Proof of Theorem axaddf
Dummy variables  a  b  x  y  z  w  v  u  f are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 moeq 2995 . . . . . . . . 9  |-  E* z 
z  =  <. (
w  +R  u ) ,  ( v  +R  f ) >.
21mosubop 4821 . . . . . . . 8  |-  E* z E. u E. f ( y  =  <. u ,  f >.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. )
32mosubop 4821 . . . . . . 7  |-  E* z E. w E. v ( x  =  <. w ,  v >.  /\  E. u E. f ( y  =  <. u ,  f
>.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )
)
4 anass 401 . . . . . . . . . . 11  |-  ( ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. )  <->  ( x  = 
<. w ,  v >.  /\  ( y  =  <. u ,  f >.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. ) ) )
542exbii 1655 . . . . . . . . . 10  |-  ( E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. )  <->  E. u E. f
( x  =  <. w ,  v >.  /\  (
y  =  <. u ,  f >.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. ) ) )
6 19.42vv 1963 . . . . . . . . . 10  |-  ( E. u E. f ( x  =  <. w ,  v >.  /\  (
y  =  <. u ,  f >.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. ) )  <->  ( x  =  <. w ,  v
>.  /\  E. u E. f ( y  = 
<. u ,  f >.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )
) )
75, 6bitri 184 . . . . . . . . 9  |-  ( E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. )  <->  ( x  = 
<. w ,  v >.  /\  E. u E. f
( y  =  <. u ,  f >.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. ) ) )
872exbii 1655 . . . . . . . 8  |-  ( E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. )  <->  E. w E. v
( x  =  <. w ,  v >.  /\  E. u E. f ( y  =  <. u ,  f
>.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )
) )
98mobii 2119 . . . . . . 7  |-  ( E* z E. w E. v E. u E. f
( ( x  = 
<. w ,  v >.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )  <->  E* z E. w E. v ( x  = 
<. w ,  v >.  /\  E. u E. f
( y  =  <. u ,  f >.  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. ) ) )
103, 9mpbir 146 . . . . . 6  |-  E* z E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. )
1110moani 2153 . . . . 5  |-  E* z
( ( x  e.  CC  /\  y  e.  CC )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )
)
1211funoprab 6161 . . . 4  |-  Fun  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  CC  /\  y  e.  CC )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )
) }
13 df-add 8154 . . . . 5  |-  +  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  CC  /\  y  e.  CC )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )
) }
1413funeqi 5378 . . . 4  |-  ( Fun 
+  <->  Fun  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  CC  /\  y  e.  CC )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. ) ) } )
1512, 14mpbir 146 . . 3  |-  Fun  +
1613dmeqi 4962 . . . . 5  |-  dom  +  =  dom  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  CC  /\  y  e.  CC )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f )
>. ) ) }
17 dmoprabss 6143 . . . . 5  |-  dom  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  CC  /\  y  e.  CC )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  +R  u ) ,  ( v  +R  f ) >. )
) }  C_  ( CC  X.  CC )
1816, 17eqsstri 3274 . . . 4  |-  dom  +  C_  ( CC  X.  CC )
19 cnm 8163 . . . . . . 7  |-  ( a  e.  CC  ->  E. b 
b  e.  a )
2019adantl 277 . . . . . 6  |-  ( ( T.  /\  a  e.  CC )  ->  E. b 
b  e.  a )
21 axaddcl 8195 . . . . . . 7  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( x  +  y )  e.  CC )
2221adantl 277 . . . . . 6  |-  ( ( T.  /\  ( x  e.  CC  /\  y  e.  CC ) )  -> 
( x  +  y )  e.  CC )
23 funrel 5374 . . . . . . 7  |-  ( Fun 
+  ->  Rel  +  )
2415, 23mp1i 10 . . . . . 6  |-  ( T. 
->  Rel  +  )
2520, 22, 24oprssdmm 6378 . . . . 5  |-  ( T. 
->  ( CC  X.  CC )  C_  dom  +  )
2625mptru 1407 . . . 4  |-  ( CC 
X.  CC )  C_  dom  +
2718, 26eqssi 3258 . . 3  |-  dom  +  =  ( CC  X.  CC )
28 df-fn 5360 . . 3  |-  (  +  Fn  ( CC  X.  CC )  <->  ( Fun  +  /\  dom  +  =  ( CC  X.  CC ) ) )
2915, 27, 28mpbir2an 951 . 2  |-  +  Fn  ( CC  X.  CC )
3021rgen2a 2598 . 2  |-  A. x  e.  CC  A. y  e.  CC  ( x  +  y )  e.  CC
31 ffnov 6165 . 2  |-  (  +  : ( CC  X.  CC ) --> CC  <->  (  +  Fn  ( CC  X.  CC )  /\  A. x  e.  CC  A. y  e.  CC  ( x  +  y )  e.  CC ) )
3229, 30, 31mpbir2an 951 1  |-  +  :
( CC  X.  CC )
--> CC
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1398   T. wtru 1399   E.wex 1541   E*wmo 2083    e. wcel 2205   A.wral 2522    C_ wss 3214   <.cop 3697    X. cxp 4752   dom cdm 4754   Rel wrel 4759   Fun wfun 5351    Fn wfn 5352   -->wf 5353  (class class class)co 6058   {coprab 6059    +R cplr 7632   CCcc 8141    + caddc 8146
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-2o 6661  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-enq0 7755  df-nq0 7756  df-0nq0 7757  df-plq0 7758  df-mq0 7759  df-inp 7797  df-iplp 7799  df-enr 8057  df-nr 8058  df-plr 8059  df-c 8149  df-add 8154
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator