[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 20 from proof nodes-append-subseteq-nodown (previous step)

# gndx1 = # lax1, # gndx = # lax, gstore[n] = groupblock(gndx, lax, m0), gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)][m] = groupblock(gndx2, lax2, m4), gndx0[pos(@(m1, m2), lax0)] = mkgnode(nd, m5, boolvar, boolvar0), gstore[m] ↓ = groupblock(gndx0, lax0, m3), m ∈ gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)], @(m1, m2) ∈ lax0, m ∈ gstore, n ∈ gstore ⊦ m ∈ ginval, nd = nodes(gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)], ginval)[@(m, m1, m2)] ∧ @(m1, m2) ∈ lax2

Heuristic weak cut applied rule cut formula

And obtained the following new goals

Proof step 21:
# gndx = # lax, # gndx1 = # lax1, gndx0[pos(@(m1, m2), lax0)] = mkgnode(nd, m5, boolvar, boolvar0), gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)][m] = groupblock(gndx2, lax2, m4), gstore[n] = groupblock(gndx, lax, m0), m = n, gstore[m] ↓ = groupblock(gndx0, lax0, m3), n ∈ gstore, m ∈ gstore, @(m1, m2) ∈ lax0, m ∈ gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)] ⊦ m ∈ ginval, nd = nodes(gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)], ginval)[@(m, m1, m2)] ∧ @(m1, m2) ∈ lax2
Proof step 31:
# gndx = # lax, # gndx1 = # lax1, gndx0[pos(@(m1, m2), lax0)] = mkgnode(nd, m5, boolvar, boolvar0), gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)][m] = groupblock(gndx2, lax2, m4), gstore[n] = groupblock(gndx, lax, m0), gstore[m] ↓ = groupblock(gndx0, lax0, m3), n ∈ gstore, m ∈ gstore, @(m1, m2) ∈ lax0, m ∈ gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)] ⊦ m = n, m ∈ ginval, nd = nodes(gstore ↓[n, groupblock(gndx + gndx1, lax + lax1, m0)], ginval)[@(m, m1, m2)] ∧ @(m1, m2) ∈ lax2

Rule argument

fma: m = n

Additional information

Used formulas: m = n