[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 23 from proof unchNorec-validrefs-pathex (previous step)

validrefs(str, r1 ' + refs1 + r0 ' + refs, ty, st), ∀ r. r = r1 ∨ r ∈ refs1 ∨ r = r0 ∨ r ∈ refs → unchangedNorec(r, st, st0) ⊦ validrefs(str, r1 ' + refs1 + r0 ', ty, st0), r0 = r1, validrefs(str, r1 ' + refs1 + r0 ', mkclasstype(`java.lang.Object' .class), st0)

User applied rule insert spec-lemma

And obtained the following new goals

Proof step 10:
⊦ ¬ validrefs(str, refs, ty, st) → ¬ validrefs(str, refs + refs0, ty, st)
Proof step 22:
¬ validrefs(str, r1 ' + refs1 + r0 ', ty, st) → ¬ validrefs(str, (r1 ' + refs1 + r0 ') + refs, ty, st), validrefs(str, r1 ' + refs1 + r0 ' + refs, ty, st), ∀ r. r = r1 ∨ r ∈ refs1 ∨ r = r0 ∨ r ∈ refs → unchangedNorec(r, st, st0) ⊦ validrefs(str, r1 ' + refs1 + r0 ', ty, st0), r0 = r1, validrefs(str, r1 ' + refs1 + r0 ', mkclasstype(`java.lang.Object' .class), st0)

Rule argument

[x0lemmaarg: spec-name: cyclic instance-name: lemma-name: validrefs-prefix antecedent: succedent: ¬ validrefs(str, refs, ty, st) → ¬ validrefs(str, refs + refs0, ty, st) substlist: [str, refs, ty, st, refs0] → [str, r1 ' + refs1 + r0 ', ty, st, refs] add preconditions?: F is rewrite lemma?: F current spec?: F rotate lemma?: F replace all?: F paths: () dummy: () ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (str, r1 ' + refs1 + r0 ', ty, st, refs)]]