Nuprl - Proof: split factor2 char 1 1 1 1

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

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: split factor2 char 1 1 1 1

1. k : {2...}
2. g : {2..k

}

3. x : {2..k

}
4. y : {2..k

}
5. x

y<k
6. x<y
7. x<x

y
8. y<x

y
9. h : {2..k

}

10. h = split_factor2(g; x; y)
11. h(x

y) = 0
12. h(x) = g(x)+g(x

y)
13. h(y) = g(y)+g(x

y)
14.

u:{2..k

}.

u = x

u = y

u = x

y

h(u) = g(u)

x

g(x)

y

g(y)

(x

y)

g(x

y) = x

(g(x)+g(x

y))

y

(g(y)+g(x

y))

(x

y)

0

By:	{normalize factors into powers of x and y } Rewrite by Thm* a,b,c:. (ab)c = acbc ...w THEN Rewrite by Thm* i:, x,y:. ixiy = i(x+y) ...w

Generated subgoal:

1 xg(x)yg(y)xg(xy)yg(xy) = xg(x)xg(xy)yg(y)yg(xy)x0y0
1 step

About:

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

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