proposition: Lemma int63_0: forall p, (Zpos p <= 63)%Z -> int63i 0 p = false.
proof: Proof. intros p Hp. generalize (spec_int63i 0 p). rewrite phi0; rewrite Zdiv_0_l; rewrite Zmod_0_l. case int63i; auto; intros HH2. absurd (0 = 1)%Z; auto with zarith. Qed.
imports: PrimInt63 Cyclic63 List BasicRubik