[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 21 from proof strengthen-recursive-node-property (previous step)

recursive-node-property(n, φn1), recursive-property(φn0, φe0) ⊦ recursive-node-property(n, λ r0, r1, H0, H1, map0, map1. φn0(r0, r1, H0, H1, map0, map1) ∧ φn1(r0, r1, H0, H1, map0, map1))

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 1:
⊦ recursive-node-property(n, φn) ↔ (∀ r0, r1, H1, map1. [H0 := H1; map0 := map1; copy_node#(r0; r1, map1, H1): n ] φn(r0, r1, H0, H1, map0, map1))

Rule argument

spec: inst: name:recursive-node-property seq: ⊦ recursive-node-property(n, φn) ↔ (∀ r0, r1, H1, map1. [H0 := H1; map0 := map1; copy_node#(r0; r1, map1, H1): n ] φn(r0, r1, H0, H1, map0, map1)) subst:[φn, n] → [λ r0, r1, H0, H1, map0, map1. φn0(r0, r1, H0, H1, map0, map1) ∧ φn1(r0, r1, H0, H1, map0, map1), n] flags:rewrite, current

Additional information

[Concretesimprules(()), Extraterms((λ r0, r1, H0, H1, map0, map1. φn0(r0, r1, H0, H1, map0, map1) ∧ φn1(r0, r1, H0, H1, map0, map1) n))]