Nuprl - Proof: invfuns are surj 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: invfuns are surj 1 1

1. A : Type
2. B : Type
3. f : A

B
4. g : B

A
5. InvFuns(A;B;f;g)
6. InvFuns(B;A;g;f)

Surj(A; B; f) & Surj(B; A; g)

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

Generated subgoal:

1 7. Surj(A; B; f)
8. Surj(B; A; g)
Surj(A; B; f) & Surj(B; A; g)
1 step

About:

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