[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 4 from proof rem-write-other (
previous step
)
a ∈ s ⊦ s = ∅, ∀ a0. (a0 ∈ st[a, d] \ s ↔ a0 ∈ st \ s) ∧ (st[a, d] \ s)[a0] = (st \ s)[a0], # s = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 5
:
a ∈ s ⊦ s = ∅, # s = 0, (a0 ∈ st[a, d] \ s ↔ a0 ∈ st \ s) ∧ (st[a, d] \ s)[a0] = (st \ s)[a0]
Rule argument
Additional information