Metamath Proof Explorer


Theorem rexuz2

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

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

Proof

Step Hyp Ref Expression
1 eluz2 ⊢ n ∈ ℤ ≥ M ↔ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n
2 df-3an ⊢ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n ↔ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n
3 1 2 bitri ⊢ n ∈ ℤ ≥ M ↔ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n
4 3 anbi1i ⊢ n ∈ ℤ ≥ M ∧ φ ↔ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n ∧ φ
5 anass ⊢ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n ∧ φ ↔ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n ∧ φ
6 an21 ⊢ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n ∧ φ ↔ n ∈ ℤ ∧ M ∈ ℤ ∧ M ≤ n ∧ φ
7 5 6 bitri ⊢ M ∈ ℤ ∧ n ∈ ℤ ∧ M ≤ n ∧ φ ↔ n ∈ ℤ ∧ M ∈ ℤ ∧ M ≤ n ∧ φ
8 4 7 bitri ⊢ n ∈ ℤ ≥ M ∧ φ ↔ n ∈ ℤ ∧ M ∈ ℤ ∧ M ≤ n ∧ φ
9 8 rexbii2 ⊢ ∃ n ∈ ℤ ≥ M φ ↔ ∃ n ∈ ℤ M ∈ ℤ ∧ M ≤ n ∧ φ
10 r19.42v ⊢ ∃ n ∈ ℤ M ∈ ℤ ∧ M ≤ n ∧ φ ↔ M ∈ ℤ ∧ ∃ n ∈ ℤ M ≤ n ∧ φ
11 9 10 bitri ⊢ ∃ n ∈ ℤ ≥ M φ ↔ M ∈ ℤ ∧ ∃ n ∈ ℤ M ≤ n ∧ φ