[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 ac-lookup-06 (previous step)

is_fskey(sk0), ∀ sk, class, st, r. sk = mkfs(class, void_type, `initstate' .field) ' ∨ (addclass(class, fis0, st)[r -- sk]) = st[r -- sk] ∨ sk ∈ fis0 ⊦ sk = mkfs(class, void_type, `initstate' .field) ', (addclass(class, (sk0 × val) ' + fis0, st)[r -- sk]) = st[r -- sk], sk = sk0, sk ∈ fis0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 3:
⊦ is_fskey(fv .1) ∧ fv .1 .fs .class ≠ class → addclass(class, fv ' + fis, st) = addclass(class, fis, st)
Proof step 10:
¬ (is_fskey((sk0 × val) .1) ∧ (sk0 × val) .1 .fs .class ≠ class), is_fskey(sk0), ∀ sk, class, st, r. sk = mkfs(class, void_type, `initstate' .field) ' ∨ (addclass(class, fis0, st)[r -- sk]) = st[r -- sk] ∨ sk ∈ fis0 ⊦ sk = mkfs(class, void_type, `initstate' .field) ', (addclass(class, (sk0 × val) ' + fis0, st)[r -- sk]) = st[r -- sk], sk = sk0, sk ∈ fis0
Proof step 16:
is_fskey((sk0 × val) .1) ∧ (sk0 × val) .1 .fs .class ≠ class, is_fskey(sk0), ∀ sk, class, st, r. sk = mkfs(class, void_type, `initstate' .field) ' ∨ (addclass(class, fis0, st)[r -- sk]) = st[r -- sk] ∨ sk ∈ fis0 ⊦ sk = mkfs(class, void_type, `initstate' .field) ', (addclass(class, fis0, st)[r -- sk]) = st[r -- sk], sk = sk0, sk ∈ fis0

Rule argument

[crewrite-arg: ac-no1 , F , [st, fis, fv, class] → [st, fis0, sk0 × val, class] ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (st, fis0, sk0 × val, class)]]