| Mathbox for Filip Cernatescu |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > problem1 | Structured version Visualization version GIF version | ||
| Description: Practice problem 1. Clues: 5p4e9 12540 3p2e5 12533 eqtri 2786 oveq1i 7461. (Contributed by Filip Cernatescu, 16-Mar-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| problem1 | ⊢ ((3 + 2) + 4) = 9 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3p2e5 12533 | . . 3 ⊢ (3 + 2) = 5 | |
| 2 | 1 | oveq1i 7461 | . 2 ⊢ ((3 + 2) + 4) = (5 + 4) |
| 3 | 5p4e9 12540 | . 2 ⊢ (5 + 4) = 9 | |
| 4 | 2, 3 | eqtri 2786 | 1 ⊢ ((3 + 2) + 4) = 9 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 (class class class)co 7451 + caddc 11242 2c2 12437 3c3 12438 4c4 12439 5c5 12440 9c9 12444 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-1cn 11297 ax-addcl 11299 ax-addass 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-iota 6520 df-fv 6574 df-ov 7454 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |