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

Theorem 5p2e7 9289
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 9201 . . . . 5  |-  2  =  ( 1  +  1 )
21oveq2i 6028 . . . 4  |-  ( 5  +  2 )  =  ( 5  +  ( 1  +  1 ) )
3 5cn 9222 . . . . 5  |-  5  e.  CC
4 ax-1cn 8124 . . . . 5  |-  1  e.  CC
53, 4, 4addassi 8186 . . . 4  |-  ( ( 5  +  1 )  +  1 )  =  ( 5  +  ( 1  +  1 ) )
62, 5eqtr4i 2255 . . 3  |-  ( 5  +  2 )  =  ( ( 5  +  1 )  +  1 )
7 df-6 9205 . . . 4  |-  6  =  ( 5  +  1 )
87oveq1i 6027 . . 3  |-  ( 6  +  1 )  =  ( ( 5  +  1 )  +  1 )
96, 8eqtr4i 2255 . 2  |-  ( 5  +  2 )  =  ( 6  +  1 )
10 df-7 9206 . 2  |-  7  =  ( 6  +  1 )
119, 10eqtr4i 2255 1  |-  ( 5  +  2 )  =  7
Colors of variables: wff set class
Syntax hints:    = wceq 1397  (class class class)co 6017   1c1 8032    + caddc 8034   2c2 9193   5c5 9196   6c6 9197   7c7 9198
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-addrcl 8128  ax-addass 8133
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020  df-2 9201  df-3 9202  df-4 9203  df-5 9204  df-6 9205  df-7 9206
This theorem is referenced by:  5p3e8  9290
  Copyright terms: Public domain W3C validator