[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
. + .	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]
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. < .	nat-basic	p	Nat × Nat
. > .	nat	p	Nat × Nat
. \ .	set-union	f	Set[A] × Set[A] → Set[A]
. ^*	relops	f	(A × A → Bool) → A × A → Bool
. ^-1	relops	f	(A × B → Bool) → B × A → Bool
. ∈ .	set-basic	p	'A × Set('A)
. ∩ .	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)
. 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)
. map ( . )	set-union	f	Set[A] × (A → B) → Set[B]
. o .	relops	f	(A × B → Bool) × (B × C → Bool) → A × C → Bool
. toFun	relops	pf	(A × B → Bool) → A → B with λ rel. λ a. funp(rel)
{ . }	set-union	f	A → Set[A]
∅	set-basic	c	Set[A]
Nat	nat-basic	s
Ref	polyref	s
Set	set-basic	s
cod .	relops	f	(A × B → Bool) → B → Bool
disjoint	set-union	p	Set('A) × Set('A)
dom .	relops	f	(A × B → Bool) → A → Bool
funp	relops	p	('A × 'B → Bool)
inj	relops	p	('A × 'B → Bool)
null	polyref	c	Ref[A]
pfunp	relops	p	('A × 'B → Bool)
r	reachable	v	Ref[A]
reach	reachable	f	Ref[A] × (Ref[A] × Ref[A] → Bool) → Set[Ref[A]]
rrp	reachable	v	Ref[A] × Ref[A] → Bool
rtc	relops	f	Nat × (A × A → Bool) → A × A → Bool
surj	relops	p	('A × 'B → Bool)
total	relops	p	('A × 'B → Bool)