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

Theorem 4p3e7 8864
Description: 4 + 3 = 7. (Contributed by NM, 11-May-2004.)
Assertion
Ref Expression
4p3e7  |-  ( 4  +  3 )  =  7

Proof of Theorem 4p3e7
StepHypRef Expression
1 df-3 8780 . . . 4  |-  3  =  ( 2  +  1 )
21oveq2i 5785 . . 3  |-  ( 4  +  3 )  =  ( 4  +  ( 2  +  1 ) )
3 4cn 8798 . . . 4  |-  4  e.  CC
4 2cn 8791 . . . 4  |-  2  e.  CC
5 ax-1cn 7713 . . . 4  |-  1  e.  CC
63, 4, 5addassi 7774 . . 3  |-  ( ( 4  +  2 )  +  1 )  =  ( 4  +  ( 2  +  1 ) )
72, 6eqtr4i 2163 . 2  |-  ( 4  +  3 )  =  ( ( 4  +  2 )  +  1 )
8 df-7 8784 . . 3  |-  7  =  ( 6  +  1 )
9 4p2e6 8863 . . . 4  |-  ( 4  +  2 )  =  6
109oveq1i 5784 . . 3  |-  ( ( 4  +  2 )  +  1 )  =  ( 6  +  1 )
118, 10eqtr4i 2163 . 2  |-  7  =  ( ( 4  +  2 )  +  1 )
127, 11eqtr4i 2163 1  |-  ( 4  +  3 )  =  7
Colors of variables: wff set class
Syntax hints:    = wceq 1331  (class class class)co 5774   1c1 7621    + caddc 7623   2c2 8771   3c3 8772   4c4 8773   6c6 8775   7c7 8776
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-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-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-addrcl 7717  ax-addass 7722
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rex 2422  df-v 2688  df-un 3075  df-in 3077  df-ss 3084  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-iota 5088  df-fv 5131  df-ov 5777  df-2 8779  df-3 8780  df-4 8781  df-5 8782  df-6 8783  df-7 8784
This theorem is referenced by:  4p4e8  8865
  Copyright terms: Public domain W3C validator