fact: Fixpoint i3th2 {m : nat} {As : Vector.t A m} {Bs : ilist3 As} (i3l : i3list2 Bs) (n : Fin.t m) {struct n} : C (ith3 Bs n) := match n in Fin.t m return forall (As : Vector.t A m) (Bs : ilist3 As), i3list2 Bs -> C (ith3 Bs n) with | Fin.F1 k => fun As Bs i3l => Vector.caseS (fun n As => forall (Bs : ilist3 As), i3list2 Bs -> C (ith3 Bs (@Fin.F1 n))) (fun a' n' As' (Bs' : ilist3 (a' :: As')) i3l' => prim_fst i3l' ) As Bs i3l | Fin.FS k n'' => fun As Bs i3l => Vector_caseS' Fin.t (fun n' As i => forall (Bs'' : ilist3 As), i3list2 Bs'' -> C (ith3 Bs'' (@Fin.FS n' i))) (fun a' n' As' n'' (Bs' : ilist3 (a' :: As')) i3l' => i3th2 (prim_snd i3l') n'') As n'' Bs i3l end As Bs i3l.
imports: Coq.Lists.List Coq.Strings.String Coq.Arith.Arith Fiat.Common.ilist Fiat.Common.ilist3