Mercurial > hg > Members > atton > agda-proofs
view systemT/boolean.agda @ 49:8031568638d0
Define composition of codesegment using subtype without constraint list
author | atton <atton@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Fri, 06 Jan 2017 06:29:51 +0000 |
parents | fe247f476ecb |
children |
line wrap: on
line source
open import systemT open import Relation.Binary.PropositionalEquality module boolean where _and_ : Bool -> Bool -> Bool T and b = b F and _ = F _or_ : Bool -> Bool -> Bool T or _ = T F or b = b not : Bool -> Bool not T = F not F = T De-Morgan's-laws : (a b : Bool) -> (not a) and (not b) ≡ not (a or b) De-Morgan's-laws T T = refl De-Morgan's-laws T F = refl De-Morgan's-laws F T = refl De-Morgan's-laws F F = refl