[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 bflipset-cons
⊦ bflipset-cons(bflipset, wlar) ↔ (∀ n. n ∈ bflipset → n < # wlar ∧ wlar[n].status = used)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
bflipset-subarray-add
,
bflipset-subarray-erase-old
,
bflipset-subarray-erase-old-add
,
bflipset-subarray-next
,
bitflip-cons-add
,
bitflip-cons-del
,
bitflip-cons-set
,
bitflip-cons-set-used
,
bitflips-cons-empty
,
bitflips-cons-in
,
Used by units in proved state:
ubi-asm
,
Proof exists?: No