proposition: Lemma not_D_queue : forall (q0 : queue Message) (m : Message), ~ D_queue q0 -> m <> dec -> ~ D_queue (input Message m q0).
proof: Proof. intros; red in |- *; intro. inversion H1. elim H. generalize H3. generalize H2. generalize H0. case q0. intros. apply D_empty. simpl in |- *. intros. apply D_dec. inversion H6. auto. auto. simpl in |- *. generalize H5 H7. case m. intro. elim H8; auto. intro. case (eq_bool_dec (is_inc_dec (inc_dec s))). intros; contradiction. intros. elim H9; intro. elim H8; auto. auto. case (eq_bool_dec (is_inc_dec copy)). intros; contradiction. intros. elim H9; intro. elim H8; auto. auto. Qed.
imports: DistributedReferenceCounting.machine4.machine DistributedReferenceCounting.machine4.cardinal DistributedReferenceCounting.machine4.comm