[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 ubifs-log-nodups-add2
⊦ ubifs-cons(fs, ri, ro, fi, fo, log) ∧ ¬ adr0 ∈ fs ∧ ¬ adr1 ∈ fs ∧ adr0 ≠ adr1 → ¬ dups(log + adr0 ' + adr1 ')
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 7
Used lemmas:
log-cons
,
ri-closed
,
ri-cons
,
ubifs-cons
,
Used spec theorems:
Used simplifier rules:
list
/address-list-set/
a
list-dup
/address-list-set/
f
list-dup
/address-list-set/
l-01