proposition: Theorem rArrayDef1P : forall (Ar : rArrayP) (m : rNat) (v : Prop), rArrayGetP (rArraySetP Ar m v) m = v.
proof: Proof. intros Ar m v; case Ar; simpl in |- *. intros r a; rewrite (rTreeDef1P r m v); auto with stalmarck. Qed.
imports: Coq(ZArith) Stalmarck(normalize) Coq(Classical) Stalmarck(sTactic)