Add subset proofs to util

This commit is contained in:
Nathan McCarty 2025-01-16 15:49:13 -05:00
parent a83cef8360
commit 8a01c46441

View file

@ -6,6 +6,7 @@ Contains utility functions extending the functionality of the `eff` package.
module Util.Eff module Util.Eff
import Control.Eff import Control.Eff
import Data.Subset
import Text.ANSI import Text.ANSI
import System import System
@ -180,3 +181,66 @@ oneOfM : Has (Choose) fs => Foldable f =>
f (Eff fs a) -> Eff fs a f (Eff fs a) -> Eff fs a
oneOfM x = foldl alt empty x oneOfM x = foldl alt empty x
``` ```
## Subset
Reorder the first two elements of the first argument of a subset
```idris
public export
subsetReorderLeft : Subset (x :: g :: xs) ys -> Subset (g :: x :: xs) ys
subsetReorderLeft (e :: (e' :: subset)) = e' :: e :: subset
```
Add the same element to both arguments of a subset
```idris
public export
subsetConsBoth : {0 xs, ys : List a} -> {0 g : a} -> Subset xs ys
-> Subset (g :: xs) (g :: ys)
subsetConsBoth {xs = []} {ys = ys} [] = [Z]
subsetConsBoth {xs = (x :: xs)} {ys} (e :: subset) =
let rest = S e :: subsetConsBoth subset {g}
in subsetReorderLeft rest
```
A list is always a subset of itself
```idris
public export
subsetReflexive : {xs : List a} -> Subset xs xs
subsetReflexive {xs = []} = []
subsetReflexive {xs = (x :: xs)} =
let rest = subsetReflexive {xs}
in subsetConsBoth rest
```
If `xs` is a subset of `ys`, then it is also a subset of `ys + g`
```idris
public export
subsetConsRight : {0 g: _} -> {0 xs, ys: _} -> Subset xs ys -> Subset xs (g :: ys)
subsetConsRight {xs = []} {ys = ys} [] = []
subsetConsRight {xs = (x :: xs)} {ys} (e :: subset) =
S e :: subsetConsRight subset {g}
```
`xs` is always a subset of `xs + g`
```idris
public export
trivialSubset : {0 g : a} -> {xs : List a} -> Subset xs (g :: xs)
trivialSubset = subsetConsRight subsetReflexive
```
`fs - f` is always a subset of `f`
```idris
public export
minusLemma : {fs : List a} -> {0 x : a} -> {auto prf : Has x fs}
-> Subset (fs - x) fs
minusLemma {fs = (_ :: vs)} {prf = Z} = trivialSubset
minusLemma {fs = (w :: vs)} {prf = (S y)} =
let rest = minusLemma {fs = vs} {prf = y}
in subsetConsBoth rest
```