equal
deleted
inserted
replaced
207 qed |
207 qed |
208 have A: "incseq A" by (auto intro!: incseq_SucI) |
208 have A: "incseq A" by (auto intro!: incseq_SucI) |
209 from finite_continuity_from_below[OF _ A] `range A \<subseteq> sets M` |
209 from finite_continuity_from_below[OF _ A] `range A \<subseteq> sets M` |
210 M'.finite_continuity_from_below[OF _ A] |
210 M'.finite_continuity_from_below[OF _ A] |
211 have convergent: "(\<lambda>i. ?d (A i)) ----> ?d (\<Union>i. A i)" |
211 have convergent: "(\<lambda>i. ?d (A i)) ----> ?d (\<Union>i. A i)" |
212 by (auto intro!: LIMSEQ_diff) |
212 by (auto intro!: tendsto_diff) |
213 obtain n :: nat where "- ?d (\<Union>i. A i) / e < real n" using reals_Archimedean2 by auto |
213 obtain n :: nat where "- ?d (\<Union>i. A i) / e < real n" using reals_Archimedean2 by auto |
214 moreover from order_trans[OF decseq_le[OF decseq convergent] dA_less] |
214 moreover from order_trans[OF decseq_le[OF decseq convergent] dA_less] |
215 have "real n \<le> - ?d (\<Union>i. A i) / e" using `0<e` by (simp add: field_simps) |
215 have "real n \<le> - ?d (\<Union>i. A i) / e" using `0<e` by (simp add: field_simps) |
216 ultimately show ?thesis by auto |
216 ultimately show ?thesis by auto |
217 qed |
217 qed |
293 show "(\<Inter>i. A i) \<in> sets M" using A_in_sets by auto |
293 show "(\<Inter>i. A i) \<in> sets M" using A_in_sets by auto |
294 have A: "decseq A" using A_mono by (auto intro!: decseq_SucI) |
294 have A: "decseq A" using A_mono by (auto intro!: decseq_SucI) |
295 from |
295 from |
296 finite_continuity_from_above[OF `range A \<subseteq> sets M` A] |
296 finite_continuity_from_above[OF `range A \<subseteq> sets M` A] |
297 M'.finite_continuity_from_above[OF `range A \<subseteq> sets M` A] |
297 M'.finite_continuity_from_above[OF `range A \<subseteq> sets M` A] |
298 have "(\<lambda>i. ?d (A i)) ----> ?d (\<Inter>i. A i)" by (intro LIMSEQ_diff) |
298 have "(\<lambda>i. ?d (A i)) ----> ?d (\<Inter>i. A i)" by (intro tendsto_diff) |
299 thus "?d (space M) \<le> ?d (\<Inter>i. A i)" using mono_dA[THEN monoD, of 0 _] |
299 thus "?d (space M) \<le> ?d (\<Inter>i. A i)" using mono_dA[THEN monoD, of 0 _] |
300 by (rule_tac LIMSEQ_le_const) (auto intro!: exI) |
300 by (rule_tac LIMSEQ_le_const) (auto intro!: exI) |
301 next |
301 next |
302 fix B assume B: "B \<in> sets M" "B \<subseteq> (\<Inter>i. A i)" |
302 fix B assume B: "B \<in> sets M" "B \<subseteq> (\<Inter>i. A i)" |
303 show "0 \<le> ?d B" |
303 show "0 \<le> ?d B" |