DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
RankTheoremName
6Thm*  k:f:(k inj k). i:u:kf{i}(u) = u[iter_perm_cycles_uniform]
cites the following:
4Thm*  k:f:(k inj k), u:ki:f{i}(u) = u[compose_iter_inj_cycles]
0Thm*  k:Q:(kAProp).
Thm*  (x:ky:AQ(x;y))  (f:(kA). x:kQ(x;f(x)))
[finite_choice]
5Thm*  a,b:e:({a..b}), i:{a..b}. e(i) | ( i:{a..b}. e(i))[components_divide_iter_mul]
2Thm*  a,b:a | b  (c:b = ac)[divides_def_on_nat]
3Thm*  x,y:xy  [mul_nat_plus]
4Thm*  x:Af:(AA), i,j,k:k = ij  f{i}{j}(x) = f{k}(x A[compose_iter_prod]
1Thm*  f:(AA), u:Af(u) = u  (i:f{i}(u) = u)[compose_iter_point_id]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath Sections DiscrMathExt Doc