(3steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
A function has at most one inverse.

At: inv funs 2 unique


  A,B:Type, f:(AB), g,h:(BA).
  InvFuns(A;B;f;g InvFuns(A;B;f;h g = h


By: Def of InvFuns(<A>;<B>;<f>;<g>)


Generated subgoal:

1 1. A : Type
2. B : Type
3. f : AB
4. g : BA
5. h : BA
6. x:Ag(f(x)) = x
7. y:Bf(g(y)) = y
8. x:Ah(f(x)) = x
9. y:Bf(h(y)) = y
  g = h

2 steps

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

(3steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc