[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 60 from proof prepost-remove-nonend-blocks (previous step)

# lax0 + 1 = # gndx1 + # gndx, gndx1.last = mkgnode(nd, m0, boolvar, false), gstore2[n] = groupblock(gndx1 + gndx, ladr ' + lax0, m), prefixn(# gndx1, ladr ' + lax0) = [], valid-group-nodes(gndx1) = valid-group-nodes(gndx1 + gndx), inv(gstore2 \ ginval), inv(groupblock(gndx1 + gndx, ladr ' + lax0, m)), n ∈ gstore2 ⊦ gndx1 = [], n ∈ ginval

User applied rule constructor cut

And closed the goal!

Rule argument

var: gndx1

Additional information

Used simplifier rules: group-node-list freely generated by [], +;;% ⊦ gnd + gndx = gnd ' + gndx; (s)%a: ⊦ (gndx + gndx0) + gndx1 = gndx + gndx0 + gndx1; from specification list[group-store]% ⊦ #(gnd ' + gndx) = (# gndx)+1; (s)% ⊦ m +1 = m + 1; (s)% ⊦ prefixn(n + 1, ladr ' + lax) = ladr ' + prefixn(n, lax); (s)%a: ⊦ (lax + lax0) + lax1 = lax + lax0 + lax1; from specification list[laddress-list]%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ lax + lax0 = [] ↔ lax = [] ∧ lax0 = []; (as)% ⊦ ladr ' ≠ []; (s)