Database
ZF (ZERMELO-FRAENKEL) SET THEORY
ZF Set Theory - add the Axiom of Union
Finite sets (cont.)
prfi
Next ⟩
tpfi
Metamath Proof Explorer
Ascii
Unicode
Theorem
prfi
Description:
An unordered pair is finite.
(Contributed by
NM
, 22-Aug-2008)
Ref
Expression
Assertion
prfi
⊢
A
B
∈
Fin
Proof
Step
Hyp
Ref
Expression
1
df-pr
⊢
A
B
=
A
∪
B
2
snfi
⊢
A
∈
Fin
3
snfi
⊢
B
∈
Fin
4
unfi
⊢
A
∈
Fin
∧
B
∈
Fin
→
A
∪
B
∈
Fin
5
2
3
4
mp2an
⊢
A
∪
B
∈
Fin
6
1
5
eqeltri
⊢
A
B
∈
Fin