[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 5 from proof inv-orphans-insert (
previous step
)
key.inode?, ro.inodes?, fo.inodes?, log-cons(log, fs), ri-inj(ri), ri-inj(fi) ⊦ ⟪ro := ro ++ key⟫ ro.inodes?
Heuristic symbolic execution applied rule assign right
And closed the goal!
Rule argument
Additional information
Used simplifier rules: ⊦ ks.inodes? → ((ks ++ key).inodes? ↔ key.inode?); (s)