proposition: Lemma Pcard_subset_equiv P Q (PQ : P [<=] Q) n R : forall x : Pcard P n, x [=] R -> Pcard_subset PQ x [=] R.
proof: Proof. intros [X [XP Xn]] xR. hyp. Qed.
imports: Coq(Basics Morphisms Setoid) CoLoR(ClassicUtil IotaUtil EpsilonUtil LogicUtil NatUtil FunUtil ListUtil ListNodup SetUtil BoundNat)