| ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = mkls(tid, ival, (gs.queue = [] ⊃ Empty;Val(gs.queue.head)), value, optval) |
lstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (gs.queue = [] ⊃ Empty;Val(gs.queue.head)), value, optval) ⊦
| lstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (gs.queue = [] ⊃ Empty;Val(gs.queue.head)), value, optval) ⊦ |
⊦ queue = gs.queue ↔ gs = mkgs(queue)
gs = mkgs(queue), lstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦
Used terms: gs, queue
| ⊦ queue = gs.queue ↔ gs = mkgs(queue) |
| gs = mkgs(queue), lstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦ |
lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦
| lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦ |
⊦ lstepf(gs, ls, invDeq, ADoDeq(ls.tid)) = (gs.queue = [] ⊃ ls.oval:= Empty;ls.oval:= Val(gs.queue.head))
lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(mkls(tid, ival, oval, value, optval).tid)) = (mkgs(queue).queue = [] ⊃ mkls(tid, ival, oval, value, optval).oval:= Empty;mkls(tid, ival, oval, value, optval).oval:= Val(mkgs(queue).queue.head)), lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦
Used terms: mkgs(queue), mkls(tid, ival, oval, value, optval)
| ⊦ lstepf(gs, ls, invDeq, ADoDeq(ls.tid)) = (gs.queue = [] ⊃ ls.oval:= Empty;ls.oval:= Val(gs.queue.head)) |
| lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(mkls(tid, ival, oval, value, optval).tid)) = (mkgs(queue).queue = [] ⊃ mkls(tid, ival, oval, value, optval).oval:= Empty;mkls(tid, ival, oval, value, optval).oval:= Val(mkgs(queue).queue.head)), lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦ |
lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = (queue = [] ⊃ mkls(tid, ival, Empty, value, optval);mkls(tid, ival, Val(queue.head), value, optval)), lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦
Used simplifier rules: sel-mkls-dottid: ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; sel-mkgs-dotqueue: ⊦ mkgs(queue).queue = queue; upd-mkls-dotoval: ⊦ mkls(tid, ival, oval, ival0, oval0).oval:= oval1 = mkls(tid, ival, oval1, ival0, oval0);
| lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = (queue = [] ⊃ mkls(tid, ival, Empty, value, optval);mkls(tid, ival, Val(queue.head), value, optval)), lstepf(mkgs(queue), mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) ≠ mkls(tid, ival, (queue = [] ⊃ Empty;Val(queue.head)), value, optval) ⊦ |
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.