[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 (
previous step
)
gstore[n] = gblock, inv(gstore \ ginval), n ∈ gstore ⊦ inv(gblock), n ∈ ginval
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: ⊦ n ∈ gstore ∧ ¬ n ∈ ns ∧ inv(gstore \ ns) → inv(gstore[n]); (ss)