*)

Lemma bigcup_cons_setI_subset_compat_backtrack {A}
(n : nat) (g g' : G (option A)) (l l' : seq (nat * G (option A))) s :
isSome :&: semGenSize g s  \subset isSome :&: semGenSize g' s ->
\bigcup_(x in (l :&: (fun x => x.1 <> 0))) (isSome :&: semGenSize x.2 s) \subset
\bigcup_(x in (l' :&: (fun x => x.1 <> 0))) (isSome :&: semGenSize x.2 s) ->
\bigcup_(x in (((n, g) :: l) :&: (fun x => x.1 <> 0))) (isSome :&: semGenSize x.2 s) \subset
\bigcup_(x in (((n, g') :: l') :&: (fun x => x.1 <> 0))) (isSome :&: semGenSize x.2 s).