[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 1 from proof abs-fwd (conclusion)
⊦ n < # pebs ∧ pebs[n] = peb ∧ abs(pebs, apebs) → n < # apebs ∧ abs-peb(peb, apebs[n])
System applied rule normalize
And obtained the following new goals
Proof step 2
:
pebs[n] = peb, n < # pebs, abs(pebs, apebs) ⊦ n < # apebs ∧ abs-peb(peb, apebs[n])
Rule argument
Additional information