equal
deleted
inserted
replaced
1344 assume "finite S" |
1344 assume "finite S" |
1345 thus ?thesis using assms |
1345 thus ?thesis using assms |
1346 by induct auto |
1346 by induct auto |
1347 qed (simp add: borel_measurable_const) |
1347 qed (simp add: borel_measurable_const) |
1348 |
1348 |
1349 lemma abs_extreal_ge0[simp]: "0 \<le> x \<Longrightarrow> \<bar>x :: extreal\<bar> = x" |
|
1350 by (cases x) auto |
|
1351 |
|
1352 lemma abs_extreal_less0[simp]: "x < 0 \<Longrightarrow> \<bar>x :: extreal\<bar> = -x" |
|
1353 by (cases x) auto |
|
1354 |
|
1355 lemma abs_extreal_pos[simp]: "0 \<le> \<bar>x :: extreal\<bar>" |
|
1356 by (cases x) auto |
|
1357 |
|
1358 lemma (in sigma_algebra) borel_measurable_extreal_abs[intro, simp]: |
1349 lemma (in sigma_algebra) borel_measurable_extreal_abs[intro, simp]: |
1359 fixes f :: "'a \<Rightarrow> extreal" assumes "f \<in> borel_measurable M" |
1350 fixes f :: "'a \<Rightarrow> extreal" assumes "f \<in> borel_measurable M" |
1360 shows "(\<lambda>x. \<bar>f x\<bar>) \<in> borel_measurable M" |
1351 shows "(\<lambda>x. \<bar>f x\<bar>) \<in> borel_measurable M" |
1361 proof - |
1352 proof - |
1362 { fix x have "\<bar>f x\<bar> = (if 0 \<le> f x then f x else - f x)" by auto } |
1353 { fix x have "\<bar>f x\<bar> = (if 0 \<le> f x then f x else - f x)" by auto } |