proposition: Lemma blocked_config : forall c : Config, legal c -> no_message c -> no_rt c -> ~ (exists t : class_trans c, ~ copy_p c t).
proof: Proof. unfold no_message, no_rt in |- *. intros. unfold not in |- *; intro. elim H2. simple induction x; simpl in |- *; intros. apply H3; auto. generalize e. rewrite H0. simpl in |- *. intro; discriminate. apply in_s_LS. apply in_s_LS. generalize e. rewrite H0. simpl in |- *. intro; discriminate. apply in_s_LS. apply in_s_LS. generalize e0. rewrite H0. simpl in |- *. intro; discriminate. apply in_s_LS. apply in_s_LS. generalize e0. rewrite H0. simpl in |- *. intro; discriminate. apply in_s_LS. apply in_s_LS. generalize e0. rewrite H0. simpl in |- *. intro; discriminate. apply in_s_LS. apply in_s_LS. generalize e0; rewrite H1. discriminate. apply in_s_LS. auto. Qed.
imports: List DistributedReferenceCounting.machine2.invariant8