(4steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: invfuns are inj 1 1

1. A : Type
2. B : Type
3. f : AB
4. g : BA
5. InvFuns(A;B;f;g)
6. InvFuns(B;A;g;f)
  Inj(ABf) & Inj(BAg)


By: FwdThru: Thm*  InvFuns(A;B;f;g Inj(ABf) on [ InvFuns(A;B;f;g) ]
THEN
FwdThru: Thm*  InvFuns(A;B;f;g Inj(ABf) on [ InvFuns(B;A;g;f) ]


Generated subgoal:

1 7. Inj(ABf)
8. Inj(BAg)
  Inj(ABf) & Inj(BAg)

1 step

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

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