equal
deleted
inserted
replaced
124 apply (rule finite_range_approx_pd) |
124 apply (rule finite_range_approx_pd) |
125 apply (rule ex_approx_pd_eq) |
125 apply (rule ex_approx_pd_eq) |
126 apply (rule ideal_Rep_upper_pd) |
126 apply (rule ideal_Rep_upper_pd) |
127 apply (rule cont_Rep_upper_pd) |
127 apply (rule cont_Rep_upper_pd) |
128 apply (rule Rep_upper_principal) |
128 apply (rule Rep_upper_principal) |
129 apply (simp only: less_upper_pd_def less_set_def) |
129 apply (simp only: less_upper_pd_def less_set_eq) |
130 done |
130 done |
131 |
131 |
132 lemma upper_principal_less_iff [simp]: |
132 lemma upper_principal_less_iff [simp]: |
133 "(upper_principal t \<sqsubseteq> upper_principal u) = (t \<le>\<sharp> u)" |
133 "(upper_principal t \<sqsubseteq> upper_principal u) = (t \<le>\<sharp> u)" |
134 unfolding less_upper_pd_def Rep_upper_principal less_set_def |
134 unfolding less_upper_pd_def Rep_upper_principal less_set_eq |
135 by (fast intro: upper_le_refl elim: upper_le_trans) |
135 by (fast intro: upper_le_refl elim: upper_le_trans) |
136 |
136 |
137 lemma upper_principal_mono: |
137 lemma upper_principal_mono: |
138 "t \<le>\<sharp> u \<Longrightarrow> upper_principal t \<sqsubseteq> upper_principal u" |
138 "t \<le>\<sharp> u \<Longrightarrow> upper_principal t \<sqsubseteq> upper_principal u" |
139 by (rule upper_pd.principal_mono) |
139 by (rule upper_pd.principal_mono) |