proposition: Lemma ACK_ULoosed : forall (b : bool) (c : Channel) (p3 : Process), UnrelProcTrans Channel Act c (ACK b) (Transmit Channel Act c (Noise Channel Act c)) p3 -> p3 = ACKING b.
proof: Proof. intros b c p3. pattern (ACK b) at 1 in |- *; rewrite unfold_ACK. intro H. inversion H. trivial. Defined.
imports: ABP.ABP.BISIMULATION.Hypotheses