
theorem Th39:
  for x,b being non pair set holds [<*x,b*>,xor2a] in
InnerVertices BitCompStr(x,b) & [<*x,b*>,and2a] in InnerVertices BitCompStr(x,b
  )
proof
  let x,b be non pair set;
  InnerVertices BitCompStr(x,b) = {[<*x,b*>,xor2a],[<*x,b*>,and2a]} by Th38;
  hence thesis by TARSKI:def 2;
end;
