fact: Definition check_2dbound2 p1 i b := let p2 := rot_part i p1 in let: DruleFork rs rt _ := rf in let: SortDrules dnt1 rt1 := sort_drules p1 rt in let: SortDrules dns1 rs1 := sort_drules p1 rs in let: SortDrules dnt2 rt2 := sort_drules p2 rt in let: SortDrules dns2 rs2 := sort_drules p2 rs in if ((dns1 + dns2)%:Z - (dnt1 + dnt2)%:Z + b)%R isn't Posz nt then false else let m := size rt1 + (size rt2 + 3) in check_2dbound2_rec p1 p2 rt1 rs1 [::] rt2 rs2 [::] i nt m.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype path fingraph) mathcomp(bigop order ssralg ssrnum ssrint) fourcolor(hypermap geometry quiztree part discharge)