[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-queue-notin (conclusion)
⊦ ¬ v ∈ vols → (abs(avols, apebs, vols, q + eq-entry(n, v × m) ') ↔ abs(avols, apebs, vols, q))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
⊦ abs(avols, apebs, vols, q + eq-entry(n, v × m) ') ↔ abs(avols, apebs, vols, q), v ∈ vols
Rule argument
Additional information