author paulson Wed, 23 May 2018 21:34:08 +0100 changeset 68258 4e7937704843 parent 68254 3a7f257dcac7 (current diff) parent 68257 e6e131577536 (diff) child 68259 80df7c90e315 child 68281 faa4b49d1b34
merged
```--- a/src/HOL/Analysis/Cauchy_Integral_Theorem.thy	Wed May 23 09:37:14 2018 +0000
+++ b/src/HOL/Analysis/Cauchy_Integral_Theorem.thy	Wed May 23 21:34:08 2018 +0100
@@ -5936,9 +5936,9 @@
also have "... = u^n * deriv (\<lambda>z. (deriv ^^ n) f (u * z)) z"
apply (rule deriv_cmult)
apply (rule analytic_on_imp_differentiable_at [OF _ Suc.prems])
-    apply (rule analytic_on_compose_gen [where g="(deriv ^^ n) f" and t=t, unfolded o_def])
-    apply (simp add: analytic_on_open f holomorphic_higher_deriv t)
+    apply (rule analytic_on_compose_gen [where g="(deriv ^^ n) f" and T=t, unfolded o_def])
+     apply (simp add: analytic_on_open f holomorphic_higher_deriv t)
apply (blast intro: fg)
done
also have "... = u * u ^ n * deriv ((deriv ^^ n) f) (u * z)"```
```--- a/src/HOL/Analysis/Complex_Analysis_Basics.thy	Wed May 23 09:37:14 2018 +0000
+++ b/src/HOL/Analysis/Complex_Analysis_Basics.thy	Wed May 23 21:34:08 2018 +0100
@@ -32,7 +32,7 @@
lemma fact_cancel:
fixes c :: "'a::real_field"
shows "of_nat (Suc n) * c / (fact (Suc n)) = c / (fact n)"
-  by (simp add: of_nat_mult del: of_nat_Suc times_nat.simps)
+  using of_nat_neq_0 by force

lemma bilinear_times:
fixes c::"'a::real_algebra" shows "bilinear (\<lambda>x y::'a. x*y)"
@@ -41,34 +41,6 @@
lemma linear_cnj: "linear cnj"
using bounded_linear.linear[OF bounded_linear_cnj] .

-lemma tendsto_Re_upper:
-  assumes "~ (trivial_limit F)"
-          "(f \<longlongrightarrow> l) F"
-          "eventually (\<lambda>x. Re(f x) \<le> b) F"
-    shows  "Re(l) \<le> b"
-  by (metis assms tendsto_le [OF _ tendsto_const]  tendsto_Re)
-
-lemma tendsto_Re_lower:
-  assumes "~ (trivial_limit F)"
-          "(f \<longlongrightarrow> l) F"
-          "eventually (\<lambda>x. b \<le> Re(f x)) F"
-    shows  "b \<le> Re(l)"
-  by (metis assms tendsto_le [OF _ _ tendsto_const]  tendsto_Re)
-
-lemma tendsto_Im_upper:
-  assumes "~ (trivial_limit F)"
-          "(f \<longlongrightarrow> l) F"
-          "eventually (\<lambda>x. Im(f x) \<le> b) F"
-    shows  "Im(l) \<le> b"
-  by (metis assms tendsto_le [OF _ tendsto_const]  tendsto_Im)
-
-lemma tendsto_Im_lower:
-  assumes "~ (trivial_limit F)"
-          "(f \<longlongrightarrow> l) F"
-          "eventually (\<lambda>x. b \<le> Im(f x)) F"
-    shows  "b \<le> Im(l)"
-  by (metis assms tendsto_le [OF _ _ tendsto_const]  tendsto_Im)
-
lemma lambda_zero: "(\<lambda>h::'a::mult_zero. 0) = ( * ) 0"
by auto

@@ -116,48 +88,48 @@

lemma DERIV_zero_connected_constant:
fixes f :: "'a::{real_normed_field,euclidean_space} \<Rightarrow> 'a"
-  assumes "connected s"
-      and "open s"
-      and "finite k"
-      and "continuous_on s f"
-      and "\<forall>x\<in>(s - k). DERIV f x :> 0"
-    obtains c where "\<And>x. x \<in> s \<Longrightarrow> f(x) = c"
+  assumes "connected S"
+      and "open S"
+      and "finite K"
+      and "continuous_on S f"
+      and "\<forall>x\<in>(S - K). DERIV f x :> 0"
+    obtains c where "\<And>x. x \<in> S \<Longrightarrow> f(x) = c"
using has_derivative_zero_connected_constant [OF assms(1-4)] assms
by (metis DERIV_const has_derivative_const Diff_iff at_within_open frechet_derivative_at has_field_derivative_def)

lemmas DERIV_zero_constant = has_field_derivative_zero_constant

lemma DERIV_zero_unique:
-  assumes "convex s"
-      and d0: "\<And>x. x\<in>s \<Longrightarrow> (f has_field_derivative 0) (at x within s)"
-      and "a \<in> s"
-      and "x \<in> s"
+  assumes "convex S"
+      and d0: "\<And>x. x\<in>S \<Longrightarrow> (f has_field_derivative 0) (at x within S)"
+      and "a \<in> S"
+      and "x \<in> S"
shows "f x = f a"
by (rule has_derivative_zero_unique [OF assms(1) _ assms(4,3)])
(metis d0 has_field_derivative_imp_has_derivative lambda_zero)

lemma DERIV_zero_connected_unique:
-  assumes "connected s"
-      and "open s"
-      and d0: "\<And>x. x\<in>s \<Longrightarrow> DERIV f x :> 0"
-      and "a \<in> s"
-      and "x \<in> s"
+  assumes "connected S"
+      and "open S"
+      and d0: "\<And>x. x\<in>S \<Longrightarrow> DERIV f x :> 0"
+      and "a \<in> S"
+      and "x \<in> S"
shows "f x = f a"
by (rule has_derivative_zero_unique_connected [OF assms(2,1) _ assms(5,4)])
(metis has_field_derivative_def lambda_zero d0)

lemma DERIV_transform_within:
-  assumes "(f has_field_derivative f') (at a within s)"
-      and "0 < d" "a \<in> s"
-      and "\<And>x. x\<in>s \<Longrightarrow> dist x a < d \<Longrightarrow> f x = g x"
-    shows "(g has_field_derivative f') (at a within s)"
+  assumes "(f has_field_derivative f') (at a within S)"
+      and "0 < d" "a \<in> S"
+      and "\<And>x. x\<in>S \<Longrightarrow> dist x a < d \<Longrightarrow> f x = g x"
+    shows "(g has_field_derivative f') (at a within S)"
using assms unfolding has_field_derivative_def
by (blast intro: has_derivative_transform_within)

lemma DERIV_transform_within_open:
assumes "DERIV f a :> f'"
-      and "open s" "a \<in> s"
-      and "\<And>x. x\<in>s \<Longrightarrow> f x = g x"
+      and "open S" "a \<in> S"
+      and "\<And>x. x\<in>S \<Longrightarrow> f x = g x"
shows "DERIV g a :> f'"
using assms unfolding has_field_derivative_def
by (metis has_derivative_transform_within_open)
@@ -270,8 +242,6 @@

subsection\<open>Holomorphic functions\<close>

-subsection\<open>Holomorphic functions\<close>
-
definition holomorphic_on :: "[complex \<Rightarrow> complex, complex set] \<Rightarrow> bool"
(infixl "(holomorphic'_on)" 50)
where "f holomorphic_on s \<equiv> \<forall>x\<in>s. f field_differentiable (at x within s)"
@@ -455,20 +425,29 @@
unfolding DERIV_deriv_iff_field_differentiable[symmetric]
by (auto intro!: DERIV_imp_deriv derivative_eq_intros)

-lemma deriv_cmult [simp]:
+lemma deriv_cmult:
"f field_differentiable at z \<Longrightarrow> deriv (\<lambda>w. c * f w) z = c * deriv f z"
-  unfolding DERIV_deriv_iff_field_differentiable[symmetric]
-  by (auto intro!: DERIV_imp_deriv derivative_eq_intros)
+  by simp

-lemma deriv_cmult_right [simp]:
+lemma deriv_cmult_right:
"f field_differentiable at z \<Longrightarrow> deriv (\<lambda>w. f w * c) z = deriv f z * c"
+  by simp
+
+lemma deriv_inverse [simp]:
+  "\<lbrakk>f field_differentiable at z; f z \<noteq> 0\<rbrakk>
+   \<Longrightarrow> deriv (\<lambda>w. inverse (f w)) z = - deriv f z / f z ^ 2"
unfolding DERIV_deriv_iff_field_differentiable[symmetric]
-  by (auto intro!: DERIV_imp_deriv derivative_eq_intros)
+  by (safe intro!: DERIV_imp_deriv derivative_eq_intros) (auto simp: divide_simps power2_eq_square)

-lemma deriv_cdivide_right [simp]:
+lemma deriv_divide [simp]:
+  "\<lbrakk>f field_differentiable at z; g field_differentiable at z; g z \<noteq> 0\<rbrakk>
+   \<Longrightarrow> deriv (\<lambda>w. f w / g w) z = (deriv f z * g z - f z * deriv g z) / g z ^ 2"
+  by (simp add: field_class.field_divide_inverse field_differentiable_inverse)
+
+lemma deriv_cdivide_right:
"f field_differentiable at z \<Longrightarrow> deriv (\<lambda>w. f w / c) z = deriv f z / c"
-  unfolding Fields.field_class.field_divide_inverse
-  by (blast intro: deriv_cmult_right)

lemma complex_derivative_transform_within_open:
"\<lbrakk>f holomorphic_on s; g holomorphic_on s; open s; z \<in> s; \<And>w. w \<in> s \<Longrightarrow> f w = g w\<rbrakk>
@@ -480,10 +459,9 @@
lemma deriv_compose_linear:
"f field_differentiable at (c * z) \<Longrightarrow> deriv (\<lambda>w. f (c * w)) z = c * deriv f (c * z)"
apply (rule DERIV_imp_deriv)
-apply (drule DERIV_chain' [of "times c" c z UNIV f "deriv f (c * z)", OF DERIV_cmult_Id])
-done
+  unfolding DERIV_deriv_iff_field_differentiable [symmetric]
+  by (metis (full_types) DERIV_chain2 DERIV_cmult_Id mult.commute)
+

lemma nonzero_deriv_nonconstant:
assumes df: "DERIV f \<xi> :> df" and S: "open S" "\<xi> \<in> S" and "df \<noteq> 0"
@@ -494,10 +472,8 @@
lemma holomorphic_nonconstant:
assumes holf: "f holomorphic_on S" and "open S" "\<xi> \<in> S" "deriv f \<xi> \<noteq> 0"
shows "\<not> f constant_on S"
-    apply (rule nonzero_deriv_nonconstant [of f "deriv f \<xi>" \<xi> S])
-    using assms
-    apply (auto simp: holomorphic_derivI)
-    done
+  by (rule nonzero_deriv_nonconstant [of f "deriv f \<xi>" \<xi> S])
+    (use assms in \<open>auto simp: holomorphic_derivI\<close>)

subsection\<open>Caratheodory characterization\<close>

@@ -516,53 +492,52 @@
subsection\<open>Analyticity on a set\<close>

definition analytic_on (infixl "(analytic'_on)" 50)
-  where
-   "f analytic_on s \<equiv> \<forall>x \<in> s. \<exists>e. 0 < e \<and> f holomorphic_on (ball x e)"
+  where "f analytic_on S \<equiv> \<forall>x \<in> S. \<exists>e. 0 < e \<and> f holomorphic_on (ball x e)"

named_theorems analytic_intros "introduction rules for proving analyticity"

-lemma analytic_imp_holomorphic: "f analytic_on s \<Longrightarrow> f holomorphic_on s"
+lemma analytic_imp_holomorphic: "f analytic_on S \<Longrightarrow> f holomorphic_on S"
by (simp add: at_within_open [OF _ open_ball] analytic_on_def holomorphic_on_def)
(metis centre_in_ball field_differentiable_at_within)

-lemma analytic_on_open: "open s \<Longrightarrow> f analytic_on s \<longleftrightarrow> f holomorphic_on s"
+lemma analytic_on_open: "open S \<Longrightarrow> f analytic_on S \<longleftrightarrow> f holomorphic_on S"
apply (auto simp: analytic_imp_holomorphic)
apply (auto simp: analytic_on_def holomorphic_on_def)
by (metis holomorphic_on_def holomorphic_on_subset open_contains_ball)

lemma analytic_on_imp_differentiable_at:
-  "f analytic_on s \<Longrightarrow> x \<in> s \<Longrightarrow> f field_differentiable (at x)"
+  "f analytic_on S \<Longrightarrow> x \<in> S \<Longrightarrow> f field_differentiable (at x)"
apply (auto simp: analytic_on_def holomorphic_on_def)
by (metis open_ball centre_in_ball field_differentiable_within_open)

-lemma analytic_on_subset: "f analytic_on s \<Longrightarrow> t \<subseteq> s \<Longrightarrow> f analytic_on t"
+lemma analytic_on_subset: "f analytic_on S \<Longrightarrow> T \<subseteq> S \<Longrightarrow> f analytic_on T"
by (auto simp: analytic_on_def)

-lemma analytic_on_Un: "f analytic_on (s \<union> t) \<longleftrightarrow> f analytic_on s \<and> f analytic_on t"
+lemma analytic_on_Un: "f analytic_on (S \<union> T) \<longleftrightarrow> f analytic_on S \<and> f analytic_on T"
by (auto simp: analytic_on_def)

-lemma analytic_on_Union: "f analytic_on (\<Union>s) \<longleftrightarrow> (\<forall>t \<in> s. f analytic_on t)"
+lemma analytic_on_Union: "f analytic_on (\<Union>\<T>) \<longleftrightarrow> (\<forall>T \<in> \<T>. f analytic_on T)"
by (auto simp: analytic_on_def)

-lemma analytic_on_UN: "f analytic_on (\<Union>i\<in>I. s i) \<longleftrightarrow> (\<forall>i\<in>I. f analytic_on (s i))"
+lemma analytic_on_UN: "f analytic_on (\<Union>i\<in>I. S i) \<longleftrightarrow> (\<forall>i\<in>I. f analytic_on (S i))"
by (auto simp: analytic_on_def)

lemma analytic_on_holomorphic:
-  "f analytic_on s \<longleftrightarrow> (\<exists>t. open t \<and> s \<subseteq> t \<and> f holomorphic_on t)"
+  "f analytic_on S \<longleftrightarrow> (\<exists>T. open T \<and> S \<subseteq> T \<and> f holomorphic_on T)"
(is "?lhs = ?rhs")
proof -
-  have "?lhs \<longleftrightarrow> (\<exists>t. open t \<and> s \<subseteq> t \<and> f analytic_on t)"
+  have "?lhs \<longleftrightarrow> (\<exists>T. open T \<and> S \<subseteq> T \<and> f analytic_on T)"
proof safe
-    assume "f analytic_on s"
-    then show "\<exists>t. open t \<and> s \<subseteq> t \<and> f analytic_on t"
+    assume "f analytic_on S"
+    then show "\<exists>T. open T \<and> S \<subseteq> T \<and> f analytic_on T"
-      apply (rule exI [where x="\<Union>{u. open u \<and> f analytic_on u}"], auto)
+      apply (rule exI [where x="\<Union>{U. open U \<and> f analytic_on U}"], auto)
apply (metis open_ball analytic_on_open centre_in_ball)
by (metis analytic_on_def)
next
-    fix t
-    assume "open t" "s \<subseteq> t" "f analytic_on t"
-    then show "f analytic_on s"
+    fix T
+    assume "open T" "S \<subseteq> T" "f analytic_on T"
+    then show "f analytic_on S"
by (metis analytic_on_subset)
qed
also have "... \<longleftrightarrow> ?rhs"
@@ -570,26 +545,26 @@
finally show ?thesis .
qed

-lemma analytic_on_linear [analytic_intros,simp]: "(( * ) c) analytic_on s"
+lemma analytic_on_linear [analytic_intros,simp]: "(( * ) c) analytic_on S"

-lemma analytic_on_const [analytic_intros,simp]: "(\<lambda>z. c) analytic_on s"
+lemma analytic_on_const [analytic_intros,simp]: "(\<lambda>z. c) analytic_on S"
by (metis analytic_on_def holomorphic_on_const zero_less_one)

-lemma analytic_on_ident [analytic_intros,simp]: "(\<lambda>x. x) analytic_on s"
+lemma analytic_on_ident [analytic_intros,simp]: "(\<lambda>x. x) analytic_on S"

-lemma analytic_on_id [analytic_intros]: "id analytic_on s"
+lemma analytic_on_id [analytic_intros]: "id analytic_on S"
unfolding id_def by (rule analytic_on_ident)

lemma analytic_on_compose:
-  assumes f: "f analytic_on s"
-      and g: "g analytic_on (f ` s)"
-    shows "(g o f) analytic_on s"
+  assumes f: "f analytic_on S"
+      and g: "g analytic_on (f ` S)"
+    shows "(g o f) analytic_on S"
unfolding analytic_on_def
proof (intro ballI)
fix x
-  assume x: "x \<in> s"
+  assume x: "x \<in> S"
then obtain e where e: "0 < e" and fh: "f holomorphic_on ball x e" using f
by (metis analytic_on_def)
obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball (f x) e'" using g
@@ -607,22 +582,22 @@
qed

lemma analytic_on_compose_gen:
-  "f analytic_on s \<Longrightarrow> g analytic_on t \<Longrightarrow> (\<And>z. z \<in> s \<Longrightarrow> f z \<in> t)
-             \<Longrightarrow> g o f analytic_on s"
+  "f analytic_on S \<Longrightarrow> g analytic_on T \<Longrightarrow> (\<And>z. z \<in> S \<Longrightarrow> f z \<in> T)
+             \<Longrightarrow> g o f analytic_on S"
by (metis analytic_on_compose analytic_on_subset image_subset_iff)

lemma analytic_on_neg [analytic_intros]:
-  "f analytic_on s \<Longrightarrow> (\<lambda>z. -(f z)) analytic_on s"
+  "f analytic_on S \<Longrightarrow> (\<lambda>z. -(f z)) analytic_on S"
by (metis analytic_on_holomorphic holomorphic_on_minus)

-  assumes f: "f analytic_on s"
-      and g: "g analytic_on s"
-    shows "(\<lambda>z. f z + g z) analytic_on s"
+  assumes f: "f analytic_on S"
+      and g: "g analytic_on S"
+    shows "(\<lambda>z. f z + g z) analytic_on S"
unfolding analytic_on_def
proof (intro ballI)
fix z
-  assume z: "z \<in> s"
+  assume z: "z \<in> S"
then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
by (metis analytic_on_def)
obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball z e'" using g
@@ -636,13 +611,13 @@
qed

lemma analytic_on_diff [analytic_intros]:
-  assumes f: "f analytic_on s"
-      and g: "g analytic_on s"
-    shows "(\<lambda>z. f z - g z) analytic_on s"
+  assumes f: "f analytic_on S"
+      and g: "g analytic_on S"
+    shows "(\<lambda>z. f z - g z) analytic_on S"
unfolding analytic_on_def
proof (intro ballI)
fix z
-  assume z: "z \<in> s"
+  assume z: "z \<in> S"
then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
by (metis analytic_on_def)
obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball z e'" using g
@@ -656,13 +631,13 @@
qed

lemma analytic_on_mult [analytic_intros]:
-  assumes f: "f analytic_on s"
-      and g: "g analytic_on s"
-    shows "(\<lambda>z. f z * g z) analytic_on s"
+  assumes f: "f analytic_on S"
+      and g: "g analytic_on S"
+    shows "(\<lambda>z. f z * g z) analytic_on S"
unfolding analytic_on_def
proof (intro ballI)
fix z
-  assume z: "z \<in> s"
+  assume z: "z \<in> S"
then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
by (metis analytic_on_def)
obtain e' where e': "0 < e'" and gh: "g holomorphic_on ball z e'" using g
@@ -676,13 +651,13 @@
qed

lemma analytic_on_inverse [analytic_intros]:
-  assumes f: "f analytic_on s"
-      and nz: "(\<And>z. z \<in> s \<Longrightarrow> f z \<noteq> 0)"
-    shows "(\<lambda>z. inverse (f z)) analytic_on s"
+  assumes f: "f analytic_on S"
+      and nz: "(\<And>z. z \<in> S \<Longrightarrow> f z \<noteq> 0)"
+    shows "(\<lambda>z. inverse (f z)) analytic_on S"
unfolding analytic_on_def
proof (intro ballI)
fix z
-  assume z: "z \<in> s"
+  assume z: "z \<in> S"
then obtain e where e: "0 < e" and fh: "f holomorphic_on ball z e" using f
by (metis analytic_on_def)
have "continuous_on (ball z e) f"
@@ -698,19 +673,19 @@
qed

lemma analytic_on_divide [analytic_intros]:
-  assumes f: "f analytic_on s"
-      and g: "g analytic_on s"
-      and nz: "(\<And>z. z \<in> s \<Longrightarrow> g z \<noteq> 0)"
-    shows "(\<lambda>z. f z / g z) analytic_on s"
+  assumes f: "f analytic_on S"
+      and g: "g analytic_on S"
+      and nz: "(\<And>z. z \<in> S \<Longrightarrow> g z \<noteq> 0)"
+    shows "(\<lambda>z. f z / g z) analytic_on S"
unfolding divide_inverse
by (metis analytic_on_inverse analytic_on_mult f g nz)

lemma analytic_on_power [analytic_intros]:
-  "f analytic_on s \<Longrightarrow> (\<lambda>z. (f z) ^ n) analytic_on s"
+  "f analytic_on S \<Longrightarrow> (\<lambda>z. (f z) ^ n) analytic_on S"
by (induct n) (auto simp: analytic_on_mult)

lemma analytic_on_sum [analytic_intros]:
-  "(\<And>i. i \<in> I \<Longrightarrow> (f i) analytic_on s) \<Longrightarrow> (\<lambda>x. sum (\<lambda>i. f i x) I) analytic_on s"
+  "(\<And>i. i \<in> I \<Longrightarrow> (f i) analytic_on S) \<Longrightarrow> (\<lambda>x. sum (\<lambda>i. f i x) I) analytic_on S"
by (induct I rule: infinite_finite_induct) (auto simp: analytic_on_const analytic_on_add)

lemma deriv_left_inverse:
@@ -727,10 +702,10 @@
using assms
by (metis analytic_on_imp_differentiable_at analytic_on_open complex_derivative_chain image_subset_iff)
also have "... = deriv id w"
-    apply (rule complex_derivative_transform_within_open [where s=S])
-    apply (rule assms holomorphic_on_compose_gen holomorphic_intros)+
-    apply simp
-    done
+  proof (rule complex_derivative_transform_within_open [where s=S])
+    show "g \<circ> f holomorphic_on S"
+      by (rule assms holomorphic_on_compose_gen holomorphic_intros)+
+  qed (use assms in auto)
also have "... = 1"
by simp
finally show ?thesis .
@@ -811,23 +786,23 @@

(* TODO: Could probably be simplified using Uniform_Limit *)
lemma has_complex_derivative_sequence:
-  fixes s :: "complex set"
-  assumes cvs: "convex s"
-      and df:  "\<And>n x. x \<in> s \<Longrightarrow> (f n has_field_derivative f' n x) (at x within s)"
-      and conv: "\<And>e. 0 < e \<Longrightarrow> \<exists>N. \<forall>n x. n \<ge> N \<longrightarrow> x \<in> s \<longrightarrow> norm (f' n x - g' x) \<le> e"
-      and "\<exists>x l. x \<in> s \<and> ((\<lambda>n. f n x) \<longlongrightarrow> l) sequentially"
-    shows "\<exists>g. \<forall>x \<in> s. ((\<lambda>n. f n x) \<longlongrightarrow> g x) sequentially \<and>
-                       (g has_field_derivative (g' x)) (at x within s)"
+  fixes S :: "complex set"
+  assumes cvs: "convex S"
+      and df:  "\<And>n x. x \<in> S \<Longrightarrow> (f n has_field_derivative f' n x) (at x within S)"
+      and conv: "\<And>e. 0 < e \<Longrightarrow> \<exists>N. \<forall>n x. n \<ge> N \<longrightarrow> x \<in> S \<longrightarrow> norm (f' n x - g' x) \<le> e"
+      and "\<exists>x l. x \<in> S \<and> ((\<lambda>n. f n x) \<longlongrightarrow> l) sequentially"
+    shows "\<exists>g. \<forall>x \<in> S. ((\<lambda>n. f n x) \<longlongrightarrow> g x) sequentially \<and>
+                       (g has_field_derivative (g' x)) (at x within S)"
proof -
-  from assms obtain x l where x: "x \<in> s" and tf: "((\<lambda>n. f n x) \<longlongrightarrow> l) sequentially"
+  from assms obtain x l where x: "x \<in> S" and tf: "((\<lambda>n. f n x) \<longlongrightarrow> l) sequentially"
by blast
{ fix e::real assume e: "e > 0"
-    then obtain N where N: "\<forall>n\<ge>N. \<forall>x. x \<in> s \<longrightarrow> cmod (f' n x - g' x) \<le> e"
+    then obtain N where N: "\<forall>n\<ge>N. \<forall>x. x \<in> S \<longrightarrow> cmod (f' n x - g' x) \<le> e"
by (metis conv)
-    have "\<exists>N. \<forall>n\<ge>N. \<forall>x\<in>s. \<forall>h. cmod (f' n x * h - g' x * h) \<le> e * cmod h"
+    have "\<exists>N. \<forall>n\<ge>N. \<forall>x\<in>S. \<forall>h. cmod (f' n x * h - g' x * h) \<le> e * cmod h"
proof (rule exI [of _ N], clarify)
fix n y h
-      assume "N \<le> n" "y \<in> s"
+      assume "N \<le> n" "y \<in> S"
then have "cmod (f' n y - g' y) \<le> e"
by (metis N)
then have "cmod h * cmod (f' n y - g' y) \<le> cmod h * e"
@@ -841,30 +816,30 @@
proof (rule has_derivative_sequence [OF cvs _ _ x])
show "(\<lambda>n. f n x) \<longlonglongrightarrow> l"
by (rule tf)
-  next show "\<And>e. e > 0 \<Longrightarrow> \<forall>\<^sub>F n in sequentially. \<forall>x\<in>s. \<forall>h. cmod (f' n x * h - g' x * h) \<le> e * cmod h"
+  next show "\<And>e. e > 0 \<Longrightarrow> \<forall>\<^sub>F n in sequentially. \<forall>x\<in>S. \<forall>h. cmod (f' n x * h - g' x * h) \<le> e * cmod h"
unfolding eventually_sequentially by (blast intro: **)
qed (metis has_field_derivative_def df)
qed

lemma has_complex_derivative_series:
-  fixes s :: "complex set"
-  assumes cvs: "convex s"
-      and df:  "\<And>n x. x \<in> s \<Longrightarrow> (f n has_field_derivative f' n x) (at x within s)"
-      and conv: "\<And>e. 0 < e \<Longrightarrow> \<exists>N. \<forall>n x. n \<ge> N \<longrightarrow> x \<in> s
+  fixes S :: "complex set"
+  assumes cvs: "convex S"
+      and df:  "\<And>n x. x \<in> S \<Longrightarrow> (f n has_field_derivative f' n x) (at x within S)"
+      and conv: "\<And>e. 0 < e \<Longrightarrow> \<exists>N. \<forall>n x. n \<ge> N \<longrightarrow> x \<in> S
\<longrightarrow> cmod ((\<Sum>i<n. f' i x) - g' x) \<le> e"
-      and "\<exists>x l. x \<in> s \<and> ((\<lambda>n. f n x) sums l)"
-    shows "\<exists>g. \<forall>x \<in> s. ((\<lambda>n. f n x) sums g x) \<and> ((g has_field_derivative g' x) (at x within s))"
+      and "\<exists>x l. x \<in> S \<and> ((\<lambda>n. f n x) sums l)"
+    shows "\<exists>g. \<forall>x \<in> S. ((\<lambda>n. f n x) sums g x) \<and> ((g has_field_derivative g' x) (at x within S))"
proof -
-  from assms obtain x l where x: "x \<in> s" and sf: "((\<lambda>n. f n x) sums l)"
+  from assms obtain x l where x: "x \<in> S" and sf: "((\<lambda>n. f n x) sums l)"
by blast
{ fix e::real assume e: "e > 0"
-    then obtain N where N: "\<forall>n x. n \<ge> N \<longrightarrow> x \<in> s
+    then obtain N where N: "\<forall>n x. n \<ge> N \<longrightarrow> x \<in> S
\<longrightarrow> cmod ((\<Sum>i<n. f' i x) - g' x) \<le> e"
by (metis conv)
-    have "\<exists>N. \<forall>n\<ge>N. \<forall>x\<in>s. \<forall>h. cmod ((\<Sum>i<n. h * f' i x) - g' x * h) \<le> e * cmod h"
+    have "\<exists>N. \<forall>n\<ge>N. \<forall>x\<in>S. \<forall>h. cmod ((\<Sum>i<n. h * f' i x) - g' x * h) \<le> e * cmod h"
proof (rule exI [of _ N], clarify)
fix n y h
-      assume "N \<le> n" "y \<in> s"
+      assume "N \<le> n" "y \<in> S"
then have "cmod ((\<Sum>i<n. f' i y) - g' y) \<le> e"
by (metis N)
then have "cmod h * cmod ((\<Sum>i<n. f' i y) - g' y) \<le> cmod h * e"
@@ -877,12 +852,12 @@
unfolding has_field_derivative_def
proof (rule has_derivative_series [OF cvs _ _ x])
fix n x
-    assume "x \<in> s"
-    then show "((f n) has_derivative (\<lambda>z. z * f' n x)) (at x within s)"
+    assume "x \<in> S"
+    then show "((f n) has_derivative (\<lambda>z. z * f' n x)) (at x within S)"
by (metis df has_field_derivative_def mult_commute_abs)
next show " ((\<lambda>n. f n x) sums l)"
by (rule sf)
-  next show "\<And>e. e>0 \<Longrightarrow> \<forall>\<^sub>F n in sequentially. \<forall>x\<in>s. \<forall>h. cmod ((\<Sum>i<n. h * f' i x) - g' x * h) \<le> e * cmod h"
+  next show "\<And>e. e>0 \<Longrightarrow> \<forall>\<^sub>F n in sequentially. \<forall>x\<in>S. \<forall>h. cmod ((\<Sum>i<n. h * f' i x) - g' x * h) \<le> e * cmod h"
unfolding eventually_sequentially by (blast intro: **)
qed
qed
@@ -890,23 +865,23 @@

lemma field_differentiable_series:
fixes f :: "nat \<Rightarrow> 'a::{real_normed_field,banach} \<Rightarrow> 'a"
-  assumes "convex s" "open s"
-  assumes "\<And>n x. x \<in> s \<Longrightarrow> (f n has_field_derivative f' n x) (at x)"
-  assumes "uniformly_convergent_on s (\<lambda>n x. \<Sum>i<n. f' i x)"
-  assumes "x0 \<in> s" "summable (\<lambda>n. f n x0)" and x: "x \<in> s"
+  assumes "convex S" "open S"
+  assumes "\<And>n x. x \<in> S \<Longrightarrow> (f n has_field_derivative f' n x) (at x)"
+  assumes "uniformly_convergent_on S (\<lambda>n x. \<Sum>i<n. f' i x)"
+  assumes "x0 \<in> S" "summable (\<lambda>n. f n x0)" and x: "x \<in> S"
shows  "(\<lambda>x. \<Sum>n. f n x) field_differentiable (at x)"
proof -
-  from assms(4) obtain g' where A: "uniform_limit s (\<lambda>n x. \<Sum>i<n. f' i x) g' sequentially"
+  from assms(4) obtain g' where A: "uniform_limit S (\<lambda>n x. \<Sum>i<n. f' i x) g' sequentially"
unfolding uniformly_convergent_on_def by blast
-  from x and \<open>open s\<close> have s: "at x within s = at x" by (rule at_within_open)
-  have "\<exists>g. \<forall>x\<in>s. (\<lambda>n. f n x) sums g x \<and> (g has_field_derivative g' x) (at x within s)"
-    by (intro has_field_derivative_series[of s f f' g' x0] assms A has_field_derivative_at_within)
-  then obtain g where g: "\<And>x. x \<in> s \<Longrightarrow> (\<lambda>n. f n x) sums g x"
-    "\<And>x. x \<in> s \<Longrightarrow> (g has_field_derivative g' x) (at x within s)" by blast
+  from x and \<open>open S\<close> have S: "at x within S = at x" by (rule at_within_open)
+  have "\<exists>g. \<forall>x\<in>S. (\<lambda>n. f n x) sums g x \<and> (g has_field_derivative g' x) (at x within S)"
+    by (intro has_field_derivative_series[of S f f' g' x0] assms A has_field_derivative_at_within)
+  then obtain g where g: "\<And>x. x \<in> S \<Longrightarrow> (\<lambda>n. f n x) sums g x"
+    "\<And>x. x \<in> S \<Longrightarrow> (g has_field_derivative g' x) (at x within S)" by blast
from g(2)[OF x] have g': "(g has_derivative ( * ) (g' x)) (at x)"
-    by (simp add: has_field_derivative_def s)
+    by (simp add: has_field_derivative_def S)
have "((\<lambda>x. \<Sum>n. f n x) has_derivative ( * ) (g' x)) (at x)"
-    by (rule has_derivative_transform_within_open[OF g' \<open>open s\<close> x])
+    by (rule has_derivative_transform_within_open[OF g' \<open>open S\<close> x])
(insert g, auto simp: sums_iff)
thus "(\<lambda>x. \<Sum>n. f n x) field_differentiable (at x)" unfolding differentiable_def
by (auto simp: summable_def field_differentiable_def has_field_derivative_def)
@@ -915,11 +890,11 @@
subsection\<open>Bound theorem\<close>

lemma field_differentiable_bound:
-  fixes s :: "'a::real_normed_field set"
-  assumes cvs: "convex s"
-      and df:  "\<And>z. z \<in> s \<Longrightarrow> (f has_field_derivative f' z) (at z within s)"
-      and dn:  "\<And>z. z \<in> s \<Longrightarrow> norm (f' z) \<le> B"
-      and "x \<in> s"  "y \<in> s"
+  fixes S :: "'a::real_normed_field set"
+  assumes cvs: "convex S"
+      and df:  "\<And>z. z \<in> S \<Longrightarrow> (f has_field_derivative f' z) (at z within S)"
+      and dn:  "\<And>z. z \<in> S \<Longrightarrow> norm (f' z) \<le> B"
+      and "x \<in> S"  "y \<in> S"
shows "norm(f x - f y) \<le> B * norm(x - y)"
apply (rule differentiable_bound [OF cvs])
apply (erule df [unfolded has_field_derivative_def])
@@ -941,35 +916,31 @@
apply (auto simp:  bounded_linear_mult_right)
done

-lemmas has_complex_derivative_inverse_basic = has_field_derivative_inverse_basic
-
lemma has_field_derivative_inverse_strong:
fixes f :: "'a::{euclidean_space,real_normed_field} \<Rightarrow> 'a"
shows "DERIV f x :> f' \<Longrightarrow>
f' \<noteq> 0 \<Longrightarrow>
-         open s \<Longrightarrow>
-         x \<in> s \<Longrightarrow>
-         continuous_on s f \<Longrightarrow>
-         (\<And>z. z \<in> s \<Longrightarrow> g (f z) = z)
+         open S \<Longrightarrow>
+         x \<in> S \<Longrightarrow>
+         continuous_on S f \<Longrightarrow>
+         (\<And>z. z \<in> S \<Longrightarrow> g (f z) = z)
\<Longrightarrow> DERIV g (f x) :> inverse (f')"
unfolding has_field_derivative_def
-  apply (rule has_derivative_inverse_strong [of s x f g ])
+  apply (rule has_derivative_inverse_strong [of S x f g ])
by auto
-lemmas has_complex_derivative_inverse_strong = has_field_derivative_inverse_strong

lemma has_field_derivative_inverse_strong_x:
fixes f :: "'a::{euclidean_space,real_normed_field} \<Rightarrow> 'a"
shows  "DERIV f (g y) :> f' \<Longrightarrow>
f' \<noteq> 0 \<Longrightarrow>
-          open s \<Longrightarrow>
-          continuous_on s f \<Longrightarrow>
-          g y \<in> s \<Longrightarrow> f(g y) = y \<Longrightarrow>
-          (\<And>z. z \<in> s \<Longrightarrow> g (f z) = z)
+          open S \<Longrightarrow>
+          continuous_on S f \<Longrightarrow>
+          g y \<in> S \<Longrightarrow> f(g y) = y \<Longrightarrow>
+          (\<And>z. z \<in> S \<Longrightarrow> g (f z) = z)
\<Longrightarrow> DERIV g y :> inverse (f')"
unfolding has_field_derivative_def
-  apply (rule has_derivative_inverse_strong_x [of s g y f])
+  apply (rule has_derivative_inverse_strong_x [of S g y f])
by auto
-lemmas has_complex_derivative_inverse_strong_x = has_field_derivative_inverse_strong_x

subsection \<open>Taylor on Complex Numbers\<close>

@@ -979,19 +950,19 @@
by (induct n) auto

lemma field_taylor:
-  assumes s: "convex s"
-      and f: "\<And>i x. x \<in> s \<Longrightarrow> i \<le> n \<Longrightarrow> (f i has_field_derivative f (Suc i) x) (at x within s)"
-      and B: "\<And>x. x \<in> s \<Longrightarrow> norm (f (Suc n) x) \<le> B"
-      and w: "w \<in> s"
-      and z: "z \<in> s"
+  assumes S: "convex S"
+      and f: "\<And>i x. x \<in> S \<Longrightarrow> i \<le> n \<Longrightarrow> (f i has_field_derivative f (Suc i) x) (at x within S)"
+      and B: "\<And>x. x \<in> S \<Longrightarrow> norm (f (Suc n) x) \<le> B"
+      and w: "w \<in> S"
+      and z: "z \<in> S"
shows "norm(f 0 z - (\<Sum>i\<le>n. f i w * (z-w) ^ i / (fact i)))
\<le> B * norm(z - w)^(Suc n) / fact n"
proof -
-  have wzs: "closed_segment w z \<subseteq> s" using assms
+  have wzs: "closed_segment w z \<subseteq> S" using assms
by (metis convex_contains_segment)
{ fix u
assume "u \<in> closed_segment w z"
-    then have "u \<in> s"
+    then have "u \<in> S"
by (metis wzs subsetD)
have "(\<Sum>i\<le>n. f i u * (- of_nat i * (z-u)^(i - 1)) / (fact i) +
f (Suc i) u * (z-u)^i / (fact i)) =
@@ -1033,16 +1004,16 @@
qed
then have "((\<lambda>v. (\<Sum>i\<le>n. f i v * (z - v)^i / (fact i)))
has_field_derivative f (Suc n) u * (z-u) ^ n / (fact n))
-               (at u within s)"
+               (at u within S)"
apply (intro derivative_eq_intros)
-      apply (blast intro: assms \<open>u \<in> s\<close>)
+      apply (blast intro: assms \<open>u \<in> S\<close>)
apply (rule refl)+
apply (auto simp: field_simps)
done
} note sum_deriv = this
{ fix u
assume u: "u \<in> closed_segment w z"
-    then have us: "u \<in> s"
+    then have us: "u \<in> S"
by (metis wzs subsetD)
have "norm (f (Suc n) u) * norm (z - u) ^ n \<le> norm (f (Suc n) u) * norm (u - z) ^ n"
by (metis norm_minus_commute order_refl)
@@ -1063,7 +1034,7 @@
also have "... \<le> B * norm (z - w) ^ n / (fact n) * norm (w - z)"
apply (rule field_differentiable_bound
[where f' = "\<lambda>w. f (Suc n) w * (z - w)^n / (fact n)"
-         and s = "closed_segment w z", OF convex_closed_segment])
+         and S = "closed_segment w z", OF convex_closed_segment])
apply (auto simp: ends_in_segment DERIV_subset [OF sum_deriv wzs]
norm_divide norm_mult norm_power divide_le_cancel cmod_bound)
done
@@ -1073,11 +1044,11 @@
qed

lemma complex_taylor:
-  assumes s: "convex s"
-      and f: "\<And>i x. x \<in> s \<Longrightarrow> i \<le> n \<Longrightarrow> (f i has_field_derivative f (Suc i) x) (at x within s)"
-      and B: "\<And>x. x \<in> s \<Longrightarrow> cmod (f (Suc n) x) \<le> B"
-      and w: "w \<in> s"
-      and z: "z \<in> s"
+  assumes S: "convex S"
+      and f: "\<And>i x. x \<in> S \<Longrightarrow> i \<le> n \<Longrightarrow> (f i has_field_derivative f (Suc i) x) (at x within S)"
+      and B: "\<And>x. x \<in> S \<Longrightarrow> cmod (f (Suc n) x) \<le> B"
+      and w: "w \<in> S"
+      and z: "z \<in> S"
shows "cmod(f 0 z - (\<Sum>i\<le>n. f i w * (z-w) ^ i / (fact i)))
\<le> B * cmod(z - w)^(Suc n) / fact n"
using assms by (rule field_taylor)```
```--- a/src/HOL/Analysis/Complex_Transcendental.thy	Wed May 23 09:37:14 2018 +0000
+++ b/src/HOL/Analysis/Complex_Transcendental.thy	Wed May 23 21:34:08 2018 +0100
@@ -9,6 +9,12 @@
"HOL-Library.Periodic_Fun"
begin

+(* TODO: MOVE *)
+lemma nonpos_Reals_inverse_iff [simp]:
+  fixes a :: "'a::real_div_algebra"
+  shows "inverse a \<in> \<real>\<^sub>\<le>\<^sub>0 \<longleftrightarrow> a \<in> \<real>\<^sub>\<le>\<^sub>0"
+  using nonpos_Reals_inverse_I by fastforce
+
(* TODO: Figure out what to do with MÃ¶bius transformations *)
definition "moebius a b c d = (\<lambda>z. (a*z+b) / (c*z+d :: 'a :: field))"

@@ -39,7 +45,7 @@
using not_real_square_gt_zero by blast
then show ?thesis using assms Complex
-    apply (auto simp: cmod_def)
apply (rule power2_less_imp_less, auto)
done
@@ -52,13 +58,15 @@
lemma cmod_square_less_1_plus:
assumes "Im z = 0 \<Longrightarrow> \<bar>Re z\<bar> < 1"
shows "(cmod z)\<^sup>2 < 1 + cmod (1 - z\<^sup>2)"
-  using assms
-  apply (cases "Im z = 0 \<or> Re z = 0")
-  using abs_square_less_1
-    apply (force simp add: Re_power2 Im_power2 cmod_def)
-  using cmod_diff_real_less [of "1 - z\<^sup>2" "1"]
-  apply (simp add: norm_power Im_power2)
-  done
+proof (cases "Im z = 0 \<or> Re z = 0")
+  case True
+  with assms abs_square_less_1 show ?thesis
+    by (force simp add: Re_power2 Im_power2 cmod_def)
+next
+  case False
+  with cmod_diff_real_less [of "1 - z\<^sup>2" "1"] show ?thesis
+    by (simp add: norm_power Im_power2)
+qed

subsection\<open>The Exponential Function is Differentiable and Continuous\<close>

@@ -90,8 +98,7 @@

theorem exp_Euler: "exp(\<i> * z) = cos(z) + \<i> * sin(z)"
proof -
-  have "(\<lambda>n. (cos_coeff n + \<i> * sin_coeff n) * z^n)
-        = (\<lambda>n. (\<i> * z) ^ n /\<^sub>R (fact n))"
+  have "(\<lambda>n. (cos_coeff n + \<i> * sin_coeff n) * z^n) = (\<lambda>n. (\<i> * z) ^ n /\<^sub>R (fact n))"
proof
fix n
show "(cos_coeff n + \<i> * sin_coeff n) * z^n = (\<i> * z) ^ n /\<^sub>R (fact n)"
@@ -122,23 +129,16 @@

subsection\<open>Relationships between real and complex trigonometric and hyperbolic functions\<close>

-lemma real_sin_eq [simp]:
-  fixes x::real
-  shows "Re(sin(of_real x)) = sin x"
+lemma real_sin_eq [simp]: "Re(sin(of_real x)) = sin x"

-lemma real_cos_eq [simp]:
-  fixes x::real
-  shows "Re(cos(of_real x)) = cos x"
+lemma real_cos_eq [simp]: "Re(cos(of_real x)) = cos x"

lemma DeMoivre: "(cos z + \<i> * sin z) ^ n = cos(n * z) + \<i> * sin(n * z)"
-  apply (simp add: exp_Euler [symmetric])
-  by (metis exp_of_nat_mult mult.left_commute)
-
-lemma exp_cnj:
-  fixes z::complex
-  shows "cnj (exp z) = exp (cnj z)"
+  by (metis exp_Euler [symmetric] exp_of_nat_mult mult.left_commute)
+
+lemma exp_cnj: "cnj (exp z) = exp (cnj z)"
proof -
have "(\<lambda>n. cnj (z ^ n /\<^sub>R (fact n))) = (\<lambda>n. (cnj z)^n /\<^sub>R (fact n))"
by auto
@@ -161,19 +161,19 @@
lemma field_differentiable_at_sin: "sin field_differentiable at z"
using DERIV_sin field_differentiable_def by blast

-lemma field_differentiable_within_sin: "sin field_differentiable (at z within s)"
+lemma field_differentiable_within_sin: "sin field_differentiable (at z within S)"

lemma field_differentiable_at_cos: "cos field_differentiable at z"
using DERIV_cos field_differentiable_def by blast

-lemma field_differentiable_within_cos: "cos field_differentiable (at z within s)"
+lemma field_differentiable_within_cos: "cos field_differentiable (at z within S)"

-lemma holomorphic_on_sin: "sin holomorphic_on s"
+lemma holomorphic_on_sin: "sin holomorphic_on S"

-lemma holomorphic_on_cos: "cos holomorphic_on s"
+lemma holomorphic_on_cos: "cos holomorphic_on S"

subsection\<open>Get a nice real/imaginary separation in Euler's formula\<close>
@@ -241,8 +241,7 @@
shows "exp((2 * n * pi) * \<i>) = 1"
proof -
have "exp((2 * n * pi) * \<i>) = exp 0"
-    using assms
-    by (simp only: Ints_def exp_eq) auto
+    using assms unfolding Ints_def exp_eq by auto
also have "... = 1"
by simp
finally show ?thesis .
@@ -300,9 +299,9 @@
by simp
then obtain n where "\<i> * of_real x = (of_int (2 * n) * pi) * \<i>"
by (simp only: Ints_def exp_eq) auto
-  then have  "of_real x = (of_int (2 * n) * pi)"
+  then have "of_real x = (of_int (2 * n) * pi)"
by (metis complex_i_not_zero mult.commute mult_cancel_left of_real_eq_iff real_scaleR_def scaleR_conv_of_real)
-  then have  "x = (of_int (2 * n) * pi)"
+  then have "x = (of_int (2 * n) * pi)"
by simp
then show False using assms
by (cases n) (auto simp: zero_less_mult_iff mult_less_0_iff)
@@ -311,7 +310,7 @@
lemma sin_eq_0:
fixes z::complex
shows "sin z = 0 \<longleftrightarrow> (\<exists>n::int. z = of_real(n * pi))"
-  by (simp add: sin_exp_eq exp_eq of_real_numeral)
+  by (simp add: sin_exp_eq exp_eq)

lemma cos_eq_0:
fixes z::complex
@@ -330,7 +329,7 @@
finally have [simp]: "cos z = 1 \<longleftrightarrow> sin (z/2) = 0"
by simp
show ?thesis
-    by (auto simp: sin_eq_0 of_real_numeral)
+    by (auto simp: sin_eq_0)
qed

lemma csin_eq_1:
@@ -346,13 +345,13 @@
proof -
have "sin z = -1 \<longleftrightarrow> sin (-z) = 1"
-  also have "...  \<longleftrightarrow> (\<exists>n::int. -z = of_real(2 * n * pi) + of_real pi/2)"
+  also have "... \<longleftrightarrow> (\<exists>n::int. -z = of_real(2 * n * pi) + of_real pi/2)"
by (simp only: csin_eq_1)
-  also have "...  \<longleftrightarrow> (\<exists>n::int. z = - of_real(2 * n * pi) - of_real pi/2)"
+  also have "... \<longleftrightarrow> (\<exists>n::int. z = - of_real(2 * n * pi) - of_real pi/2)"
apply (rule iff_exI)
-    by (metis (no_types)  is_num_normalize(8) minus_minus of_real_def real_vector.scale_minus_left uminus_add_conv_diff)
+    by (metis (no_types) is_num_normalize(8) minus_minus of_real_def real_vector.scale_minus_left uminus_add_conv_diff)
also have "... = ?rhs"
-    apply (auto simp: of_real_numeral)
+    apply safe
apply (rule_tac [2] x="-(x+1)" in exI)
apply (rule_tac x="-(x+1)" in exI)
@@ -364,23 +363,17 @@
fixes z::complex
shows "cos z = -1 \<longleftrightarrow> (\<exists>n::int. z = of_real(2 * n * pi) + pi)"
using csin_eq_1 [of "z - of_real pi/2"]
-  apply (simp add: algebra_simps of_real_numeral equation_minus_iff)
-  done
+  by (simp add: sin_diff algebra_simps equation_minus_iff)

lemma sin_eq_1: "sin x = 1 \<longleftrightarrow> (\<exists>n::int. x = (2 * n + 1 / 2) * pi)"
(is "_ = ?rhs")
proof -
have "sin x = 1 \<longleftrightarrow> sin (complex_of_real x) = 1"
by (metis of_real_1 one_complex.simps(1) real_sin_eq sin_of_real)
-  also have "...  \<longleftrightarrow> (\<exists>n::int. complex_of_real x = of_real(2 * n * pi) + of_real pi/2)"
+  also have "... \<longleftrightarrow> (\<exists>n::int. complex_of_real x = of_real(2 * n * pi) + of_real pi/2)"
by (simp only: csin_eq_1)
-  also have "...  \<longleftrightarrow> (\<exists>n::int. x = of_real(2 * n * pi) + of_real pi/2)"
-    apply (rule iff_exI)
-    apply (auto simp: algebra_simps of_real_numeral)
-    apply (rule injD [OF inj_of_real [where 'a = complex]])
-    apply (auto simp: of_real_numeral)
-    done
+  also have "... \<longleftrightarrow> (\<exists>n::int. x = of_real(2 * n * pi) + of_real pi/2)"
+    by (rule iff_exI) (auto simp: algebra_simps intro: injD [OF inj_of_real [where 'a = complex]])
also have "... = ?rhs"
by (auto simp: algebra_simps)
finally show ?thesis .
@@ -390,13 +383,10 @@
proof -
have "sin x = -1 \<longleftrightarrow> sin (complex_of_real x) = -1"
by (metis Re_complex_of_real of_real_def scaleR_minus1_left sin_of_real)
-  also have "...  \<longleftrightarrow> (\<exists>n::int. complex_of_real x = of_real(2 * n * pi) + 3/2*pi)"
+  also have "... \<longleftrightarrow> (\<exists>n::int. complex_of_real x = of_real(2 * n * pi) + 3/2*pi)"
by (simp only: csin_eq_minus1)
-  also have "...  \<longleftrightarrow> (\<exists>n::int. x = of_real(2 * n * pi) + 3/2*pi)"
-    apply (rule iff_exI)
-    apply (auto simp: algebra_simps)
-    apply (rule injD [OF inj_of_real [where 'a = complex]], auto)
-    done
+  also have "... \<longleftrightarrow> (\<exists>n::int. x = of_real(2 * n * pi) + 3/2*pi)"
+    by (rule iff_exI) (auto simp: algebra_simps intro: injD [OF inj_of_real [where 'a = complex]])
also have "... = ?rhs"
by (auto simp: algebra_simps)
finally show ?thesis .
@@ -407,13 +397,10 @@
proof -
have "cos x = -1 \<longleftrightarrow> cos (complex_of_real x) = -1"
by (metis Re_complex_of_real of_real_def scaleR_minus1_left cos_of_real)
-  also have "...  \<longleftrightarrow> (\<exists>n::int. complex_of_real x = of_real(2 * n * pi) + pi)"
+  also have "... \<longleftrightarrow> (\<exists>n::int. complex_of_real x = of_real(2 * n * pi) + pi)"
by (simp only: ccos_eq_minus1)
-  also have "...  \<longleftrightarrow> (\<exists>n::int. x = of_real(2 * n * pi) + pi)"
-    apply (rule iff_exI)
-    apply (auto simp: algebra_simps)
-    apply (rule injD [OF inj_of_real [where 'a = complex]], auto)
-    done
+  also have "... \<longleftrightarrow> (\<exists>n::int. x = of_real(2 * n * pi) + pi)"
+    by (rule iff_exI) (auto simp: algebra_simps intro: injD [OF inj_of_real [where 'a = complex]])
also have "... = ?rhs"
by (auto simp: algebra_simps)
finally show ?thesis .
@@ -442,13 +429,11 @@
proof cases
case 1
then show ?thesis
-      apply (auto simp: sin_eq_0 algebra_simps)
-      by (metis Ints_of_int of_real_of_int_eq)
+      by (simp add: sin_eq_0 algebra_simps) (metis Ints_of_int of_real_of_int_eq)
next
case 2
then show ?thesis
-      apply (auto simp: cos_eq_0 algebra_simps)
-      by (metis Ints_of_int of_real_of_int_eq)
+      by (simp add: cos_eq_0 algebra_simps) (metis Ints_of_int of_real_of_int_eq)
qed
next
assume ?rhs
@@ -464,8 +449,7 @@

lemma complex_cos_eq:
fixes w :: complex
-  shows "cos w = cos z \<longleftrightarrow>
-         (\<exists>n \<in> \<int>. w = z + of_real(2*n*pi) \<or> w = -z + of_real(2*n*pi))"
+  shows "cos w = cos z \<longleftrightarrow> (\<exists>n \<in> \<int>. w = z + of_real(2*n*pi) \<or> w = -z + of_real(2*n*pi))"
(is "?lhs = ?rhs")
proof
assume ?lhs
@@ -479,12 +463,12 @@
proof cases
case 1
then show ?thesis
-      apply (auto simp: sin_eq_0 algebra_simps)
+      apply (simp add: sin_eq_0 algebra_simps)
by (metis Ints_of_int of_real_of_int_eq)
next
case 2
then show ?thesis
-      apply (auto simp: sin_eq_0 algebra_simps)
+      apply (clarsimp simp: sin_eq_0 algebra_simps)
qed
next
@@ -494,7 +478,7 @@
using Ints_cases  by (metis of_int_mult of_int_numeral)
then show ?lhs
using Periodic_Fun.cos.plus_of_int [of z n]
-    apply (auto simp: algebra_simps)
by (metis cos.plus_of_int cos_minus minus_add_cancel mult.commute)
qed

@@ -540,8 +524,7 @@
apply (cases z)
apply (simp add: cos_exp_eq sin_exp_eq exp_minus exp_of_real Re_divide Im_divide power_divide)
-  apply (simp only: left_diff_distrib [symmetric] power_mult_distrib)
+  apply (simp only: left_diff_distrib [symmetric] power_mult_distrib sin_squared_eq)
apply (simp add: power2_eq_square algebra_simps divide_simps)
done

@@ -550,8 +533,7 @@
apply (cases z)
apply (simp add: cos_exp_eq sin_exp_eq exp_minus exp_of_real Re_divide Im_divide power_divide)
-  apply (simp only: left_diff_distrib [symmetric] power_mult_distrib)
+  apply (simp only: left_diff_distrib [symmetric] power_mult_distrib cos_squared_eq)
apply (simp add: power2_eq_square algebra_simps divide_simps)
done

@@ -588,11 +570,7 @@
also have "... = cmod (2 + exp (\<i> * z) + exp (- (\<i> * z))) / 2"
finally show ?thesis
-    apply (rule ssubst, simp)
-    apply (rule order_trans [OF triangle3], simp)
-    using exp_uminus_Im *
-    apply (auto intro: mono)
-    done
+    by (metis exp_eq_one_iff exp_le_cancel_iff mult_2 norm_cos_le norm_ge_zero norm_one norm_triangle_mono)
qed

lemma sinh_conv_sin: "sinh z = -\<i> * sin (\<i>*z)"
@@ -650,14 +628,7 @@
using x by (auto simp: closed_segment_def intro!: mult_left_le_one_le)
finally show "norm (exp x) \<le> exp (norm z)"
by simp
-next
-  show "0 \<in> closed_segment 0 z"
-    by (auto simp: closed_segment_def)
-next
-  show "z \<in> closed_segment 0 z"
-    apply (simp add: closed_segment_def scaleR_conv_of_real)
-    using of_real_1 zero_le_one by blast
-qed
+qed auto

lemma Taylor_exp:
"norm(exp z - (\<Sum>k\<le>n. z ^ k / (fact k))) \<le> exp\<bar>Re z\<bar> * (norm z) ^ (Suc n) / (fact n)"
@@ -673,40 +644,40 @@
fix x
assume "x \<in> closed_segment 0 z"
then show "Re x \<le> \<bar>Re z\<bar>"
-    apply (auto simp: closed_segment_def scaleR_conv_of_real)
+    apply (clarsimp simp: closed_segment_def scaleR_conv_of_real)
by (meson abs_ge_self abs_ge_zero linear mult_left_le_one_le mult_nonneg_nonpos order_trans)
-next
-  show "0 \<in> closed_segment 0 z"
-    by (auto simp: closed_segment_def)
-next
-  show "z \<in> closed_segment 0 z"
-    apply (simp add: closed_segment_def scaleR_conv_of_real)
-    using of_real_1 zero_le_one by blast
-qed
+qed auto

lemma
assumes "0 \<le> u" "u \<le> 1"
shows cmod_sin_le_exp: "cmod (sin (u *\<^sub>R z)) \<le> exp \<bar>Im z\<bar>"
and cmod_cos_le_exp: "cmod (cos (u *\<^sub>R z)) \<le> exp \<bar>Im z\<bar>"
proof -
-  have mono: "\<And>u w z::real. w \<le> u \<Longrightarrow> z \<le> u \<Longrightarrow> w + z \<le> u*2"
-    by arith
-  show "cmod (sin (u *\<^sub>R z)) \<le> exp \<bar>Im z\<bar>" using assms
-    apply (auto simp: scaleR_conv_of_real norm_mult norm_power sin_exp_eq norm_divide)
-    apply (rule order_trans [OF norm_triangle_ineq4])
-    apply (rule mono)
-    apply (auto simp: abs_if mult_left_le_one_le)
-    apply (meson mult_nonneg_nonneg neg_le_0_iff_le not_le order_trans)
-    apply (meson less_eq_real_def mult_nonneg_nonpos neg_0_le_iff_le order_trans)
-    done
-  show "cmod (cos (u *\<^sub>R z)) \<le> exp \<bar>Im z\<bar>" using assms
-    apply (auto simp: scaleR_conv_of_real norm_mult norm_power cos_exp_eq norm_divide)
-    apply (rule order_trans [OF norm_triangle_ineq])
-    apply (rule mono)
-    apply (auto simp: abs_if mult_left_le_one_le)
-    apply (meson mult_nonneg_nonneg neg_le_0_iff_le not_le order_trans)
-    apply (meson less_eq_real_def mult_nonneg_nonpos neg_0_le_iff_le order_trans)
-    done
+  have mono: "\<And>u w z::real. w \<le> u \<Longrightarrow> z \<le> u \<Longrightarrow> (w + z)/2 \<le> u"
+    by simp
+  have *: "(cmod (exp (\<i> * (u * z))) + cmod (exp (- (\<i> * (u * z)))) ) / 2 \<le> exp \<bar>Im z\<bar>"
+  proof (rule mono)
+    show "cmod (exp (\<i> * (u * z))) \<le> exp \<bar>Im z\<bar>"
+      apply (simp add: abs_if mult_left_le_one_le assms not_less)
+      by (meson assms(1) mult_nonneg_nonneg neg_le_0_iff_le order_trans)
+    show "cmod (exp (- (\<i> * (u * z)))) \<le> exp \<bar>Im z\<bar>"
+      apply (simp add: abs_if mult_left_le_one_le assms)
+      by (meson \<open>0 \<le> u\<close> less_eq_real_def mult_nonneg_nonpos neg_0_le_iff_le order_trans)
+  qed
+  have "cmod (sin (u *\<^sub>R z)) = cmod (exp (\<i> * (u * z)) - exp (- (\<i> * (u * z)))) / 2"
+    by (auto simp: scaleR_conv_of_real norm_mult norm_power sin_exp_eq norm_divide)
+  also have "... \<le> (cmod (exp (\<i> * (u * z))) + cmod (exp (- (\<i> * (u * z)))) ) / 2"
+    by (intro divide_right_mono norm_triangle_ineq4) simp
+  also have "... \<le> exp \<bar>Im z\<bar>"
+    by (rule *)
+  finally show "cmod (sin (u *\<^sub>R z)) \<le> exp \<bar>Im z\<bar>" .
+  have "cmod (cos (u *\<^sub>R z)) = cmod (exp (\<i> * (u * z)) + exp (- (\<i> * (u * z)))) / 2"
+    by (auto simp: scaleR_conv_of_real norm_mult norm_power cos_exp_eq norm_divide)
+  also have "... \<le> (cmod (exp (\<i> * (u * z))) + cmod (exp (- (\<i> * (u * z)))) ) / 2"
+    by (intro divide_right_mono norm_triangle_ineq) simp
+  also have "... \<le> exp \<bar>Im z\<bar>"
+    by (rule *)
+  finally show "cmod (cos (u *\<^sub>R z)) \<le> exp \<bar>Im z\<bar>" .
qed

lemma Taylor_sin:
@@ -827,12 +798,9 @@
then obtain n::int where n: "t' = t + 2 * n * pi"
by (auto simp: sin_cos_eq_iff)
then have "n=0"
-    apply (rule_tac z=n in int_cases)
-    using t t'
-    apply (auto simp: mult_less_0_iff algebra_simps)
-    done
+    by (cases n) (use t t' in \<open>auto simp: mult_less_0_iff algebra_simps\<close>)
then show "t' = t"
qed

lemma Arg: "0 \<le> Arg z & Arg z < 2*pi & z = of_real(norm z) * exp(\<i> * of_real(Arg z))"
@@ -868,26 +836,24 @@
by (metis Arg_eq cis_conv_exp mult.left_neutral norm_cis of_real_1)

lemma Arg_unique: "\<lbrakk>of_real r * exp(\<i> * of_real a) = z; 0 < r; 0 \<le> a; a < 2*pi\<rbrakk> \<Longrightarrow> Arg z = a"
-  apply (rule Arg_unique_lemma [OF _ Arg_eq])
-  using Arg [of z]
-  apply (auto simp: norm_mult)
-  done
+  by (rule Arg_unique_lemma [OF _ Arg_eq])
+  (use Arg [of z] in \<open>auto simp: norm_mult\<close>)

lemma Arg_minus: "z \<noteq> 0 \<Longrightarrow> Arg (-z) = (if Arg z < pi then Arg z + pi else Arg z - pi)"
apply (rule Arg_unique [of "norm z"])
apply (rule complex_eqI)
-  using Arg_ge_0 [of z] Arg_eq [of z] Arg_lt_2pi [of z] Arg_eq [of z]
-  apply auto
+  using Arg_ge_0 [of z] Arg_eq [of z] Arg_lt_2pi [of z]
apply (auto simp: Re_exp Im_exp cos_diff sin_diff cis_conv_exp [symmetric])
apply (metis Re_rcis Im_rcis rcis_def)+
done

-lemma Arg_times_of_real [simp]: "0 < r \<Longrightarrow> Arg (of_real r * z) = Arg z"
-  apply (cases "z=0", simp)
-  apply (rule Arg_unique [of "r * norm z"])
-  using Arg
-  apply auto
-  done
+lemma Arg_times_of_real [simp]:
+  assumes "0 < r" shows "Arg (of_real r * z) = Arg z"
+proof (cases "z=0")
+  case False
+  show ?thesis
+    by (rule Arg_unique [of "r * norm z"]) (use Arg False assms in auto)
+qed auto

lemma Arg_times_of_real2 [simp]: "0 < r \<Longrightarrow> Arg (z * of_real r) = Arg z"
by (metis Arg_times_of_real mult.commute)
@@ -897,61 +863,52 @@

lemma Arg_le_pi: "Arg z \<le> pi \<longleftrightarrow> 0 \<le> Im z"
proof (cases "z=0")
-  case True then show ?thesis
-    by simp
-next
case False
have "0 \<le> Im z \<longleftrightarrow> 0 \<le> Im (of_real (cmod z) * exp (\<i> * complex_of_real (Arg z)))"
by (metis Arg_eq)
also have "... = (0 \<le> Im (exp (\<i> * complex_of_real (Arg z))))"
-    using False
+    using False  by (simp add: zero_le_mult_iff)
also have "... \<longleftrightarrow> Arg z \<le> pi"
by (simp add: Im_exp) (metis Arg_ge_0 Arg_lt_2pi sin_lt_zero sin_ge_zero not_le)
finally show ?thesis
by blast
-qed
+qed auto

lemma Arg_lt_pi: "0 < Arg z \<and> Arg z < pi \<longleftrightarrow> 0 < Im z"
proof (cases "z=0")
-  case True then show ?thesis
-    by simp
-next
case False
have "0 < Im z \<longleftrightarrow> 0 < Im (of_real (cmod z) * exp (\<i> * complex_of_real (Arg z)))"
by (metis Arg_eq)
also have "... = (0 < Im (exp (\<i> * complex_of_real (Arg z))))"
-    using False
+    using False by (simp add: zero_less_mult_iff)
also have "... \<longleftrightarrow> 0 < Arg z \<and> Arg z < pi"
-    using Arg_ge_0  Arg_lt_2pi sin_le_zero sin_gt_zero
+    using Arg_ge_0 Arg_lt_2pi sin_le_zero sin_gt_zero
apply (auto simp: Im_exp)
using le_less apply fastforce
using not_le by blast
finally show ?thesis
by blast
-qed
+qed auto

lemma Arg_eq_0: "Arg z = 0 \<longleftrightarrow> z \<in> \<real> \<and> 0 \<le> Re z"
proof (cases "z=0")
-  case True then show ?thesis
-    by simp
-next
case False
have "z \<in> \<real> \<and> 0 \<le> Re z \<longleftrightarrow> z \<in> \<real> \<and> 0 \<le> Re (of_real (cmod z) * exp (\<i> * complex_of_real (Arg z)))"
by (metis Arg_eq)
also have "... \<longleftrightarrow> z \<in> \<real> \<and> 0 \<le> Re (exp (\<i> * complex_of_real (Arg z)))"
-    using False
+    using False  by (simp add: zero_le_mult_iff)
also have "... \<longleftrightarrow> Arg z = 0"
-    apply (auto simp: Re_exp)
-    apply (metis Arg_lt_pi Arg_ge_0 Arg_le_pi cos_pi complex_is_Real_iff leD less_linear less_minus_one_simps(2) minus_minus neg_less_eq_nonneg order_refl)
-    using Arg_eq [of z]
-    apply (auto simp: Reals_def)
-    done
+  proof -
+    have [simp]: "Arg z = 0 \<Longrightarrow> z \<in> \<real>"
+      using Arg_eq [of z] by (auto simp: Reals_def)
+    moreover have "\<lbrakk>z \<in> \<real>; 0 \<le> cos (Arg z)\<rbrakk> \<Longrightarrow> Arg z = 0"
+      by (metis Arg_lt_pi Arg_ge_0 Arg_le_pi cos_pi complex_is_Real_iff leD less_linear less_minus_one_simps(2) minus_minus neg_less_eq_nonneg order_refl)
+    ultimately show ?thesis
+      by (auto simp: Re_exp)
+  qed
finally show ?thesis
by blast
-qed
+qed auto

corollary Arg_gt_0:
assumes "z \<in> \<real> \<Longrightarrow> Re z < 0"
@@ -962,22 +919,21 @@

lemma Arg_eq_pi: "Arg z = pi \<longleftrightarrow> z \<in> \<real> \<and> Re z < 0"
-  apply  (cases "z=0", simp)
using Arg_eq_0 [of "-z"]
-  apply (auto simp: complex_is_Real_iff Arg_minus)
-  apply (metis Arg_minus pi_gt_zero add.left_neutral minus_minus minus_zero)
-  done
+  by (metis Arg_eq_0 Arg_gt_0 Arg_le_pi Arg_lt_pi complex_is_Real_iff dual_order.order_iff_strict not_less pi_neq_zero)

lemma Arg_eq_0_pi: "Arg z = 0 \<or> Arg z = pi \<longleftrightarrow> z \<in> \<real>"
using Arg_eq_0 Arg_eq_pi not_le by auto

lemma Arg_inverse: "Arg(inverse z) = (if z \<in> \<real> \<and> 0 \<le> Re z then Arg z else 2*pi - Arg z)"
-  apply (cases "z=0", simp)
-  apply (rule Arg_unique [of "inverse (norm z)"])
-  using Arg_ge_0 [of z] Arg_lt_2pi [of z] Arg_eq [of z] Arg_eq_0 [of z] exp_two_pi_i
-  apply (auto simp: of_real_numeral algebra_simps exp_diff divide_simps)
-  done
+proof (cases "z=0")
+  case False
+  show ?thesis
+    apply (rule Arg_unique [of "inverse (norm z)"])
+    using False Arg_ge_0 [of z] Arg_lt_2pi [of z] Arg_eq [of z] Arg_eq_0 [of z]
+       apply (auto simp: exp_diff field_simps)
+    done
+qed auto

lemma Arg_eq_iff:
assumes "w \<noteq> 0" "z \<noteq> 0"
@@ -989,17 +945,14 @@
by (metis mult.commute mult.left_commute)

lemma Arg_inverse_eq_0: "Arg(inverse z) = 0 \<longleftrightarrow> Arg z = 0"
-  using complex_is_Real_iff
-  apply (auto simp: divide_simps not_sum_power2_lt_zero)
-  done
+  by (metis Arg_eq_0 Arg_inverse inverse_inverse_eq)

lemma Arg_divide:
assumes "w \<noteq> 0" "z \<noteq> 0" "Arg w \<le> Arg z"
shows "Arg(z / w) = Arg z - Arg w"
apply (rule Arg_unique [of "norm(z / w)"])
-  using assms Arg_eq [of z] Arg_eq [of w] Arg_ge_0 [of w] Arg_lt_2pi [of z]
-  apply (auto simp: exp_diff norm_divide algebra_simps divide_simps)
+  using assms Arg_eq Arg_ge_0 [of w] Arg_lt_2pi [of z]
+  apply (auto simp: exp_diff norm_divide field_simps)
done

lemma Arg_le_div_sum:
@@ -1010,23 +963,19 @@
lemma Arg_le_div_sum_eq:
assumes "w \<noteq> 0" "z \<noteq> 0"
shows "Arg w \<le> Arg z \<longleftrightarrow> Arg z = Arg w + Arg(z / w)"
-  using assms
-  by (auto simp: Arg_ge_0 intro: Arg_le_div_sum)
+  using assms by (auto simp: Arg_ge_0 intro: Arg_le_div_sum)

lemma Arg_diff:
assumes "w \<noteq> 0" "z \<noteq> 0"
shows "Arg w - Arg z = (if Arg z \<le> Arg w then Arg(w / z) else Arg(w/z) - 2*pi)"
-  using assms
-  apply (auto simp: Arg_ge_0 Arg_divide not_le)
-  using Arg_divide [of w z] Arg_inverse [of "w/z"]
-  apply auto
+  using assms Arg_divide Arg_inverse [of "w/z"]
+  apply (clarsimp simp add: Arg_ge_0 Arg_divide not_le)
by (metis Arg_eq_0 less_irrefl minus_diff_eq right_minus_eq)

assumes "w \<noteq> 0" "z \<noteq> 0"
shows "Arg w + Arg z = (if Arg w + Arg z < 2*pi then Arg(w * z) else Arg(w * z) + 2*pi)"
-  using assms
-  using Arg_diff [of "w*z" z] Arg_le_div_sum_eq [of z "w*z"]
+  using assms Arg_diff [of "w*z" z] Arg_le_div_sum_eq [of z "w*z"]
apply (auto simp: Arg_ge_0 Arg_divide not_le)
@@ -1039,20 +988,22 @@
by auto

-lemma Arg_cnj: "Arg(cnj z) = (if z \<in> \<real> \<and> 0 \<le> Re z then Arg z else 2*pi - Arg z)"
-  apply (cases "z=0", simp)
-  apply (rule trans [of _ "Arg(inverse z)"])
+lemma Arg_cnj_eq_inverse: "z\<noteq>0 \<Longrightarrow> Arg (cnj z) = Arg (inverse z)"
apply (simp add: Arg_eq_iff divide_simps complex_norm_square [symmetric] mult.commute)
-  apply (metis norm_eq_zero of_real_power zero_less_power2)
-  apply (auto simp: of_real_numeral Arg_inverse)
-  done
+  by (metis of_real_power zero_less_norm_iff zero_less_power)
+
+lemma Arg_cnj: "Arg(cnj z) = (if z \<in> \<real> \<and> 0 \<le> Re z then Arg z else 2*pi - Arg z)"
+proof (cases "z=0")
+  case False
+  then show ?thesis
+    by (simp add: Arg_cnj_eq_inverse Arg_inverse)
+qed auto

lemma Arg_real: "z \<in> \<real> \<Longrightarrow> Arg z = (if 0 \<le> Re z then 0 else pi)"
-  using Arg_eq_0 Arg_eq_0_pi
-  by auto
+  using Arg_eq_0 Arg_eq_0_pi by auto

lemma Arg_exp: "0 \<le> Im z \<Longrightarrow> Im z < 2*pi \<Longrightarrow> Arg(exp z) = Im z"
-  by (rule Arg_unique [of  "exp(Re z)"]) (auto simp: exp_eq_polar)
+  by (rule Arg_unique [of "exp(Re z)"]) (auto simp: exp_eq_polar)

lemma complex_split_polar:
obtains r a::real where "z = complex_of_real r * (cos a + \<i> * sin a)" "0 \<le> r" "0 \<le> a" "a < 2*pi"
@@ -1135,8 +1086,7 @@
have "ln(of_real (exp (ln z))::complex) = ln (exp (of_real (ln z)))"
also have "... = of_real(ln z)"
-    using assms
-    by (subst Ln_exp) auto
+    using assms by (subst Ln_exp) auto
finally show ?thesis
using assms by simp
qed
@@ -1156,7 +1106,7 @@
lemma Ln_1 [simp]: "ln 1 = (0::complex)"
proof -
have "ln (exp 0) = (0::complex)"
-    by (metis (mono_tags, hide_lams) Ln_of_real exp_zero ln_one of_real_0 of_real_1 zero_less_one)
+    by (simp add: del: exp_zero)
then show ?thesis
by simp
qed
@@ -1191,11 +1141,11 @@
proposition exists_complex_root:
fixes z :: complex
assumes "n \<noteq> 0"  obtains w where "z = w ^ n"
-  apply (cases "z=0")
-  using assms apply (simp add: power_0_left)
-  apply (rule_tac w = "exp(Ln z / n)" in that)
-  apply (auto simp: assms exp_of_nat_mult [symmetric])
-  done
+proof (cases "z=0")
+  case False
+  then show ?thesis
+    by (rule_tac w = "exp(Ln z / n)" in that) (simp add: assms exp_of_nat_mult [symmetric])
+qed (use assms in auto)

corollary exists_complex_root_nonzero:
fixes z::complex
@@ -1234,10 +1184,10 @@
have "(exp has_field_derivative z) (at (Ln z))"
by (metis znz DERIV_exp exp_Ln)
then show "(Ln has_field_derivative inverse(z)) (at z)"
-    apply (rule has_complex_derivative_inverse_strong_x
-              [where s = "{w. -pi < Im(w) \<and> Im(w) < pi}"])
+    apply (rule has_field_derivative_inverse_strong_x
+              [where S = "{w. -pi < Im(w) \<and> Im(w) < pi}"])
using znz *
-    apply (auto simp: Transcendental.continuous_on_exp [OF continuous_on_id] open_Collect_conj open_halfspace_Im_gt open_halfspace_Im_lt mpi_less_Im_Ln)
+    apply (auto simp: continuous_on_exp [OF continuous_on_id] open_Collect_conj open_halfspace_Im_gt open_halfspace_Im_lt mpi_less_Im_Ln)
done
qed

@@ -1293,10 +1243,7 @@
proof (rule exE [OF complex_mvt_line [of x y "\<lambda>z. z / Ln z" "\<lambda>z. 1/(Ln z) - 1/(Ln z)^2"]];
clarsimp simp add: closed_segment_Reals closed_segment_eq_real_ivl assms)
show "\<And>u. \<lbrakk>x \<le> u; u \<le> y\<rbrakk> \<Longrightarrow> ((\<lambda>z. z / Ln z) has_field_derivative 1 / Ln u - 1 / (Ln u)\<^sup>2) (at u)"
-    using \<open>3 \<le> x\<close> apply -
-    apply (rule derivative_eq_intros | simp)+
-    apply (force simp: field_simps power_eq_if)
-    done
+    using \<open>3 \<le> x\<close> by (force intro!: derivative_eq_intros simp: field_simps power_eq_if)
show "x / ln x \<le> y / ln y"
if "Re (y / Ln y) - Re (x / Ln x) = (Re (1 / Ln u) - Re (1 / (Ln u)\<^sup>2)) * (y - x)"
and x: "x \<le> u" "u \<le> y" for u
@@ -1325,12 +1272,9 @@
using Im_Ln_le_pi [of z]  mpi_less_Im_Ln [of z]  assms
by auto
then have "\<bar>Im w\<bar> < pi/2 \<longleftrightarrow> 0 < Re(exp w)"
-      apply (auto simp: Re_exp zero_less_mult_iff cos_gt_zero_pi)
using cos_lt_zero_pi [of "-(Im w)"] cos_lt_zero_pi [of "(Im w)"]
-      apply (simp add: abs_if split: if_split_asm)
-      apply (metis (no_types) cos_minus cos_pi_half eq_divide_eq_numeral1(1) eq_numeral_simps(4)
-               less_numeral_extra(3) linorder_neqE_linordered_idom minus_mult_minus minus_mult_right
-               mult_numeral_1_right)
+      apply (auto simp: Re_exp zero_less_mult_iff cos_gt_zero_pi abs_if split: if_split_asm)
+      apply (metis cos_minus cos_pi_half divide_minus_left less_irrefl linorder_neqE_linordered_idom nonzero_mult_div_cancel_right zero_neq_numeral)+
done
}
then show ?thesis using assms
@@ -1367,8 +1311,7 @@
by auto
then have "0 < Im w \<and> Im w < pi \<longleftrightarrow> 0 < Im(exp w)"
using sin_gt_zero [of "- (Im w)"] sin_gt_zero [of "(Im w)"]
-      apply (auto simp: Im_exp zero_less_mult_iff)
-      using less_linear apply fastforce
+      apply (simp add: Im_exp zero_less_mult_iff)
using less_linear apply fastforce
done
}
@@ -1412,22 +1355,52 @@

subsection\<open>More Properties of Ln\<close>

-lemma cnj_Ln: "z \<notin> \<real>\<^sub>\<le>\<^sub>0 \<Longrightarrow> cnj(Ln z) = Ln(cnj z)"
-  apply (cases "z=0", auto)
-  apply (rule exp_complex_eqI)
-  apply (auto simp: abs_if split: if_split_asm)
-  using Im_Ln_less_pi Im_Ln_le_pi apply force
-  apply (metis complex_cnj_zero_iff diff_minus_eq_add diff_strict_mono minus_less_iff
-          mpi_less_Im_Ln mult.commute mult_2_right)
-  by (metis exp_Ln exp_cnj)
-
-lemma Ln_inverse: "z \<notin> \<real>\<^sub>\<le>\<^sub>0 \<Longrightarrow> Ln(inverse z) = -(Ln z)"
-  apply (cases "z=0", auto)
-  apply (rule exp_complex_eqI)
-  using mpi_less_Im_Ln [of z] mpi_less_Im_Ln [of "inverse z"]
-  apply (auto simp: abs_if exp_minus split: if_split_asm)
-  done
+lemma cnj_Ln: assumes "z \<notin> \<real>\<^sub>\<le>\<^sub>0" shows "cnj(Ln z) = Ln(cnj z)"
+proof (cases "z=0")
+  case False
+  show ?thesis
+  proof (rule exp_complex_eqI)
+    have "\<bar>Im (cnj (Ln z)) - Im (Ln (cnj z))\<bar> \<le> \<bar>Im (cnj (Ln z))\<bar> + \<bar>Im (Ln (cnj z))\<bar>"
+      by (rule abs_triangle_ineq4)
+    also have "... < pi + pi"
+    proof -
+      have "\<bar>Im (cnj (Ln z))\<bar> < pi"
+        by (simp add: False Im_Ln_less_pi abs_if assms minus_less_iff mpi_less_Im_Ln)
+      moreover have "\<bar>Im (Ln (cnj z))\<bar> \<le> pi"
+        by (meson abs_le_iff complex_cnj_zero_iff less_eq_real_def minus_less_iff  False Im_Ln_le_pi mpi_less_Im_Ln)
+      ultimately show ?thesis
+        by simp
+    qed
+    finally show "\<bar>Im (cnj (Ln z)) - Im (Ln (cnj z))\<bar> < 2 * pi"
+      by simp
+    show "exp (cnj (Ln z)) = exp (Ln (cnj z))"
+      by (metis False complex_cnj_zero_iff exp_Ln exp_cnj)
+  qed
+qed (use assms in auto)
+
+
+lemma Ln_inverse: assumes "z \<notin> \<real>\<^sub>\<le>\<^sub>0" shows "Ln(inverse z) = -(Ln z)"
+proof (cases "z=0")
+  case False
+  show ?thesis
+  proof (rule exp_complex_eqI)
+    have "\<bar>Im (Ln (inverse z)) - Im (- Ln z)\<bar> \<le> \<bar>Im (Ln (inverse z))\<bar> + \<bar>Im (- Ln z)\<bar>"
+      by (rule abs_triangle_ineq4)
+    also have "... < pi + pi"
+    proof -
+      have "\<bar>Im (Ln (inverse z))\<bar> < pi"
+        by (simp add: False Im_Ln_less_pi abs_if assms minus_less_iff mpi_less_Im_Ln)
+      moreover have "\<bar>Im (- Ln z)\<bar> \<le> pi"
+        using False Im_Ln_le_pi mpi_less_Im_Ln by fastforce
+      ultimately show ?thesis
+        by simp
+    qed
+    finally show "\<bar>Im (Ln (inverse z)) - Im (- Ln z)\<bar> < 2 * pi"
+      by simp
+    show "exp (Ln (inverse z)) = exp (- Ln z)"
+      by (simp add: False exp_minus)
+  qed
+qed (use assms in auto)

lemma Ln_minus1 [simp]: "Ln(-1) = \<i> * pi"
apply (rule exp_complex_eqI)
@@ -1451,11 +1424,9 @@
lemma Ln_times:
assumes "w \<noteq> 0" "z \<noteq> 0"
shows "Ln(w * z) =
-                (if Im(Ln w + Ln z) \<le> -pi then
-                  (Ln(w) + Ln(z)) + \<i> * of_real(2*pi)
-                else if Im(Ln w + Ln z) > pi then
-                  (Ln(w) + Ln(z)) - \<i> * of_real(2*pi)
-                else Ln(w) + Ln(z))"
+           (if Im(Ln w + Ln z) \<le> -pi then (Ln(w) + Ln(z)) + \<i> * of_real(2*pi)
+            else if Im(Ln w + Ln z) > pi then (Ln(w) + Ln(z)) - \<i> * of_real(2*pi)
+            else Ln(w) + Ln(z))"
using pi_ge_zero Im_Ln_le_pi [of w] Im_Ln_le_pi [of z]
using assms mpi_less_Im_Ln [of w] mpi_less_Im_Ln [of z]
by (auto simp: exp_add exp_diff sin_double cos_double exp_Euler intro!: Ln_unique)
@@ -1508,10 +1479,7 @@
apply (subst Ln_inverse)
using z by (auto simp add: complex_nonneg_Reals_iff)
also have "... = - (Ln z) + \<i> * 2 * complex_of_real pi"
-    apply (subst Ln_minus [OF assms])
-    using assms z
-    apply simp
-    done
+    by (subst Ln_minus) (use assms z in auto)
finally show ?thesis by (simp add: True)
qed

@@ -1598,17 +1566,17 @@
have *: "isCont (\<lambda>z. Im (Ln (- z)) + pi) z"
by (rule Complex.isCont_Im isCont_Ln' continuous_intros | simp add: assms complex_is_Real_iff)+
have [simp]: "\<And>x. \<lbrakk>Im x \<noteq> 0\<rbrakk> \<Longrightarrow> Im (Ln (- x)) + pi = Arg x"
-      using Arg_Ln Arg_gt_0 complex_is_Real_iff by auto
+    using Arg_Ln Arg_gt_0 complex_is_Real_iff by auto
consider "Re z < 0" | "Im z \<noteq> 0" using assms
using complex_nonneg_Reals_iff not_le by blast
then have [simp]: "(\<lambda>z. Im (Ln (- z)) + pi) \<midarrow>z\<rightarrow> Arg z"
-      using "*"  by (simp add: isCont_def) (metis Arg_Ln Arg_gt_0 complex_is_Real_iff)
+    using "*"  by (simp add: isCont_def) (metis Arg_Ln Arg_gt_0 complex_is_Real_iff)
show ?thesis
-      apply (rule Lim_transform_within_open [where s= "-\<real>\<^sub>\<ge>\<^sub>0" and f = "\<lambda>z. Im(Ln(-z)) + pi"])
-      apply (auto simp add: not_le Arg_Ln [OF Arg_gt_0] complex_nonneg_Reals_iff closed_def [symmetric])
-      using assms apply (force simp add: complex_nonneg_Reals_iff)
-      done
+    unfolding continuous_at
+  proof (rule Lim_transform_within_open)
+    show "\<And>x. \<lbrakk>x \<in> - \<real>\<^sub>\<ge>\<^sub>0; x \<noteq> z\<rbrakk> \<Longrightarrow> Im (Ln (- x)) + pi = Arg x"
+      by (auto simp add: Arg_Ln [OF Arg_gt_0] complex_nonneg_Reals_iff)
+  qed (use assms in auto)
qed

lemma Ln_series:
@@ -1624,7 +1592,7 @@
have "\<exists>c. \<forall>z\<in>ball 0 1. ln (1 + z) - ?F z = c"
proof (rule has_field_derivative_zero_constant)
fix z :: complex assume z': "z \<in> ball 0 1"
-    hence z: "norm z < 1" by (simp add: dist_0_norm)
+    hence z: "norm z < 1" by simp
define t :: complex where "t = of_real (1 + norm z) / 2"
from z have t: "norm z < norm t" "norm t < 1" unfolding t_def
@@ -1648,7 +1616,7 @@
qed simp_all
then obtain c where c: "\<And>z. z \<in> ball 0 1 \<Longrightarrow> ln (1 + z) - ?F z = c" by blast
from c[of 0] have "c = 0" by (simp only: powser_zero) simp
-  with c[of z] assms have "ln (1 + z) = ?F z" by (simp add: dist_0_norm)
+  with c[of z] assms have "ln (1 + z) = ?F z" by simp
moreover have "summable (\<lambda>n. ?f n * z^n)" using assms r
ultimately show ?thesis by (simp add: sums_iff)
@@ -1694,8 +1662,9 @@
(auto simp: norm_power norm_inverse norm_mult mult_ac simp del: of_nat_add of_nat_Suc)
also have "norm ((-z)^2 * (-z)^i) * inverse (of_nat (i+2)) \<le> norm ((-z)^2 * (-z)^i) * 1" for i
by (intro mult_left_mono) (simp_all add: divide_simps)
-  hence "(\<Sum>i. norm (-(z^2) * inverse (of_nat (i+2)) * (-z)^i)) \<le>
-           (\<Sum>i. norm (-(z^2) * (-z)^i))" using A assms
+  hence "(\<Sum>i. norm (-(z^2) * inverse (of_nat (i+2)) * (-z)^i))
+         \<le> (\<Sum>i. norm (-(z^2) * (-z)^i))"
+    using A assms
apply (simp_all only: norm_power norm_inverse norm_divide norm_mult)
apply (intro suminf_le summable_mult summable_geometric)
apply (auto simp: norm_power field_simps simp del: of_nat_add of_nat_Suc)
@@ -1714,34 +1683,31 @@
assumes "0 < Im z"
shows "Arg z = pi/2 - arctan(Re z / Im z)"
proof (cases "z = 0")
-  case True with assms show ?thesis
-    by simp
-next
case False
show ?thesis
-    apply (rule Arg_unique [of "norm z"])
-    using False assms arctan [of "Re z / Im z"] pi_ge_two pi_half_less_two
-    apply (auto simp: exp_Euler cos_diff sin_diff)
-    using norm_complex_def [of z, symmetric]
-    apply (simp add: sin_of_real cos_of_real sin_arctan cos_arctan field_simps real_sqrt_divide)
-    apply (metis complex_eq mult.assoc ring_class.ring_distribs(2))
-    done
-qed
+  proof (rule Arg_unique [of "norm z"])
+    show "(cmod z) * exp (\<i> * (pi / 2 - arctan (Re z / Im z))) = z"
+      apply (auto simp: exp_Euler cos_diff sin_diff)
+      using assms norm_complex_def [of z, symmetric]
+      apply (simp add: sin_of_real cos_of_real sin_arctan cos_arctan field_simps real_sqrt_divide)
+      apply (metis complex_eq)
+      done
+  qed (use False arctan [of "Re z / Im z"] in auto)
+qed (use assms in auto)

lemma Arg_eq_Im_Ln:
assumes "0 \<le> Im z" "0 < Re z"
shows "Arg z = Im (Ln z)"
-proof (cases "z = 0 \<or> Im z = 0")
+proof (cases "Im z = 0")
case True then show ?thesis
-    using assms Arg_eq_0 complex_is_Real_iff
-    apply auto
-    by (metis Arg_eq_0_pi Arg_eq_pi Im_Ln_eq_0 Im_Ln_eq_pi less_numeral_extra(3) zero_complex.simps(1))
+    using Arg_eq_0 Ln_in_Reals assms(2) complex_is_Real_iff by auto
next
case False
-  then have "Arg z > 0"
+  then have *: "Arg z > 0"
using Arg_gt_0 complex_is_Real_iff by blast
-  then show ?thesis
-    using assms False
+  then have "z \<noteq> 0"
+    by auto
+  with * assms False show ?thesis
by (subst Arg_Ln) (auto simp: Ln_minus)
qed

@@ -1782,8 +1748,8 @@
qed

lemma continuous_on_upperhalf_Arg: "continuous_on ({z. 0 \<le> Im z} - {0}) Arg"
-  apply (auto simp: continuous_on_eq_continuous_within)
-  by (metis Diff_subset continuous_within_subset continuous_within_upperhalf_Arg)
+  unfolding continuous_on_eq_continuous_within
+  by (metis DiffE Diff_subset continuous_within_subset continuous_within_upperhalf_Arg insertCI)

lemma open_Arg_less_Int:
assumes "0 \<le> s" "t \<le> 2*pi"
@@ -1868,7 +1834,7 @@
by (metis assms not_le of_int_of_nat powr_complexpow powr_minus)

lemma powr_Reals_eq: "\<lbrakk>x \<in> \<real>; y \<in> \<real>; Re x \<ge> 0\<rbrakk> \<Longrightarrow> x powr y = of_real (Re x powr Re y)"
-  by (metis not_le of_real_Re powr_of_real)
+  by (metis of_real_Re powr_of_real)

lemma norm_powr_real_mono:
"\<lbrakk>w \<in> \<real>; 1 < Re w\<rbrakk>
@@ -1904,14 +1870,18 @@

lemma has_field_derivative_powr:
fixes z :: complex
-  shows "z \<notin> \<real>\<^sub>\<le>\<^sub>0 \<Longrightarrow> ((\<lambda>z. z powr s) has_field_derivative (s * z powr (s - 1))) (at z)"
-  apply (cases "z=0", auto)
+  assumes "z \<notin> \<real>\<^sub>\<le>\<^sub>0"
+  shows "((\<lambda>z. z powr s) has_field_derivative (s * z powr (s - 1))) (at z)"
+proof (cases "z=0")
+  case False
+  with assms show ?thesis
apply (rule DERIV_transform_at [where d = "norm z" and f = "\<lambda>z. exp (s * Ln z)"])
apply (auto simp: dist_complex_def)
-  apply (intro derivative_eq_intros | simp)+
+    apply (intro derivative_eq_intros | simp)+
done
+qed (use assms in auto)

declare has_field_derivative_powr[THEN DERIV_chain2, derivative_intros]

@@ -2009,9 +1979,7 @@

lemma has_field_derivative_powr_right [derivative_intros]:
"w \<noteq> 0 \<Longrightarrow> ((\<lambda>z. w powr z) has_field_derivative Ln w * w powr z) (at z)"
-  apply (intro derivative_eq_intros | simp)+
-  done
+  unfolding powr_def by (intro derivative_eq_intros | simp)+

lemma field_differentiable_powr_right [derivative_intros]:
fixes w::complex
@@ -2051,8 +2019,9 @@

lemma norm_powr_real_powr:
"w \<in> \<real> \<Longrightarrow> 0 \<le> Re w \<Longrightarrow> cmod (w powr z) = Re w powr Re z"
-  by (cases "w = 0") (auto simp add: norm_powr_real powr_def Im_Ln_eq_0
-                                     complex_is_Real_iff in_Reals_norm complex_eq_iff)
+  by (cases "w = 0")
+     (auto simp add: norm_powr_real powr_def Im_Ln_eq_0
+                     complex_is_Real_iff in_Reals_norm complex_eq_iff)

lemma tendsto_ln_complex [tendsto_intros]:
assumes "(f \<longlongrightarrow> a) F" "a \<notin> \<real>\<^sub>\<le>\<^sub>0"
@@ -2201,7 +2170,7 @@
lemma lim_Ln_over_power:
fixes s::complex
assumes "0 < Re s"
-    shows "((\<lambda>n. Ln n / (n powr s)) \<longlongrightarrow> 0) sequentially"
+    shows "(\<lambda>n. Ln (of_nat n) / of_nat n powr s) \<longlonglongrightarrow> 0"
proof (simp add: lim_sequentially dist_norm, clarify)
fix e::real
assume e: "0 < e"
@@ -2212,10 +2181,10 @@
next
fix x::real
assume x: "2 / (e * (Re s)\<^sup>2) \<le> x"
-    then have "x>0"
-    using e assms
-      by (metis less_le_trans mult_eq_0_iff mult_pos_pos pos_less_divide_eq power2_eq_square
-                zero_less_numeral)
+    have "2 / (e * (Re s)\<^sup>2) > 0"
+      using e assms by simp
+    with x have "x > 0"
+      by linarith
then show "0 < e * 2 + (e * Re s * 2 - 2) * x + e * (Re s)\<^sup>2 * x\<^sup>2"
using e assms x
apply (auto simp: field_simps)
@@ -2228,16 +2197,15 @@
then have "\<exists>xo>0. \<forall>x\<ge>xo. x / e < exp (Re s * x)"
using assms
by (force intro: less_le_trans [OF _ exp_lower_taylor_quadratic])
-  then have "\<exists>xo>0. \<forall>x\<ge>xo. x < e * exp (Re s * x)"
-    using e   by (auto simp: field_simps)
-  with e show "\<exists>no. \<forall>n\<ge>no. norm (Ln (of_nat n) / of_nat n powr s) < e"
+  then obtain xo where "xo > 0" and xo: "\<And>x. x \<ge> xo \<Longrightarrow> x < e * exp (Re s * x)"
+    using e  by (auto simp: field_simps)
+  have "norm (Ln (of_nat n) / of_nat n powr s) < e" if "n \<ge> nat \<lceil>exp xo\<rceil>" for n
+    using e xo [of "ln n"] that
apply (auto simp: norm_divide norm_powr_real divide_simps)
-    apply (rule_tac x="nat \<lceil>exp xo\<rceil>" in exI)
-    apply clarify
-    apply (drule_tac x="ln n" in spec)
-    apply (auto simp: exp_less_mono nat_ceiling_le_eq not_le)
apply (metis exp_less_mono exp_ln not_le of_nat_0_less_iff)
done
+  then show "\<exists>no. \<forall>n\<ge>no. norm (Ln (of_nat n) / of_nat n powr s) < e"
+    by blast
qed

lemma lim_Ln_over_n: "((\<lambda>n. Ln(of_nat n) / of_nat n) \<longlongrightarrow> 0) sequentially"
@@ -2261,18 +2229,15 @@

lemma lim_1_over_complex_power:
assumes "0 < Re s"
-    shows "((\<lambda>n. 1 / (of_nat n powr s)) \<longlongrightarrow> 0) sequentially"
-proof -
+  shows "(\<lambda>n. 1 / of_nat n powr s) \<longlonglongrightarrow> 0"
+proof (rule Lim_null_comparison)
have "\<forall>n>0. 3 \<le> n \<longrightarrow> 1 \<le> ln (real_of_nat n)"
using ln_272_gt_1
by (force intro: order_trans [of _ "ln (272/100)"])
-  moreover have "(\<lambda>n. cmod (Ln (of_nat n) / of_nat n powr s)) \<longlonglongrightarrow> 0"
-    using lim_Ln_over_power [OF assms]
-    by (metis tendsto_norm_zero_iff)
-  ultimately show ?thesis
-    apply (auto intro!: Lim_null_comparison [where g = "\<lambda>n. norm (Ln(of_nat n) / of_nat n powr s)"])
-    apply (auto simp: norm_divide divide_simps eventually_sequentially)
-    done
+  then show "\<forall>\<^sub>F x in sequentially. cmod (1 / of_nat x powr s) \<le> cmod (Ln (of_nat x) / of_nat x powr s)"
+    by (auto simp: norm_divide divide_simps eventually_sequentially)
+  show "(\<lambda>n. cmod (Ln (of_nat n) / of_nat n powr s)) \<longlonglongrightarrow> 0"
+    using lim_Ln_over_power [OF assms] by (metis tendsto_norm_zero_iff)
qed

lemma lim_1_over_real_power:
@@ -2302,12 +2267,9 @@
moreover have "n > 0" using n
using neq0_conv by fastforce
-  ultimately show "\<exists>no. \<forall>n. Ln (of_nat n) \<noteq> 0 \<longrightarrow> no \<le> n \<longrightarrow> 1 < r * cmod (Ln (of_nat n))"
+  ultimately show "\<exists>no. \<forall>k. Ln (of_nat k) \<noteq> 0 \<longrightarrow> no \<le> k \<longrightarrow> 1 < r * cmod (Ln (of_nat k))"
using n \<open>0 < r\<close>
-    apply (rule_tac x=n in exI)
-    apply (auto simp: divide_simps)
-    apply (erule less_le_trans, auto)
-    done
+    by (rule_tac x=n in exI) (force simp: divide_simps intro: less_le_trans)
qed

lemma lim_1_over_ln: "((\<lambda>n. 1 / ln(real_of_nat n)) \<longlongrightarrow> 0) sequentially"
@@ -2378,21 +2340,21 @@
lemma csqrt_inverse:
assumes "z \<notin> \<real>\<^sub>\<le>\<^sub>0"
shows "csqrt (inverse z) = inverse (csqrt z)"
-proof (cases "z=0", simp)
-  assume "z \<noteq> 0"
+proof (cases "z=0")
+  case False
then show ?thesis
using assms csqrt_exp_Ln Ln_inverse exp_minus
by (simp add: csqrt_exp_Ln Ln_inverse exp_minus)
-qed
+qed auto

lemma cnj_csqrt:
assumes "z \<notin> \<real>\<^sub>\<le>\<^sub>0"
shows "cnj(csqrt z) = csqrt(cnj z)"
-proof (cases "z=0", simp)
-  assume "z \<noteq> 0"
+proof (cases "z=0")
+  case False
then show ?thesis
by (simp add: assms cnj_Ln csqrt_exp_Ln exp_cnj)
-qed
+qed auto

lemma has_field_derivative_csqrt:
assumes "z \<notin> \<real>\<^sub>\<le>\<^sub>0"
@@ -2409,11 +2371,10 @@
with z have "((\<lambda>z. exp (Ln z / 2)) has_field_derivative inverse (2 * csqrt z)) (at z)"
by (force intro: derivative_eq_intros * simp add: assms)
then show ?thesis
-    apply (rule DERIV_transform_at[where d = "norm z"])
-    apply (intro z derivative_eq_intros | simp add: assms)+
-    using z
-    apply (metis csqrt_exp_Ln dist_0_norm less_irrefl)
-    done
+  proof (rule DERIV_transform_at)
+    show "\<And>x. dist x z < cmod z \<Longrightarrow> exp (Ln x / 2) = csqrt x"
+      by (metis csqrt_exp_Ln dist_0_norm less_irrefl)
+  qed (use z in auto)
qed

lemma field_differentiable_at_csqrt:
@@ -3054,7 +3015,7 @@
then have "cos (Arcsin z) \<noteq> 0"
by (metis diff_0_right power_zero_numeral sin_squared_eq)
then show ?thesis
-    apply (rule has_complex_derivative_inverse_basic [OF DERIV_sin _ _ open_ball [of z 1]])
+    apply (rule has_field_derivative_inverse_basic [OF DERIV_sin _ _ open_ball [of z 1]])
apply (auto intro: isCont_Arcsin assms)
done
qed
@@ -3219,7 +3180,7 @@
then have "- sin (Arccos z) \<noteq> 0"
by (metis cos_squared_eq diff_0_right mult_zero_left neg_0_equal_iff_equal power2_eq_square)
then have "(Arccos has_field_derivative inverse(- sin(Arccos z))) (at z)"
-    apply (rule has_complex_derivative_inverse_basic [OF DERIV_cos _ _ open_ball [of z 1]])
+    apply (rule has_field_derivative_inverse_basic [OF DERIV_cos _ _ open_ball [of z 1]])
apply (auto intro: isCont_Arccos assms)
done
then show ?thesis```
```--- a/src/HOL/Analysis/Conformal_Mappings.thy	Wed May 23 09:37:14 2018 +0000
+++ b/src/HOL/Analysis/Conformal_Mappings.thy	Wed May 23 21:34:08 2018 +0100
@@ -1290,7 +1290,7 @@
have 2: "deriv f z \<noteq> 0"
using \<open>z \<in> S\<close> \<open>open S\<close> holf holomorphic_injective_imp_regular injf by blast
show ?thesis
-      apply (rule has_complex_derivative_inverse_strong [OF 1 2 \<open>open S\<close> \<open>z \<in> S\<close>])
+      apply (rule has_field_derivative_inverse_strong [OF 1 2 \<open>open S\<close> \<open>z \<in> S\<close>])
```--- a/src/HOL/Analysis/Great_Picard.thy	Wed May 23 09:37:14 2018 +0000