[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 2 from proof fwd-inv-gblock-rem-del (
previous step
)
gstore[n] = gblock, inv(gstore \ (ginval -- n)), n ∈ gstore ⊦ inv(gblock)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
inv(gstore \ (ginval -- n)), n ∈ gstore ⊦ inv(gstore[n])
Rule argument
Additional information