equal
deleted
inserted
replaced
577 from \<open>x \<in> A\<close> have "A \<noteq> {}" by auto |
577 from \<open>x \<in> A\<close> have "A \<noteq> {}" by auto |
578 with assms show "Max A \<le> x" by simp |
578 with assms show "Max A \<le> x" by simp |
579 next |
579 next |
580 from assms show "x \<le> Max A" by simp |
580 from assms show "x \<le> Max A" by simp |
581 qed |
581 qed |
|
582 |
|
583 lemma eq_Min_iff: |
|
584 "\<lbrakk> finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> m = Min A \<longleftrightarrow> m \<in> A \<and> (\<forall>a \<in> A. m \<le> a)" |
|
585 by (meson Min_in Min_le antisym) |
|
586 |
|
587 lemma Min_eq_iff: |
|
588 "\<lbrakk> finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> Min A = m \<longleftrightarrow> m \<in> A \<and> (\<forall>a \<in> A. m \<le> a)" |
|
589 by (meson Min_in Min_le antisym) |
|
590 |
|
591 lemma eq_Max_iff: |
|
592 "\<lbrakk> finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> m = Max A \<longleftrightarrow> m \<in> A \<and> (\<forall>a \<in> A. a \<le> m)" |
|
593 by (meson Max_in Max_ge antisym) |
|
594 |
|
595 lemma Max_eq_iff: |
|
596 "\<lbrakk> finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> Max A = m \<longleftrightarrow> m \<in> A \<and> (\<forall>a \<in> A. a \<le> m)" |
|
597 by (meson Max_in Max_ge antisym) |
582 |
598 |
583 context |
599 context |
584 fixes A :: "'a set" |
600 fixes A :: "'a set" |
585 assumes fin_nonempty: "finite A" "A \<noteq> {}" |
601 assumes fin_nonempty: "finite A" "A \<noteq> {}" |
586 begin |
602 begin |