val correct (#l: nat) (b:Seq.seq UInt8.t{Seq.length b = l})
  : Lemma (reveal #l (hide b) == b)
  [SMTPat (reveal #l (hide b))]
val correct (#l: nat) (b:Seq.seq UInt8.t{Seq.length b = l})
  : Lemma (reveal #l (hide b) == b)
  [SMTPat (reveal #l (hide b))]
let correct #l (b:Seq.seq UInt8.t{Seq.length b = l})
  : Lemma (reveal #l (hide b) == b)
  [SMTPat (reveal #l (hide b))]
=
  assert (reveal #l (hide b) `Seq.equal` b)
module Model.Helpers

friend Lib.RawIntTypes
/
prims.fst.checked Lib.RawIntTypes.fst.checked FStar.UInt8.fsti.checked FStar.Seq.fst.checked FStar.Pervasives.fsti.checked
Model.Helpers.fst
b: FStar.Seq.Base.seq FStar.UInt8.t {FStar.Seq.Base.length b = l}
  -> FStar.Pervasives.Lemma (ensures Model.Helpers.reveal (Model.Helpers.hide b) == b)
      [SMTPat (Model.Helpers.reveal (Model.Helpers.hide b))]
Prims.nat FStar.Seq.Base.seq FStar.UInt8.t Prims.b2t Prims.op_Equality FStar.Seq.Base.length Prims._assert FStar.Seq.Base.equal QUIC.Spec.Base.byte Model.Helpers.reveal Model.Helpers.hide Prims.unit Prims.l_True Prims.squash Prims.eq2 Prims.l_or Prims.Cons FStar.Pervasives.pattern FStar.Pervasives.smt_pat QUIC.Spec.Base.lbytes Prims.Nil
let correct #l (b: Seq.seq UInt8.t {Seq.length b = l})
    : Lemma (reveal #l (hide b) == b) [SMTPat (reveal #l (hide b))] =
  
assert ((reveal #l (hide b)) `Seq.equal` b)