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

Theorem 5p2e7 9154
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 9066 . . . . 5  |-  2  =  ( 1  +  1 )
21oveq2i 5936 . . . 4  |-  ( 5  +  2 )  =  ( 5  +  ( 1  +  1 ) )
3 5cn 9087 . . . . 5  |-  5  e.  CC
4 ax-1cn 7989 . . . . 5  |-  1  e.  CC
53, 4, 4addassi 8051 . . . 4  |-  ( ( 5  +  1 )  +  1 )  =  ( 5  +  ( 1  +  1 ) )
62, 5eqtr4i 2220 . . 3  |-  ( 5  +  2 )  =  ( ( 5  +  1 )  +  1 )
7 df-6 9070 . . . 4  |-  6  =  ( 5  +  1 )
87oveq1i 5935 . . 3  |-  ( 6  +  1 )  =  ( ( 5  +  1 )  +  1 )
96, 8eqtr4i 2220 . 2  |-  ( 5  +  2 )  =  ( 6  +  1 )
10 df-7 9071 . 2  |-  7  =  ( 6  +  1 )
119, 10eqtr4i 2220 1  |-  ( 5  +  2 )  =  7
Colors of variables: wff set class
Syntax hints:    = wceq 1364  (class class class)co 5925   1c1 7897    + caddc 7899   2c2 9058   5c5 9061   6c6 9062   7c7 9063
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-addrcl 7993  ax-addass 7998
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-iota 5220  df-fv 5267  df-ov 5928  df-2 9066  df-3 9067  df-4 9068  df-5 9069  df-6 9070  df-7 9071
This theorem is referenced by:  5p3e8  9155
  Copyright terms: Public domain W3C validator