1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
\begin{proposition}\label{prelude_universe_contains}
For all $n$ we have $n \in \cumul{n}$.
\end{proposition}
\begin{proposition}\label{prelude_universe_transitive}
For all $n, a$ we have if $a \in \cumul{n}$, then for all $x$ if $x \in a$, then $x \in \cumul{n}$.
\end{proposition}
\begin{proposition}\label{prelude_universe_union_closed}
For all $n, a$ we have if $a \in \cumul{n}$, then $\unions{a} \in \cumul{n}$.
\end{proposition}
\begin{proposition}\label{prelude_universe_power_closed}
For all $n, a$ we have if $a \in \cumul{n}$, then $\pow{a} \in \cumul{n}$.
\end{proposition}
\begin{proposition}\label{setext}
For all $A,B$ we have if for all $x$ if $x \in A$, then $x \in B$, then if for all $x$ if $x \in B$, then $x \in A$, then $A = B$.
\end{proposition}
\begin{proposition}\label{emptyset}
For all $x$ we have $x \in \emptyset$ iff $\bot$.
\end{proposition}
\begin{proposition}\label{pairset_iff}
For all $a,b,x$ we have $x \in \upair{a}{b}$ iff $x = a$ or $x = b$.
\end{proposition}
\begin{proposition}\label{pow_iff}
For all $A,B$ we have $B \in \pow{A}$ iff for all $x$ if $x \in B$, then $x \in A$.
\end{proposition}
\begin{proposition}\label{unions_iff}
For all $A,x$ we have $x \in \unions{A}$ iff there exists $B \in A$ such that $x \in B$.
\end{proposition}
\begin{definition}\label{prelude_successor}
$\preludeSuccessor{x} = \unions{\upair{\upair{x}{x}}{x}}$.
\end{definition}
\begin{definition}\label{prelude_transitive}
$\preludeTransitive{A}$ iff for all $x$ we have if $x \in A$, then for all $y$ if $y \in x$, then $y \in A$.
\end{definition}
\begin{definition}\label{prelude_inductive}
$\preludeInductive{A}$ iff it is not the case that if $\emptyset \in A$, then it is not the case that for all $x$ we have if $x \in A$, then $\preludeSuccessor{x} \in A$.
\end{definition}
\begin{definition}\label{prelude_u0}
$\preludeU = \cumul{\emptyset}$.
\end{definition}
\begin{proposition}\label{prelude_u0_empty}
$\emptyset \in \preludeU$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_universe_contains,prelude_u0}.
\end{proof}
\begin{proposition}\label{prelude_empty_transitive}
$\preludeTransitive{\emptyset}$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_transitive}.
\end{proof}
\begin{proposition}\label{prelude_successor_transitive}
For all $x$ we have if $\preludeTransitive{x}$, then $\preludeTransitive{\preludeSuccessor{x}}$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_transitive,prelude_successor}.
\end{proof}
\begin{proposition}\label{prelude_successor_power_bound}
For all $x$ we have if $\preludeTransitive{x}$, then $\preludeSuccessor{x} \in \pow{\pow{x}}$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_transitive,prelude_successor}.
\end{proof}
\begin{proposition}\label{prelude_u0_transitive_successor}
For all $x$ we have if $x \in \preludeU$, then if $\preludeTransitive{x}$, then $\preludeSuccessor{x} \in \preludeU$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_universe_transitive,prelude_universe_power_closed,prelude_successor_power_bound,prelude_u0}.
\end{proof}
\begin{definition}\label{prelude_transitive_part}
$\preludeTransitivePart = \{ x \in \preludeU \mid \preludeTransitive{x} \}$.
\end{definition}
\begin{proposition}\label{prelude_transitive_part_empty}
$\emptyset \in \preludeTransitivePart$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_transitive_part,prelude_u0_empty,prelude_empty_transitive}.
\end{proof}
\begin{proposition}\label{prelude_transitive_part_successor}
For all $x$ we have if $x \in \preludeTransitivePart$, then $\preludeSuccessor{x} \in \preludeTransitivePart$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_transitive_part,prelude_u0_transitive_successor,prelude_successor_transitive}.
\end{proof}
\begin{proposition}\label{prelude_infinity}
$\preludeInductive{\preludeTransitivePart}$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_inductive,prelude_transitive_part_empty,prelude_transitive_part_successor}.
\end{proof}
\begin{definition}\label{prelude_omega}
$\preludeOmega = \{ x \in \preludeU \mid \text{for all $A$ if $\preludeInductive{A}$, then $x \in A$} \}$.
\end{definition}
\begin{proposition}\label{prelude_omega_empty}
$\emptyset \in \preludeOmega$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_omega,prelude_u0_empty,prelude_inductive}.
\end{proof}
\begin{proposition}\label{prelude_omega_successor}
For all $x$ we have if $x \in \preludeOmega$, then $\preludeSuccessor{x} \in \preludeOmega$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_omega,prelude_infinity,prelude_transitive_part,prelude_u0_transitive_successor,prelude_inductive}.
\end{proof}
\begin{proposition}\label{prelude_omega_inductive}
$\preludeInductive{\preludeOmega}$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_inductive,prelude_omega_empty,prelude_omega_successor}.
\end{proof}
\begin{proposition}\label{prelude_omega_minimal}
For all $A$ we have if $\preludeInductive{A}$, then for all $x$ if $x \in \preludeOmega$, then $x \in A$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_omega}.
\end{proof}
\begin{abbreviation}\label{prelude_naturals}
$\naturals = \preludeOmega$.
\end{abbreviation}
\begin{proposition}\label{prelude_naturals_inductive}
$\preludeInductive{\naturals}$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_omega_inductive}.
\end{proof}
\begin{proposition}\label{prelude_naturals_minimal}
For all $A$ we have if $\preludeInductive{A}$, then for all $x$ if $x \in \naturals$, then $x \in A$.
\end{proposition}
\begin{proof}
Follows by \cref{prelude_omega_minimal}.
\end{proof}
|
