finite sets Sections AutomataTheory Doc

Def {i...} == {j:| ij }

Thm* n:{1...}, m:{n+1...}, f:(mn). i,j:m. i < j & f(i) = f(j) phole_lemma

Thm* n:{1...}, f:((n+1)n). i:(n+1), j:i. f(i) = f(j) phole_aux

In prior sections: int 1 int 2