Definitions DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
bijectDef  Bij(ABf) == Inj(ABf) & Surj(ABf)
Thm*  A,B:Type, f:(AB). Bij(ABf Prop
injectDef  Inj(ABf) == a1,a2:Af(a1) = f(a2 B  a1 = a2
Thm*  A,B:Type, f:(AB). Inj(ABf Prop
one_one_corr_2Def  A ~ B == f:(AB), g:(BA). InvFuns(A;B;f;g)
Thm*  A,B:Type. (A ~ B Prop
inv_funs_2Def  InvFuns(A;B;f;g) == (x:Ag(f(x)) = x) & (y:Bf(g(y)) = y)
Thm*  f:(AB), g:(BA). InvFuns(A;B;f;g Prop
surjectDef  Surj(ABf) == b:Ba:Af(a) = b
Thm*  A,B:Type, f:(AB). Surj(ABf Prop

About:
applyfunctionuniverseequalmemberprop
impliesandallexists
!abstraction
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

Definitions DiscreteMath Sections DiscrMathExt Doc