Cardinality
Logic
Propositional logic
Predicate-Logic
Set
Set
Set operation
Binary relation and Map
Equivalence relation
Ordered set
Wellordered set
Axiom of Choice
Cardinality
Topology
Topology
Topological space
Continuous map
Compact
Separation axioms
Metric-space
Convergence
Linear algebra
Linear space
Product space
Basis
Orthogonal system
Linear operator
Determinant
Elementary matrix
Rank
Eigenspace
Nomal matrix
Group
Group
Subgroup
Cyclic group
Symmetric group
Quotient group
Homomorphism
Cartesian product
Group action
Real analysis
Convergence of real sequence
Convergence theorem1
Convergence of real series
Convergence of real function
Convergence theorem2
Measure theory
Finitely additive measure
Outer measure
Measure space
Back
en
ja
Equality of cardinality
∣
A
∣
=
∣
B
∣
:
f
exists
Comparison of cardinality
∣
A
∣
≤
∣
B
∣
:
f
exists
Schröder–Bernstein theorem
∃
f
,
g
(
f
,
g
are injective
)
⇒
∃
h
(
h
is bijective
)
Proposition
∣
A
∣
≤
∣
B
∣
∧
∣
B
∣
≤
∣
A
∣
⇒
∣
A
∣
=
∣
B
∣
[n]
[
n
]
:=
{
{
1
,
2
,
...
,
n
}
(
n
≥
1
)
ϕ
(
n
=
0
)
Infinite set
Infinite set: Set that is not finite set
Countable set
A
is a countable set:
∣
A
∣
=
∣
N
∣
Uncountable set
A
is an uncountable set:
A
is not countable set
Finite set
A
is a finite set:
∃
n
1
∈
N
0
(
∣
A
∣
=
∣
[
n
1
]
∣
)
Also
∣
A
∣
:=
♯
A
=
n
1
Equality of cardinality
Comparison of cardinality
Schröder–Bernstein theorem
Proposition
[n]
Infinite set
Countable set
Uncountable set
Finite set