[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 33 from proof nonnullrefs-dups (previous step)

vals0[m1] = refval(r), (refval(r0) ' + vals0)[n] = refval(r), m1 < # vals0, n ≤ # vals0 ⊦ r = jvmref, m1 + 1 = n, r0 = jvmref, vals0 = [], dups(vals0 .nonnullrefs), r0 ∈ vals0 .nonnullrefs, ∃ r1, m0, n0. vals0[m0] = refval(r1) ∧ vals0[n0] = refval(r1) ∧ r1 ≠ jvmref ∧ m0 ≠ n0 ∧ ¬ # vals0 ≤ m0 ∧ ¬ # vals0 ≤ n0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 23:
n ≠ 0 ⊦ (val ' + vals)[(* n)] = vals[n -1]
Proof step 28:
¬ n ≠ 0, vals0[m1] = refval(r), (refval(r0) ' + vals0)[n] = refval(r), m1 < # vals0, n ≤ # vals0 ⊦ r = jvmref, m1 + 1 = n, r0 = jvmref, vals0 = [], dups(vals0 .nonnullrefs), r0 ∈ vals0 .nonnullrefs, ∃ r1, m0, n0. vals0[m0] = refval(r1) ∧ vals0[n0] = refval(r1) ∧ r1 ≠ jvmref ∧ m0 ≠ n0 ∧ ¬ # vals0 ≤ m0 ∧ ¬ # vals0 ≤ n0
Proof step 32:
n ≠ 0, vals0[m1] = refval(r), vals0[n -1] = refval(r), m1 < # vals0, n ≤ # vals0 ⊦ r = jvmref, m1 + 1 = n, r0 = jvmref, vals0 = [], dups(vals0 .nonnullrefs), r0 ∈ vals0 .nonnullrefs, ∃ r1, m0, n0. vals0[m0] = refval(r1) ∧ vals0[n0] = refval(r1) ∧ r1 ≠ jvmref ∧ m0 ≠ n0 ∧ ¬ # vals0 ≤ m0 ∧ ¬ # vals0 ≤ n0

Rule argument

[x0lemmaarg: spec-name: list-del instance-name: javavalues lemma-name: get-numrec antecedent: n ≠ 0 succedent: (val ' + vals)[(* n)] = vals[n -1] substlist: [n, vals, val] → [n, vals0, refval(r0)] add preconditions?: F is rewrite lemma?: T current spec?: F rotate lemma?: F replace all?: T paths: ((0, 0, 1)) dummy: () ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (n, vals0, refval(r0))]]