proposition: Lemma setRaster_correct1 : forall {n m : positive} (r:raster n m) x i j, raster_well_formed r -> (i < Pos.to_nat m) -> (j < Pos.to_nat n) -> RasterIndex (setRaster r x i j) i j = x.
proof: Proof. intros n m r x i j rWf Hi Hj. destruct r. simpl. destruct rWf. rewrite updateList_correct1 with (d2:=nil). 2: rewrite H; exact Hi. rewrite updateList_correct1. reflexivity. trivial. rewrite Forall_forall in H0. rewrite (H0 (nth i l nil)). exact Hj. apply nth_In. rewrite H. exact Hi. Qed.
imports: CoRN.stdlib_omissions.List Coq.Arith.Arith Coq.PArith.BinPos