[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 same-used
⊦ same-used(wlar0, wlar1) ↔ # wlar0 = # wlar1 ∧ (∀ n. n < # wlar0 → (wlar0[n].status = used ↔ wlar1[n].status = used))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
same-used-extract
,
same-used-idexpt
,
same-used-same
,
same-used2-idexpt
,
Used by units in proved state:
Proof exists?: No