[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 indef (
previous step
)
∀ a0. (a0 ∈ st ↔ a0 ∈ st[a, st[a]]) ∧ st[a0] = st[a, st[a]][a0] ⊦ a ∈ st
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
∀ a0. (a0 ∈ st ↔ a0 ∈ st[a, st[a]]) ∧ st[a0] = st[a, st[a]][a0] ⊦ a ∈ st
Rule argument
Additional information