[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 38 from proof initialization (
previous step
)
psynced ↔ isdir, fs = fs1, ofh = ofh1, root = tree, ⌊err1⌋ ⊦ ∃ err. ⌊err⌋ ∧ ⟨err0 := err⟩ (tree = root ∧ fs1 = fs ∧ ofh1 = ofh ∧ (isdir ↔ psynced) ∧ err1 = err0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 39
:
⌊err1⌋ ⊦ ∃ err. ⌊err⌋ ∧ ⟨err0 := err⟩ (err1 = err0)
Rule argument
Additional information