(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 2
1. A : Type
2. a : A
3. f : AA
4. Inj(A; A; f)
5. (x:A. f(x) = a)
6. n1,n2:. f{n1}(a) = f{n2}(a)  n1<n2
  Inj(; A; i.f{i}(a))
By: Def of Inj(; A; i.f{i}(a)) THEN CBV: i1,i2:. <prop> THEN Reduce Concl

Generated subgoal:

1 7. i1 : 
8. i2 : 
9. f{i1}(a) = f{i2}(a)
  i1 = i2
1 step

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