Users' Mathboxes Mathbox for Filip Cernatescu < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  problem1 Structured version   Visualization version   GIF version

Theorem problem1 31319
Description: Practice problem 1. Clues: 5p4e9 11127 3p2e5 11120 eqtri 2643 oveq1i 6625. (Contributed by Filip Cernatescu, 16-Mar-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
problem1 ((3 + 2) + 4) = 9

Proof of Theorem problem1
StepHypRef Expression
1 3p2e5 11120 . . 3 (3 + 2) = 5
21oveq1i 6625 . 2 ((3 + 2) + 4) = (5 + 4)
3 5p4e9 11127 . 2 (5 + 4) = 9
42, 3eqtri 2643 1 ((3 + 2) + 4) = 9
Colors of variables: wff setvar class
Syntax hints:   = wceq 1480  (class class class)co 6615   + caddc 9899  2c2 11030  3c3 11031  4c4 11032  5c5 11033  9c9 11037
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-resscn 9953  ax-1cn 9954  ax-icn 9955  ax-addcl 9956  ax-addrcl 9957  ax-mulcl 9958  ax-mulrcl 9959  ax-addass 9961  ax-i2m1 9964  ax-1ne0 9965  ax-rrecex 9968  ax-cnre 9969
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-br 4624  df-iota 5820  df-fv 5865  df-ov 6618  df-2 11039  df-3 11040  df-4 11041  df-5 11042  df-6 11043  df-7 11044  df-8 11045  df-9 11046
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator