proposition: Lemma rex_pump_to_pump: forall L r w, Equiv (Accept r) L -> RexPump r w -> In w (Pump L (pumping_constant r)).
proof: Proof. intros. inversion H0; subst; clear H0. apply pump_def with (x:=x) (y:=y) (z:=z); auto. intros. apply H. apply H4. Qed.
imports: Coq.Strings.Ascii Coq.Lists.List Coq.Strings.Ascii Coq.Arith.PeanoNat Coq.micromega.Lia Turing.Lang Turing.Regex Turing.Util