[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 remove-refsize0-refsize-cons (conclusion)
⊦ as ⊆ dom nodes(st) ∧ refsize-cons(st, as) ∧ inv(st) → as ⊆ dom nodes(remove-refsize0(st))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
inv(st), refsize-cons(st, as), as ⊆ dom nodes(st) ⊦ as ⊆ dom nodes(remove-refsize0(st))
Rule argument
Additional information