equal
deleted
inserted
replaced
7 theory Hartog |
7 theory Hartog |
8 imports AC_Equiv |
8 imports AC_Equiv |
9 begin |
9 begin |
10 |
10 |
11 definition |
11 definition |
12 Hartog :: "i => i" where |
12 Hartog :: "i \<Rightarrow> i" where |
13 "Hartog(X) \<equiv> \<mu> i. \<not> i \<lesssim> X" |
13 "Hartog(X) \<equiv> \<mu> i. \<not> i \<lesssim> X" |
14 |
14 |
15 lemma Ords_in_set: "\<forall>a. Ord(a) \<longrightarrow> a \<in> X \<Longrightarrow> P" |
15 lemma Ords_in_set: "\<forall>a. Ord(a) \<longrightarrow> a \<in> X \<Longrightarrow> P" |
16 apply (rule_tac X = "{y \<in> X. Ord (y) }" in ON_class [elim_format]) |
16 apply (rule_tac X = "{y \<in> X. Ord (y) }" in ON_class [elim_format]) |
17 apply fast |
17 apply fast |
43 done |
43 done |
44 |
44 |
45 lemma Ords_lepoll_set_lemma: |
45 lemma Ords_lepoll_set_lemma: |
46 "(\<forall>a. Ord(a) \<longrightarrow> a \<lesssim> X) \<Longrightarrow> |
46 "(\<forall>a. Ord(a) \<longrightarrow> a \<lesssim> X) \<Longrightarrow> |
47 \<forall>a. Ord(a) \<longrightarrow> |
47 \<forall>a. Ord(a) \<longrightarrow> |
48 a \<in> {b. Z \<in> Pow(X)*Pow(X*X), \<exists>Y R. Z=<Y,R> \<and> ordertype(Y,R)=b}" |
48 a \<in> {b. Z \<in> Pow(X)*Pow(X*X), \<exists>Y R. Z=\<langle>Y,R\<rangle> \<and> ordertype(Y,R)=b}" |
49 apply (intro allI impI) |
49 apply (intro allI impI) |
50 apply (elim allE impE, assumption) |
50 apply (elim allE impE, assumption) |
51 apply (blast dest!: Ord_lepoll_imp_eq_ordertype intro: sym) |
51 apply (blast dest!: Ord_lepoll_imp_eq_ordertype intro: sym) |
52 done |
52 done |
53 |
53 |