[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 5 from proof subset-notin (
previous step
)
r -- sk ∈ st, r ∈ st, ∀ rk. rk ∈ st → rk ∈ st0 ∧ st[rk] = st0[rk] ⊦ r ∈ st0
Heuristic quantifier closing applied rule all left
And obtained the following new goals
Proof step 4
:
⊦ r -- sk ∈ st → r ∈ st
Rule argument
[EXRARG : pos: left 3, [QUANTTERMLIST : (r -- sk)]]
Additional information
[[CONCRETESIMPRULES : ()], [EXTRATERMS : (r -- sk)]]