(9steps total) PrintForm Definitions Lemmas LogicSupplement Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: dec pred iff some boolfun 1 1 1 1

1. T : Type
2. E : TProp
3. x:T. Dec(E(x))
4. x : T
5. b : 
6. b  E(x)
  b is the b:b  E(x)


By: Analyze THEN CBV: b'


Generated subgoals:

1   b  E(x)
Hypothesis
2   b':. (b'  E(x))  b' = b
2 steps

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

(9steps total) PrintForm Definitions Lemmas LogicSupplement Sections DiscrMathExt Doc