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

Theorem 4p3e7 9266
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 9181 . . . 4  |-  3  =  ( 2  +  1 )
21oveq2i 6018 . . 3  |-  ( 4  +  3 )  =  ( 4  +  ( 2  +  1 ) )
3 4cn 9199 . . . 4  |-  4  e.  CC
4 2cn 9192 . . . 4  |-  2  e.  CC
5 ax-1cn 8103 . . . 4  |-  1  e.  CC
63, 4, 5addassi 8165 . . 3  |-  ( ( 4  +  2 )  +  1 )  =  ( 4  +  ( 2  +  1 ) )
72, 6eqtr4i 2253 . 2  |-  ( 4  +  3 )  =  ( ( 4  +  2 )  +  1 )
8 df-7 9185 . . 3  |-  7  =  ( 6  +  1 )
9 4p2e6 9265 . . . 4  |-  ( 4  +  2 )  =  6
109oveq1i 6017 . . 3  |-  ( ( 4  +  2 )  +  1 )  =  ( 6  +  1 )
118, 10eqtr4i 2253 . 2  |-  7  =  ( ( 4  +  2 )  +  1 )
127, 11eqtr4i 2253 1  |-  ( 4  +  3 )  =  7
Colors of variables: wff set class
Syntax hints:    = wceq 1395  (class class class)co 6007   1c1 8011    + caddc 8013   2c2 9172   3c3 9173   4c4 9174   6c6 9176   7c7 9177
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-addrcl 8107  ax-addass 8112
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-iota 5278  df-fv 5326  df-ov 6010  df-2 9180  df-3 9181  df-4 9182  df-5 9183  df-6 9184  df-7 9185
This theorem is referenced by:  4p4e8  9267  2lgslem3d  15791  2lgsoddprmlem3d  15805
  Copyright terms: Public domain W3C validator