proposition: Lemma ancestor_does_not_join : forall (c0 : Config) (s2 s3 s4 : Site), legal c0 -> legal (rec_copy2_trans c0 s2) -> ancestor (rec_copy2_trans c0 s2) s3 s4 -> rt c0 s2 = false -> first Message (bm c0 owner s2) = value Message copy -> s3 <> s2.
proof: Proof. intros. elim H1. intros. apply (parent_does_not_join c0 s2 s1 s0). auto. auto. auto. auto. auto. intros. auto. Qed.
imports: DistributedReferenceCounting.machine2.invariant0 DistributedReferenceCounting.machine2.invariant1 DistributedReferenceCounting.machine2.invariant2 DistributedReferenceCounting.machine2.invariant3 DistributedReferenceCounting.machine2.invariant4