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

Theorem 3p2e5 9213
Description: 3 + 2 = 5. (Contributed by NM, 11-May-2004.)
Assertion
Ref Expression
3p2e5  |-  ( 3  +  2 )  =  5

Proof of Theorem 3p2e5
StepHypRef Expression
1 df-2 9130 . . . . 5  |-  2  =  ( 1  +  1 )
21oveq2i 5978 . . . 4  |-  ( 3  +  2 )  =  ( 3  +  ( 1  +  1 ) )
3 3cn 9146 . . . . 5  |-  3  e.  CC
4 ax-1cn 8053 . . . . 5  |-  1  e.  CC
53, 4, 4addassi 8115 . . . 4  |-  ( ( 3  +  1 )  +  1 )  =  ( 3  +  ( 1  +  1 ) )
62, 5eqtr4i 2231 . . 3  |-  ( 3  +  2 )  =  ( ( 3  +  1 )  +  1 )
7 df-4 9132 . . . 4  |-  4  =  ( 3  +  1 )
87oveq1i 5977 . . 3  |-  ( 4  +  1 )  =  ( ( 3  +  1 )  +  1 )
96, 8eqtr4i 2231 . 2  |-  ( 3  +  2 )  =  ( 4  +  1 )
10 df-5 9133 . 2  |-  5  =  ( 4  +  1 )
119, 10eqtr4i 2231 1  |-  ( 3  +  2 )  =  5
Colors of variables: wff set class
Syntax hints:    = wceq 1373  (class class class)co 5967   1c1 7961    + caddc 7963   2c2 9122   3c3 9123   4c4 9124   5c5 9125
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-addrcl 8057  ax-addass 8062
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-rex 2492  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-iota 5251  df-fv 5298  df-ov 5970  df-2 9130  df-3 9131  df-4 9132  df-5 9133
This theorem is referenced by:  3p3e6  9214  2exp5  12870  2exp16  12875  2lgsoddprmlem3d  15702
  Copyright terms: Public domain W3C validator