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

P = P0, A0 = A, DAid(A, D), ADid(A, D), nodups(A), split(P0, A, X), partitions(P0, # A), Fok(F, P0, # A), samepartitions(P0, A, P4, A4) ⊦ ⟨REFINEONE(x, F; A, D, P)⟩ ( perm(A0, A) ∧ DAid(A, D) ∧ ADid(A, D) ∧ split(P, A, X + x ') ∧ partitions(P, # A) ∧ resetcnt(P) = resetcnt(P0) ∧ nodups(A) ∧ Fok(F, P, # A) ∧ samepartitions(P, A, P4, A4))

Heuristic weak unfold applied rule call right

And closed the goal!

Rule argument

pos:right 1

Additional information

[Concretesimprules((Csimpnamedseq(REFINEONE,,, ⊦ )))]