[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 pendingOk-prop-FO
⊦ pendingOk(bq, pq) ∧ isPropFO(n, l, bq(t)) → pendingOk(bq(t := bq(t) -p n), pq(l := pq(l) + FO(t) '))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
FLIT-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
isPropFO-restrict-delpos
,
pendingOk
,
Used spec theorems:
list-data
/
le-one
Used simplifier rules:
nat-basic
/
c
nat-basic
/
a
list-data
/
l
nat-basic
/
one-03
nat-basic
/
one
nat
/
le-def
list
/
a
list
/
app
FLITPSC-preds
/
filter-W-one-fo
FLITPSC-preds
/
filter-W-append
nat
/
one-02
nat-basic
/
one-04
nat-basic
/
one-05
list-data
/
lf-01
list
/
c
nat
/
lels-02
nat-basic
/
one-01
list
/
e