Thms automata 4 Sections AutomataTheory Doc

card_ge Def |S| |T| == f:(ST). Surj(S; T; f)

Thm* S,T:Type. |S| |T| Prop

surject Def Surj(A; B; f) == b:B. a:A. f(a) = b

Thm* A,B:Type, f:(AB). Surj(A; B; f) Prop

About:
!abstractionallexistsequalapply
universefunctionmemberprop