summaryrefslogtreecommitdiff
path: root/src/Cfe/Language/Base.agda
diff options
context:
space:
mode:
authorChloe Brown <chloe.brown.00@outlook.com>2021-03-05 00:22:20 +0000
committerChloe Brown <chloe.brown.00@outlook.com>2021-03-05 00:22:20 +0000
commit90c7597b6f80e0bd5bb2a9a7245d097d40486518 (patch)
treef106450275fb3375d0346a2f02e72f6537f8c5cc /src/Cfe/Language/Base.agda
parent9c5540562f53be81bfb03ef2b96d7f59b3ddea44 (diff)
Prove lemma 3.3
Diffstat (limited to 'src/Cfe/Language/Base.agda')
-rw-r--r--src/Cfe/Language/Base.agda4
1 files changed, 4 insertions, 0 deletions
diff --git a/src/Cfe/Language/Base.agda b/src/Cfe/Language/Base.agda
index c34de30..74854df 100644
--- a/src/Cfe/Language/Base.agda
+++ b/src/Cfe/Language/Base.agda
@@ -21,6 +21,7 @@ open import Relation.Binary.PropositionalEquality as ≡ using (_≡_)
open import Relation.Binary.Indexed.Heterogeneous
infix 4 _∈_
+infix 4 _∉_
Language : ∀ a aℓ → Set (suc c ⊔ suc a ⊔ suc aℓ)
Language a aℓ = IndexedSetoid (List C) a aℓ
@@ -58,6 +59,9 @@ Lift b bℓ A = record
_∈_ : ∀ {a aℓ} → List C → Language a aℓ → Set a
_∈_ = flip 𝕃
+_∉_ : ∀ {a aℓ} → List C → Language a aℓ → Set a
+l ∉ A = l ∈ A → ⊥
+
∈-cong : ∀ {a aℓ} → (A : Language a aℓ) → ∀ {l₁ l₂} → l₁ ≡ l₂ → l₁ ∈ A → l₂ ∈ A
∈-cong A ≡.refl l∈A = l∈A