Metamath Proof Explorer


Theorem rexuz3

Description: Restrict the base of the upper integers set to another upper integers set. (Contributed by Mario Carneiro, 26-Dec-2013)

Ref Expression
Hypothesis rexuz3.1 ⊢ Z = ℤ ≥ M
Assertion rexuz3 ⊢ M ∈ ℤ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j φ

Proof

Step Hyp Ref Expression
1 rexuz3.1 ⊢ Z = ℤ ≥ M
2 ralel ⊢ ∀ k ∈ Z k ∈ Z
3 fveq2 ⊢ j = M → ℤ ≥ j = ℤ ≥ M
4 3 1 eqtr4di ⊢ j = M → ℤ ≥ j = Z
5 4 raleqdv ⊢ j = M → ∀ k ∈ ℤ ≥ j k ∈ Z ↔ ∀ k ∈ Z k ∈ Z
6 5 rspcev ⊢ M ∈ ℤ ∧ ∀ k ∈ Z k ∈ Z → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ Z
7 2 6 mpan2 ⊢ M ∈ ℤ → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ Z
8 7 biantrurd ⊢ M ∈ ℤ → ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j φ ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j φ
9 1 uztrn2 ⊢ j ∈ Z ∧ k ∈ ℤ ≥ j → k ∈ Z
10 9 a1d ⊢ j ∈ Z ∧ k ∈ ℤ ≥ j → φ → k ∈ Z
11 10 ancrd ⊢ j ∈ Z ∧ k ∈ ℤ ≥ j → φ → k ∈ Z ∧ φ
12 11 ralimdva ⊢ j ∈ Z → ∀ k ∈ ℤ ≥ j φ → ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ
13 eluzelz ⊢ j ∈ ℤ ≥ M → j ∈ ℤ
14 13 1 eleq2s ⊢ j ∈ Z → j ∈ ℤ
15 12 14 jctild ⊢ j ∈ Z → ∀ k ∈ ℤ ≥ j φ → j ∈ ℤ ∧ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ
16 15 imp ⊢ j ∈ Z ∧ ∀ k ∈ ℤ ≥ j φ → j ∈ ℤ ∧ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ
17 uzid ⊢ j ∈ ℤ → j ∈ ℤ ≥ j
18 simpl ⊢ k ∈ Z ∧ φ → k ∈ Z
19 18 ralimi ⊢ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ → ∀ k ∈ ℤ ≥ j k ∈ Z
20 eleq1w ⊢ k = j → k ∈ Z ↔ j ∈ Z
21 20 rspcva ⊢ j ∈ ℤ ≥ j ∧ ∀ k ∈ ℤ ≥ j k ∈ Z → j ∈ Z
22 17 19 21 syl2an ⊢ j ∈ ℤ ∧ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ → j ∈ Z
23 simpr ⊢ k ∈ Z ∧ φ → φ
24 23 ralimi ⊢ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ → ∀ k ∈ ℤ ≥ j φ
25 24 adantl ⊢ j ∈ ℤ ∧ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ → ∀ k ∈ ℤ ≥ j φ
26 22 25 jca ⊢ j ∈ ℤ ∧ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ → j ∈ Z ∧ ∀ k ∈ ℤ ≥ j φ
27 16 26 impbii ⊢ j ∈ Z ∧ ∀ k ∈ ℤ ≥ j φ ↔ j ∈ ℤ ∧ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ
28 27 rexbii2 ⊢ ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ
29 rexanuz ⊢ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ φ ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j φ
30 28 29 bitr2i ⊢ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j k ∈ Z ∧ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j φ ↔ ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ
31 8 30 bitr2di ⊢ M ∈ ℤ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ ↔ ∃ j ∈ ℤ ∀ k ∈ ℤ ≥ j φ