[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 abs-apply-persist-FO
⊦ fowl[n].FO? ∧ n < # fowl → v ⊕ (fowl -p n) = v ⊕ fowl
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 13
Used lemmas:
Used spec theorems:
FOW
/
ex-dotFOque
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat
/
lels
list
/
c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
nat-basic
/
succ
list
/
len-05
FLITPSC-preds
/
oplus-v-append
list
/
e
list
/
app-02
list-del
/
get-zero
nat
/
lez
list-del
/
delpos-base
FLITPSC-preds
/
oplus-v-one-FO
FLITPSC-preds
/
oplus-same-writes-eq
list-del
/
get-succ
nat
/
succ-01
list-del
/
delpos-rec
FLITPSC-preds
/
oplus-v-one-W