[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 notin-down-eq-notin-down (conclusion)
⊦ nodes(gstore0 ↓, ginval) = fs ∧ ¬ adr ∈ gstore0 → ¬ adr ∈ fs
System applied rule normalize
And obtained the following new goals
Proof step 2
:
nodes(gstore0 ↓, ginval) = fs, adr ∈ fs ⊦ adr ∈ gstore0
Rule argument
Additional information