(3steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc

At: no repeats reverse 1 1
1. T: Type
2. L: T List
3. u: T
4. v: T List
5. no_repeats(T;rev(v)) no_repeats(T;v)
(u v) & l_disjoint(T;rev(v);nil) & no_repeats(T;rev(v)) & no_repeats(T;[u]) no_repeats(T;v) & (u v)
By: Obvious
Generated subgoals:

None

About:
listconsniluniverseand

(3steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc