The cycle property states: for any cycle in the graph, the maximum-weight edge in that cycle cannot be in any MST (unless there are ties). If you find a cycle and one edge is heavier than all others in that cycle, you can safely remove it.
It will never be part of an MST. This property helps you eliminate bad edges before running an MST algorithm. It is also useful for proving correctness of both algorithms.