equal
deleted
inserted
replaced
392 have free: "freeultrafilter_axioms U" |
392 have free: "freeultrafilter_axioms U" |
393 proof (rule freeultrafilter_axioms.intro) |
393 proof (rule freeultrafilter_axioms.intro) |
394 fix A assume "A \<in> U" |
394 fix A assume "A \<in> U" |
395 with U show "infinite A" by (rule mem_superfrechet_all_infinite) |
395 with U show "infinite A" by (rule mem_superfrechet_all_infinite) |
396 qed |
396 qed |
397 from fil ultra free have "freeultrafilter U" |
397 show ?thesis |
398 by (rule freeultrafilter.intro [OF ultrafilter.intro]) |
398 proof |
399 (* FIXME: unfold_locales should use chained facts *) |
399 from fil ultra free show "freeultrafilter U" |
400 thus ?thesis .. |
400 by (rule freeultrafilter.intro [OF ultrafilter.intro]) |
|
401 (* FIXME: unfold_locales should use chained facts *) |
|
402 qed |
401 qed |
403 qed |
402 |
404 |
403 lemmas freeultrafilter_Ex = UFT.freeultrafilter_ex |
405 lemmas freeultrafilter_Ex = UFT.freeultrafilter_ex |
404 |
406 |
405 hide (open) const filter |
407 hide (open) const filter |