| Mathbox for Filip Cernatescu |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > problem3 | Structured version Visualization version GIF version | ||
| Description: Practice problem 3. Clues: eqcomi 2773 eqtri 2787 subaddrii 11683 recni 11359 4re 12464 3re 12460 1re 11344 df-4 12444 addcomi 11537. (Contributed by Filip Cernatescu, 16-Mar-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| problem3.1 | ⊢ 𝐴 ∈ ℂ |
| problem3.2 | ⊢ (𝐴 + 3) = 4 |
| Ref | Expression |
|---|---|
| problem3 | ⊢ 𝐴 = 1 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 4re 12464 | . . . . . 6 ⊢ 4 ∈ ℝ | |
| 2 | 1 | recni 11359 | . . . . 5 ⊢ 4 ∈ ℂ |
| 3 | 3re 12460 | . . . . . 6 ⊢ 3 ∈ ℝ | |
| 4 | 3 | recni 11359 | . . . . 5 ⊢ 3 ∈ ℂ |
| 5 | 1re 11344 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 6 | 5 | recni 11359 | . . . . 5 ⊢ 1 ∈ ℂ |
| 7 | df-4 12444 | . . . . . 6 ⊢ 4 = (3 + 1) | |
| 8 | 7 | eqcomi 2773 | . . . . 5 ⊢ (3 + 1) = 4 |
| 9 | 2, 4, 6, 8 | subaddrii 11683 | . . . 4 ⊢ (4 − 3) = 1 |
| 10 | 9 | eqcomi 2773 | . . 3 ⊢ 1 = (4 − 3) |
| 11 | problem3.1 | . . . 4 ⊢ 𝐴 ∈ ℂ | |
| 12 | 4, 11 | addcomi 11537 | . . . . 5 ⊢ (3 + 𝐴) = (𝐴 + 3) |
| 13 | problem3.2 | . . . . 5 ⊢ (𝐴 + 3) = 4 | |
| 14 | 12, 13 | eqtri 2787 | . . . 4 ⊢ (3 + 𝐴) = 4 |
| 15 | 2, 4, 11, 14 | subaddrii 11683 | . . 3 ⊢ (4 − 3) = 𝐴 |
| 16 | 10, 15 | eqtri 2787 | . 2 ⊢ 1 = 𝐴 |
| 17 | 16 | eqcomi 2773 | 1 ⊢ 𝐴 = 1 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2148 (class class class)co 7448 ℂcc 11234 1c1 11237 + caddc 11239 − cmin 11577 3c3 12435 4c4 12436 |
| 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 2150 ax-9 2158 ax-10 2181 ax-11 2198 ax-12 2217 ax-ext 2736 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7780 ax-resscn 11293 ax-1cn 11294 ax-icn 11295 ax-addcl 11296 ax-addrcl 11297 ax-mulcl 11298 ax-mulrcl 11299 ax-mulcom 11300 ax-addass 11301 ax-mulass 11302 ax-distr 11303 ax-i2m1 11304 ax-1ne0 11305 ax-1rid 11306 ax-rnegex 11307 ax-rrecex 11308 ax-cnre 11309 ax-pre-lttri 11310 ax-pre-lttrn 11311 ax-pre-ltadd 11312 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3849 df-ss 3898 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4483 df-pw 4559 df-sn 4586 df-pr 4588 df-op 4838 df-uni 4870 df-br 5106 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6517 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7405 df-ov 7451 df-oprab 7452 df-mpo 7453 df-er 8752 df-en 9009 df-dom 9010 df-sdom 9011 df-pnf 11381 df-mnf 11382 df-ltxr 11384 df-sub 11579 df-2 12442 df-3 12443 df-4 12444 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |