[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 isPropFO-delpos-eq-delfirst
⊦ isPropFO(n, l, bel) → bel -1l FO(l) = bel -p n
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
reorder-del-other-propFO
,
reorder-step-read-propFO
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
Used spec theorems:
FLIT-preds
/
isPropFO-def
list-del
/
del1-n
Used simplifier rules:
list-data
/
l
nat-basic
/
f
list
/
c
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
nat-basic
/
succ
list
/
len-05
list
/
e
list
/
app-02
list-del
/
get-zero
list-del
/
delpos-base
nat
/
lez
nat-basic
/
less-zero
list-del
/
del1-y
nat
/
succ-01
list-del
/
delpos-rec
list-del
/
get-succ
Bevent
/
disj-FO-SF
Bevent
/
test-dotWque-FO
Bevent
/
test-dotFOque-FO
Bevent
/
sel-FO-dotl
list
/
len-01
nat-basic
/
trans-Nat
nat-basic
/
lf