[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 1 from proof lpt-ram-flash-write-log (conclusion)
n < # lpt ⊦ n ∈ nx → (lpt-ram-flash(lpt[n, lp], lpt0, nx) ↔ lpt-ram-flash(lpt, lpt0, nx))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n < # lpt, n ∈ nx ⊦ lpt-ram-flash(lpt[n, lp], lpt0, nx) ↔ lpt-ram-flash(lpt, lpt0, nx)
Rule argument
Additional information