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

1. A : Type
2. a : A
3. f : AA
4. Inj(AAf)
5. (x:Af(x) = a)
  Inj(Ai.f{i}(a))


By: n1,n2:f{n1}(a) = f{n2}(a A  n1<n2  Asserted


Generated subgoals:

1 6. n1 : 
7. n2 : 
8. f{n1}(a) = f{n2}(a)
  n1<n2

6 steps
2 6. n1,n2:f{n1}(a) = f{n2}(a n1<n2
  Inj(Ai.f{i}(a))

2 steps

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

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