(12steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: compose iter surjection 1 1 1

1. A : Type
2. f : AA
3. Surj(AAf)
  Surj(AA; Id)


By: Def THEN Reduce Concl


Generated subgoal:

1 4. b : A
  a:Aa = b

1 step

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

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