[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 B-postfix-weak-one
⊦ be ' ⊒w be0 ' + bel ↔ be0 = be ∧ bel = []
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
B-postfix-weak-one-ws
,
Used by units in proved state:
FLIT-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 27
Used lemmas:
B-restrict-SF-l
,
B-postfix-weak
,
Used spec theorems:
list-last
/
postfix
Used simplifier rules:
list-last
/
postfix-reflexivity
filter-count
/
filter-one
list
/
a
list
/
app
filter-count
/
filter-rec
filter-count
/
filter-base
list
/
c-05
list-last
/
postfix-empty
list-last
/
postfix-empty-03
list
/
e
list
/
app-02
list
/
c
list
/
eq-04
list
/
Nil