Transitive multisets
Content created by Jonathan Prieto-Cubides, Egbert Rijke and Fredrik Bakke.
Created on 2023-01-27.
Last modified on 2023-05-03.
module trees.transitive-multisets where
Imports
open import foundation.universe-levels open import trees.multisets open import trees.submultisets
Idea
A multiset x
is said to be transitive if y ⊑-𝕍 x
for every y ∈-𝕍 x
.
That is, x
is transitive if for every z ∈-𝕍 y ∈-𝕍 x
we have
z ∈-𝕍 y ≃ z ∈-𝕍 x
.
Similarly, we say that x
is weakly transitive if y ⊆-𝕍 x
for every
y ∈-𝕍 x
. That is, x
is weakly transitive if for every z ∈-𝕍 y ∈-𝕍 x
we
have z ∈-𝕍 y ↪ z ∈-𝕍 x
.
Definition
Transitive multisets
is-transitive-𝕍 : {l : Level} → 𝕍 l → UU (lsuc l) is-transitive-𝕍 {l} x = (y : 𝕍 l) → y ∈-𝕍 x → y ⊑-𝕍 x
Wealky transitive multisets
is-weakly-transitive-𝕍 : {l : Level} → 𝕍 l → UU (lsuc l) is-weakly-transitive-𝕍 {l} x = (y : 𝕍 l) → y ∈-𝕍 x → y ⊆-𝕍 x
Recent changes
- 2023-05-03. Egbert Rijke. Enriched directed trees and elements of W-types (#561).
- 2023-03-14. Fredrik Bakke. Remove all unused imports (#502).
- 2023-03-13. Jonathan Prieto-Cubides. More maintenance (#506).
- 2023-03-10. Fredrik Bakke. Additions to
fix-import
(#497). - 2023-03-09. Jonathan Prieto-Cubides. Add hooks (#495).