Documentation

Validator.Certificate.SetExpr

Instances For
    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
        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
            Instances For
              @[irreducible]
              Equations
              • One or more equations did not get rendered due to their size.
              Instances For
                theorem Validator.Certificate.validSets.getActionIds_union {n : ℕ} {pt : STRIPS.PlanningTask n} {C : Certificate pt} {hC : C.validSets} (Aᵢ A'ᵢ A''ᵢ : Fin C.actions.size) (h : C.actions[Aᵢ]? = some (ActionSetExpr.union ↑A'ᵢ ↑A''ᵢ)) :
                hC.getActionIds Aᵢ = hC.getActionIds A'ᵢ ∪ hC.getActionIds A''ᵢ
                Equations
                Instances For
                  theorem Validator.Certificate.validSets.getActions_union {n : ℕ} {pt : STRIPS.PlanningTask n} {C : Certificate pt} {hC : C.validSets} (Aᵢ A'ᵢ A''ᵢ : Fin C.actions.size) (h : C.actions[Aᵢ]? = some (ActionSetExpr.union ↑A'ᵢ ↑A''ᵢ)) :
                  hC.getActions Aᵢ = hC.getActions A'ᵢ ∪ hC.getActions A''ᵢ
                  @[irreducible]
                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For
                    theorem Validator.Certificate.validSets.getStatesNeg {n : ℕ} {pt : STRIPS.PlanningTask n} {C : Certificate pt} (hC : C.validSets) (Sᵢ S'ᵢ : Fin C.states.size) (h : C.states[Sᵢ]? = some (StateSetExpr.neg ↑S'ᵢ)) :
                    hC.getStates Sᵢ = (hC.getStates S'ᵢ)ᶜ
                    theorem Validator.Certificate.validSets.getStatesInter {n : ℕ} {pt : STRIPS.PlanningTask n} {C : Certificate pt} (hC : C.validSets) (Sᵢ S'ᵢ S''ᵢ : Fin C.states.size) (h : C.states[Sᵢ]? = some (StateSetExpr.inter ↑S'ᵢ ↑S''ᵢ)) :
                    hC.getStates Sᵢ = hC.getStates S'ᵢ ∩ hC.getStates S''ᵢ
                    theorem Validator.Certificate.validSets.getStatesUnion {n : ℕ} {pt : STRIPS.PlanningTask n} {C : Certificate pt} (hC : C.validSets) (Sᵢ S'ᵢ S''ᵢ : Fin C.states.size) (h : C.states[Sᵢ]? = some (StateSetExpr.union ↑S'ᵢ ↑S''ᵢ)) :
                    hC.getStates Sᵢ = hC.getStates S'ᵢ ∪ hC.getStates S''ᵢ
                    theorem Validator.Certificate.validSets.getStatesProg {n : ℕ} {pt : STRIPS.PlanningTask n} {C : Certificate pt} (hC : C.validSets) (Sᵢ S'ᵢ : Fin C.states.size) (Aᵢ : Fin C.actions.size) (h : C.states[Sᵢ]? = some (StateSetExpr.progr ↑S'ᵢ ↑Aᵢ)) :
                    hC.getStates Sᵢ = STRIPS.progression (hC.getStates S'ᵢ) (hC.getActions Aᵢ)
                    theorem Validator.Certificate.validSets.getStatesRegr {n : ℕ} {pt : STRIPS.PlanningTask n} {C : Certificate pt} (hC : C.validSets) (Sᵢ S'ᵢ : Fin C.states.size) (Aᵢ : Fin C.actions.size) (h : C.states[Sᵢ]? = some (StateSetExpr.regr ↑S'ᵢ ↑Aᵢ)) :
                    hC.getStates Sᵢ = STRIPS.regression (hC.getStates S'ᵢ) (hC.getActions Aᵢ)