[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 in-propagate (previous step)

copy-node-prepost(H0, H, map), r ∈ H0 ⊦ r ∈ H

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 1:
⊦ copy-node-prepost(H0, H, map) ↔ (∃ H1. H0 ∪ H1 = H ∧ H0 ⊥ H1 ∧ dom map ⊆ dom H0 ∧ ran map = dom H1 ∧ closed(H0) ∧ closed(H1) ∧ inj(map))

Rule argument

spec: inst: name:copy-node-prepost seq: ⊦ copy-node-prepost(H0, H, map) ↔ (∃ H1. H0 ∪ H1 = H ∧ H0 ⊥ H1 ∧ dom map ⊆ dom H0 ∧ ran map = dom H1 ∧ closed(H0) ∧ closed(H1) ∧ inj(map)) subst:[map, H, H0] → [map, H, H0] flags:rewrite, current

Additional information

[Concretesimprules((Csimpnamedseq(heap,node-heap,in-uni, ⊦ H0 ⊥ H1 → ( r ∈ H0 ∪ H1 ↔ ¬ ¬(r ∈ H0 ∨ r ∈ H1))))), Extraterms((mapHH0))]