Z Paragraphs, Declarations Predicates

LATEX input Output Meaning LATEX input Output Meaning

[X] [X ] given set x = y x =y equality
\begin{axdef} x \in S x ∈S membership
D D \lnot P ¬P negation
\where axiomatic box P \land Q P ∧Q conjunction
P P P \lor Q P ∨Q disjunction
\end{axdef} P \implies Q P ⇒Q implication
P \iff Q P ⇔Q equivalence
\begin{schema}{S} S universal
D \forall ST @ P ∀ ST • P
D quantification
\where schema box existential
P P \exists ST @ P ∃ ST • P
quantification
\end{schema} unique
\exists_1 ST @ P ∃1 ST • P
quantification
\begin{gendef}[X] [X ] let V ==
\LET V==E
D D E local definition
@ P
\where generic box •P
P P schema
\pre S pre S
\end{gendef} pre-condition
a \inrel{R} b aRb infix relation
horizontal schema \IF P if P
S \defs T S =
bT definition \THEN Q then Q conditional
abbreviation \ELSE R else R
X == e X == e
definition
T ::= T ::=
A | A| free type definition
Schema Expressions
B\ldata E\rdata B hhE ii
LATEX input Output Meaning
\Delta S ∆S schema name prefix
\Xi S ΞS schema name prefix
\lnot S ¬S negation
S \land T S ∧T conjunction
S \lor T S ∨T disjunction
S \implies T S ⇒T implication
Expressions S \iff T S ⇔T equivalence
LATEX input Output Meaning universal
\forall ST @ S ∀ ST • S
(a, b) (a, b) tuple quantification
\{a, b\} {a, b} set display existential
\exists ST @ S ∃ ST • S
\power X PX power set quantification
X \cross Y X ×Y cross product unique
\exists_1 ST @ S ∃1 ST • S
{D | P • quantification
\{~D | P @ E~\} set comprehension S \hide (a) S \ (a) hiding
E}
(λ ST • S \project T S T projection
(\lambda ST @ E) lambda expression \pre S pre S pre-condition
E)
(µ ST • sequential
(\mu ST @ E) definite description S \semi T S o9 T
E) composition
(let V == S \pipe T S >>T piping
(\LET V==E1
local definition
@ E2 E1
• E2 Sets
function LATEX input Output Meaning
E1~E2 E1 E2
application x \neq y x 6= y inequality
a.b a.b selection x \notin S x ∈/S non-membership
\theta S θS binding formation \emptyset ∅ empty set
\IF P if P S \subseteq T S ⊆T subset
\THEN E1 then E 1 conditional S \subset T S ⊂T proper subset
\ELSE E2 else E 2 non-empty
\power_1 X P1 X
\langle E \rangle hE i sequence display powerset
\lbag E \rbag [[E ]] bag display S \cup T S ∪T set union
\neg n n negative numeral S \cap T S ∩T set intersection
\lblot D \rblot h|D|i binding set S \setminus T S \T
S set difference
x! x! decoration \bigcup S S generalized union
x? x? decoration T generalized
\bigcap S S
x’ x0 decoration intersection
decoration (n a first component of
x_n xn first~x first x
digit) ordered pair
underscore (in second component
\_ second~x second x
opnames) of ordered pair
 Relations Numbers and Finiteness
LATEX input Output Meaning LATEX input Output Meaning
X \rel Y X ↔Y relation \nat N natural numbers
maplet (ordered \num Z integers
x \mapsto y x 7→ y
pair) a + b a +b addition
\dom X dom X domain a - b a −b subtraction
\ran X ran X range a * b a ∗b multiplication
\id X id X identity relation a \div b a div b division
relational a \mod b a mod b modulus
Q \comp R Q o9 R
composition a < b a<b less than
backward relational less than or equal
R \circ Q R◦Q a \leq b a≤b
composition to
S \dres R S CR domain restriction greater than or
a \geq b a≥b
R \rres T RBT range restriction equal to
domain a > b a>b greater than
S \ndres R S−
CR
anti-restriction \nat_1 N1 positive integers
range succ~a succ a successor
R \nrres T R−
BT
anti-restriction a \upto b a .. b number range
R \inv R∼ relational inversion R^{k} Rk iteration
R \limg S \rimg R(| S |) relational image R \bsup k \esup Rk iteration
Q \oplus R Q ⊕R overriding \finset F finite set
R \plus R+ transitive closure non-empty finite
reflexive transitive \finset_1 F1
R \star R∗ set
closure number of
\# X #X members of a finite
set
finite partial
X \ffun Y X → 77 Y
function
finite partial
X \finj Y X  77 Y
Functions injection
LATEX input Output Meaning minimum of a set
min~S min S
X \pfun Y X →7 Y partial function of numbers
X \fun Y X →Y total function maximum of a set
max~S max S
X \pinj Y X  7 Y partial injection of numbers
X \inj Y X Y total injection Bags
X \psurj Y X →
→ 7 Y partial surjection LATEX input Output Meaning
X \surj Y X →
→Y total surjection \bag bag bags
X \bij Y →Y
X  bijection count~B~x count B x multiplicity
B \bcount x B ]x multiplicity
n \otimes B n ⊗B bag scaling
x \inbag B x in B bag membership
B \subbageq C B vC sub-bag relation
B \uplus C B ]C bag union
Sequences B \uminus C B∪ − C bag difference
LATEX input Output Meaning bag of sequence
items~s items s
\seq X seq X finite sequence elements
non-empty finite Miscellaneous, Spacing
\seq_1 X seq1 X
sequence LATEX input Output Meaning
\iseq X iseq X injective sequence \spot, @ • separator
s \cat t s at concatenation \mid, | | separator
rev~s rev s reversal p \bind x p;x variable binding
head~s head s first element
last~s last s last element \\ newline
all but the first \! xx negative thin space
tail~s tail s
element (a space) xx normal space
all but the last \, xx thin space
front~s front s
element ~ xx thin space
U \extract s U s extraction \: xx medium space
s \filter V s V filter \; x x thick space
squash~f squash f compaction \ (a space) x x interword space
s \prefix t s prefix t prefix relation n quad spaces (n a
s \suffix t s suffix t suffix relation \tn x x
digit)
s \inseq t s in t segment relation
a/ q distributed
\dcat q
concatenation
\disjoint S disjoint S disjointness
S partition
S \partition T partition
T