Metamath Proof Explorer


Theorem dignn0flhalflem1

Description: Lemma 1 for dignn0flhalf . (Contributed by AV, 7-Jun-2012)

Ref Expression
Assertion dignn0flhalflem1 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A 2 N − 1 < A − 1 2 N

Proof

Step Hyp Ref Expression
1 zre ⊢ A ∈ ℤ → A ∈ ℝ
2 1 3ad2ant1 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A ∈ ℝ
3 2rp ⊢ 2 ∈ ℝ +
4 3 a1i ⊢ N ∈ ℕ → 2 ∈ ℝ +
5 nnz ⊢ N ∈ ℕ → N ∈ ℤ
6 4 5 rpexpcld ⊢ N ∈ ℕ → 2 N ∈ ℝ +
7 6 rpred ⊢ N ∈ ℕ → 2 N ∈ ℝ
8 7 3ad2ant3 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N ∈ ℝ
9 2 8 resubcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 2 N ∈ ℝ
10 6 3ad2ant3 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N ∈ ℝ +
11 9 10 modcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 2 N mod 2 N ∈ ℝ
12 9 11 resubcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A - 2 N - A − 2 N mod 2 N ∈ ℝ
13 peano2zm ⊢ A ∈ ℤ → A − 1 ∈ ℤ
14 13 zred ⊢ A ∈ ℤ → A − 1 ∈ ℝ
15 14 3ad2ant1 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 ∈ ℝ
16 15 10 modcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 mod 2 N ∈ ℝ
17 15 16 resubcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A - 1 - A − 1 mod 2 N ∈ ℝ
18 1red ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 1 ∈ ℝ
19 18 16 readdcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 1 + A − 1 mod 2 N ∈ ℝ
20 8 11 readdcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N + A − 2 N mod 2 N ∈ ℝ
21 2nn ⊢ 2 ∈ ℕ
22 21 a1i ⊢ N ∈ ℕ → 2 ∈ ℕ
23 nnnn0 ⊢ N ∈ ℕ → N ∈ ℕ 0
24 22 23 nnexpcld ⊢ N ∈ ℕ → 2 N ∈ ℕ
25 24 anim2i ⊢ A ∈ ℤ ∧ N ∈ ℕ → A ∈ ℤ ∧ 2 N ∈ ℕ
26 25 3adant2 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A ∈ ℤ ∧ 2 N ∈ ℕ
27 m1modmmod ⊢ A ∈ ℤ ∧ 2 N ∈ ℕ → A − 1 mod 2 N − A mod 2 N = if A mod 2 N = 0 2 N − 1 − 1
28 26 27 syl ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 mod 2 N − A mod 2 N = if A mod 2 N = 0 2 N − 1 − 1
29 nnz ⊢ A − 1 2 ∈ ℕ → A − 1 2 ∈ ℤ
30 29 a1i ⊢ A ∈ ℤ ∧ N ∈ ℕ → A − 1 2 ∈ ℕ → A − 1 2 ∈ ℤ
31 zcn ⊢ A ∈ ℤ → A ∈ ℂ
32 xp1d2m1eqxm1d2 ⊢ A ∈ ℂ → A + 1 2 − 1 = A − 1 2
33 32 eqcomd ⊢ A ∈ ℂ → A − 1 2 = A + 1 2 − 1
34 31 33 syl ⊢ A ∈ ℤ → A − 1 2 = A + 1 2 − 1
35 34 adantr ⊢ A ∈ ℤ ∧ N ∈ ℕ → A − 1 2 = A + 1 2 − 1
36 35 eleq1d ⊢ A ∈ ℤ ∧ N ∈ ℕ → A − 1 2 ∈ ℤ ↔ A + 1 2 − 1 ∈ ℤ
37 peano2z ⊢ A + 1 2 − 1 ∈ ℤ → A + 1 2 - 1 + 1 ∈ ℤ
38 31 adantr ⊢ A ∈ ℤ ∧ N ∈ ℕ → A ∈ ℂ
39 1cnd ⊢ A ∈ ℤ ∧ N ∈ ℕ → 1 ∈ ℂ
40 38 39 addcld ⊢ A ∈ ℤ ∧ N ∈ ℕ → A + 1 ∈ ℂ
41 40 halfcld ⊢ A ∈ ℤ ∧ N ∈ ℕ → A + 1 2 ∈ ℂ
42 41 39 npcand ⊢ A ∈ ℤ ∧ N ∈ ℕ → A + 1 2 - 1 + 1 = A + 1 2
43 42 eleq1d ⊢ A ∈ ℤ ∧ N ∈ ℕ → A + 1 2 - 1 + 1 ∈ ℤ ↔ A + 1 2 ∈ ℤ
44 37 43 imbitrid ⊢ A ∈ ℤ ∧ N ∈ ℕ → A + 1 2 − 1 ∈ ℤ → A + 1 2 ∈ ℤ
45 36 44 sylbid ⊢ A ∈ ℤ ∧ N ∈ ℕ → A − 1 2 ∈ ℤ → A + 1 2 ∈ ℤ
46 mod0 ⊢ A ∈ ℝ ∧ 2 N ∈ ℝ + → A mod 2 N = 0 ↔ A 2 N ∈ ℤ
47 1 6 46 syl2an ⊢ A ∈ ℤ ∧ N ∈ ℕ → A mod 2 N = 0 ↔ A 2 N ∈ ℤ
48 22 nnzd ⊢ N ∈ ℕ → 2 ∈ ℤ
49 nnm1nn0 ⊢ N ∈ ℕ → N − 1 ∈ ℕ 0
50 48 49 zexpcld ⊢ N ∈ ℕ → 2 N − 1 ∈ ℤ
51 50 adantl ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N − 1 ∈ ℤ
52 51 adantr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ A 2 N ∈ ℤ → 2 N − 1 ∈ ℤ
53 simpr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ A 2 N ∈ ℤ → A 2 N ∈ ℤ
54 52 53 zmulcld ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ A 2 N ∈ ℤ → 2 N − 1 ⁢ A 2 N ∈ ℤ
55 54 ex ⊢ A ∈ ℤ ∧ N ∈ ℕ → A 2 N ∈ ℤ → 2 N − 1 ⁢ A 2 N ∈ ℤ
56 5 adantl ⊢ A ∈ ℤ ∧ N ∈ ℕ → N ∈ ℤ
57 56 zcnd ⊢ A ∈ ℤ ∧ N ∈ ℕ → N ∈ ℂ
58 39 negcld ⊢ A ∈ ℤ ∧ N ∈ ℕ → − 1 ∈ ℂ
59 57 39 negsubd ⊢ A ∈ ℤ ∧ N ∈ ℕ → N + -1 = N − 1
60 57 58 59 mvlladdcd ⊢ A ∈ ℤ ∧ N ∈ ℕ → N - 1 - N = − 1
61 60 oveq2d ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N - 1 - N = 2 − 1
62 2cnd ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 ∈ ℂ
63 2ne0 ⊢ 2 ≠ 0
64 63 a1i ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 ≠ 0
65 1zzd ⊢ N ∈ ℕ → 1 ∈ ℤ
66 5 65 zsubcld ⊢ N ∈ ℕ → N − 1 ∈ ℤ
67 66 5 jca ⊢ N ∈ ℕ → N − 1 ∈ ℤ ∧ N ∈ ℤ
68 67 adantl ⊢ A ∈ ℤ ∧ N ∈ ℕ → N − 1 ∈ ℤ ∧ N ∈ ℤ
69 expsub ⊢ 2 ∈ ℂ ∧ 2 ≠ 0 ∧ N − 1 ∈ ℤ ∧ N ∈ ℤ → 2 N - 1 - N = 2 N − 1 2 N
70 62 64 68 69 syl21anc ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N - 1 - N = 2 N − 1 2 N
71 expn1 ⊢ 2 ∈ ℂ → 2 − 1 = 1 2
72 62 71 syl ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 − 1 = 1 2
73 61 70 72 3eqtr3d ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N − 1 2 N = 1 2
74 73 oveq2d ⊢ A ∈ ℤ ∧ N ∈ ℕ → A ⁢ 2 N − 1 2 N = A ⁢ 1 2
75 2cnd ⊢ N ∈ ℕ → 2 ∈ ℂ
76 75 49 expcld ⊢ N ∈ ℕ → 2 N − 1 ∈ ℂ
77 76 adantl ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N − 1 ∈ ℂ
78 3 a1i ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 ∈ ℝ +
79 78 56 rpexpcld ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N ∈ ℝ +
80 79 rpcnne0d ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N ∈ ℂ ∧ 2 N ≠ 0
81 div12 ⊢ 2 N − 1 ∈ ℂ ∧ A ∈ ℂ ∧ 2 N ∈ ℂ ∧ 2 N ≠ 0 → 2 N − 1 ⁢ A 2 N = A ⁢ 2 N − 1 2 N
82 77 38 80 81 syl3anc ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N − 1 ⁢ A 2 N = A ⁢ 2 N − 1 2 N
83 38 62 64 divrecd ⊢ A ∈ ℤ ∧ N ∈ ℕ → A 2 = A ⁢ 1 2
84 74 82 83 3eqtr4d ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N − 1 ⁢ A 2 N = A 2
85 84 eleq1d ⊢ A ∈ ℤ ∧ N ∈ ℕ → 2 N − 1 ⁢ A 2 N ∈ ℤ ↔ A 2 ∈ ℤ
86 55 85 sylibd ⊢ A ∈ ℤ ∧ N ∈ ℕ → A 2 N ∈ ℤ → A 2 ∈ ℤ
87 47 86 sylbid ⊢ A ∈ ℤ ∧ N ∈ ℕ → A mod 2 N = 0 → A 2 ∈ ℤ
88 zeo2 ⊢ A ∈ ℤ → A 2 ∈ ℤ ↔ ¬ A + 1 2 ∈ ℤ
89 88 adantr ⊢ A ∈ ℤ ∧ N ∈ ℕ → A 2 ∈ ℤ ↔ ¬ A + 1 2 ∈ ℤ
90 87 89 sylibd ⊢ A ∈ ℤ ∧ N ∈ ℕ → A mod 2 N = 0 → ¬ A + 1 2 ∈ ℤ
91 90 necon2ad ⊢ A ∈ ℤ ∧ N ∈ ℕ → A + 1 2 ∈ ℤ → A mod 2 N ≠ 0
92 30 45 91 3syld ⊢ A ∈ ℤ ∧ N ∈ ℕ → A − 1 2 ∈ ℕ → A mod 2 N ≠ 0
93 92 ex ⊢ A ∈ ℤ → N ∈ ℕ → A − 1 2 ∈ ℕ → A mod 2 N ≠ 0
94 93 com23 ⊢ A ∈ ℤ → A − 1 2 ∈ ℕ → N ∈ ℕ → A mod 2 N ≠ 0
95 94 3imp ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N ≠ 0
96 95 neneqd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → ¬ A mod 2 N = 0
97 96 iffalsed ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → if A mod 2 N = 0 2 N − 1 − 1 = − 1
98 28 97 eqtrd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 mod 2 N − A mod 2 N = − 1
99 neg1lt0 ⊢ − 1 < 0
100 2re ⊢ 2 ∈ ℝ
101 1lt2 ⊢ 1 < 2
102 expgt1 ⊢ 2 ∈ ℝ ∧ N ∈ ℕ ∧ 1 < 2 → 1 < 2 N
103 100 101 102 mp3an13 ⊢ N ∈ ℕ → 1 < 2 N
104 1red ⊢ N ∈ ℕ → 1 ∈ ℝ
105 104 7 posdifd ⊢ N ∈ ℕ → 1 < 2 N ↔ 0 < 2 N − 1
106 103 105 mpbid ⊢ N ∈ ℕ → 0 < 2 N − 1
107 104 renegcld ⊢ N ∈ ℕ → − 1 ∈ ℝ
108 0red ⊢ N ∈ ℕ → 0 ∈ ℝ
109 7 104 resubcld ⊢ N ∈ ℕ → 2 N − 1 ∈ ℝ
110 lttr ⊢ − 1 ∈ ℝ ∧ 0 ∈ ℝ ∧ 2 N − 1 ∈ ℝ → − 1 < 0 ∧ 0 < 2 N − 1 → − 1 < 2 N − 1
111 107 108 109 110 syl3anc ⊢ N ∈ ℕ → − 1 < 0 ∧ 0 < 2 N − 1 → − 1 < 2 N − 1
112 106 111 mpan2d ⊢ N ∈ ℕ → − 1 < 0 → − 1 < 2 N − 1
113 99 112 mpi ⊢ N ∈ ℕ → − 1 < 2 N − 1
114 113 3ad2ant3 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → − 1 < 2 N − 1
115 98 114 eqbrtrd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 mod 2 N − A mod 2 N < 2 N − 1
116 2 10 modcld ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N ∈ ℝ
117 ltsubadd2b ⊢ 1 ∈ ℝ ∧ 2 N ∈ ℝ ∧ A mod 2 N ∈ ℝ ∧ A − 1 mod 2 N ∈ ℝ → A − 1 mod 2 N − A mod 2 N < 2 N − 1 ↔ 1 + A − 1 mod 2 N < 2 N + A mod 2 N
118 18 8 116 16 117 syl22anc ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 mod 2 N − A mod 2 N < 2 N − 1 ↔ 1 + A − 1 mod 2 N < 2 N + A mod 2 N
119 115 118 mpbid ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 1 + A − 1 mod 2 N < 2 N + A mod 2 N
120 modid0 ⊢ 2 N ∈ ℝ + → 2 N mod 2 N = 0
121 10 120 syl ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N mod 2 N = 0
122 121 oveq2d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N − 2 N mod 2 N = A mod 2 N − 0
123 116 recnd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N ∈ ℂ
124 123 subid1d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N − 0 = A mod 2 N
125 122 124 eqtrd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N − 2 N mod 2 N = A mod 2 N
126 125 oveq1d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N − 2 N mod 2 N mod 2 N = A mod 2 N mod 2 N
127 modsubmodmod ⊢ A ∈ ℝ ∧ 2 N ∈ ℝ ∧ 2 N ∈ ℝ + → A mod 2 N − 2 N mod 2 N mod 2 N = A − 2 N mod 2 N
128 2 8 10 127 syl3anc ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N − 2 N mod 2 N mod 2 N = A − 2 N mod 2 N
129 modabs2 ⊢ A ∈ ℝ ∧ 2 N ∈ ℝ + → A mod 2 N mod 2 N = A mod 2 N
130 2 10 129 syl2anc ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A mod 2 N mod 2 N = A mod 2 N
131 126 128 130 3eqtr3d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 2 N mod 2 N = A mod 2 N
132 131 oveq2d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N + A − 2 N mod 2 N = 2 N + A mod 2 N
133 119 132 breqtrrd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 1 + A − 1 mod 2 N < 2 N + A − 2 N mod 2 N
134 19 20 2 133 ltsub2dd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 2 N + A − 2 N mod 2 N < A − 1 + A − 1 mod 2 N
135 31 3ad2ant1 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A ∈ ℂ
136 8 recnd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N ∈ ℂ
137 11 recnd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 2 N mod 2 N ∈ ℂ
138 135 136 137 subsub4d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A - 2 N - A − 2 N mod 2 N = A − 2 N + A − 2 N mod 2 N
139 1cnd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 1 ∈ ℂ
140 16 recnd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 mod 2 N ∈ ℂ
141 135 139 140 subsub4d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A - 1 - A − 1 mod 2 N = A − 1 + A − 1 mod 2 N
142 134 138 141 3brtr4d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A - 2 N - A − 2 N mod 2 N < A - 1 - A − 1 mod 2 N
143 12 17 10 142 ltdiv1dd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A - 2 N - A − 2 N mod 2 N 2 N < A - 1 - A − 1 mod 2 N 2 N
144 7 recnd ⊢ N ∈ ℕ → 2 N ∈ ℂ
145 144 3ad2ant3 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N ∈ ℂ
146 63 a1i ⊢ N ∈ ℕ → 2 ≠ 0
147 75 146 5 expne0d ⊢ N ∈ ℕ → 2 N ≠ 0
148 147 3ad2ant3 ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → 2 N ≠ 0
149 divsub1dir ⊢ A ∈ ℂ ∧ 2 N ∈ ℂ ∧ 2 N ≠ 0 → A 2 N − 1 = A − 2 N 2 N
150 149 fveq2d ⊢ A ∈ ℂ ∧ 2 N ∈ ℂ ∧ 2 N ≠ 0 → A 2 N − 1 = A − 2 N 2 N
151 135 145 148 150 syl3anc ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A 2 N − 1 = A − 2 N 2 N
152 fldivmod ⊢ A − 2 N ∈ ℝ ∧ 2 N ∈ ℝ + → A − 2 N 2 N = A - 2 N - A − 2 N mod 2 N 2 N
153 9 10 152 syl2anc ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 2 N 2 N = A - 2 N - A − 2 N mod 2 N 2 N
154 151 153 eqtrd ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A 2 N − 1 = A - 2 N - A − 2 N mod 2 N 2 N
155 fldivmod ⊢ A − 1 ∈ ℝ ∧ 2 N ∈ ℝ + → A − 1 2 N = A - 1 - A − 1 mod 2 N 2 N
156 15 10 155 syl2anc ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A − 1 2 N = A - 1 - A − 1 mod 2 N 2 N
157 143 154 156 3brtr4d ⊢ A ∈ ℤ ∧ A − 1 2 ∈ ℕ ∧ N ∈ ℕ → A 2 N − 1 < A − 1 2 N