[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 replay-safe-split
⊦ replay-safe(log0 + log1, fs, ri) ↔ replay-safe(log0, fs, ri) ∧ replay-safe(log1, fs, replay-log(log0, fs, ri))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ss,
Comment:
Used by:
replay-cons-strong-append
,
Used by units in proved state:
aubifs-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
replay-log-rec
,
replay-safe-rec
,
replay-log-empty
,
replay-safe-empty
,
Used spec theorems:
Used simplifier rules:
list
/address-list-set/
Nil
list
/address-list-set/
a
list
/address-list-set/
c