| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > m1p1sr | Structured version Visualization version GIF version | ||
| Description: Minus one plus one is zero for signed reals. (Contributed by NM, 5-May-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| m1p1sr | ⊢ (-1R +R 1R) = 0R |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-m1r 11147 | . . 3 ⊢ -1R = [〈1P, (1P +P 1P)〉] ~R | |
| 2 | df-1r 11146 | . . 3 ⊢ 1R = [〈(1P +P 1P), 1P〉] ~R | |
| 3 | 1, 2 | oveq12i 7432 | . 2 ⊢ (-1R +R 1R) = ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) |
| 4 | df-0r 11145 | . . 3 ⊢ 0R = [〈1P, 1P〉] ~R | |
| 5 | 1pr 11100 | . . . . 5 ⊢ 1P ∈ P | |
| 6 | addclpr 11103 | . . . . . 6 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P) | |
| 7 | 5, 5, 6 | mp2an 705 | . . . . 5 ⊢ (1P +P 1P) ∈ P |
| 8 | addsrpr 11160 | . . . . 5 ⊢ (((1P ∈ P ∧ (1P +P 1P) ∈ P) ∧ ((1P +P 1P) ∈ P ∧ 1P ∈ P)) → ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R ) | |
| 9 | 5, 7, 7, 5, 8 | mp4an 706 | . . . 4 ⊢ ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R |
| 10 | addasspr 11107 | . . . . . 6 ⊢ ((1P +P 1P) +P 1P) = (1P +P (1P +P 1P)) | |
| 11 | 10 | oveq2i 7431 | . . . . 5 ⊢ (1P +P ((1P +P 1P) +P 1P)) = (1P +P (1P +P (1P +P 1P))) |
| 12 | addclpr 11103 | . . . . . . 7 ⊢ ((1P ∈ P ∧ (1P +P 1P) ∈ P) → (1P +P (1P +P 1P)) ∈ P) | |
| 13 | 5, 7, 12 | mp2an 705 | . . . . . 6 ⊢ (1P +P (1P +P 1P)) ∈ P |
| 14 | addclpr 11103 | . . . . . . 7 ⊢ (((1P +P 1P) ∈ P ∧ 1P ∈ P) → ((1P +P 1P) +P 1P) ∈ P) | |
| 15 | 7, 5, 14 | mp2an 705 | . . . . . 6 ⊢ ((1P +P 1P) +P 1P) ∈ P |
| 16 | enreceq 11151 | . . . . . 6 ⊢ (((1P ∈ P ∧ 1P ∈ P) ∧ ((1P +P (1P +P 1P)) ∈ P ∧ ((1P +P 1P) +P 1P) ∈ P)) → ([〈1P, 1P〉] ~R = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R ↔ (1P +P ((1P +P 1P) +P 1P)) = (1P +P (1P +P (1P +P 1P))))) | |
| 17 | 5, 5, 13, 15, 16 | mp4an 706 | . . . . 5 ⊢ ([〈1P, 1P〉] ~R = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R ↔ (1P +P ((1P +P 1P) +P 1P)) = (1P +P (1P +P (1P +P 1P)))) |
| 18 | 11, 17 | mpbir 234 | . . . 4 ⊢ [〈1P, 1P〉] ~R = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R |
| 19 | 9, 18 | eqtr4i 2786 | . . 3 ⊢ ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) = [〈1P, 1P〉] ~R |
| 20 | 4, 19 | eqtr4i 2786 | . 2 ⊢ 0R = ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) |
| 21 | 3, 20 | eqtr4i 2786 | 1 ⊢ (-1R +R 1R) = 0R |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 ∈ wcel 2144 〈cop 4589 (class class class)co 7420 [cec 8715 Pcnp 10944 1Pc1p 10945 +P cpp 10946 ~R cer 10949 0Rc0r 10951 1Rc1r 10952 -1Rcm1r 10953 +R cplr 10954 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9642 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-omul 8481 df-er 8717 df-ec 8719 df-qs 8723 df-ni 10957 df-pli 10958 df-mi 10959 df-lti 10960 df-plpq 10993 df-mpq 10994 df-ltpq 10995 df-enq 10996 df-nq 10997 df-erq 10998 df-plq 10999 df-mq 11000 df-1nq 11001 df-rq 11002 df-ltnq 11003 df-np 11066 df-1p 11067 df-plp 11068 df-ltp 11070 df-enr 11140 df-nr 11141 df-plr 11142 df-0r 11145 df-1r 11146 df-m1r 11147 |
| This theorem is used by: pn0sr 11186 supsrlem 11196 axi2m1 11244 |
| Copyright terms: Public domain | W3C validator |