proposition: Lemma hold_eiff (k: kind) (x y : rtyp k) : (hold k x <-> hold k y) <-> eiff k x y.
proof: Proof. destruct k ; simpl. - tauto. - unfold is_true. destruct x,y ; intuition congruence. Qed.
imports: List Refl Bool Relation_Definitions Setoid