LAWS.first_key_is_own: law of near-v-framework@0.4.0.0
Import: import near-v-framework@0.4.0.0/general/rose/LAWS.bend as LAWS
Lines 5-9 of near-v-framework@0.4.0.0/general/rose/LAWS.bend: https://jend.leeeet.dev/read.txt?path=near-v-framework@0.4.0.0/general/rose/LAWS.bend&start_line=5&end_line=9

import Base
import near-v-framework@0.4.0.0/general/rose/type.bend as R
import near-v-framework@0.4.0.0/general/rose/ops.bend as O

# LAW: a tree's first key is its own
law first_key_is_own:
  for -N: Data
  for +r: R.Rose<N>
  {O.first(O.keys(N, [r])) == O.key(N, r) : String}

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  https://jend.leeeet.dev/definition.txt?path=near-v-framework@0.4.0.0/general/rose/ops.bend&name=first
  https://jend.leeeet.dev/definition.txt?path=near-v-framework@0.4.0.0/general/rose/ops.bend&name=key
  https://jend.leeeet.dev/definition.txt?path=near-v-framework@0.4.0.0/general/rose/ops.bend&name=keys
  https://jend.leeeet.dev/definition.txt?path=near-v-framework@0.4.0.0/general/rose/type.bend&name=Rose