law start_len
import minebender-game@1.0.0.0/proof_solver.bend as ProofSolverimport Base
import minebender-game@1.0.0.0/types.bend as T
import minebender-game@1.0.0.0/solver.bend as S
1504law start_len:
1505 for +g: T.Grid(T.Seen)
1506 {List.length(&2, List<&2, Maybe<&2, Bool>>, S.start(g)) == List.length(&2, List<&2, T.Seen>, g) : Nat}