Metamath Proof Explorer


Theorem aaliou2b

Description: Liouville's approximation theorem extended to complex A . (Contributed by Stefan O'Rear, 20-Nov-2014)

Ref Expression
Assertion aaliou2b ⊢ A ∈ 𝔸 → ∃ k ∈ ℕ ∃ x ∈ ℝ + ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q k < A − p q

Proof

Step Hyp Ref Expression
1 elin ⊢ A ∈ 𝔸 ∩ ℝ ↔ A ∈ 𝔸 ∧ A ∈ ℝ
2 aaliou2 ⊢ A ∈ 𝔸 ∩ ℝ → ∃ k ∈ ℕ ∃ x ∈ ℝ + ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q k < A − p q
3 1 2 sylbir ⊢ A ∈ 𝔸 ∧ A ∈ ℝ → ∃ k ∈ ℕ ∃ x ∈ ℝ + ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q k < A − p q
4 1nn ⊢ 1 ∈ ℕ
5 aacn ⊢ A ∈ 𝔸 → A ∈ ℂ
6 5 adantr ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → A ∈ ℂ
7 6 imcld ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → ℑ ⁡ A ∈ ℝ
8 7 recnd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → ℑ ⁡ A ∈ ℂ
9 reim0b ⊢ A ∈ ℂ → A ∈ ℝ ↔ ℑ ⁡ A = 0
10 5 9 syl ⊢ A ∈ 𝔸 → A ∈ ℝ ↔ ℑ ⁡ A = 0
11 10 necon3bbid ⊢ A ∈ 𝔸 → ¬ A ∈ ℝ ↔ ℑ ⁡ A ≠ 0
12 11 biimpa ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → ℑ ⁡ A ≠ 0
13 8 12 absrpcld ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → ℑ ⁡ A ∈ ℝ +
14 13 rphalfcld ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → ℑ ⁡ A 2 ∈ ℝ +
15 14 adantr ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 ∈ ℝ +
16 1nn0 ⊢ 1 ∈ ℕ 0
17 nnexpcl ⊢ q ∈ ℕ ∧ 1 ∈ ℕ 0 → q 1 ∈ ℕ
18 16 17 mpan2 ⊢ q ∈ ℕ → q 1 ∈ ℕ
19 18 ad2antll ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → q 1 ∈ ℕ
20 19 nnrpd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → q 1 ∈ ℝ +
21 15 20 rpdivcld ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 q 1 ∈ ℝ +
22 21 rpred ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 q 1 ∈ ℝ
23 15 rpred ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 ∈ ℝ
24 6 adantr ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → A ∈ ℂ
25 znq ⊢ p ∈ ℤ ∧ q ∈ ℕ → p q ∈ ℚ
26 25 adantl ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → p q ∈ ℚ
27 qre ⊢ p q ∈ ℚ → p q ∈ ℝ
28 26 27 syl ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → p q ∈ ℝ
29 28 recnd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → p q ∈ ℂ
30 24 29 subcld ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → A − p q ∈ ℂ
31 30 abscld ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → A − p q ∈ ℝ
32 19 nnge1d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → 1 ≤ q 1
33 1rp ⊢ 1 ∈ ℝ +
34 rpregt0 ⊢ 1 ∈ ℝ + → 1 ∈ ℝ ∧ 0 < 1
35 33 34 mp1i ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → 1 ∈ ℝ ∧ 0 < 1
36 20 rpregt0d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → q 1 ∈ ℝ ∧ 0 < q 1
37 15 rpregt0d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 ∈ ℝ ∧ 0 < ℑ ⁡ A 2
38 lediv2 ⊢ 1 ∈ ℝ ∧ 0 < 1 ∧ q 1 ∈ ℝ ∧ 0 < q 1 ∧ ℑ ⁡ A 2 ∈ ℝ ∧ 0 < ℑ ⁡ A 2 → 1 ≤ q 1 ↔ ℑ ⁡ A 2 q 1 ≤ ℑ ⁡ A 2 1
39 35 36 37 38 syl3anc ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → 1 ≤ q 1 ↔ ℑ ⁡ A 2 q 1 ≤ ℑ ⁡ A 2 1
40 32 39 mpbid ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 q 1 ≤ ℑ ⁡ A 2 1
41 15 rpcnd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 ∈ ℂ
42 41 div1d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 1 = ℑ ⁡ A 2
43 40 42 breqtrd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 q 1 ≤ ℑ ⁡ A 2
44 13 adantr ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A ∈ ℝ +
45 44 rpred ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A ∈ ℝ
46 rphalflt ⊢ ℑ ⁡ A ∈ ℝ + → ℑ ⁡ A 2 < ℑ ⁡ A
47 44 46 syl ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 < ℑ ⁡ A
48 24 29 imsubd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A − p q = ℑ ⁡ A − ℑ ⁡ p q
49 28 reim0d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ p q = 0
50 49 oveq2d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A − ℑ ⁡ p q = ℑ ⁡ A − 0
51 8 adantr ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A ∈ ℂ
52 51 subid1d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A − 0 = ℑ ⁡ A
53 48 50 52 3eqtrd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A − p q = ℑ ⁡ A
54 53 fveq2d ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A − p q = ℑ ⁡ A
55 absimle ⊢ A − p q ∈ ℂ → ℑ ⁡ A − p q ≤ A − p q
56 30 55 syl ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A − p q ≤ A − p q
57 54 56 eqbrtrrd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A ≤ A − p q
58 23 45 31 47 57 ltletrd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 < A − p q
59 22 23 31 43 58 lelttrd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → ℑ ⁡ A 2 q 1 < A − p q
60 59 olcd ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ ∧ p ∈ ℤ ∧ q ∈ ℕ → A = p q ∨ ℑ ⁡ A 2 q 1 < A − p q
61 60 ralrimivva ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ ℑ ⁡ A 2 q 1 < A − p q
62 oveq2 ⊢ k = 1 → q k = q 1
63 62 oveq2d ⊢ k = 1 → x q k = x q 1
64 63 breq1d ⊢ k = 1 → x q k < A − p q ↔ x q 1 < A − p q
65 64 orbi2d ⊢ k = 1 → A = p q ∨ x q k < A − p q ↔ A = p q ∨ x q 1 < A − p q
66 65 2ralbidv ⊢ k = 1 → ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q k < A − p q ↔ ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q 1 < A − p q
67 oveq1 ⊢ x = ℑ ⁡ A 2 → x q 1 = ℑ ⁡ A 2 q 1
68 67 breq1d ⊢ x = ℑ ⁡ A 2 → x q 1 < A − p q ↔ ℑ ⁡ A 2 q 1 < A − p q
69 68 orbi2d ⊢ x = ℑ ⁡ A 2 → A = p q ∨ x q 1 < A − p q ↔ A = p q ∨ ℑ ⁡ A 2 q 1 < A − p q
70 69 2ralbidv ⊢ x = ℑ ⁡ A 2 → ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q 1 < A − p q ↔ ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ ℑ ⁡ A 2 q 1 < A − p q
71 66 70 rspc2ev ⊢ 1 ∈ ℕ ∧ ℑ ⁡ A 2 ∈ ℝ + ∧ ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ ℑ ⁡ A 2 q 1 < A − p q → ∃ k ∈ ℕ ∃ x ∈ ℝ + ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q k < A − p q
72 4 14 61 71 mp3an2i ⊢ A ∈ 𝔸 ∧ ¬ A ∈ ℝ → ∃ k ∈ ℕ ∃ x ∈ ℝ + ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q k < A − p q
73 3 72 pm2.61dan ⊢ A ∈ 𝔸 → ∃ k ∈ ℕ ∃ x ∈ ℝ + ∀ p ∈ ℤ ∀ q ∈ ℕ A = p q ∨ x q k < A − p q