Metamath Proof Explorer


Theorem rexuz

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

Ref Expression
Assertion rexuz ⊢ M ∈ ℤ → ∃ n ∈ ℤ ≥ M φ ↔ ∃ n ∈ ℤ M ≤ n ∧ φ

Proof

Step Hyp Ref Expression
1 eluz1 ⊢ M ∈ ℤ → n ∈ ℤ ≥ M ↔ n ∈ ℤ ∧ M ≤ n
2 1 anbi1d ⊢ M ∈ ℤ → n ∈ ℤ ≥ M ∧ φ ↔ n ∈ ℤ ∧ M ≤ n ∧ φ
3 anass ⊢ n ∈ ℤ ∧ M ≤ n ∧ φ ↔ n ∈ ℤ ∧ M ≤ n ∧ φ
4 2 3 bitrdi ⊢ M ∈ ℤ → n ∈ ℤ ≥ M ∧ φ ↔ n ∈ ℤ ∧ M ≤ n ∧ φ
5 4 rexbidv2 ⊢ M ∈ ℤ → ∃ n ∈ ℤ ≥ M φ ↔ ∃ n ∈ ℤ M ≤ n ∧ φ