law empty_has

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/lemmas/proofs/native_map.bend:28

import Base

28law empty_has:
29  for -V: Data
30  for k: String
31  {Map.has(&2, V, Map.new(&2, V), k) == (MTip{}, False{}) : Map<&2, V> & Bool}