(3steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: card union swap 1

1. A : Type
2. B : Type
  f:((A+B)(B+A)), g:((B+A)(A+B)). InvFuns(A+B;B+A;f;g)


By: Witness:
Wie.InjCase(ex. inr(x); y. inl(y)) |
Wie.InjCase(ex. inr(x); y. inl(y))


Generated subgoal:

1   InvFuns(A+B;B+A
  InvFuns;e.InjCase(ex. inr(x); y. inl(y))
  InvFuns;e.InjCase(ex. inr(x); y. inl(y)))

1 step

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

(3steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc