[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 bitflip-cons-set-used
⊦ bflipset-cons(bflipset, wlar) → bflipset-cons(bflipset, wlar[m, wl-entry(n, used)])
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 13
Used lemmas:
bflipset-cons
,
Used spec theorems:
Used simplifier rules:
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
array
/wlarray-base/
Size-put
wlentry
/
elim-02
array
/wlarray-base/
Put-same
wlentry
/
inj-03
nat
/
le-ls-simp
array
/wlarray-base/
Put-other
nat
/
lels
nat-basic
/
f
wlentry
/
sel-04