proposition: Lemma Pcard_subset_inj n R P (PR : P [<=] R) Q (QR : Q [<=] R) : forall (x : Pcard P n) (y : Pcard Q n), x [=] y -> Pcard_subset PR x =c= Pcard_subset QR y.
proof: Proof. intros [X [XP Xn]] [Y [YQ Yn]] e. hyp. Qed.
imports: Coq(Basics Morphisms Setoid) CoLoR(ClassicUtil IotaUtil EpsilonUtil LogicUtil NatUtil FunUtil ListUtil ListNodup SetUtil BoundNat)