equal
deleted
inserted
replaced
672 instance |
672 instance |
673 proof |
673 proof |
674 fix x :: finite_2 and A |
674 fix x :: finite_2 and A |
675 assume "x \<in> A" |
675 assume "x \<in> A" |
676 then show "\<Sqinter>A \<le> x" "x \<le> \<Squnion>A" |
676 then show "\<Sqinter>A \<le> x" "x \<le> \<Squnion>A" |
677 by(case_tac [!] x)(auto simp add: less_eq_finite_2_def less_finite_2_def Inf_finite_2_def Sup_finite_2_def) |
677 by(cases x; auto simp add: less_eq_finite_2_def less_finite_2_def Inf_finite_2_def Sup_finite_2_def)+ |
678 qed(auto simp add: less_eq_finite_2_def less_finite_2_def inf_finite_2_def sup_finite_2_def Inf_finite_2_def Sup_finite_2_def) |
678 qed(auto simp add: less_eq_finite_2_def less_finite_2_def inf_finite_2_def sup_finite_2_def Inf_finite_2_def Sup_finite_2_def) |
679 end |
679 end |
680 |
680 |
681 instance finite_2 :: complete_linorder .. |
681 instance finite_2 :: complete_linorder .. |
682 |
682 |