We give two Frankl-like results on set systems with restrictions on set difference sizes and set symmetric difference sizes modulo prime powers. Based on a similar method, we also give a bound on codes satisfying the properties of Hamming distance modulo prime powers.