[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 3 from proof abssub-05 (
previous step
)
j < i0 ⊦ abs(i - j) + j = i, i + 1 < i0
Heuristic elimination applied rule insert elim lemma
And obtained the following new goals
Proof step 4
:
⊦ i0 = i - j ↔ i = i0 + j
Proof step 5
:
i = i1 + j, j < i0 ⊦ abs(i1) + j = i, i + 1 < i0
Rule argument
spec: int-abs inst: name: elim-sub seq: ⊦ i0 = i - j ↔ i = i0 + j subst: [i, j, i0] → [i, j, i1] flags: rewrite, current
Additional information
Used terms: i, j, i1