proposition: Theorem godel_coding_235 : godel_coding 3.
proof: Proof. exists pos3_235 (fun v => ⦉v#>pos0,v#>pos1,v#>pos2⦊). + apply pos3_235_gt_0. + intros p; repeat invert pos p; intros v ->. * rewrite combi_235_2_0; apply not_divides_2_35. * rewrite combi_235_3_0; apply not_divides_3_25. * rewrite combi_235_5_0; apply not_divides_5_23. + intros p; repeat invert pos p; intros v; rew vec. * apply combi_235_mult2. * apply combi_235_mult3. * apply combi_235_mult5. Qed.
imports: List Arith Lia Undecidability.Shared.Libs.DLW(utils gcd prime pos vec)