[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 prefix-subseteq-dom-nodes-rev (conclusion)
⊦ st0 ⊑ st1 → (dom nodes(st1) ⊆ dom nodes(st0) ↔ dom nodes(st1) = dom nodes(st0))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
st0 ⊑ st1 ⊦ dom nodes(st1) ⊆ dom nodes(st0) ↔ dom nodes(st1) = dom nodes(st0)
Rule argument
Additional information