XML is extended with functional dependencies, which are fundamental to semantic specification. Based on DTD, tree model for XML and path expressions, definitions for node value equality and node set are given. The definition for functional dependency, logical implication and path closure are studied; the satisfiability of functional dependency in a given DTD is proved. A sound and complete set of inference rules is presented, and an algorithm to calculate closure for XML paths is proved.