[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Signature symbols in this unit

Symbol Specification Kind Type
# .mapfMap[A, B] → Nat
# .set-basicfSet[A] → Nat
. ( . )mappfMap[A, B] × A → B with λ st, a. a ∈ st
. ( . := . )mapfMap[A, B] × A × B → Map[A, B]
. + .nat-basicfNat × Nat → Nat
. ++ .set-basicfSet[A] × A → Set[A]
. +1nat-basicfNat → Nat
. - .natpfNat × Nat → Nat with λ n, m. n ≥ m
. -- .mapfMap[A, B] × A → Map[A, B]
. -- .set-unionfSet[A] × A → Set[A]
. -1nat-basicpfNat → Nat with λ n. n ≠ 0
. < .nat-basicpNat × Nat
. > .natpNat × Nat
. \ .set-unionfSet[A] × Set[A] → Set[A]
. \ .heapfuns-mapfMap[A, B] × Set[A] → Map[A, B]
. \ .heapfuns-mapfMap[A, B] × Map[A, B] → Map[A, B]
. ∈ .mapp'A × Map('A, 'B)
. ∈ .set-basicp'A × Set('A)
. ∩ .set-unionfSet[A] × Set[A] → Set[A]
. ∪ .set-unionfSet[A] × Set[A] → Set[A]
. ∪ .heapfuns-mapfMap[A, B] × Map[A, B] → Map[A, B]
. ≤ .natpNat × Nat
. ≥ .natpNat × Nat
. ⊆ .mappMap('A, 'B) × Map('A, 'B)
. ⊆ .set-basicpSet('A) × Set('A)
. ⊥ .heapfuns-mappMap('A, 'B) × Map('A, 'B)
. exists ( . )set-unionpSet('A) × ('A → Bool)
. filter ( . )set-unionfSet[A] × (A → Bool) → Set[A]
. forall ( . )set-unionpSet('A) × ('A → Bool)
. map ( . )set-unionfSet[A] × (A → B) → Set[B]
{ . }set-unionfA → Set[A]
∅mapcMap[A, B]
∅set-basiccSet[A]
Mapmaps
Natnat-basics
Setset-basics
dheapfuns-mapvB
disjointset-unionpSet('A) × Set('A)
dom .heapfuns-mapfMap[A, B] → Set[A]
hheapfuns-mapvMap[A, B]
hPheapfuns-mapvMap[A, B] → Bool
oheapfuns-mapvB
rheapfuns-mapvA
rsheapfuns-mapvSet[A]