Metamath Proof Explorer


Theorem raluz

Description: Restricted universal quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005)

Ref Expression
Assertion raluz ⊢ M ∈ ℤ → ∀ n ∈ ℤ ≥ M φ ↔ ∀ n ∈ ℤ M ≤ n → φ

Proof

Step Hyp Ref Expression
1 eluz1 ⊢ M ∈ ℤ → n ∈ ℤ ≥ M ↔ n ∈ ℤ ∧ M ≤ n
2 1 imbi1d ⊢ M ∈ ℤ → n ∈ ℤ ≥ M → φ ↔ n ∈ ℤ ∧ M ≤ n → φ
3 impexp ⊢ n ∈ ℤ ∧ M ≤ n → φ ↔ n ∈ ℤ → M ≤ n → φ
4 2 3 bitrdi ⊢ M ∈ ℤ → n ∈ ℤ ≥ M → φ ↔ n ∈ ℤ → M ≤ n → φ
5 4 ralbidv2 ⊢ M ∈ ℤ → ∀ n ∈ ℤ ≥ M φ ↔ ∀ n ∈ ℤ M ≤ n → φ