[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 nodes-remove-ginval-notin (
previous step
)
⊦ nodes(gstore, ginval -- n) = nodes(gstore, ginval), n ∈ gstore
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
⊦ nodes(gstore, ginval -- n) = nodes(gstore, ginval), n ∈ gstore
Rule argument
Additional information