Proposition: A tree has only cycles of length 0:
forall T: T is tree => ~(exists p: p is path in T /\ length(p) > 0 /\ p is cycle).
No (non-trivial) path in a tree is a cycle.