src/HOL/Probability/Product_Measure.thy
changeset 39098 21e9bd6cf0a8
parent 39097 943c7b348524
child 40859 de0b30e6c2d2
equal deleted inserted replaced
39097:943c7b348524 39098:21e9bd6cf0a8
     3 begin
     3 begin
     4 
     4 
     5 definition "dynkin M \<longleftrightarrow>
     5 definition "dynkin M \<longleftrightarrow>
     6   space M \<in> sets M \<and>
     6   space M \<in> sets M \<and>
     7   (\<forall> A \<in> sets M. A \<subseteq> space M) \<and>
     7   (\<forall> A \<in> sets M. A \<subseteq> space M) \<and>
     8   (\<forall> a \<in> sets M. \<forall> b \<in> sets M. b - a \<in> sets M) \<and>
     8   (\<forall> a \<in> sets M. \<forall> b \<in> sets M. a \<subseteq> b \<longrightarrow> b - a \<in> sets M) \<and>
     9   (\<forall>A. disjoint_family A \<and> range A \<subseteq> sets M \<longrightarrow> (\<Union>i::nat. A i) \<in> sets M)"
     9   (\<forall>A. disjoint_family A \<and> range A \<subseteq> sets M \<longrightarrow> (\<Union>i::nat. A i) \<in> sets M)"
    10 
    10 
    11 lemma dynkinI:
    11 lemma dynkinI:
    12   assumes "\<And> A. A \<in> sets M \<Longrightarrow> A \<subseteq> space M"
    12   assumes "\<And> A. A \<in> sets M \<Longrightarrow> A \<subseteq> space M"
    13   assumes "space M \<in> sets M" and "\<forall> b \<in> sets M. \<forall> a \<in> sets M. a \<subseteq> b \<longrightarrow> b - a \<in> sets M"
    13   assumes "space M \<in> sets M" and "\<forall> b \<in> sets M. \<forall> a \<in> sets M. a \<subseteq> b \<longrightarrow> b - a \<in> sets M"
    14   assumes "\<And> a. (\<And> i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {})
    14   assumes "\<And> a. (\<And> i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {})
    15           \<Longrightarrow> (\<And> i :: nat. a i \<in> sets M) \<Longrightarrow> UNION UNIV a \<in> sets M"
    15           \<Longrightarrow> (\<And> i :: nat. a i \<in> sets M) \<Longrightarrow> UNION UNIV a \<in> sets M"
    16   shows "dynkin M"
    16   shows "dynkin M"
    17 using assms unfolding dynkin_def sorry
    17 using assms by (auto simp: dynkin_def disjoint_family_on_def image_subset_iff)
    18 
    18 
    19 lemma dynkin_subset:
    19 lemma dynkin_subset:
    20   assumes "dynkin M"
    20   assumes "dynkin M"
    21   shows "\<And> A. A \<in> sets M \<Longrightarrow> A \<subseteq> space M"
    21   shows "\<And> A. A \<in> sets M \<Longrightarrow> A \<subseteq> space M"
    22 using assms unfolding dynkin_def by auto
    22 using assms unfolding dynkin_def by auto
    39 lemma dynkin_UN:
    39 lemma dynkin_UN:
    40   assumes "dynkin M"
    40   assumes "dynkin M"
    41   assumes "\<And> i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {}"
    41   assumes "\<And> i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {}"
    42   assumes "\<And> i :: nat. a i \<in> sets M"
    42   assumes "\<And> i :: nat. a i \<in> sets M"
    43   shows "UNION UNIV a \<in> sets M"
    43   shows "UNION UNIV a \<in> sets M"
    44 using assms unfolding dynkin_def sorry
    44 using assms by (auto simp: dynkin_def disjoint_family_on_def image_subset_iff)
    45 
    45 
    46 definition "Int_stable M \<longleftrightarrow> (\<forall> a \<in> sets M. \<forall> b \<in> sets M. a \<inter> b \<in> sets M)"
    46 definition "Int_stable M \<longleftrightarrow> (\<forall> a \<in> sets M. \<forall> b \<in> sets M. a \<inter> b \<in> sets M)"
    47 
    47 
    48 lemma dynkin_trivial:
    48 lemma dynkin_trivial:
    49   shows "dynkin \<lparr> space = A, sets = Pow A \<rparr>"
    49   shows "dynkin \<lparr> space = A, sets = Pow A \<rparr>"