|*: cases Hletin1; cases x1; change in f3 with (eq1 ? x w); apply (. f3‡#); assumption;]
qed.
-inductive exT2 (A:Type2) (P:A→CProp2) : CProp2 ≝
- ex_introT2: ∀w:A. P w → exT2 A P.
-theorem SUBSETS_full: ∀S,T.∀f. exT2 ? (λg. map_arrows2 ?? SUBSETS' S T g = f).
+theorem SUBSETS_full: ∀S,T.∀f. exT22 ? (λg. map_arrows2 ?? SUBSETS' S T g = f).
intros; exists;
[ constructor 1; constructor 1;
[ apply (λx:carr S.λy:carr T. y ∈ f (singleton S x));