[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 615 from proof NEWPARTS-theorem (previous step)

P = P0, DAid(A, D), ADid(A, D), nodups(A), split(P0, A, X), partitions(P0, # A), Fok(F, P0, # A), samepartitions(P0, A, P4, A4), length_of_P = # P, Pnew = [], Pdone = [], F1 = F ∧ P2 = P ⊦ ⟨while P2 ≠ [] do let p = P2.head in {P2 := P2.tail; if p.count ≠ 0 ∧ p.first + p.count ≤ p.last then Pdone := Pdone + pe(p.first, p.first + p.count -1, 0), Pnew := Pnew + pe(p.first + p.count, p.last, 0), F1 := F1[p.first + p.count, p.last, length_of_P + # Pnew] else Pdone := Pdone + p}⟩ ⟨P2 := Pdone + Pnew⟩ (partitions(P2, # A) ∧ divides(P2, P0, X, A) ∧ Fok(F1, P2, # A) ∧ partitionRefinement(P2, A, P4, A4, X))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 614:
length_of_P = # P0, Pnew = [], Pdone = [], P2 = P0, DAid(A, D), ADid(A, D), nodups(A), split(P0, A, X), partitions(P0, # A), Fok(F, P0, # A), samepartitions(P0, A, P4, A4) ⊦ ⟨while P2 ≠ [] do let p = P2.head in {P2 := P2.tail; if p.count ≠ 0 ∧ p.first + p.count ≤ p.last then Pdone := Pdone + pe(p.first, p.first + (p.count - 1), 0) ', Pnew := Pnew + pe(p.first + p.count, p.last, 0) ', F := F[p.first + p.count, p.last, length_of_P + # Pnew] else Pdone := Pdone + p '}⟩ ⟨P2 := Pdone + Pnew⟩ (partitions(P2, # A) ∧ divides(P2, P0, X, A) ∧ Fok(F, P2, # A) ∧ partitionRefinement(P2, A, P4, A4, X))

Rule argument

Additional information

[Concretesimprules((Csimpnamedseq(list,partition,Last, ⊦ P + p = P + p ') Csimpnamedseq(nat,,pred-03, ⊦ n -1 = n - 1)))]