equal
deleted
inserted
replaced
163 lemma |
163 lemma |
164 fixes f :: "'a \<Rightarrow> 'b::semiring_1" assumes "finite A" |
164 fixes f :: "'a \<Rightarrow> 'b::semiring_1" assumes "finite A" |
165 shows setsum_mult_indicator[simp]: "(\<Sum>x \<in> A. f x * indicator (B x) (g x)) = (\<Sum>x\<in>{x\<in>A. g x \<in> B x}. f x)" |
165 shows setsum_mult_indicator[simp]: "(\<Sum>x \<in> A. f x * indicator (B x) (g x)) = (\<Sum>x\<in>{x\<in>A. g x \<in> B x}. f x)" |
166 and setsum_indicator_mult[simp]: "(\<Sum>x \<in> A. indicator (B x) (g x) * f x) = (\<Sum>x\<in>{x\<in>A. g x \<in> B x}. f x)" |
166 and setsum_indicator_mult[simp]: "(\<Sum>x \<in> A. indicator (B x) (g x) * f x) = (\<Sum>x\<in>{x\<in>A. g x \<in> B x}. f x)" |
167 unfolding indicator_def |
167 unfolding indicator_def |
168 using assms by (auto intro!: setsum.mono_neutral_cong_right split: split_if_asm) |
168 using assms by (auto intro!: setsum.mono_neutral_cong_right split: if_split_asm) |
169 |
169 |
170 lemma borel_measurable_induct_real[consumes 2, case_names set mult add seq]: |
170 lemma borel_measurable_induct_real[consumes 2, case_names set mult add seq]: |
171 fixes P :: "('a \<Rightarrow> real) \<Rightarrow> bool" |
171 fixes P :: "('a \<Rightarrow> real) \<Rightarrow> bool" |
172 assumes u: "u \<in> borel_measurable M" "\<And>x. 0 \<le> u x" |
172 assumes u: "u \<in> borel_measurable M" "\<And>x. 0 \<le> u x" |
173 assumes set: "\<And>A. A \<in> sets M \<Longrightarrow> P (indicator A)" |
173 assumes set: "\<And>A. A \<in> sets M \<Longrightarrow> P (indicator A)" |