(21steps total) PrintForm Definitions Lemmas quot 1 Sections StandardLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: decidable quotient equal 1 1 1

1. T : Type
2. E : TTProp
3. EquivRel x,y:TE(x,y)
4. f : TT
5. x,y:T. (x f y E(x,y)
  f:((x,y:T//E(x,y))(x,y:T//E(x,y))). 
  u,v:x,y:T//E(x,y). (u f v u = v


By: Assert (f  (x,y:T//E(x,y))(x,y:T//E(x,y)))


Generated subgoals:

1   f  (x,y:T//E(x,y))(x,y:T//E(x,y))
9 steps
2 6. f  (x,y:T//E(x,y))(x,y:T//E(x,y))
  f:((x,y:T//E(x,y))(x,y:T//E(x,y))). 
  u,v:x,y:T//E(x,y). (u f v u = v

8 steps

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

(21steps total) PrintForm Definitions Lemmas quot 1 Sections StandardLIB Doc