ProofGrid.contains_remove_self.go: def of minebender-game@1.0.0.0
Import: import minebender-game@1.0.0.0/proof_grid.bend as ProofGrid
Lines 229-244 of minebender-game@1.0.0.0/proof_grid.bend: https://jend.leeeet.dev/read.txt?path=minebender-game@1.0.0.0/proof_grid.bend&start_line=229&end_line=244

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

def contains_remove_self.go(+q: T.Pos, +t: List<&2, T.Pos>, +p: T.Pos, +b: Bool,
  +e: {B.same(q, p) == b : Bool},
  ih: {B.contains(B.remove(t, p), p) == False{} : Bool}) ->
  {B.contains(List.filter.put(T.Pos, q, B.remove(t, p), Bool.not(B.same(q, p))), p)
    == False{} : Bool}:
  match b:
    case True{}:
      %Equal.sym(Bool, B.same(q, p), True{}, e) :
        {B.contains(List.filter.put(T.Pos, q, B.remove(t, p), Bool.not(_)), p) == False{} : Bool}
      ih
    case False{}:
      %Equal.sym(Bool, B.same(q, p), False{}, e) :
        {B.contains(List.filter.put(T.Pos, q, B.remove(t, p), Bool.not(_)), p) == False{} : Bool}
      %Equal.sym(Bool, B.same(q, p), False{}, e) :
        {Bool.or(_, B.contains(B.remove(t, p), p)) == False{} : Bool}
      ih

Uses (10):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.not
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.or
  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.filter.put
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/board.bend&name=contains
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/board.bend&name=remove
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/board.bend&name=same
  https://jend.leeeet.dev/definition.txt?path=minebender-game@1.0.0.0/types.bend&name=Pos