[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 16 from proof subset-put-01 (
previous step
)
(∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a]) ∧ ¬ a ∈ st, a0 ∈ st ⊦ a0 = a, a0 ∈ st0 ∧ st[a0] = st0[a0]
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 17
:
a0 ∈ st, ∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a] ⊦ a ∈ st, a0 ∈ st0 ∧ st[a0] = st0[a0]
Rule argument
Additional information