IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
assert of bexists T:Type, P:(T). (x:T. P(x)) (x:T. P(x))
By:
Unfold `bexists` 0 THEN Simp THEN StrongAuto THEN HypBackchain THEN StrongAuto
Generated subgoals:
None
About:
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
T:Type, P:(T
). (
x:T. P(x)) 
(
