[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 27 from proof transitivity (previous step)

datakey(ino1, ino2) < key1, key1.ino ≤ ino, ino < ino1 ∨ ino = ino1 ∧ ino0 < ino2 ⊦ key1.data? ∧ ino = key1.ino ∧ ino0 < key1.part

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 28:
⊦ datakey(ino, n) < key ↔ ino < key.ino ∨ key.data? ∧ ino = key.ino ∧ n < key.part
Proof step 29:
key1.ino ≤ ino, ino < ino1 ∨ ino = ino1 ∧ ino0 < ino2, ino1 < key1.ino ∨ key1.data? ∧ ino1 = key1.ino ∧ ino2 < key1.part ⊦ key1.data? ∧ ino = key1.ino ∧ ino0 < key1.part

Rule argument

spec: key-order-def name: datakey-less seq: ⊦ datakey(ino, n) < key ↔ ino < key.ino ∨ key.data? ∧ ino = key.ino ∧ n < key.part subst: [key, n, ino] → [key1, ino2, ino1] flags: <all paths>

Additional information

Used terms: key1, ino2, ino1