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

Theorem ax0id 7679
Description:  0 is an identity element for real addition. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-0id 7721.

In the Metamath Proof Explorer this is not a complex number axiom but is instead proved from other axioms. That proof relies on excluded middle and it is not known whether it is possible to prove this from the other axioms without excluded middle. (Contributed by Jim Kingdon, 16-Jan-2020.) (New usage is discouraged.)

Assertion
Ref Expression
ax0id  |-  ( A  e.  CC  ->  ( A  +  0 )  =  A )

Proof of Theorem ax0id
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-c 7619 . 2  |-  CC  =  ( R.  X.  R. )
2 oveq1 5774 . . 3  |-  ( <.
x ,  y >.  =  A  ->  ( <.
x ,  y >.  +  0 )  =  ( A  +  0 ) )
3 id 19 . . 3  |-  ( <.
x ,  y >.  =  A  ->  <. x ,  y >.  =  A )
42, 3eqeq12d 2152 . 2  |-  ( <.
x ,  y >.  =  A  ->  ( (
<. x ,  y >.  +  0 )  = 
<. x ,  y >.  <->  ( A  +  0 )  =  A ) )
5 0r 7551 . . . 4  |-  0R  e.  R.
6 addcnsr 7635 . . . 4  |-  ( ( ( x  e.  R.  /\  y  e.  R. )  /\  ( 0R  e.  R.  /\  0R  e.  R. )
)  ->  ( <. x ,  y >.  +  <. 0R ,  0R >. )  =  <. ( x  +R  0R ) ,  ( y  +R  0R ) >.
)
75, 5, 6mpanr12 435 . . 3  |-  ( ( x  e.  R.  /\  y  e.  R. )  ->  ( <. x ,  y
>.  +  <. 0R ,  0R >. )  =  <. (
x  +R  0R ) ,  ( y  +R  0R ) >. )
8 df-0 7620 . . . . . 6  |-  0  =  <. 0R ,  0R >.
98eqcomi 2141 . . . . 5  |-  <. 0R ,  0R >.  =  0
109a1i 9 . . . 4  |-  ( ( x  e.  R.  /\  y  e.  R. )  -> 
<. 0R ,  0R >.  =  0 )
1110oveq2d 5783 . . 3  |-  ( ( x  e.  R.  /\  y  e.  R. )  ->  ( <. x ,  y
>.  +  <. 0R ,  0R >. )  =  ( <.
x ,  y >.  +  0 ) )
12 0idsr 7568 . . . . 5  |-  ( x  e.  R.  ->  (
x  +R  0R )  =  x )
1312adantr 274 . . . 4  |-  ( ( x  e.  R.  /\  y  e.  R. )  ->  ( x  +R  0R )  =  x )
14 0idsr 7568 . . . . 5  |-  ( y  e.  R.  ->  (
y  +R  0R )  =  y )
1514adantl 275 . . . 4  |-  ( ( x  e.  R.  /\  y  e.  R. )  ->  ( y  +R  0R )  =  y )
1613, 15opeq12d 3708 . . 3  |-  ( ( x  e.  R.  /\  y  e.  R. )  -> 
<. ( x  +R  0R ) ,  ( y  +R  0R ) >.  =  <. x ,  y >. )
177, 11, 163eqtr3d 2178 . 2  |-  ( ( x  e.  R.  /\  y  e.  R. )  ->  ( <. x ,  y
>.  +  0 )  = 
<. x ,  y >.
)
181, 4, 17optocl 4610 1  |-  ( A  e.  CC  ->  ( A  +  0 )  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480   <.cop 3525  (class class class)co 5767   R.cnr 7098   0Rc0r 7099    +R cplr 7102   CCcc 7611   0cc0 7613    + caddc 7616
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-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  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-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  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-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-1o 6306  df-2o 6307  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-pli 7106  df-mi 7107  df-lti 7108  df-plpq 7145  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-plqqs 7150  df-mqqs 7151  df-1nqqs 7152  df-rq 7153  df-ltnqqs 7154  df-enq0 7225  df-nq0 7226  df-0nq0 7227  df-plq0 7228  df-mq0 7229  df-inp 7267  df-i1p 7268  df-iplp 7269  df-enr 7527  df-nr 7528  df-plr 7529  df-0r 7532  df-c 7619  df-0 7620  df-add 7624
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator