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

Theorem 5p2e7 9451
Description: 5 + 2 = 7. (Contributed by NM, 11-May-2004.)
Assertion
Ref Expression
5p2e7  |-  ( 5  +  2 )  =  7

Proof of Theorem 5p2e7
StepHypRef Expression
1 df-2 9363 . . . . 5  |-  2  =  ( 1  +  1 )
21oveq2i 6096 . . . 4  |-  ( 5  +  2 )  =  ( 5  +  ( 1  +  1 ) )
3 5cn 9384 . . . . 5  |-  5  e.  CC
4 ax-1cn 8272 . . . . 5  |-  1  e.  CC
53, 4, 4addassi 8334 . . . 4  |-  ( ( 5  +  1 )  +  1 )  =  ( 5  +  ( 1  +  1 ) )
62, 5eqtr4i 2262 . . 3  |-  ( 5  +  2 )  =  ( ( 5  +  1 )  +  1 )
7 df-6 9367 . . . 4  |-  6  =  ( 5  +  1 )
87oveq1i 6095 . . 3  |-  ( 6  +  1 )  =  ( ( 5  +  1 )  +  1 )
96, 8eqtr4i 2262 . 2  |-  ( 5  +  2 )  =  ( 6  +  1 )
10 df-7 9368 . 2  |-  7  =  ( 6  +  1 )
119, 10eqtr4i 2262 1  |-  ( 5  +  2 )  =  7
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402  (class class class)co 6085   1c1 8180    + caddc 8182   2c2 9355   5c5 9358   6c6 9359   7c7 9360
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-addrcl 8276  ax-addass 8281
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368
This theorem is used by:  5p3e8  9452  log2ublog2  16086
  Copyright terms: Public domain W3C validator