[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 17 from proof log-cons-copy-new (previous step)

# kx1 = # ax1, # kx = # ax0, key0 ∈ ri, kx1.toSet ⊆ dom ri, kx.toSet ⊆ dom ri, ∀ key. key ∈ ri → ri[key] ∈ fs ∧ key-cons(key, fs[ri[key]]) ⊦ dups(ax0), dups(ax1), dups(ax1 + ax0), dups(kx1 + kx), dups(kx1), dups(kx), key-cons(fs[ri[key0]].key, fs[ri[key0]]), node-cons(fs[ri[key0]].key, fs[ri[key0]]), adr ∈ ax0, adr ∈ ax1, key0 ∈ kx1, key0 ∈ kx

User applied rule all left

And obtained the following new goals

Proof step 18:
# kx = # ax0, # kx1 = # ax1, key0 ∈ ri, kx.toSet ⊆ dom ri, kx1.toSet ⊆ dom ri, key0 ∈ ri → ri[key0] ∈ fs ∧ key-cons(key0, fs[ri[key0]]) ⊦ dups(kx), dups(kx1), dups(kx1 + kx), dups(ax1 + ax0), dups(ax1), dups(ax0), key-cons(fs[ri[key0]].key, fs[ri[key0]]), node-cons(fs[ri[key0]].key, fs[ri[key0]]), key0 ∈ kx, key0 ∈ kx1, adr ∈ ax1, adr ∈ ax0

Rule argument

pos: left 6 terms: key0 abort: F discard: T computed: T

Additional information

Used terms: key0