(16steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: split factor1 char a

  k:{2...}, g:({2..k}), x:{2..k}.
  xx<k
  
  {2..k}(g) = {2..k}(split_factor1(gx))
  & split_factor1(gx)(xx) = 0
  & (u:{2..k}. xx<u  split_factor1(gx)(u) = g(u))


By: UnivCD ...w THEN Inst: Thm*  i:{2...}, j:{1...}. j<ij Using:[x | x]


Generated subgoal:

1 1. k : {2...}
2. g : {2..k}
3. x : {2..k}
4. xx<k
5. x<xx & x<xx
  {2..k}(g) = {2..k}(split_factor1(gx))
  & split_factor1(gx)(xx) = 0
  & (u:{2..k}. xx<u  split_factor1(gx)(u) = g(u))

4 steps

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

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