[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 13 from proof size-0 (previous step)

(range ri | m).size = 0, ri[key] = @(m, m0, m1), inv(gstore \ ginval), key ∈ ri, ∀ key0. key0 ∈ ri → ri[key0] ∈ gstore ↓ ∧ ¬ ri[key0].lnum ∈ ginval ∧ key-cons(key0, nodes(gstore ↓, ginval)[ri[key0]]) ⊦

User applied rule all left

And obtained the following new goals

Proof step 14:
(range ri | m).size = 0, ri[key] = @(m, m0, m1), inv(gstore \ ginval), key ∈ ri, key ∈ ri → ri[key] ∈ gstore ↓ ∧ ¬ ri[key].lnum ∈ ginval ∧ key-cons(key, nodes(gstore ↓, ginval)[ri[key]]) ⊦

Rule argument

pos: left 5 terms: key abort: F discard: T computed: T

Additional information

Used terms: key