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

Theorem 5p2e7 9433
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 9345 . . . . 5  |-  2  =  ( 1  +  1 )
21oveq2i 6089 . . . 4  |-  ( 5  +  2 )  =  ( 5  +  ( 1  +  1 ) )
3 5cn 9366 . . . . 5  |-  5  e.  CC
4 ax-1cn 8265 . . . . 5  |-  1  e.  CC
53, 4, 4addassi 8327 . . . 4  |-  ( ( 5  +  1 )  +  1 )  =  ( 5  +  ( 1  +  1 ) )
62, 5eqtr4i 2262 . . 3  |-  ( 5  +  2 )  =  ( ( 5  +  1 )  +  1 )
7 df-6 9349 . . . 4  |-  6  =  ( 5  +  1 )
87oveq1i 6088 . . 3  |-  ( 6  +  1 )  =  ( ( 5  +  1 )  +  1 )
96, 8eqtr4i 2262 . 2  |-  ( 5  +  2 )  =  ( 6  +  1 )
10 df-7 9350 . 2  |-  7  =  ( 6  +  1 )
119, 10eqtr4i 2262 1  |-  ( 5  +  2 )  =  7
Colors of variables: wff set class
Syntax hints:    = wceq 1402  (class class class)co 6078   1c1 8173    + caddc 8175   2c2 9337   5c5 9340   6c6 9341   7c7 9342
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-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 8264  ax-1cn 8265  ax-1re 8266  ax-addrcl 8269  ax-addass 8274
This theorem 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 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-iota 5335  df-fv 5383  df-ov 6081  df-2 9345  df-3 9346  df-4 9347  df-5 9348  df-6 9349  df-7 9350
This theorem is referenced by:  5p3e8  9434
  Copyright terms: Public domain W3C validator