![]() |
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 6972 | . . 3 ⊢ -1R = [〈1P, (1P +P 1P)〉] ~R | |
2 | df-1r 6971 | . . 3 ⊢ 1R = [〈(1P +P 1P), 1P〉] ~R | |
3 | 1, 2 | oveq12i 5555 | . 2 ⊢ (-1R +R 1R) = ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) |
4 | df-0r 6970 | . . 3 ⊢ 0R = [〈1P, 1P〉] ~R | |
5 | 1pr 6806 | . . . . 5 ⊢ 1P ∈ P | |
6 | addclpr 6789 | . . . . . 6 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P) | |
7 | 5, 5, 6 | mp2an 417 | . . . . 5 ⊢ (1P +P 1P) ∈ P |
8 | addsrpr 6984 | . . . . 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 418 | . . . 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 6831 | . . . . . . 7 ⊢ ((1P ∈ P ∧ 1P ∈ P ∧ 1P ∈ P) → ((1P +P 1P) +P 1P) = (1P +P (1P +P 1P))) | |
11 | 5, 5, 5, 10 | mp3an 1269 | . . . . . 6 ⊢ ((1P +P 1P) +P 1P) = (1P +P (1P +P 1P)) |
12 | 11 | oveq2i 5554 | . . . . 5 ⊢ (1P +P ((1P +P 1P) +P 1P)) = (1P +P (1P +P (1P +P 1P))) |
13 | addclpr 6789 | . . . . . . 7 ⊢ ((1P ∈ P ∧ (1P +P 1P) ∈ P) → (1P +P (1P +P 1P)) ∈ P) | |
14 | 5, 7, 13 | mp2an 417 | . . . . . 6 ⊢ (1P +P (1P +P 1P)) ∈ P |
15 | addclpr 6789 | . . . . . . 7 ⊢ (((1P +P 1P) ∈ P ∧ 1P ∈ P) → ((1P +P 1P) +P 1P) ∈ P) | |
16 | 7, 5, 15 | mp2an 417 | . . . . . 6 ⊢ ((1P +P 1P) +P 1P) ∈ P |
17 | enreceq 6975 | . . . . . 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 418 | . . . . 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 144 | . . . 4 ⊢ [〈1P, 1P〉] ~R = [〈(1P +P (1P +P 1P)), ((1P +P 1P) +P 1P)〉] ~R |
20 | 9, 19 | eqtr4i 2105 | . . 3 ⊢ ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) = [〈1P, 1P〉] ~R |
21 | 4, 20 | eqtr4i 2105 | . 2 ⊢ 0R = ([〈1P, (1P +P 1P)〉] ~R +R [〈(1P +P 1P), 1P〉] ~R ) |
22 | 3, 21 | eqtr4i 2105 | 1 ⊢ (-1R +R 1R) = 0R |
Colors of variables: wff set class |
Syntax hints: ↔ wb 103 = wceq 1285 ∈ wcel 1434 〈cop 3409 (class class class)co 5543 [cec 6170 Pcnp 6543 1Pc1p 6544 +P cpp 6545 ~R cer 6548 0Rc0r 6550 1Rc1r 6551 -1Rcm1r 6552 +R cplr 6553 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-13 1445 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2064 ax-coll 3901 ax-sep 3904 ax-nul 3912 ax-pow 3956 ax-pr 3972 ax-un 4196 ax-setind 4288 ax-iinf 4337 |
This theorem depends on definitions: df-bi 115 df-dc 777 df-3or 921 df-3an 922 df-tru 1288 df-fal 1291 df-nf 1391 df-sb 1687 df-eu 1945 df-mo 1946 df-clab 2069 df-cleq 2075 df-clel 2078 df-nfc 2209 df-ne 2247 df-ral 2354 df-rex 2355 df-reu 2356 df-rab 2358 df-v 2604 df-sbc 2817 df-csb 2910 df-dif 2976 df-un 2978 df-in 2980 df-ss 2987 df-nul 3259 df-pw 3392 df-sn 3412 df-pr 3413 df-op 3415 df-uni 3610 df-int 3645 df-iun 3688 df-br 3794 df-opab 3848 df-mpt 3849 df-tr 3884 df-eprel 4052 df-id 4056 df-po 4059 df-iso 4060 df-iord 4129 df-on 4131 df-suc 4134 df-iom 4340 df-xp 4377 df-rel 4378 df-cnv 4379 df-co 4380 df-dm 4381 df-rn 4382 df-res 4383 df-ima 4384 df-iota 4897 df-fun 4934 df-fn 4935 df-f 4936 df-f1 4937 df-fo 4938 df-f1o 4939 df-fv 4940 df-ov 5546 df-oprab 5547 df-mpt2 5548 df-1st 5798 df-2nd 5799 df-recs 5954 df-irdg 6019 df-1o 6065 df-2o 6066 df-oadd 6069 df-omul 6070 df-er 6172 df-ec 6174 df-qs 6178 df-ni 6556 df-pli 6557 df-mi 6558 df-lti 6559 df-plpq 6596 df-mpq 6597 df-enq 6599 df-nqqs 6600 df-plqqs 6601 df-mqqs 6602 df-1nqqs 6603 df-rq 6604 df-ltnqqs 6605 df-enq0 6676 df-nq0 6677 df-0nq0 6678 df-plq0 6679 df-mq0 6680 df-inp 6718 df-i1p 6719 df-iplp 6720 df-enr 6965 df-nr 6966 df-plr 6967 df-0r 6970 df-1r 6971 df-m1r 6972 |
This theorem is referenced by: pn0sr 7010 caucvgsrlemoffres 7038 caucvgsr 7040 axi2m1 7103 |
Copyright terms: Public domain | W3C validator |