We present a nesting-free normal form for the formalism of nested conditions and constraints in the context of finite lattices of subgraphs.