Documentation

Determinize.Proof.FiniteModel.Lookup

Instances For
    def Determinize.Proof.FiniteModel.Lookup.get {α : Type} (table : Lookup α) (i : Nat) :
    α
    Equations
    Instances For
      def Determinize.Proof.FiniteModel.Lookup.Indexed {α : Type} (table : Lookup α) (label : α → Nat) (lo hi : Nat) :
      Equations
      Instances For
        @[instance_reducible]
        instance Determinize.Proof.FiniteModel.instDecidableIndexed {α : Type} (table : Lookup α) (label : α → Nat) (lo hi : Nat) :
        Decidable (table.Indexed label lo hi)
        Equations
        theorem Determinize.Proof.FiniteModel.Lookup.get_index {α : Type} (table : Lookup α) (label : α → Nat) (lo hi : Nat) (valid : table.Indexed label lo hi) (i : Nat) (lower : lo ≤ i) (upper : i < hi) :
        label (table.get i) = i
        theorem Determinize.Proof.FiniteModel.lookup_evidence_all {n : Nat} (p : Fin n → Prop) (table : Lookup (Subtype p)) (indexed : table.Indexed (fun (e : Subtype p) => ↑e.val) 0 n) (i : Fin n) :
        p i