proposition: Lemma N_dans_S_V2' : ~ dans S' V2'.
proof: Proof. red in |- *. replace V2' with (map injdroite V2). unfold injdroite in |- *. intros. elimtype (exists y : Elt, dans y V2 /\ S' = (fun e : Elt => couple e un) y). intros x temp; elim temp; clear temp. intros dans_x_V2 S_egal. absurd (S' = couple x un). unfold S', zero in |- *. discriminate. auto. apply (dans_map (fun e : Elt => couple e un)). assumption. unfold V2' in |- *. simpl in |- *. auto. Qed.
imports: Ensf Words more_words Rat need fonctions Relations gram gram2 gram3 gram4