[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-W-in-delpos
⊦ isPropFO(n, l, bel) → (W(l, v) ∈ bel -p n ↔ W(l, v) ∈ bel)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
FLIT-refines-FLITPSCweak
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 26
Used lemmas:
isPropFO-def
,
Used spec theorems:
list-del
/
in-get
Used simplifier rules:
list-data
/
l
nat-basic
/
f
list-del
/
rmpos-get
nat-basic
/
a
nat-basic
/
c
nat
/
ls
list-del
/
delpos-empty
nat-basic
/
one-01
nat
/
le-def
list-del
/
rmpos-size
nat-basic
/
succ
nat-basic
/
trans-Nat
nat-basic
/
lf
nat
/
lels
Bevent
/
inj-W
nat
/
eqle-one
nat-basic
/
lf-01
nat-basic
/
oz
nat
/
les
nat
/
ls-le-simp
nat
/
fle-01
nat
/
le-ls-simp
nat-basic
/
s-04
nat
/
leprf
nat
/
let
nat
/
lez-01
nat-basic
/
one
nat-basic
/
lf-02
nat
/
fle
list-getput
/
get-zero-01
nat
/
lez
nat-basic
/
zero
nat-basic
/
less-zero
Bevent
/
disj-W-FO
nat-basic
/
ls-02
nat
/
ls-01
nat-basic
/
refl-Nat
nat
/
lep-02
nat
/
elim-pred-c
nat
/
add-01
nat-basic
/
add-base