[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
,
Proof step 13 from proof log-cons-drop (
previous step
)
log.toSet ∩ as = ∅, adr ∈ log, ∀ adr. adr ∈ log → adr ∈ fs ∧ node-cons(fs[adr].key, fs[adr]) ⊦ adr ∈ as, adr ∈ fs ∧ node-cons(fs[adr].key, fs[adr])
User applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: adr abort: F discard: T computed: T
Additional information
Used terms: adr