val app_state_feq_comm_aux (#adm: _) (st1 st2: app_state adm)
    : Lemma (requires (app_state_feq st1 st2)) (ensures (app_state_feq st2 st1))
val app_state_feq_comm_aux (#adm: _) (st1 st2: app_state adm)
    : Lemma (requires (app_state_feq st1 st2)) (ensures (app_state_feq st2 st1))
let app_state_feq_comm_aux (#adm:_) (st1 st2: app_state adm)
  : Lemma (requires (app_state_feq st1 st2))
          (ensures (app_state_feq st2 st1))
  = let aux (k:_)
      : Lemma (ensures (st2 k = st1 k))
      = assert(st1 k = st2 k)
    in
    forall_intro aux
module Zeta.AppSimulate.Helper

open FStar.Classical
module S = FStar.Seq

open Zeta.Ghost
/
Zeta.SeqIdx.fsti.checked Zeta.SeqAux.fsti.checked Zeta.Ghost.fsti.checked prims.fst.checked FStar.Seq.fst.checked FStar.Pervasives.fsti.checked FStar.Classical.Sugar.fsti.checked FStar.Classical.fsti.checked
Zeta.AppSimulate.Helper.fst
st1: Zeta.AppSimulate.app_state adm -> st2: Zeta.AppSimulate.app_state adm
  -> FStar.Pervasives.Lemma (requires Zeta.AppSimulate.Helper.app_state_feq st1 st2)
      (ensures Zeta.AppSimulate.Helper.app_state_feq st2 st1)
Zeta.App.app_data_model Zeta.AppSimulate.app_state FStar.Classical.forall_intro Zeta.App.app_key Prims.b2t Prims.op_Equality Zeta.App.app_value_nullable Prims.unit Prims.l_True Prims.squash Prims.Nil FStar.Pervasives.pattern Prims._assert Zeta.AppSimulate.Helper.app_state_feq
let app_state_feq_comm_aux (#adm: _) (st1 st2: app_state adm)
    : Lemma (requires (app_state_feq st1 st2)) (ensures (app_state_feq st2 st1)) =
  
let aux (k: _) : Lemma (ensures (st2 k = st1 k)) = assert (st1 k = st2 k) in
forall_intro aux