equal
deleted
inserted
replaced
174 assume "x \<notin> A" |
174 assume "x \<notin> A" |
175 with A show "A \<subseteq> F" by (simp add: subset_insert_iff) |
175 with A show "A \<subseteq> F" by (simp add: subset_insert_iff) |
176 qed |
176 qed |
177 qed |
177 qed |
178 qed |
178 qed |
|
179 |
|
180 lemma finite_Collect_subset: "finite A \<Longrightarrow> finite{x \<in> A. P x}" |
|
181 using finite_subset[of "{x \<in> A. P x}" "A"] by blast |
179 |
182 |
180 lemma finite_Un [iff]: "finite (F Un G) = (finite F & finite G)" |
183 lemma finite_Un [iff]: "finite (F Un G) = (finite F & finite G)" |
181 by (blast intro: finite_subset [of _ "X Un Y", standard] finite_UnI) |
184 by (blast intro: finite_subset [of _ "X Un Y", standard] finite_UnI) |
182 |
185 |
183 lemma finite_Int [simp, intro]: "finite F | finite G ==> finite (F Int G)" |
186 lemma finite_Int [simp, intro]: "finite F | finite G ==> finite (F Int G)" |