[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
# .	set-basic	f	Set[A] → Nat
# .	map	f	Map[A, B] → Nat
. ( . )	map	pf	Map[A, B] × A → B with λ st, a. a ∈ st
. ( . := . )	map	f	Map[A, B] × A × B → Map[A, B]
. + .	nat-basic	f	Nat × Nat → Nat
. ++ .	set-basic	f	Set[A] × A → Set[A]
. +1	nat-basic	f	Nat → Nat
. - .	nat	pf	Nat × Nat → Nat with λ n, m. n ≥ m
. -- .	set-union	f	Set[A] × A → Set[A]
. -- .	map	f	Map[A, B] × A → Map[A, B]
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. < .	nat-basic	p	Nat × Nat
. < .	tord	p	Tord × Tord
. < .	oset	p	Tord × Set(Tord)
. < .	oset	p	Set(Tord) × Tord
. > .	nat	p	Nat × Nat
. \ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∈ .	set-basic	p	'A × Set('A)
. ∈ .	map	p	'A × Map('A, 'B)
. ∩ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	set-union	f	Set[A] × Set[A] → Set[A]
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	set-basic	p	Set('A) × Set('A)
. ⊆ .	map	p	Map('A, 'B) × Map('A, 'B)
. butmax	oset	pf	Set[Tord] → Set[Tord] with λ s. s ≠ ∅
. butmin	oset	pf	Set[Tord] → Set[Tord] with λ s. s ≠ ∅
. butmin	omap	pf	Map[Tord, B] → Map[Tord, B] with λ st. st ≠ ∅
. exists ( . )	set-union	p	Set('A) × ('A → Bool)
. filter ( . )	set-union	f	Set[A] × (A → Bool) → Set[A]
. forall ( . )	set-union	p	Set('A) × ('A → Bool)
. keys	omap	f	Map[Tord, B] → Set[Tord]
. map ( . )	set-union	f	Set[A] × (A → B) → Set[B]
. max	oset	pf	Set[Tord] → Tord with λ s. s ≠ ∅
. min	oset	pf	Set[Tord] → Tord with λ s. s ≠ ∅
. min	omap	pf	Map[Tord, B] → Tord with λ st. st ≠ ∅
{ . }	set-union	f	A → Set[A]
∅	set-basic	c	Set[A]
∅	map	c	Map[A, B]
Map	map	s
Nat	nat-basic	s
Set	set-basic	s
Tord	tord	s
a	omap	v	Tord
d	omap	v	B
disjoint	set-union	p	Set('A) × Set('A)
s	omap	v	Set[Tord]
st	omap	v	Map[Tord, B]