proposition: Lemma Z_nat_business1 : forall x y : positive, (Zpos y < Zpos x)%Z -> nat_of_P y < nat_of_P x.
proof: Proof. intros. apply nat_of_P_lt_Lt_compare_morphism. generalize H. unfold Zlt in |- *. unfold Zcompare in |- *. auto. Qed.
imports: List DistributedReferenceCounting.machine2.invariant8