Metamath Proof Explorer


Theorem hashprlei

Description: An unordered pair has at most two elements. (Contributed by Mario Carneiro, 11-Feb-2015)

Ref Expression
Assertion hashprlei ⊢ A B ∈ Fin ∧ A B ≤ 2

Proof

Step Hyp Ref Expression
1 df-pr ⊢ A B = A ∪ B
2 hashsnlei ⊢ A ∈ Fin ∧ A ≤ 1
3 hashsnlei ⊢ B ∈ Fin ∧ B ≤ 1
4 1nn0 ⊢ 1 ∈ ℕ 0
5 1p1e2 ⊢ 1 + 1 = 2
6 1 2 3 4 4 5 hashunlei ⊢ A B ∈ Fin ∧ A B ≤ 2