[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 1 from proof exlsf-tidok (conclusion) (back to tree)

⊦ ∃ lsf. ∀ tid. lsf(tid).tid = tid

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∀ tid. ∃ ls. ls.tid = tid

Additional information

Used formulas: ∀ tid. ∃ ls. ls.tid = tid

Proof step 2 from proof exlsf-tidok (previous step) (back to tree)

∀ tid. ∃ ls. ls.tid = tid ⊦ ∃ lsf. ∀ tid. lsf(tid).tid = tid

User applied rule choice left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 3 from proof exlsf-tidok (previous step) (back to tree)

∀ tid0. lsf(tid0).tid = tid0 ⊦ ∃ lsf. ∀ tid. lsf(tid).tid = tid

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: lsf abort: F discard: T computed: T

Additional information

Used terms: lsf

Proof step 4 from proof exlsf-tidok (previous step) (back to tree)

∀ tid0. lsf(tid0).tid = tid0 ⊦ ∀ tid. lsf(tid).tid = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof exlsf-tidok (previous step) (back to tree)

lsf(tid).tid ≠ tid, ∀ tid0. lsf(tid0).tid = tid0 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [val, vhead1, optval0, vhead, nd, lsf(tid), addr, tid1, vhead0, vhead2, rvref, tid2, obsEmpty, optval]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, lsf(tid), addr, tid1, lst, first, rvref, othertid, success, optval

Proof step 6 from proof exlsf-tidok (previous step) (back to tree)

lsf(tid) = mkls(tid1, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid2, addr), tid1 ≠ tid, ∀ tid0. lsf(tid0).tid = tid0 ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) Used terms: tid

Proof step 7 from proof exlsf-tidok (previous step) (back to tree)

⊦ ∀ tid. ∃ ls. ls.tid = tid, ∃ lsf. ∀ tid. lsf(tid).tid = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof exlsf-tidok (previous step) (back to tree)

⊦ ∃ lsf. ∀ tid. lsf(tid).tid = tid, ∃ ls. ls.tid = tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:exls-tidok, seq: ⊦ ∃ ls. ls.tid = tid, subst:[tid] → [tid]

Additional information

Used terms: tid

Proof step 9 from proof exlsf-tidok (previous step) (back to tree)

⊦ ∃ ls. ls.tid = tid

Lemma exls-tidok

Proof Tree for exlsf-tidok (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree