[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 28 from proof nouninit-addarrays (previous step)

¬ # newref_list(i→n(countrefs(ints)), st) ≠ # (r ' + refs), newref_list(i→n(countrefs(ints)), st) = r ' + refs, 0 ≤ i, posints(ints), class ∈ claset, jvmref -- mkfs(class, void_type, `initstate' .field) ' ∈ addarrays(r ' + refs, ty, ints, i, st) ∧ (addarrays(r ' + refs, ty, ints, i, st)[jvmref -- mkfs(class, void_type, `initstate' .field) ']) = initval(undone) ∨ ¬ jvmref -- mkfs(class, void_type, `initstate' .field) ' ∈ addarrays(r ' + refs, ty, ints, i, st) ∧ _uninit ∈ addarrays(r ' + refs, ty, ints, i, st) ⊦ claset = ∅, ints = [], # claset = 0, jvmref = r, initundone(class, st), 1 + # refs = i→n(countrefs(ints)) ∧ ¬ jvmref ∈ refs

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ jvmref ∈ refs → newref_list(n, st) ≠ r ' + refs], [CSIMPSEQ : ⊦ (refs + refs0) + refs1 = refs + refs0 + refs1], [CSIMPSEQ : ⊦ # r ' = 0 +1], [CSIMPSEQ : ⊦ # (refs + refs0) = # refs + # refs0], [CSIMPSEQ : ⊦ # newref_list(n, st) = n])]]