ProofLists.count_false_set.go: law of minebender-game@1.0.0.0
Import: import minebender-game@1.0.0.0/proof_lists.bend as ProofLists
Lines 486-493 of minebender-game@1.0.0.0/proof_lists.bend: https://jend.leeeet.dev/read.txt?path=minebender-game@1.0.0.0/proof_lists.bend&start_line=486&end_line=493

import Base
import minebender-game@1.0.0.0/types.bend as T
import minebender-game@1.0.0.0/board.bend as B

law count_false_set.go:
  for +g: T.Grid(Bool)
  for +y: Nat
  for +r: List<&2, Bool>
  for +r2: List<&2, Bool>
  for e: {List.get(&2, List<&2, Bool>, g, y) == Some{r} : Maybe<&2, List<&2, Bool>>}
  for rf: {B.row_false(r) == 1n+B.row_false(r2) : Nat}
  {B.count_false(g) == 1n+B.count_false(List.set(&2, List<&2, Bool>, g, y, r2)) : Nat}

Uses (15):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Empty.absurd
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.get
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.set
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/board.bend&name=count_false
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/board.bend&name=row_false
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/proof_base.bend&name=add_succ
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/proof_lists.bend&name=none_ne_some
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/proof_lists.bend&name=some_inj
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/types.bend&name=Grid