proposition: Lemma hzmodissymm ( p : hz ) ( x : hzneq 0 p ) : issymm ( hzmod p x ).
proof: Proof. intros. unfold issymm. intros n m. unfold hzmod. intro v. assert ( hzremaindermod p x m = hzremaindermod p x n ) as a by exact ( pathsinv0 v ). apply a. Defined.
imports: UniMath.PAdics.lemmas UniMath.NumberSystems.Integers UniMath.Foundations.Preamble