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

Theorem 5p4e9 9453
Description: 5 + 4 = 9. (Contributed by NM, 11-May-2004.)
Assertion
Ref Expression
5p4e9  |-  ( 5  +  4 )  =  9

Proof of Theorem 5p4e9
StepHypRef Expression
1 df-4 9365 . . . 4  |-  4  =  ( 3  +  1 )
21oveq2i 6096 . . 3  |-  ( 5  +  4 )  =  ( 5  +  ( 3  +  1 ) )
3 5cn 9384 . . . 4  |-  5  e.  CC
4 3cn 9379 . . . 4  |-  3  e.  CC
5 ax-1cn 8272 . . . 4  |-  1  e.  CC
63, 4, 5addassi 8334 . . 3  |-  ( ( 5  +  3 )  +  1 )  =  ( 5  +  ( 3  +  1 ) )
72, 6eqtr4i 2262 . 2  |-  ( 5  +  4 )  =  ( ( 5  +  3 )  +  1 )
8 df-9 9370 . . 3  |-  9  =  ( 8  +  1 )
9 5p3e8 9452 . . . 4  |-  ( 5  +  3 )  =  8
109oveq1i 6095 . . 3  |-  ( ( 5  +  3 )  +  1 )  =  ( 8  +  1 )
118, 10eqtr4i 2262 . 2  |-  9  =  ( ( 5  +  3 )  +  1 )
127, 11eqtr4i 2262 1  |-  ( 5  +  4 )  =  9
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402  (class class class)co 6085   1c1 8180    + caddc 8182   3c3 9356   4c4 9357   5c5 9358   8c8 9361   9c9 9362
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  df-8 9369  df-9 9370
This theorem is used by:  5p5e10  9847
  Copyright terms: Public domain W3C validator