Documentation

Cedar.Thm.TPE.Input

This file defines theorems related to the inputs of TPE.

theorem Cedar.Thm.decide_eq_implies_eq {α : Sort u_1} [DecidableEq α] {y : α} (x : α) :
decide (x = y) = true → x = y
inductive Cedar.Thm.PartialIsValid {α : Type u_1} (p : α → Prop) (o : Option α) :
Instances For
    @[simp]
    theorem Cedar.Thm.PartialIsValid.some_inv {α : Type u_1} {p : α → Prop} {x : α} :
    theorem Cedar.Thm.partial_is_valid_rfl {α : Type u_1} {f : α → Bool} {p : α → Prop} {o : Option α} :
    (∀ (x : α), f x = true → p x) → TPE.partialIsValid o f = true → PartialIsValid p o
    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        Concrete request req and entities es refine their partial counterparts peq and pes.

        Equations
        Instances For

          Requests and entities that pass isValidAndConsistent satisfy RequestAndEntitiesRefine.