![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > m1p1sr | GIF version |
Description: Minus one plus one is zero for signed reals. (Contributed by NM, 5-May-1996.) |
Ref | Expression |
---|---|
m1p1sr | ⊢ (-1R +R 1R) = 0R |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-m1r 7761 | . . 3 ⊢ -1R = [〈1P, (1P +P 1P)〉] ~R | |
2 | df-1r 7760 | . . 3 ⊢ 1R = [〈(1P +P 1P), 1P〉] ~R | |
3 | 1, 2 | oveq12i 5907 | . 2 ⊢ (-1R +R 1R) = ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) |
4 | df-0r 7759 | . . 3 ⊢ 0R = [〈1P, 1P〉] ~R | |
5 | 1pr 7582 | . . . . 5 ⊢ 1P ∈ P | |
6 | addclpr 7565 | . . . . . 6 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P) | |
7 | 5, 5, 6 | mp2an 426 | . . . . 5 ⊢ (1P +P 1P) ∈ P |
8 | addsrpr 7773 | . . . . 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 427 | . . . 4 ⊢ ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R |
10 | addassprg 7607 | . . . . . . 7 ⊢ ((1P ∈ P ∧ 1P ∈ P ∧ 1P ∈ P) → ((1P +P 1P) +P 1P) = (1P +P (1P +P 1P))) | |
11 | 5, 5, 5, 10 | mp3an 1348 | . . . . . 6 ⊢ ((1P +P 1P) +P 1P) = (1P +P (1P +P 1P)) |
12 | 11 | oveq2i 5906 | . . . . 5 ⊢ (1P +P ((1P +P 1P) +P 1P)) = (1P +P (1P +P (1P +P 1P))) |
13 | addclpr 7565 | . . . . . . 7 ⊢ ((1P ∈ P ∧ (1P +P 1P) ∈ P) → (1P +P (1P +P 1P)) ∈ P) | |
14 | 5, 7, 13 | mp2an 426 | . . . . . 6 ⊢ (1P +P (1P +P 1P)) ∈ P |
15 | addclpr 7565 | . . . . . . 7 ⊢ (((1P +P 1P) ∈ P ∧ 1P ∈ P) → ((1P +P 1P) +P 1P) ∈ P) | |
16 | 7, 5, 15 | mp2an 426 | . . . . . 6 ⊢ ((1P +P 1P) +P 1P) ∈ P |
17 | enreceq 7764 | . . . . . 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))))) | |
18 | 5, 5, 14, 16, 17 | mp4an 427 | . . . . 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)))) |
19 | 12, 18 | mpbir 146 | . . . 4 ⊢ [〈1P, 1P〉] ~R = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R |
20 | 9, 19 | eqtr4i 2213 | . . 3 ⊢ ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) = [〈1P, 1P〉] ~R |
21 | 4, 20 | eqtr4i 2213 | . 2 ⊢ 0R = ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) |
22 | 3, 21 | eqtr4i 2213 | 1 ⊢ (-1R +R 1R) = 0R |
Colors of variables: wff set class |
Syntax hints: ↔ wb 105 = wceq 1364 ∈ wcel 2160 〈cop 3610 (class class class)co 5895 [cec 6556 Pcnp 7319 1Pc1p 7320 +P cpp 7321 ~R cer 7324 0Rc0r 7326 1Rc1r 7327 -1Rcm1r 7328 +R cplr 7329 |
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-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-iinf 4605 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-eprel 4307 df-id 4311 df-po 4314 df-iso 4315 df-iord 4384 df-on 4386 df-suc 4389 df-iom 4608 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-ov 5898 df-oprab 5899 df-mpo 5900 df-1st 6164 df-2nd 6165 df-recs 6329 df-irdg 6394 df-1o 6440 df-2o 6441 df-oadd 6444 df-omul 6445 df-er 6558 df-ec 6560 df-qs 6564 df-ni 7332 df-pli 7333 df-mi 7334 df-lti 7335 df-plpq 7372 df-mpq 7373 df-enq 7375 df-nqqs 7376 df-plqqs 7377 df-mqqs 7378 df-1nqqs 7379 df-rq 7380 df-ltnqqs 7381 df-enq0 7452 df-nq0 7453 df-0nq0 7454 df-plq0 7455 df-mq0 7456 df-inp 7494 df-i1p 7495 df-iplp 7496 df-enr 7754 df-nr 7755 df-plr 7756 df-0r 7759 df-1r 7760 df-m1r 7761 |
This theorem is referenced by: pn0sr 7799 ltm1sr 7805 caucvgsrlemoffres 7828 caucvgsr 7830 suplocsrlempr 7835 axi2m1 7903 |
Copyright terms: Public domain | W3C validator |