Thms myhill nerode Sections AutomataTheory Doc

append Def as @ bs == Case of as; nil bs ; a.as' a.(as' @ bs) (recursive)

Thm* T:Type, as,bs:T*. (as @ bs) T*

iff Def P Q == (P Q) & (P Q)

Thm* A,B:Prop. (A B) Prop

rev_implies Def P Q == Q P

Thm* A,B:Prop. (A B) Prop

About:
!abstractionimpliesallpropmemberand
recursive_def_noticelist_indconsuniverselist