Metamath Proof Explorer


Theorem uzssz

Description: An upper set of integers is a subset of all integers. (Contributed by NM, 2-Sep-2005) (Revised by Mario Carneiro, 3-Nov-2013)

Ref Expression
Assertion uzssz ⊢ ℤ ≥ M ⊆ ℤ

Proof

Step Hyp Ref Expression
1 uzf ⊢ ℤ ≥ : ℤ ⟶ 𝒫 ℤ
2 1 ffvelcdmi ⊢ M ∈ ℤ → ℤ ≥ M ∈ 𝒫 ℤ
3 2 elpwid ⊢ M ∈ ℤ → ℤ ≥ M ⊆ ℤ
4 1 fdmi ⊢ dom ⁡ ℤ ≥ = ℤ
5 3 4 eleq2s ⊢ M ∈ dom ⁡ ℤ ≥ → ℤ ≥ M ⊆ ℤ
6 ndmfv ⊢ ¬ M ∈ dom ⁡ ℤ ≥ → ℤ ≥ M = ∅
7 0ss ⊢ ∅ ⊆ ℤ
8 6 7 eqsstrdi ⊢ ¬ M ∈ dom ⁡ ℤ ≥ → ℤ ≥ M ⊆ ℤ
9 5 8 pm2.61i ⊢ ℤ ≥ M ⊆ ℤ