[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
,
Theorem vols-eraseq-bound
⊦ vols1⌈vols0, q0⌉ ↔ (∀ v, m. v ∈ vols0 ∧ v ∈ vols1 ∧ m < # vols0[v] ∧ m < # vols1[v] ∧ vols0[v][m] = unmapped ∧ vols1[v][m] ≠ unmapped → eq-entry(vols1[v][m].pnum, v × m) ∈ q0)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
Used by units in proved state:
ubi-refine
,
ubi-asm
,
Proof exists?: No