(27steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: inv pair inv 1 3 1 2 1

1. A : Type
2. B : Type
3. (fg.fg/f,g. <f,g,(x.*),(y.*)>)  (AB)(A ~ B)
4. (fga.fga/f,##/g,a. <f,g>)  (A ~ B)AB
5. f : AB
6. g : BA
7. a : InvFuns(A;B;f;g)
  <f,g,(x.*),(y.*)> = <f,g,a (A ~ B)


By: Def


Generated subgoal:

1   <f,g,(x.*),(y.*)> = <f,g,a (f:(AB), g:(BA). InvFuns(A;B;f;g))
12 steps

About:
pairspreadlambdafunctionuniverseequalaxiommemberexists
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(27steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc