Nuprl - Proof: eval factorization split pluck 1

(2steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: eval factorization split pluck 1

1. a :

2. c :

3. b :

4. f : {a..b

}

5. a

c
6. c<b

(

i:{a..b

}. i

f(i)) = (

i:{a..c

}. i

f(i))

c

f(c)

(

i:{c+1..b

}. i

f(i))

By:	Rewrite by Thm* a,c,b:, e:({a..b}). Thm* ac Thm* Thm* c<b Thm* Thm* ( i:{a..b}. e(i)) = ( i:{a..c}. e(i))e(c)( i:{c+1..b}. e(i))

Generated subgoals:

None

About:

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

(2steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc