[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 2 from proof abs-neg (
previous step
)
⊦ abs(0 - i) = abs(i)
Heuristic elimination applied rule insert elim lemma
And obtained the following new goals
Proof step 3
:
⊦ i0 = i - j ↔ i = i0 + j
Proof step 4
:
0 = i0 + i ⊦ abs(i0) = abs(i)
Rule argument
spec: int-abs inst: name: elim-sub seq: ⊦ i0 = i - j ↔ i = i0 + j subst: [i, j, i0] → [0, i, i0] flags: rewrite, current
Additional information
Used terms: 0, i, i0