Metamath Proof Explorer


Theorem rexuzre

Description: Convert an upper real quantifier to an upper integer quantifier. (Contributed by Mario Carneiro, 7-May-2016)

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

Proof

Step Hyp Ref Expression
1 rexuz3.1 ⊢ Z = ℤ ≥ M
2 eluzelre ⊢ j ∈ ℤ ≥ M → j ∈ ℝ
3 2 1 eleq2s ⊢ j ∈ Z → j ∈ ℝ
4 3 adantr ⊢ j ∈ Z ∧ ∀ k ∈ ℤ ≥ j φ → j ∈ ℝ
5 eluzelz ⊢ j ∈ ℤ ≥ M → j ∈ ℤ
6 5 1 eleq2s ⊢ j ∈ Z → j ∈ ℤ
7 eluzelz ⊢ k ∈ ℤ ≥ M → k ∈ ℤ
8 7 1 eleq2s ⊢ k ∈ Z → k ∈ ℤ
9 eluz ⊢ j ∈ ℤ ∧ k ∈ ℤ → k ∈ ℤ ≥ j ↔ j ≤ k
10 6 8 9 syl2an ⊢ j ∈ Z ∧ k ∈ Z → k ∈ ℤ ≥ j ↔ j ≤ k
11 10 biimprd ⊢ j ∈ Z ∧ k ∈ Z → j ≤ k → k ∈ ℤ ≥ j
12 11 expimpd ⊢ j ∈ Z → k ∈ Z ∧ j ≤ k → k ∈ ℤ ≥ j
13 12 imim1d ⊢ j ∈ Z → k ∈ ℤ ≥ j → φ → k ∈ Z ∧ j ≤ k → φ
14 13 exp4a ⊢ j ∈ Z → k ∈ ℤ ≥ j → φ → k ∈ Z → j ≤ k → φ
15 14 ralimdv2 ⊢ j ∈ Z → ∀ k ∈ ℤ ≥ j φ → ∀ k ∈ Z j ≤ k → φ
16 15 imp ⊢ j ∈ Z ∧ ∀ k ∈ ℤ ≥ j φ → ∀ k ∈ Z j ≤ k → φ
17 4 16 jca ⊢ j ∈ Z ∧ ∀ k ∈ ℤ ≥ j φ → j ∈ ℝ ∧ ∀ k ∈ Z j ≤ k → φ
18 17 reximi2 ⊢ ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ → ∃ j ∈ ℝ ∀ k ∈ Z j ≤ k → φ
19 simpl ⊢ M ∈ ℤ ∧ j ∈ ℝ → M ∈ ℤ
20 flcl ⊢ j ∈ ℝ → j ∈ ℤ
21 20 adantl ⊢ M ∈ ℤ ∧ j ∈ ℝ → j ∈ ℤ
22 21 peano2zd ⊢ M ∈ ℤ ∧ j ∈ ℝ → j + 1 ∈ ℤ
23 22 19 ifcld ⊢ M ∈ ℤ ∧ j ∈ ℝ → if M ≤ j + 1 j + 1 M ∈ ℤ
24 zre ⊢ M ∈ ℤ → M ∈ ℝ
25 reflcl ⊢ j ∈ ℝ → j ∈ ℝ
26 peano2re ⊢ j ∈ ℝ → j + 1 ∈ ℝ
27 25 26 syl ⊢ j ∈ ℝ → j + 1 ∈ ℝ
28 max1 ⊢ M ∈ ℝ ∧ j + 1 ∈ ℝ → M ≤ if M ≤ j + 1 j + 1 M
29 24 27 28 syl2an ⊢ M ∈ ℤ ∧ j ∈ ℝ → M ≤ if M ≤ j + 1 j + 1 M
30 eluz2 ⊢ if M ≤ j + 1 j + 1 M ∈ ℤ ≥ M ↔ M ∈ ℤ ∧ if M ≤ j + 1 j + 1 M ∈ ℤ ∧ M ≤ if M ≤ j + 1 j + 1 M
31 19 23 29 30 syl3anbrc ⊢ M ∈ ℤ ∧ j ∈ ℝ → if M ≤ j + 1 j + 1 M ∈ ℤ ≥ M
32 31 1 eleqtrrdi ⊢ M ∈ ℤ ∧ j ∈ ℝ → if M ≤ j + 1 j + 1 M ∈ Z
33 impexp ⊢ k ∈ Z ∧ j ≤ k → φ ↔ k ∈ Z → j ≤ k → φ
34 uzss ⊢ if M ≤ j + 1 j + 1 M ∈ ℤ ≥ M → ℤ ≥ if M ≤ j + 1 j + 1 M ⊆ ℤ ≥ M
35 31 34 syl ⊢ M ∈ ℤ ∧ j ∈ ℝ → ℤ ≥ if M ≤ j + 1 j + 1 M ⊆ ℤ ≥ M
36 35 1 sseqtrrdi ⊢ M ∈ ℤ ∧ j ∈ ℝ → ℤ ≥ if M ≤ j + 1 j + 1 M ⊆ Z
37 36 sselda ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → k ∈ Z
38 simplr ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → j ∈ ℝ
39 23 adantr ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → if M ≤ j + 1 j + 1 M ∈ ℤ
40 39 zred ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → if M ≤ j + 1 j + 1 M ∈ ℝ
41 eluzelre ⊢ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → k ∈ ℝ
42 41 adantl ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → k ∈ ℝ
43 simpr ⊢ M ∈ ℤ ∧ j ∈ ℝ → j ∈ ℝ
44 27 adantl ⊢ M ∈ ℤ ∧ j ∈ ℝ → j + 1 ∈ ℝ
45 23 zred ⊢ M ∈ ℤ ∧ j ∈ ℝ → if M ≤ j + 1 j + 1 M ∈ ℝ
46 fllep1 ⊢ j ∈ ℝ → j ≤ j + 1
47 46 adantl ⊢ M ∈ ℤ ∧ j ∈ ℝ → j ≤ j + 1
48 max2 ⊢ M ∈ ℝ ∧ j + 1 ∈ ℝ → j + 1 ≤ if M ≤ j + 1 j + 1 M
49 24 27 48 syl2an ⊢ M ∈ ℤ ∧ j ∈ ℝ → j + 1 ≤ if M ≤ j + 1 j + 1 M
50 43 44 45 47 49 letrd ⊢ M ∈ ℤ ∧ j ∈ ℝ → j ≤ if M ≤ j + 1 j + 1 M
51 50 adantr ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → j ≤ if M ≤ j + 1 j + 1 M
52 eluzle ⊢ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → if M ≤ j + 1 j + 1 M ≤ k
53 52 adantl ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → if M ≤ j + 1 j + 1 M ≤ k
54 38 40 42 51 53 letrd ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → j ≤ k
55 37 54 jca ⊢ M ∈ ℤ ∧ j ∈ ℝ ∧ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → k ∈ Z ∧ j ≤ k
56 55 ex ⊢ M ∈ ℤ ∧ j ∈ ℝ → k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → k ∈ Z ∧ j ≤ k
57 56 imim1d ⊢ M ∈ ℤ ∧ j ∈ ℝ → k ∈ Z ∧ j ≤ k → φ → k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → φ
58 33 57 biimtrrid ⊢ M ∈ ℤ ∧ j ∈ ℝ → k ∈ Z → j ≤ k → φ → k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M → φ
59 58 ralimdv2 ⊢ M ∈ ℤ ∧ j ∈ ℝ → ∀ k ∈ Z j ≤ k → φ → ∀ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M φ
60 fveq2 ⊢ m = if M ≤ j + 1 j + 1 M → ℤ ≥ m = ℤ ≥ if M ≤ j + 1 j + 1 M
61 60 raleqdv ⊢ m = if M ≤ j + 1 j + 1 M → ∀ k ∈ ℤ ≥ m φ ↔ ∀ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M φ
62 61 rspcev ⊢ if M ≤ j + 1 j + 1 M ∈ Z ∧ ∀ k ∈ ℤ ≥ if M ≤ j + 1 j + 1 M φ → ∃ m ∈ Z ∀ k ∈ ℤ ≥ m φ
63 32 59 62 syl6an ⊢ M ∈ ℤ ∧ j ∈ ℝ → ∀ k ∈ Z j ≤ k → φ → ∃ m ∈ Z ∀ k ∈ ℤ ≥ m φ
64 63 rexlimdva ⊢ M ∈ ℤ → ∃ j ∈ ℝ ∀ k ∈ Z j ≤ k → φ → ∃ m ∈ Z ∀ k ∈ ℤ ≥ m φ
65 fveq2 ⊢ m = j → ℤ ≥ m = ℤ ≥ j
66 65 raleqdv ⊢ m = j → ∀ k ∈ ℤ ≥ m φ ↔ ∀ k ∈ ℤ ≥ j φ
67 66 cbvrexvw ⊢ ∃ m ∈ Z ∀ k ∈ ℤ ≥ m φ ↔ ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ
68 64 67 imbitrdi ⊢ M ∈ ℤ → ∃ j ∈ ℝ ∀ k ∈ Z j ≤ k → φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ
69 18 68 impbid2 ⊢ M ∈ ℤ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j φ ↔ ∃ j ∈ ℝ ∀ k ∈ Z j ≤ k → φ