[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 2 from proof iter-mod (conclusion)

⊦ a ∈ st → iter st[a, d] = iter st

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 1:
⊦ iter st0 = iter st1 ↔ dom st0 = dom st1

Rule argument

Additional information

[Concretesimprules((Csimpnamedseq(iter-eq,,, ⊦ iter st0 = iter st1 ↔ dom st0 = dom st1) Csimpseq( ⊦ a ∈ dom st ↔ a ∈ st) Csimpseq( ⊦ s ++ a = s ↔ a ∈ s) Csimpseq( ⊦ dom st[a, d] = dom st ++ a)))]