src/ZF/Constructible/L_axioms.thy
author paulson
Tue, 10 Sep 2002 16:51:31 +0200
changeset 13564 1500a2e48d44
parent 13563 7d6c9817c432
child 13566 52a419210d5c
permissions -rw-r--r--
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
13505
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
     1
(*  Title:      ZF/Constructible/L_axioms.thy
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
     2
    ID:         $Id$
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
     4
    Copyright   2002  University of Cambridge
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
     5
*)
13429
wenzelm
parents: 13428
diff changeset
     6
wenzelm
parents: 13428
diff changeset
     7
header {* The ZF Axioms (Except Separation) in L *}
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
     8
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
     9
theory L_axioms = Formula + Relative + Reflection + MetaExists:
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    10
13564
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
    11
text {* The class L satisfies the premises of locale @{text M_trivial} *}
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    12
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    13
lemma transL: "[| y\<in>x; L(x) |] ==> L(y)"
13429
wenzelm
parents: 13428
diff changeset
    14
apply (insert Transset_Lset)
wenzelm
parents: 13428
diff changeset
    15
apply (simp add: Transset_def L_def, blast)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    16
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    17
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    18
lemma nonempty: "L(0)"
13429
wenzelm
parents: 13428
diff changeset
    19
apply (simp add: L_def)
wenzelm
parents: 13428
diff changeset
    20
apply (blast intro: zero_in_Lset)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    21
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    22
13563
paulson
parents: 13506
diff changeset
    23
theorem upair_ax: "upair_ax(L)"
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    24
apply (simp add: upair_ax_def upair_def, clarify)
13429
wenzelm
parents: 13428
diff changeset
    25
apply (rule_tac x="{x,y}" in rexI)
wenzelm
parents: 13428
diff changeset
    26
apply (simp_all add: doubleton_in_L)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    27
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    28
13563
paulson
parents: 13506
diff changeset
    29
theorem Union_ax: "Union_ax(L)"
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    30
apply (simp add: Union_ax_def big_union_def, clarify)
13429
wenzelm
parents: 13428
diff changeset
    31
apply (rule_tac x="Union(x)" in rexI)
wenzelm
parents: 13428
diff changeset
    32
apply (simp_all add: Union_in_L, auto)
wenzelm
parents: 13428
diff changeset
    33
apply (blast intro: transL)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    34
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    35
13563
paulson
parents: 13506
diff changeset
    36
theorem power_ax: "power_ax(L)"
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    37
apply (simp add: power_ax_def powerset_def Relative.subset_def, clarify)
13429
wenzelm
parents: 13428
diff changeset
    38
apply (rule_tac x="{y \<in> Pow(x). L(y)}" in rexI)
13299
3a932abf97e8 More use of relativized quantifiers
paulson
parents: 13298
diff changeset
    39
apply (simp_all add: LPow_in_L, auto)
13429
wenzelm
parents: 13428
diff changeset
    40
apply (blast intro: transL)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    41
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    42
13563
paulson
parents: 13506
diff changeset
    43
text{*We don't actually need @{term L} to satisfy the foundation axiom.*}
paulson
parents: 13506
diff changeset
    44
theorem foundation_ax: "foundation_ax(L)"
paulson
parents: 13506
diff changeset
    45
apply (simp add: foundation_ax_def)
paulson
parents: 13506
diff changeset
    46
apply (rule rallI) 
paulson
parents: 13506
diff changeset
    47
apply (cut_tac A=x in foundation)
paulson
parents: 13506
diff changeset
    48
apply (blast intro: transL)
paulson
parents: 13506
diff changeset
    49
done
paulson
parents: 13506
diff changeset
    50
13506
acc18a5d2b1a Various tweaks of the presentation
paulson
parents: 13505
diff changeset
    51
subsection{*For L to satisfy Replacement *}
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    52
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    53
(*Can't move these to Formula unless the definition of univalent is moved
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    54
there too!*)
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    55
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    56
lemma LReplace_in_Lset:
13429
wenzelm
parents: 13428
diff changeset
    57
     "[|X \<in> Lset(i); univalent(L,X,Q); Ord(i)|]
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    58
      ==> \<exists>j. Ord(j) & Replace(X, %x y. Q(x,y) & L(y)) \<subseteq> Lset(j)"
13429
wenzelm
parents: 13428
diff changeset
    59
apply (rule_tac x="\<Union>y \<in> Replace(X, %x y. Q(x,y) & L(y)). succ(lrank(y))"
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    60
       in exI)
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    61
apply simp
13429
wenzelm
parents: 13428
diff changeset
    62
apply clarify
wenzelm
parents: 13428
diff changeset
    63
apply (rule_tac a=x in UN_I)
wenzelm
parents: 13428
diff changeset
    64
 apply (simp_all add: Replace_iff univalent_def)
wenzelm
parents: 13428
diff changeset
    65
apply (blast dest: transL L_I)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    66
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    67
13429
wenzelm
parents: 13428
diff changeset
    68
lemma LReplace_in_L:
wenzelm
parents: 13428
diff changeset
    69
     "[|L(X); univalent(L,X,Q)|]
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    70
      ==> \<exists>Y. L(Y) & Replace(X, %x y. Q(x,y) & L(y)) \<subseteq> Y"
13429
wenzelm
parents: 13428
diff changeset
    71
apply (drule L_D, clarify)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    72
apply (drule LReplace_in_Lset, assumption+)
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    73
apply (blast intro: L_I Lset_in_Lset_succ)
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    74
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    75
13563
paulson
parents: 13506
diff changeset
    76
theorem replacement: "replacement(L,P)"
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    77
apply (simp add: replacement_def, clarify)
13429
wenzelm
parents: 13428
diff changeset
    78
apply (frule LReplace_in_L, assumption+, clarify)
wenzelm
parents: 13428
diff changeset
    79
apply (rule_tac x=Y in rexI)
wenzelm
parents: 13428
diff changeset
    80
apply (simp_all add: Replace_iff univalent_def, blast)
13223
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    81
done
45be08fbdcff new theory of inner models
paulson
parents:
diff changeset
    82
13564
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
    83
subsection{*Instantiating the locale @{text M_trivial}*}
13363
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
    84
text{*No instances of Separation yet.*}
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
    85
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
    86
lemma Lset_mono_le: "mono_le_subset(Lset)"
13429
wenzelm
parents: 13428
diff changeset
    87
by (simp add: mono_le_subset_def le_imp_subset Lset_mono)
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
    88
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
    89
lemma Lset_cont: "cont_Ord(Lset)"
13429
wenzelm
parents: 13428
diff changeset
    90
by (simp add: cont_Ord_def Limit_Lset_eq OUnion_def Limit_is_Ord)
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
    91
13428
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
    92
lemmas Pair_in_Lset = Formula.Pair_in_LLimit
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
    93
13428
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
    94
lemmas L_nat = Ord_in_L [OF Ord_nat]
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
    95
13564
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
    96
theorem M_trivial_L: "PROP M_trivial(L)"
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
    97
  apply (rule M_trivial.intro)
13428
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
    98
        apply (erule (1) transL)
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
    99
       apply (rule nonempty)
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
   100
      apply (rule upair_ax)
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
   101
     apply (rule Union_ax)
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
   102
    apply (rule power_ax)
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
   103
   apply (rule replacement)
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
   104
  apply (rule L_nat)
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
   105
  done
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   106
13564
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   107
lemmas rall_abs = M_trivial.rall_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   108
  and rex_abs = M_trivial.rex_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   109
  and ball_iff_equiv = M_trivial.ball_iff_equiv [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   110
  and M_equalityI = M_trivial.M_equalityI [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   111
  and empty_abs = M_trivial.empty_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   112
  and subset_abs = M_trivial.subset_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   113
  and upair_abs = M_trivial.upair_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   114
  and upair_in_M_iff = M_trivial.upair_in_M_iff [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   115
  and singleton_in_M_iff = M_trivial.singleton_in_M_iff [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   116
  and pair_abs = M_trivial.pair_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   117
  and pair_in_M_iff = M_trivial.pair_in_M_iff [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   118
  and pair_components_in_M = M_trivial.pair_components_in_M [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   119
  and cartprod_abs = M_trivial.cartprod_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   120
  and union_abs = M_trivial.union_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   121
  and inter_abs = M_trivial.inter_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   122
  and setdiff_abs = M_trivial.setdiff_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   123
  and Union_abs = M_trivial.Union_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   124
  and Union_closed = M_trivial.Union_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   125
  and Un_closed = M_trivial.Un_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   126
  and cons_closed = M_trivial.cons_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   127
  and successor_abs = M_trivial.successor_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   128
  and succ_in_M_iff = M_trivial.succ_in_M_iff [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   129
  and separation_closed = M_trivial.separation_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   130
  and strong_replacementI = M_trivial.strong_replacementI [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   131
  and strong_replacement_closed = M_trivial.strong_replacement_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   132
  and RepFun_closed = M_trivial.RepFun_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   133
  and lam_closed = M_trivial.lam_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   134
  and image_abs = M_trivial.image_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   135
  and powerset_Pow = M_trivial.powerset_Pow [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   136
  and powerset_imp_subset_Pow = M_trivial.powerset_imp_subset_Pow [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   137
  and nat_into_M = M_trivial.nat_into_M [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   138
  and nat_case_closed = M_trivial.nat_case_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   139
  and Inl_in_M_iff = M_trivial.Inl_in_M_iff [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   140
  and Inr_in_M_iff = M_trivial.Inr_in_M_iff [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   141
  and lt_closed = M_trivial.lt_closed [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   142
  and transitive_set_abs = M_trivial.transitive_set_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   143
  and ordinal_abs = M_trivial.ordinal_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   144
  and limit_ordinal_abs = M_trivial.limit_ordinal_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   145
  and successor_ordinal_abs = M_trivial.successor_ordinal_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   146
  and finite_ordinal_abs = M_trivial.finite_ordinal_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   147
  and omega_abs = M_trivial.omega_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   148
  and number1_abs = M_trivial.number1_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   149
  and number2_abs = M_trivial.number2_abs [OF M_trivial_L]
1500a2e48d44 renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents: 13563
diff changeset
   150
  and number3_abs = M_trivial.number3_abs [OF M_trivial_L]
13429
wenzelm
parents: 13428
diff changeset
   151
wenzelm
parents: 13428
diff changeset
   152
declare rall_abs [simp]
wenzelm
parents: 13428
diff changeset
   153
declare rex_abs [simp]
wenzelm
parents: 13428
diff changeset
   154
declare empty_abs [simp]
wenzelm
parents: 13428
diff changeset
   155
declare subset_abs [simp]
wenzelm
parents: 13428
diff changeset
   156
declare upair_abs [simp]
wenzelm
parents: 13428
diff changeset
   157
declare upair_in_M_iff [iff]
wenzelm
parents: 13428
diff changeset
   158
declare singleton_in_M_iff [iff]
wenzelm
parents: 13428
diff changeset
   159
declare pair_abs [simp]
wenzelm
parents: 13428
diff changeset
   160
declare pair_in_M_iff [iff]
wenzelm
parents: 13428
diff changeset
   161
declare cartprod_abs [simp]
wenzelm
parents: 13428
diff changeset
   162
declare union_abs [simp]
wenzelm
parents: 13428
diff changeset
   163
declare inter_abs [simp]
wenzelm
parents: 13428
diff changeset
   164
declare setdiff_abs [simp]
wenzelm
parents: 13428
diff changeset
   165
declare Union_abs [simp]
wenzelm
parents: 13428
diff changeset
   166
declare Union_closed [intro, simp]
wenzelm
parents: 13428
diff changeset
   167
declare Un_closed [intro, simp]
wenzelm
parents: 13428
diff changeset
   168
declare cons_closed [intro, simp]
wenzelm
parents: 13428
diff changeset
   169
declare successor_abs [simp]
wenzelm
parents: 13428
diff changeset
   170
declare succ_in_M_iff [iff]
wenzelm
parents: 13428
diff changeset
   171
declare separation_closed [intro, simp]
wenzelm
parents: 13428
diff changeset
   172
declare strong_replacementI
wenzelm
parents: 13428
diff changeset
   173
declare strong_replacement_closed [intro, simp]
wenzelm
parents: 13428
diff changeset
   174
declare RepFun_closed [intro, simp]
wenzelm
parents: 13428
diff changeset
   175
declare lam_closed [intro, simp]
wenzelm
parents: 13428
diff changeset
   176
declare image_abs [simp]
wenzelm
parents: 13428
diff changeset
   177
declare nat_into_M [intro]
wenzelm
parents: 13428
diff changeset
   178
declare Inl_in_M_iff [iff]
wenzelm
parents: 13428
diff changeset
   179
declare Inr_in_M_iff [iff]
wenzelm
parents: 13428
diff changeset
   180
declare transitive_set_abs [simp]
wenzelm
parents: 13428
diff changeset
   181
declare ordinal_abs [simp]
wenzelm
parents: 13428
diff changeset
   182
declare limit_ordinal_abs [simp]
wenzelm
parents: 13428
diff changeset
   183
declare successor_ordinal_abs [simp]
wenzelm
parents: 13428
diff changeset
   184
declare finite_ordinal_abs [simp]
wenzelm
parents: 13428
diff changeset
   185
declare omega_abs [simp]
wenzelm
parents: 13428
diff changeset
   186
declare number1_abs [simp]
wenzelm
parents: 13428
diff changeset
   187
declare number2_abs [simp]
wenzelm
parents: 13428
diff changeset
   188
declare number3_abs [simp]
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   189
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   190
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   191
subsection{*Instantiation of the locale @{text reflection}*}
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   192
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   193
text{*instances of locale constants*}
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   194
constdefs
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   195
  L_F0 :: "[i=>o,i] => i"
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   196
    "L_F0(P,y) == \<mu>b. (\<exists>z. L(z) \<and> P(<y,z>)) --> (\<exists>z\<in>Lset(b). P(<y,z>))"
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   197
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   198
  L_FF :: "[i=>o,i] => i"
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   199
    "L_FF(P)   == \<lambda>a. \<Union>y\<in>Lset(a). L_F0(P,y)"
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   200
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   201
  L_ClEx :: "[i=>o,i] => o"
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   202
    "L_ClEx(P) == \<lambda>a. Limit(a) \<and> normalize(L_FF(P),a) = a"
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   203
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   204
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   205
text{*We must use the meta-existential quantifier; otherwise the reflection
13429
wenzelm
parents: 13428
diff changeset
   206
      terms become enormous!*}
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   207
constdefs
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   208
  L_Reflects :: "[i=>o,[i,i]=>o] => prop"      ("(3REFLECTS/ [_,/ _])")
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   209
    "REFLECTS[P,Q] == (??Cl. Closed_Unbounded(Cl) &
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   210
                           (\<forall>a. Cl(a) --> (\<forall>x \<in> Lset(a). P(x) <-> Q(a,x))))"
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   211
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   212
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   213
theorem Triv_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   214
     "REFLECTS[P, \<lambda>a x. P(x)]"
13429
wenzelm
parents: 13428
diff changeset
   215
apply (simp add: L_Reflects_def)
wenzelm
parents: 13428
diff changeset
   216
apply (rule meta_exI)
wenzelm
parents: 13428
diff changeset
   217
apply (rule Closed_Unbounded_Ord)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   218
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   219
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   220
theorem Not_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   221
     "REFLECTS[P,Q] ==> REFLECTS[\<lambda>x. ~P(x), \<lambda>a x. ~Q(a,x)]"
13429
wenzelm
parents: 13428
diff changeset
   222
apply (unfold L_Reflects_def)
wenzelm
parents: 13428
diff changeset
   223
apply (erule meta_exE)
wenzelm
parents: 13428
diff changeset
   224
apply (rule_tac x=Cl in meta_exI, simp)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   225
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   226
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   227
theorem And_reflection:
13429
wenzelm
parents: 13428
diff changeset
   228
     "[| REFLECTS[P,Q]; REFLECTS[P',Q'] |]
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   229
      ==> REFLECTS[\<lambda>x. P(x) \<and> P'(x), \<lambda>a x. Q(a,x) \<and> Q'(a,x)]"
13429
wenzelm
parents: 13428
diff changeset
   230
apply (unfold L_Reflects_def)
wenzelm
parents: 13428
diff changeset
   231
apply (elim meta_exE)
wenzelm
parents: 13428
diff changeset
   232
apply (rule_tac x="\<lambda>a. Cl(a) \<and> Cla(a)" in meta_exI)
wenzelm
parents: 13428
diff changeset
   233
apply (simp add: Closed_Unbounded_Int, blast)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   234
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   235
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   236
theorem Or_reflection:
13429
wenzelm
parents: 13428
diff changeset
   237
     "[| REFLECTS[P,Q]; REFLECTS[P',Q'] |]
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   238
      ==> REFLECTS[\<lambda>x. P(x) \<or> P'(x), \<lambda>a x. Q(a,x) \<or> Q'(a,x)]"
13429
wenzelm
parents: 13428
diff changeset
   239
apply (unfold L_Reflects_def)
wenzelm
parents: 13428
diff changeset
   240
apply (elim meta_exE)
wenzelm
parents: 13428
diff changeset
   241
apply (rule_tac x="\<lambda>a. Cl(a) \<and> Cla(a)" in meta_exI)
wenzelm
parents: 13428
diff changeset
   242
apply (simp add: Closed_Unbounded_Int, blast)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   243
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   244
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   245
theorem Imp_reflection:
13429
wenzelm
parents: 13428
diff changeset
   246
     "[| REFLECTS[P,Q]; REFLECTS[P',Q'] |]
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   247
      ==> REFLECTS[\<lambda>x. P(x) --> P'(x), \<lambda>a x. Q(a,x) --> Q'(a,x)]"
13429
wenzelm
parents: 13428
diff changeset
   248
apply (unfold L_Reflects_def)
wenzelm
parents: 13428
diff changeset
   249
apply (elim meta_exE)
wenzelm
parents: 13428
diff changeset
   250
apply (rule_tac x="\<lambda>a. Cl(a) \<and> Cla(a)" in meta_exI)
wenzelm
parents: 13428
diff changeset
   251
apply (simp add: Closed_Unbounded_Int, blast)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   252
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   253
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   254
theorem Iff_reflection:
13429
wenzelm
parents: 13428
diff changeset
   255
     "[| REFLECTS[P,Q]; REFLECTS[P',Q'] |]
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   256
      ==> REFLECTS[\<lambda>x. P(x) <-> P'(x), \<lambda>a x. Q(a,x) <-> Q'(a,x)]"
13429
wenzelm
parents: 13428
diff changeset
   257
apply (unfold L_Reflects_def)
wenzelm
parents: 13428
diff changeset
   258
apply (elim meta_exE)
wenzelm
parents: 13428
diff changeset
   259
apply (rule_tac x="\<lambda>a. Cl(a) \<and> Cla(a)" in meta_exI)
wenzelm
parents: 13428
diff changeset
   260
apply (simp add: Closed_Unbounded_Int, blast)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   261
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   262
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   263
13434
78b93a667c01 better sats rules for higher-order operators
paulson
parents: 13429
diff changeset
   264
lemma reflection_Lset: "reflection(Lset)"
78b93a667c01 better sats rules for higher-order operators
paulson
parents: 13429
diff changeset
   265
apply (blast intro: reflection.intro Lset_mono_le Lset_cont Pair_in_Lset) +
78b93a667c01 better sats rules for higher-order operators
paulson
parents: 13429
diff changeset
   266
done
78b93a667c01 better sats rules for higher-order operators
paulson
parents: 13429
diff changeset
   267
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   268
theorem Ex_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   269
     "REFLECTS[\<lambda>x. P(fst(x),snd(x)), \<lambda>a x. Q(a,fst(x),snd(x))]
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   270
      ==> REFLECTS[\<lambda>x. \<exists>z. L(z) \<and> P(x,z), \<lambda>a x. \<exists>z\<in>Lset(a). Q(a,x,z)]"
13429
wenzelm
parents: 13428
diff changeset
   271
apply (unfold L_Reflects_def L_ClEx_def L_FF_def L_F0_def L_def)
wenzelm
parents: 13428
diff changeset
   272
apply (elim meta_exE)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   273
apply (rule meta_exI)
13434
78b93a667c01 better sats rules for higher-order operators
paulson
parents: 13429
diff changeset
   274
apply (erule reflection.Ex_reflection [OF reflection_Lset])
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   275
done
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   276
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   277
theorem All_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   278
     "REFLECTS[\<lambda>x. P(fst(x),snd(x)), \<lambda>a x. Q(a,fst(x),snd(x))]
13429
wenzelm
parents: 13428
diff changeset
   279
      ==> REFLECTS[\<lambda>x. \<forall>z. L(z) --> P(x,z), \<lambda>a x. \<forall>z\<in>Lset(a). Q(a,x,z)]"
wenzelm
parents: 13428
diff changeset
   280
apply (unfold L_Reflects_def L_ClEx_def L_FF_def L_F0_def L_def)
wenzelm
parents: 13428
diff changeset
   281
apply (elim meta_exE)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   282
apply (rule meta_exI)
13434
78b93a667c01 better sats rules for higher-order operators
paulson
parents: 13429
diff changeset
   283
apply (erule reflection.All_reflection [OF reflection_Lset])
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   284
done
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   285
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   286
theorem Rex_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   287
     "REFLECTS[ \<lambda>x. P(fst(x),snd(x)), \<lambda>a x. Q(a,fst(x),snd(x))]
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   288
      ==> REFLECTS[\<lambda>x. \<exists>z[L]. P(x,z), \<lambda>a x. \<exists>z\<in>Lset(a). Q(a,x,z)]"
13429
wenzelm
parents: 13428
diff changeset
   289
apply (unfold rex_def)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   290
apply (intro And_reflection Ex_reflection, assumption)
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   291
done
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   292
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   293
theorem Rall_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   294
     "REFLECTS[\<lambda>x. P(fst(x),snd(x)), \<lambda>a x. Q(a,fst(x),snd(x))]
13429
wenzelm
parents: 13428
diff changeset
   295
      ==> REFLECTS[\<lambda>x. \<forall>z[L]. P(x,z), \<lambda>a x. \<forall>z\<in>Lset(a). Q(a,x,z)]"
wenzelm
parents: 13428
diff changeset
   296
apply (unfold rall_def)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   297
apply (intro Imp_reflection All_reflection, assumption)
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   298
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   299
13440
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   300
text{*This version handles an alternative form of the bounded quantifier
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   301
      in the second argument of @{text REFLECTS}.*}
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   302
theorem Rex_reflection':
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   303
     "REFLECTS[ \<lambda>x. P(fst(x),snd(x)), \<lambda>a x. Q(a,fst(x),snd(x))]
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   304
      ==> REFLECTS[\<lambda>x. \<exists>z[L]. P(x,z), \<lambda>a x. \<exists>z[**Lset(a)]. Q(a,x,z)]"
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   305
apply (unfold setclass_def rex_def)
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   306
apply (erule Rex_reflection [unfolded rex_def Bex_def]) 
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   307
done
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   308
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   309
text{*As above.*}
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   310
theorem Rall_reflection':
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   311
     "REFLECTS[\<lambda>x. P(fst(x),snd(x)), \<lambda>a x. Q(a,fst(x),snd(x))]
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   312
      ==> REFLECTS[\<lambda>x. \<forall>z[L]. P(x,z), \<lambda>a x. \<forall>z[**Lset(a)]. Q(a,x,z)]"
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   313
apply (unfold setclass_def rall_def)
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   314
apply (erule Rall_reflection [unfolded rall_def Ball_def]) 
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   315
done
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   316
13429
wenzelm
parents: 13428
diff changeset
   317
lemmas FOL_reflections =
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   318
        Triv_reflection Not_reflection And_reflection Or_reflection
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   319
        Imp_reflection Iff_reflection Ex_reflection All_reflection
13440
cdde97e1db1c some progress towards "satisfies"
paulson
parents: 13434
diff changeset
   320
        Rex_reflection Rall_reflection Rex_reflection' Rall_reflection'
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   321
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   322
lemma ReflectsD:
13429
wenzelm
parents: 13428
diff changeset
   323
     "[|REFLECTS[P,Q]; Ord(i)|]
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   324
      ==> \<exists>j. i<j & (\<forall>x \<in> Lset(j). P(x) <-> Q(j,x))"
13429
wenzelm
parents: 13428
diff changeset
   325
apply (unfold L_Reflects_def Closed_Unbounded_def)
wenzelm
parents: 13428
diff changeset
   326
apply (elim meta_exE, clarify)
wenzelm
parents: 13428
diff changeset
   327
apply (blast dest!: UnboundedD)
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   328
done
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   329
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   330
lemma ReflectsE:
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   331
     "[| REFLECTS[P,Q]; Ord(i);
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   332
         !!j. [|i<j;  \<forall>x \<in> Lset(j). P(x) <-> Q(j,x)|] ==> R |]
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   333
      ==> R"
13429
wenzelm
parents: 13428
diff changeset
   334
apply (drule ReflectsD, assumption, blast)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   335
done
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   336
13428
99e52e78eb65 eliminate open locales and special ML code;
wenzelm
parents: 13418
diff changeset
   337
lemma Collect_mem_eq: "{x\<in>A. x\<in>B} = A \<inter> B"
13291
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   338
by blast
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   339
a73ab154f75c towards proving separation for L
paulson
parents: 13269
diff changeset
   340
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   341
subsection{*Internalized Formulas for some Set-Theoretic Concepts*}
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   342
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   343
lemmas setclass_simps = rall_setclass_is_ball rex_setclass_is_bex
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   344
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   345
subsubsection{*Some numbers to help write de Bruijn indices*}
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   346
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   347
syntax
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   348
    "3" :: i   ("3")
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   349
    "4" :: i   ("4")
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   350
    "5" :: i   ("5")
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   351
    "6" :: i   ("6")
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   352
    "7" :: i   ("7")
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   353
    "8" :: i   ("8")
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   354
    "9" :: i   ("9")
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   355
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   356
translations
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   357
   "3"  == "succ(2)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   358
   "4"  == "succ(3)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   359
   "5"  == "succ(4)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   360
   "6"  == "succ(5)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   361
   "7"  == "succ(6)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   362
   "8"  == "succ(7)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   363
   "9"  == "succ(8)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   364
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   365
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   366
subsubsection{*The Empty Set, Internalized*}
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   367
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   368
constdefs empty_fm :: "i=>i"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   369
    "empty_fm(x) == Forall(Neg(Member(0,succ(x))))"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   370
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   371
lemma empty_type [TC]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   372
     "x \<in> nat ==> empty_fm(x) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   373
by (simp add: empty_fm_def)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   374
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   375
lemma arity_empty_fm [simp]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   376
     "x \<in> nat ==> arity(empty_fm(x)) = succ(x)"
13429
wenzelm
parents: 13428
diff changeset
   377
by (simp add: empty_fm_def succ_Un_distrib [symmetric] Un_ac)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   378
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   379
lemma sats_empty_fm [simp]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   380
   "[| x \<in> nat; env \<in> list(A)|]
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   381
    ==> sats(A, empty_fm(x), env) <-> empty(**A, nth(x,env))"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   382
by (simp add: empty_fm_def empty_def)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   383
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   384
lemma empty_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   385
      "[| nth(i,env) = x; nth(j,env) = y;
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   386
          i \<in> nat; env \<in> list(A)|]
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   387
       ==> empty(**A, x) <-> sats(A, empty_fm(i), env)"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   388
by simp
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   389
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   390
theorem empty_reflection:
13429
wenzelm
parents: 13428
diff changeset
   391
     "REFLECTS[\<lambda>x. empty(L,f(x)),
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   392
               \<lambda>i x. empty(**Lset(i),f(x))]"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   393
apply (simp only: empty_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   394
apply (intro FOL_reflections)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   395
done
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   396
13385
31df66ca0780 Expressing Lset and L without using length and arity; simplifies Separation
paulson
parents: 13363
diff changeset
   397
text{*Not used.  But maybe useful?*}
31df66ca0780 Expressing Lset and L without using length and arity; simplifies Separation
paulson
parents: 13363
diff changeset
   398
lemma Transset_sats_empty_fm_eq_0:
31df66ca0780 Expressing Lset and L without using length and arity; simplifies Separation
paulson
parents: 13363
diff changeset
   399
   "[| n \<in> nat; env \<in> list(A); Transset(A)|]
31df66ca0780 Expressing Lset and L without using length and arity; simplifies Separation
paulson
parents: 13363
diff changeset
   400
    ==> sats(A, empty_fm(n), env) <-> nth(n,env) = 0"
31df66ca0780 Expressing Lset and L without using length and arity; simplifies Separation
paulson
parents: 13363
diff changeset
   401
apply (simp add: empty_fm_def empty_def Transset_def, auto)
13429
wenzelm
parents: 13428
diff changeset
   402
apply (case_tac "n < length(env)")
wenzelm
parents: 13428
diff changeset
   403
apply (frule nth_type, assumption+, blast)
wenzelm
parents: 13428
diff changeset
   404
apply (simp_all add: not_lt_iff_le nth_eq_0)
13385
31df66ca0780 Expressing Lset and L without using length and arity; simplifies Separation
paulson
parents: 13363
diff changeset
   405
done
31df66ca0780 Expressing Lset and L without using length and arity; simplifies Separation
paulson
parents: 13363
diff changeset
   406
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   407
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   408
subsubsection{*Unordered Pairs, Internalized*}
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   409
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   410
constdefs upair_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   411
    "upair_fm(x,y,z) ==
wenzelm
parents: 13428
diff changeset
   412
       And(Member(x,z),
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   413
           And(Member(y,z),
13429
wenzelm
parents: 13428
diff changeset
   414
               Forall(Implies(Member(0,succ(z)),
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   415
                              Or(Equal(0,succ(x)), Equal(0,succ(y)))))))"
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   416
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   417
lemma upair_type [TC]:
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   418
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> upair_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   419
by (simp add: upair_fm_def)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   420
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   421
lemma arity_upair_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   422
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   423
      ==> arity(upair_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
   424
by (simp add: upair_fm_def succ_Un_distrib [symmetric] Un_ac)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   425
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   426
lemma sats_upair_fm [simp]:
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   427
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   428
    ==> sats(A, upair_fm(x,y,z), env) <->
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   429
            upair(**A, nth(x,env), nth(y,env), nth(z,env))"
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   430
by (simp add: upair_fm_def upair_def)
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   431
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   432
lemma upair_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   433
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   434
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   435
       ==> upair(**A, x, y, z) <-> sats(A, upair_fm(i,j,k), env)"
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   436
by (simp add: sats_upair_fm)
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   437
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   438
text{*Useful? At least it refers to "real" unordered pairs*}
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   439
lemma sats_upair_fm2 [simp]:
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   440
   "[| x \<in> nat; y \<in> nat; z < length(env); env \<in> list(A); Transset(A)|]
13429
wenzelm
parents: 13428
diff changeset
   441
    ==> sats(A, upair_fm(x,y,z), env) <->
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   442
        nth(z,env) = {nth(x,env), nth(y,env)}"
13429
wenzelm
parents: 13428
diff changeset
   443
apply (frule lt_length_in_nat, assumption)
wenzelm
parents: 13428
diff changeset
   444
apply (simp add: upair_fm_def Transset_def, auto)
wenzelm
parents: 13428
diff changeset
   445
apply (blast intro: nth_type)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   446
done
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   447
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   448
theorem upair_reflection:
13429
wenzelm
parents: 13428
diff changeset
   449
     "REFLECTS[\<lambda>x. upair(L,f(x),g(x),h(x)),
wenzelm
parents: 13428
diff changeset
   450
               \<lambda>i x. upair(**Lset(i),f(x),g(x),h(x))]"
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   451
apply (simp add: upair_def)
13429
wenzelm
parents: 13428
diff changeset
   452
apply (intro FOL_reflections)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   453
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   454
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   455
subsubsection{*Ordered pairs, Internalized*}
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   456
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   457
constdefs pair_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   458
    "pair_fm(x,y,z) ==
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   459
       Exists(And(upair_fm(succ(x),succ(x),0),
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   460
              Exists(And(upair_fm(succ(succ(x)),succ(succ(y)),0),
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   461
                         upair_fm(1,0,succ(succ(z)))))))"
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   462
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   463
lemma pair_type [TC]:
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   464
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> pair_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   465
by (simp add: pair_fm_def)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   466
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   467
lemma arity_pair_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   468
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   469
      ==> arity(pair_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
   470
by (simp add: pair_fm_def succ_Un_distrib [symmetric] Un_ac)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   471
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   472
lemma sats_pair_fm [simp]:
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   473
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   474
    ==> sats(A, pair_fm(x,y,z), env) <->
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   475
        pair(**A, nth(x,env), nth(y,env), nth(z,env))"
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   476
by (simp add: pair_fm_def pair_def)
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   477
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   478
lemma pair_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   479
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   480
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   481
       ==> pair(**A, x, y, z) <-> sats(A, pair_fm(i,j,k), env)"
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   482
by (simp add: sats_pair_fm)
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   483
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   484
theorem pair_reflection:
13429
wenzelm
parents: 13428
diff changeset
   485
     "REFLECTS[\<lambda>x. pair(L,f(x),g(x),h(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   486
               \<lambda>i x. pair(**Lset(i),f(x),g(x),h(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   487
apply (simp only: pair_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   488
apply (intro FOL_reflections upair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   489
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   490
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   491
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   492
subsubsection{*Binary Unions, Internalized*}
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   493
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   494
constdefs union_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   495
    "union_fm(x,y,z) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   496
       Forall(Iff(Member(0,succ(z)),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   497
                  Or(Member(0,succ(x)),Member(0,succ(y)))))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   498
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   499
lemma union_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   500
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> union_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   501
by (simp add: union_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   502
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   503
lemma arity_union_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   504
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   505
      ==> arity(union_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
   506
by (simp add: union_fm_def succ_Un_distrib [symmetric] Un_ac)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   507
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   508
lemma sats_union_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   509
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   510
    ==> sats(A, union_fm(x,y,z), env) <->
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   511
        union(**A, nth(x,env), nth(y,env), nth(z,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   512
by (simp add: union_fm_def union_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   513
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   514
lemma union_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   515
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   516
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   517
       ==> union(**A, x, y, z) <-> sats(A, union_fm(i,j,k), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   518
by (simp add: sats_union_fm)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   519
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   520
theorem union_reflection:
13429
wenzelm
parents: 13428
diff changeset
   521
     "REFLECTS[\<lambda>x. union(L,f(x),g(x),h(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   522
               \<lambda>i x. union(**Lset(i),f(x),g(x),h(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   523
apply (simp only: union_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   524
apply (intro FOL_reflections)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   525
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   526
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   527
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   528
subsubsection{*Set ``Cons,'' Internalized*}
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   529
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   530
constdefs cons_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   531
    "cons_fm(x,y,z) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   532
       Exists(And(upair_fm(succ(x),succ(x),0),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   533
                  union_fm(0,succ(y),succ(z))))"
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   534
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   535
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   536
lemma cons_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   537
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> cons_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   538
by (simp add: cons_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   539
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   540
lemma arity_cons_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   541
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   542
      ==> arity(cons_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
   543
by (simp add: cons_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   544
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   545
lemma sats_cons_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   546
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   547
    ==> sats(A, cons_fm(x,y,z), env) <->
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   548
        is_cons(**A, nth(x,env), nth(y,env), nth(z,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   549
by (simp add: cons_fm_def is_cons_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   550
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   551
lemma cons_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   552
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   553
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   554
       ==> is_cons(**A, x, y, z) <-> sats(A, cons_fm(i,j,k), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   555
by simp
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   556
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   557
theorem cons_reflection:
13429
wenzelm
parents: 13428
diff changeset
   558
     "REFLECTS[\<lambda>x. is_cons(L,f(x),g(x),h(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   559
               \<lambda>i x. is_cons(**Lset(i),f(x),g(x),h(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   560
apply (simp only: is_cons_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   561
apply (intro FOL_reflections upair_reflection union_reflection)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   562
done
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   563
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   564
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   565
subsubsection{*Successor Function, Internalized*}
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   566
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   567
constdefs succ_fm :: "[i,i]=>i"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   568
    "succ_fm(x,y) == cons_fm(x,x,y)"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   569
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   570
lemma succ_type [TC]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   571
     "[| x \<in> nat; y \<in> nat |] ==> succ_fm(x,y) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   572
by (simp add: succ_fm_def)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   573
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   574
lemma arity_succ_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   575
     "[| x \<in> nat; y \<in> nat |]
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   576
      ==> arity(succ_fm(x,y)) = succ(x) \<union> succ(y)"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   577
by (simp add: succ_fm_def)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   578
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   579
lemma sats_succ_fm [simp]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   580
   "[| x \<in> nat; y \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   581
    ==> sats(A, succ_fm(x,y), env) <->
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   582
        successor(**A, nth(x,env), nth(y,env))"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   583
by (simp add: succ_fm_def successor_def)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   584
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   585
lemma successor_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   586
      "[| nth(i,env) = x; nth(j,env) = y;
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   587
          i \<in> nat; j \<in> nat; env \<in> list(A)|]
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   588
       ==> successor(**A, x, y) <-> sats(A, succ_fm(i,j), env)"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   589
by simp
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   590
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   591
theorem successor_reflection:
13429
wenzelm
parents: 13428
diff changeset
   592
     "REFLECTS[\<lambda>x. successor(L,f(x),g(x)),
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   593
               \<lambda>i x. successor(**Lset(i),f(x),g(x))]"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   594
apply (simp only: successor_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   595
apply (intro cons_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   596
done
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   597
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   598
13363
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   599
subsubsection{*The Number 1, Internalized*}
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   600
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   601
(* "number1(M,a) == (\<exists>x[M]. empty(M,x) & successor(M,x,a))" *)
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   602
constdefs number1_fm :: "i=>i"
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   603
    "number1_fm(a) == Exists(And(empty_fm(0), succ_fm(0,succ(a))))"
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   604
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   605
lemma number1_type [TC]:
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   606
     "x \<in> nat ==> number1_fm(x) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   607
by (simp add: number1_fm_def)
13363
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   608
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   609
lemma arity_number1_fm [simp]:
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   610
     "x \<in> nat ==> arity(number1_fm(x)) = succ(x)"
13429
wenzelm
parents: 13428
diff changeset
   611
by (simp add: number1_fm_def succ_Un_distrib [symmetric] Un_ac)
13363
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   612
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   613
lemma sats_number1_fm [simp]:
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   614
   "[| x \<in> nat; env \<in> list(A)|]
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   615
    ==> sats(A, number1_fm(x), env) <-> number1(**A, nth(x,env))"
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   616
by (simp add: number1_fm_def number1_def)
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   617
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   618
lemma number1_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   619
      "[| nth(i,env) = x; nth(j,env) = y;
13363
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   620
          i \<in> nat; env \<in> list(A)|]
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   621
       ==> number1(**A, x) <-> sats(A, number1_fm(i), env)"
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   622
by simp
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   623
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   624
theorem number1_reflection:
13429
wenzelm
parents: 13428
diff changeset
   625
     "REFLECTS[\<lambda>x. number1(L,f(x)),
13363
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   626
               \<lambda>i x. number1(**Lset(i),f(x))]"
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   627
apply (simp only: number1_def setclass_simps)
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   628
apply (intro FOL_reflections empty_reflection successor_reflection)
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   629
done
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   630
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
   631
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   632
subsubsection{*Big Union, Internalized*}
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   633
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   634
(*  "big_union(M,A,z) == \<forall>x[M]. x \<in> z <-> (\<exists>y[M]. y\<in>A & x \<in> y)" *)
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   635
constdefs big_union_fm :: "[i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   636
    "big_union_fm(A,z) ==
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   637
       Forall(Iff(Member(0,succ(z)),
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   638
                  Exists(And(Member(0,succ(succ(A))), Member(1,0)))))"
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   639
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   640
lemma big_union_type [TC]:
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   641
     "[| x \<in> nat; y \<in> nat |] ==> big_union_fm(x,y) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   642
by (simp add: big_union_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   643
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   644
lemma arity_big_union_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   645
     "[| x \<in> nat; y \<in> nat |]
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   646
      ==> arity(big_union_fm(x,y)) = succ(x) \<union> succ(y)"
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   647
by (simp add: big_union_fm_def succ_Un_distrib [symmetric] Un_ac)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   648
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   649
lemma sats_big_union_fm [simp]:
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   650
   "[| x \<in> nat; y \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   651
    ==> sats(A, big_union_fm(x,y), env) <->
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   652
        big_union(**A, nth(x,env), nth(y,env))"
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   653
by (simp add: big_union_fm_def big_union_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   654
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   655
lemma big_union_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   656
      "[| nth(i,env) = x; nth(j,env) = y;
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   657
          i \<in> nat; j \<in> nat; env \<in> list(A)|]
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   658
       ==> big_union(**A, x, y) <-> sats(A, big_union_fm(i,j), env)"
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   659
by simp
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   660
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   661
theorem big_union_reflection:
13429
wenzelm
parents: 13428
diff changeset
   662
     "REFLECTS[\<lambda>x. big_union(L,f(x),g(x)),
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   663
               \<lambda>i x. big_union(**Lset(i),f(x),g(x))]"
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   664
apply (simp only: big_union_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   665
apply (intro FOL_reflections)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   666
done
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   667
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   668
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   669
subsubsection{*Variants of Satisfaction Definitions for Ordinals, etc.*}
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   670
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   671
text{*Differs from the one in Formula by using "ordinal" rather than "Ord"*}
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   672
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   673
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   674
lemma sats_subset_fm':
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   675
   "[|x \<in> nat; y \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   676
    ==> sats(A, subset_fm(x,y), env) <-> subset(**A, nth(x,env), nth(y,env))"
wenzelm
parents: 13428
diff changeset
   677
by (simp add: subset_fm_def Relative.subset_def)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   678
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   679
theorem subset_reflection:
13429
wenzelm
parents: 13428
diff changeset
   680
     "REFLECTS[\<lambda>x. subset(L,f(x),g(x)),
wenzelm
parents: 13428
diff changeset
   681
               \<lambda>i x. subset(**Lset(i),f(x),g(x))]"
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   682
apply (simp only: Relative.subset_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   683
apply (intro FOL_reflections)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   684
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   685
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   686
lemma sats_transset_fm':
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   687
   "[|x \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   688
    ==> sats(A, transset_fm(x), env) <-> transitive_set(**A, nth(x,env))"
13429
wenzelm
parents: 13428
diff changeset
   689
by (simp add: sats_subset_fm' transset_fm_def transitive_set_def)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   690
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   691
theorem transitive_set_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   692
     "REFLECTS[\<lambda>x. transitive_set(L,f(x)),
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   693
               \<lambda>i x. transitive_set(**Lset(i),f(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   694
apply (simp only: transitive_set_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   695
apply (intro FOL_reflections subset_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   696
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   697
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   698
lemma sats_ordinal_fm':
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   699
   "[|x \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   700
    ==> sats(A, ordinal_fm(x), env) <-> ordinal(**A,nth(x,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   701
by (simp add: sats_transset_fm' ordinal_fm_def ordinal_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   702
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   703
lemma ordinal_iff_sats:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   704
      "[| nth(i,env) = x;  i \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   705
       ==> ordinal(**A, x) <-> sats(A, ordinal_fm(i), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   706
by (simp add: sats_ordinal_fm')
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   707
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   708
theorem ordinal_reflection:
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   709
     "REFLECTS[\<lambda>x. ordinal(L,f(x)), \<lambda>i x. ordinal(**Lset(i),f(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   710
apply (simp only: ordinal_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   711
apply (intro FOL_reflections transitive_set_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   712
done
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   713
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   714
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   715
subsubsection{*Membership Relation, Internalized*}
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   716
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   717
constdefs Memrel_fm :: "[i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   718
    "Memrel_fm(A,r) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   719
       Forall(Iff(Member(0,succ(r)),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   720
                  Exists(And(Member(0,succ(succ(A))),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   721
                             Exists(And(Member(0,succ(succ(succ(A)))),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   722
                                        And(Member(1,0),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   723
                                            pair_fm(1,0,2))))))))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   724
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   725
lemma Memrel_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   726
     "[| x \<in> nat; y \<in> nat |] ==> Memrel_fm(x,y) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   727
by (simp add: Memrel_fm_def)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   728
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   729
lemma arity_Memrel_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   730
     "[| x \<in> nat; y \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   731
      ==> arity(Memrel_fm(x,y)) = succ(x) \<union> succ(y)"
13429
wenzelm
parents: 13428
diff changeset
   732
by (simp add: Memrel_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   733
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   734
lemma sats_Memrel_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   735
   "[| x \<in> nat; y \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   736
    ==> sats(A, Memrel_fm(x,y), env) <->
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   737
        membership(**A, nth(x,env), nth(y,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   738
by (simp add: Memrel_fm_def membership_def)
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   739
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   740
lemma Memrel_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   741
      "[| nth(i,env) = x; nth(j,env) = y;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   742
          i \<in> nat; j \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   743
       ==> membership(**A, x, y) <-> sats(A, Memrel_fm(i,j), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   744
by simp
13304
43ef6c6dd906 more separation instances
paulson
parents: 13299
diff changeset
   745
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   746
theorem membership_reflection:
13429
wenzelm
parents: 13428
diff changeset
   747
     "REFLECTS[\<lambda>x. membership(L,f(x),g(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   748
               \<lambda>i x. membership(**Lset(i),f(x),g(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   749
apply (simp only: membership_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   750
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   751
done
13304
43ef6c6dd906 more separation instances
paulson
parents: 13299
diff changeset
   752
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   753
subsubsection{*Predecessor Set, Internalized*}
13304
43ef6c6dd906 more separation instances
paulson
parents: 13299
diff changeset
   754
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   755
constdefs pred_set_fm :: "[i,i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   756
    "pred_set_fm(A,x,r,B) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   757
       Forall(Iff(Member(0,succ(B)),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   758
                  Exists(And(Member(0,succ(succ(r))),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   759
                             And(Member(1,succ(succ(A))),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   760
                                 pair_fm(1,succ(succ(x)),0))))))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   761
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   762
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   763
lemma pred_set_type [TC]:
13429
wenzelm
parents: 13428
diff changeset
   764
     "[| A \<in> nat; x \<in> nat; r \<in> nat; B \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   765
      ==> pred_set_fm(A,x,r,B) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   766
by (simp add: pred_set_fm_def)
13304
43ef6c6dd906 more separation instances
paulson
parents: 13299
diff changeset
   767
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   768
lemma arity_pred_set_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   769
   "[| A \<in> nat; x \<in> nat; r \<in> nat; B \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   770
    ==> arity(pred_set_fm(A,x,r,B)) = succ(A) \<union> succ(x) \<union> succ(r) \<union> succ(B)"
13429
wenzelm
parents: 13428
diff changeset
   771
by (simp add: pred_set_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   772
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   773
lemma sats_pred_set_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   774
   "[| U \<in> nat; x \<in> nat; r \<in> nat; B \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   775
    ==> sats(A, pred_set_fm(U,x,r,B), env) <->
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   776
        pred_set(**A, nth(U,env), nth(x,env), nth(r,env), nth(B,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   777
by (simp add: pred_set_fm_def pred_set_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   778
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   779
lemma pred_set_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   780
      "[| nth(i,env) = U; nth(j,env) = x; nth(k,env) = r; nth(l,env) = B;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   781
          i \<in> nat; j \<in> nat; k \<in> nat; l \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   782
       ==> pred_set(**A,U,x,r,B) <-> sats(A, pred_set_fm(i,j,k,l), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   783
by (simp add: sats_pred_set_fm)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   784
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   785
theorem pred_set_reflection:
13429
wenzelm
parents: 13428
diff changeset
   786
     "REFLECTS[\<lambda>x. pred_set(L,f(x),g(x),h(x),b(x)),
wenzelm
parents: 13428
diff changeset
   787
               \<lambda>i x. pred_set(**Lset(i),f(x),g(x),h(x),b(x))]"
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   788
apply (simp only: pred_set_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   789
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   790
done
13304
43ef6c6dd906 more separation instances
paulson
parents: 13299
diff changeset
   791
43ef6c6dd906 more separation instances
paulson
parents: 13299
diff changeset
   792
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
   793
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   794
subsubsection{*Domain of a Relation, Internalized*}
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   795
13429
wenzelm
parents: 13428
diff changeset
   796
(* "is_domain(M,r,z) ==
wenzelm
parents: 13428
diff changeset
   797
        \<forall>x[M]. (x \<in> z <-> (\<exists>w[M]. w\<in>r & (\<exists>y[M]. pair(M,x,y,w))))" *)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   798
constdefs domain_fm :: "[i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   799
    "domain_fm(r,z) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   800
       Forall(Iff(Member(0,succ(z)),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   801
                  Exists(And(Member(0,succ(succ(r))),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   802
                             Exists(pair_fm(2,0,1))))))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   803
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   804
lemma domain_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   805
     "[| x \<in> nat; y \<in> nat |] ==> domain_fm(x,y) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   806
by (simp add: domain_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   807
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   808
lemma arity_domain_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   809
     "[| x \<in> nat; y \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   810
      ==> arity(domain_fm(x,y)) = succ(x) \<union> succ(y)"
13429
wenzelm
parents: 13428
diff changeset
   811
by (simp add: domain_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   812
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   813
lemma sats_domain_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   814
   "[| x \<in> nat; y \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   815
    ==> sats(A, domain_fm(x,y), env) <->
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   816
        is_domain(**A, nth(x,env), nth(y,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   817
by (simp add: domain_fm_def is_domain_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   818
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   819
lemma domain_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   820
      "[| nth(i,env) = x; nth(j,env) = y;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   821
          i \<in> nat; j \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   822
       ==> is_domain(**A, x, y) <-> sats(A, domain_fm(i,j), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   823
by simp
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   824
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   825
theorem domain_reflection:
13429
wenzelm
parents: 13428
diff changeset
   826
     "REFLECTS[\<lambda>x. is_domain(L,f(x),g(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   827
               \<lambda>i x. is_domain(**Lset(i),f(x),g(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   828
apply (simp only: is_domain_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   829
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   830
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   831
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   832
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   833
subsubsection{*Range of a Relation, Internalized*}
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   834
13429
wenzelm
parents: 13428
diff changeset
   835
(* "is_range(M,r,z) ==
wenzelm
parents: 13428
diff changeset
   836
        \<forall>y[M]. (y \<in> z <-> (\<exists>w[M]. w\<in>r & (\<exists>x[M]. pair(M,x,y,w))))" *)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   837
constdefs range_fm :: "[i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   838
    "range_fm(r,z) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   839
       Forall(Iff(Member(0,succ(z)),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   840
                  Exists(And(Member(0,succ(succ(r))),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   841
                             Exists(pair_fm(0,2,1))))))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   842
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   843
lemma range_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   844
     "[| x \<in> nat; y \<in> nat |] ==> range_fm(x,y) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   845
by (simp add: range_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   846
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   847
lemma arity_range_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   848
     "[| x \<in> nat; y \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   849
      ==> arity(range_fm(x,y)) = succ(x) \<union> succ(y)"
13429
wenzelm
parents: 13428
diff changeset
   850
by (simp add: range_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   851
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   852
lemma sats_range_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   853
   "[| x \<in> nat; y \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   854
    ==> sats(A, range_fm(x,y), env) <->
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   855
        is_range(**A, nth(x,env), nth(y,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   856
by (simp add: range_fm_def is_range_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   857
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   858
lemma range_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   859
      "[| nth(i,env) = x; nth(j,env) = y;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   860
          i \<in> nat; j \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   861
       ==> is_range(**A, x, y) <-> sats(A, range_fm(i,j), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   862
by simp
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   863
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   864
theorem range_reflection:
13429
wenzelm
parents: 13428
diff changeset
   865
     "REFLECTS[\<lambda>x. is_range(L,f(x),g(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   866
               \<lambda>i x. is_range(**Lset(i),f(x),g(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   867
apply (simp only: is_range_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   868
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   869
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   870
13429
wenzelm
parents: 13428
diff changeset
   871
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   872
subsubsection{*Field of a Relation, Internalized*}
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   873
13429
wenzelm
parents: 13428
diff changeset
   874
(* "is_field(M,r,z) ==
wenzelm
parents: 13428
diff changeset
   875
        \<exists>dr[M]. is_domain(M,r,dr) &
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   876
            (\<exists>rr[M]. is_range(M,r,rr) & union(M,dr,rr,z))" *)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   877
constdefs field_fm :: "[i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   878
    "field_fm(r,z) ==
wenzelm
parents: 13428
diff changeset
   879
       Exists(And(domain_fm(succ(r),0),
wenzelm
parents: 13428
diff changeset
   880
              Exists(And(range_fm(succ(succ(r)),0),
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   881
                         union_fm(1,0,succ(succ(z)))))))"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   882
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   883
lemma field_type [TC]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   884
     "[| x \<in> nat; y \<in> nat |] ==> field_fm(x,y) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   885
by (simp add: field_fm_def)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   886
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   887
lemma arity_field_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   888
     "[| x \<in> nat; y \<in> nat |]
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   889
      ==> arity(field_fm(x,y)) = succ(x) \<union> succ(y)"
13429
wenzelm
parents: 13428
diff changeset
   890
by (simp add: field_fm_def succ_Un_distrib [symmetric] Un_ac)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   891
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   892
lemma sats_field_fm [simp]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   893
   "[| x \<in> nat; y \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   894
    ==> sats(A, field_fm(x,y), env) <->
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   895
        is_field(**A, nth(x,env), nth(y,env))"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   896
by (simp add: field_fm_def is_field_def)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   897
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   898
lemma field_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   899
      "[| nth(i,env) = x; nth(j,env) = y;
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   900
          i \<in> nat; j \<in> nat; env \<in> list(A)|]
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   901
       ==> is_field(**A, x, y) <-> sats(A, field_fm(i,j), env)"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   902
by simp
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   903
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   904
theorem field_reflection:
13429
wenzelm
parents: 13428
diff changeset
   905
     "REFLECTS[\<lambda>x. is_field(L,f(x),g(x)),
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   906
               \<lambda>i x. is_field(**Lset(i),f(x),g(x))]"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   907
apply (simp only: is_field_def setclass_simps)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   908
apply (intro FOL_reflections domain_reflection range_reflection
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   909
             union_reflection)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   910
done
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   911
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   912
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
   913
subsubsection{*Image under a Relation, Internalized*}
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   914
13429
wenzelm
parents: 13428
diff changeset
   915
(* "image(M,r,A,z) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   916
        \<forall>y[M]. (y \<in> z <-> (\<exists>w[M]. w\<in>r & (\<exists>x[M]. x\<in>A & pair(M,x,y,w))))" *)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   917
constdefs image_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   918
    "image_fm(r,A,z) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   919
       Forall(Iff(Member(0,succ(z)),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   920
                  Exists(And(Member(0,succ(succ(r))),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   921
                             Exists(And(Member(0,succ(succ(succ(A)))),
13429
wenzelm
parents: 13428
diff changeset
   922
                                        pair_fm(0,2,1)))))))"
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   923
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   924
lemma image_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   925
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> image_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   926
by (simp add: image_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   927
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   928
lemma arity_image_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   929
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   930
      ==> arity(image_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
   931
by (simp add: image_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   932
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   933
lemma sats_image_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   934
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   935
    ==> sats(A, image_fm(x,y,z), env) <->
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   936
        image(**A, nth(x,env), nth(y,env), nth(z,env))"
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   937
by (simp add: image_fm_def Relative.image_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   938
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   939
lemma image_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   940
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   941
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   942
       ==> image(**A, x, y, z) <-> sats(A, image_fm(i,j,k), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   943
by (simp add: sats_image_fm)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   944
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   945
theorem image_reflection:
13429
wenzelm
parents: 13428
diff changeset
   946
     "REFLECTS[\<lambda>x. image(L,f(x),g(x),h(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   947
               \<lambda>i x. image(**Lset(i),f(x),g(x),h(x))]"
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
   948
apply (simp only: Relative.image_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   949
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
   950
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   951
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
   952
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   953
subsubsection{*Pre-Image under a Relation, Internalized*}
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   954
13429
wenzelm
parents: 13428
diff changeset
   955
(* "pre_image(M,r,A,z) ==
wenzelm
parents: 13428
diff changeset
   956
        \<forall>x[M]. x \<in> z <-> (\<exists>w[M]. w\<in>r & (\<exists>y[M]. y\<in>A & pair(M,x,y,w)))" *)
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   957
constdefs pre_image_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   958
    "pre_image_fm(r,A,z) ==
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   959
       Forall(Iff(Member(0,succ(z)),
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   960
                  Exists(And(Member(0,succ(succ(r))),
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   961
                             Exists(And(Member(0,succ(succ(succ(A)))),
13429
wenzelm
parents: 13428
diff changeset
   962
                                        pair_fm(2,0,1)))))))"
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   963
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   964
lemma pre_image_type [TC]:
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   965
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> pre_image_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
   966
by (simp add: pre_image_fm_def)
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   967
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   968
lemma arity_pre_image_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
   969
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   970
      ==> arity(pre_image_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
   971
by (simp add: pre_image_fm_def succ_Un_distrib [symmetric] Un_ac)
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   972
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   973
lemma sats_pre_image_fm [simp]:
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   974
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
   975
    ==> sats(A, pre_image_fm(x,y,z), env) <->
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   976
        pre_image(**A, nth(x,env), nth(y,env), nth(z,env))"
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   977
by (simp add: pre_image_fm_def Relative.pre_image_def)
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   978
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   979
lemma pre_image_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
   980
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   981
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   982
       ==> pre_image(**A, x, y, z) <-> sats(A, pre_image_fm(i,j,k), env)"
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   983
by (simp add: sats_pre_image_fm)
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   984
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   985
theorem pre_image_reflection:
13429
wenzelm
parents: 13428
diff changeset
   986
     "REFLECTS[\<lambda>x. pre_image(L,f(x),g(x),h(x)),
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   987
               \<lambda>i x. pre_image(**Lset(i),f(x),g(x),h(x))]"
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   988
apply (simp only: Relative.pre_image_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
   989
apply (intro FOL_reflections pair_reflection)
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   990
done
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   991
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
   992
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   993
subsubsection{*Function Application, Internalized*}
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   994
13429
wenzelm
parents: 13428
diff changeset
   995
(* "fun_apply(M,f,x,y) ==
wenzelm
parents: 13428
diff changeset
   996
        (\<exists>xs[M]. \<exists>fxs[M].
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   997
         upair(M,x,x,xs) & image(M,f,xs,fxs) & big_union(M,fxs,y))" *)
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
   998
constdefs fun_apply_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
   999
    "fun_apply_fm(f,x,y) ==
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1000
       Exists(Exists(And(upair_fm(succ(succ(x)), succ(succ(x)), 1),
13429
wenzelm
parents: 13428
diff changeset
  1001
                         And(image_fm(succ(succ(f)), 1, 0),
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1002
                             big_union_fm(0,succ(succ(y)))))))"
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1003
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1004
lemma fun_apply_type [TC]:
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1005
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> fun_apply_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
  1006
by (simp add: fun_apply_fm_def)
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1007
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1008
lemma arity_fun_apply_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
  1009
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1010
      ==> arity(fun_apply_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
  1011
by (simp add: fun_apply_fm_def succ_Un_distrib [symmetric] Un_ac)
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1012
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1013
lemma sats_fun_apply_fm [simp]:
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1014
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
  1015
    ==> sats(A, fun_apply_fm(x,y,z), env) <->
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1016
        fun_apply(**A, nth(x,env), nth(y,env), nth(z,env))"
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1017
by (simp add: fun_apply_fm_def fun_apply_def)
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1018
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1019
lemma fun_apply_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
  1020
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1021
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1022
       ==> fun_apply(**A, x, y, z) <-> sats(A, fun_apply_fm(i,j,k), env)"
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1023
by simp
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1024
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1025
theorem fun_apply_reflection:
13429
wenzelm
parents: 13428
diff changeset
  1026
     "REFLECTS[\<lambda>x. fun_apply(L,f(x),g(x),h(x)),
wenzelm
parents: 13428
diff changeset
  1027
               \<lambda>i x. fun_apply(**Lset(i),f(x),g(x),h(x))]"
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1028
apply (simp only: fun_apply_def setclass_simps)
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1029
apply (intro FOL_reflections upair_reflection image_reflection
13429
wenzelm
parents: 13428
diff changeset
  1030
             big_union_reflection)
13352
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1031
done
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1032
3cd767f8d78b new definitions of fun_apply and M_is_recfun
paulson
parents: 13348
diff changeset
  1033
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
  1034
subsubsection{*The Concept of Relation, Internalized*}
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1035
13429
wenzelm
parents: 13428
diff changeset
  1036
(* "is_relation(M,r) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1037
        (\<forall>z[M]. z\<in>r --> (\<exists>x[M]. \<exists>y[M]. pair(M,x,y,z)))" *)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1038
constdefs relation_fm :: "i=>i"
13429
wenzelm
parents: 13428
diff changeset
  1039
    "relation_fm(r) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1040
       Forall(Implies(Member(0,succ(r)), Exists(Exists(pair_fm(1,0,2)))))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1041
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1042
lemma relation_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1043
     "[| x \<in> nat |] ==> relation_fm(x) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
  1044
by (simp add: relation_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1045
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1046
lemma arity_relation_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1047
     "x \<in> nat ==> arity(relation_fm(x)) = succ(x)"
13429
wenzelm
parents: 13428
diff changeset
  1048
by (simp add: relation_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1049
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1050
lemma sats_relation_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1051
   "[| x \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1052
    ==> sats(A, relation_fm(x), env) <-> is_relation(**A, nth(x,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1053
by (simp add: relation_fm_def is_relation_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1054
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1055
lemma relation_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
  1056
      "[| nth(i,env) = x; nth(j,env) = y;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1057
          i \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1058
       ==> is_relation(**A, x) <-> sats(A, relation_fm(i), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1059
by simp
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1060
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1061
theorem is_relation_reflection:
13429
wenzelm
parents: 13428
diff changeset
  1062
     "REFLECTS[\<lambda>x. is_relation(L,f(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1063
               \<lambda>i x. is_relation(**Lset(i),f(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1064
apply (simp only: is_relation_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
  1065
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1066
done
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1067
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1068
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
  1069
subsubsection{*The Concept of Function, Internalized*}
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1070
13429
wenzelm
parents: 13428
diff changeset
  1071
(* "is_function(M,r) ==
wenzelm
parents: 13428
diff changeset
  1072
        \<forall>x[M]. \<forall>y[M]. \<forall>y'[M]. \<forall>p[M]. \<forall>p'[M].
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1073
           pair(M,x,y,p) --> pair(M,x,y',p') --> p\<in>r --> p'\<in>r --> y=y'" *)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1074
constdefs function_fm :: "i=>i"
13429
wenzelm
parents: 13428
diff changeset
  1075
    "function_fm(r) ==
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1076
       Forall(Forall(Forall(Forall(Forall(
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1077
         Implies(pair_fm(4,3,1),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1078
                 Implies(pair_fm(4,2,0),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1079
                         Implies(Member(1,r#+5),
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1080
                                 Implies(Member(0,r#+5), Equal(3,2))))))))))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1081
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1082
lemma function_type [TC]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1083
     "[| x \<in> nat |] ==> function_fm(x) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
  1084
by (simp add: function_fm_def)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1085
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1086
lemma arity_function_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1087
     "x \<in> nat ==> arity(function_fm(x)) = succ(x)"
13429
wenzelm
parents: 13428
diff changeset
  1088
by (simp add: function_fm_def succ_Un_distrib [symmetric] Un_ac)
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1089
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1090
lemma sats_function_fm [simp]:
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1091
   "[| x \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1092
    ==> sats(A, function_fm(x), env) <-> is_function(**A, nth(x,env))"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1093
by (simp add: function_fm_def is_function_def)
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1094
13505
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
  1095
lemma is_function_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
  1096
      "[| nth(i,env) = x; nth(j,env) = y;
13306
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1097
          i \<in> nat; env \<in> list(A)|]
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1098
       ==> is_function(**A, x) <-> sats(A, function_fm(i), env)"
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1099
by simp
6eebcddee32b more internalized formulas and separation proofs
paulson
parents: 13304
diff changeset
  1100
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1101
theorem is_function_reflection:
13429
wenzelm
parents: 13428
diff changeset
  1102
     "REFLECTS[\<lambda>x. is_function(L,f(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1103
               \<lambda>i x. is_function(**Lset(i),f(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1104
apply (simp only: is_function_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
  1105
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1106
done
13298
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
  1107
b4f370679c65 Constructible: some separation axioms
paulson
parents: 13291
diff changeset
  1108
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
  1109
subsubsection{*Typed Functions, Internalized*}
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1110
13429
wenzelm
parents: 13428
diff changeset
  1111
(* "typed_function(M,A,B,r) ==
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1112
        is_function(M,r) & is_relation(M,r) & is_domain(M,r,A) &
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1113
        (\<forall>u[M]. u\<in>r --> (\<forall>x[M]. \<forall>y[M]. pair(M,x,y,u) --> y\<in>B))" *)
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1114
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1115
constdefs typed_function_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
  1116
    "typed_function_fm(A,B,r) ==
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1117
       And(function_fm(r),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1118
         And(relation_fm(r),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1119
           And(domain_fm(r,A),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1120
             Forall(Implies(Member(0,succ(r)),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1121
                  Forall(Forall(Implies(pair_fm(1,0,2),Member(0,B#+3)))))))))"
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1122
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1123
lemma typed_function_type [TC]:
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1124
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> typed_function_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
  1125
by (simp add: typed_function_fm_def)
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1126
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1127
lemma arity_typed_function_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
  1128
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1129
      ==> arity(typed_function_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
  1130
by (simp add: typed_function_fm_def succ_Un_distrib [symmetric] Un_ac)
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1131
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1132
lemma sats_typed_function_fm [simp]:
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1133
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
  1134
    ==> sats(A, typed_function_fm(x,y,z), env) <->
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1135
        typed_function(**A, nth(x,env), nth(y,env), nth(z,env))"
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1136
by (simp add: typed_function_fm_def typed_function_def)
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1137
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1138
lemma typed_function_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
  1139
  "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1140
      i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1141
   ==> typed_function(**A, x, y, z) <-> sats(A, typed_function_fm(i,j,k), env)"
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1142
by simp
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1143
13429
wenzelm
parents: 13428
diff changeset
  1144
lemmas function_reflections =
13363
c26eeb000470 instantiation of locales M_trancl and M_wfrank;
paulson
parents: 13352
diff changeset
  1145
        empty_reflection number1_reflection
13429
wenzelm
parents: 13428
diff changeset
  1146
        upair_reflection pair_reflection union_reflection
wenzelm
parents: 13428
diff changeset
  1147
        big_union_reflection cons_reflection successor_reflection
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1148
        fun_apply_reflection subset_reflection
13429
wenzelm
parents: 13428
diff changeset
  1149
        transitive_set_reflection membership_reflection
wenzelm
parents: 13428
diff changeset
  1150
        pred_set_reflection domain_reflection range_reflection field_reflection
13348
374d05460db4 Separation/Replacement up to M_wfrank!
paulson
parents: 13339
diff changeset
  1151
        image_reflection pre_image_reflection
13429
wenzelm
parents: 13428
diff changeset
  1152
        is_relation_reflection is_function_reflection
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1153
13429
wenzelm
parents: 13428
diff changeset
  1154
lemmas function_iff_sats =
wenzelm
parents: 13428
diff changeset
  1155
        empty_iff_sats number1_iff_sats
wenzelm
parents: 13428
diff changeset
  1156
        upair_iff_sats pair_iff_sats union_iff_sats
13505
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
  1157
        big_union_iff_sats cons_iff_sats successor_iff_sats
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1158
        fun_apply_iff_sats  Memrel_iff_sats
13429
wenzelm
parents: 13428
diff changeset
  1159
        pred_set_iff_sats domain_iff_sats range_iff_sats field_iff_sats
wenzelm
parents: 13428
diff changeset
  1160
        image_iff_sats pre_image_iff_sats
13505
52a16cb7fefb Relativized right up to L satisfies V=L!
paulson
parents: 13496
diff changeset
  1161
        relation_iff_sats is_function_iff_sats
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1162
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1163
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1164
theorem typed_function_reflection:
13429
wenzelm
parents: 13428
diff changeset
  1165
     "REFLECTS[\<lambda>x. typed_function(L,f(x),g(x),h(x)),
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1166
               \<lambda>i x. typed_function(**Lset(i),f(x),g(x),h(x))]"
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1167
apply (simp only: typed_function_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
  1168
apply (intro FOL_reflections function_reflections)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1169
done
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1170
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1171
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
  1172
subsubsection{*Composition of Relations, Internalized*}
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1173
13429
wenzelm
parents: 13428
diff changeset
  1174
(* "composition(M,r,s,t) ==
wenzelm
parents: 13428
diff changeset
  1175
        \<forall>p[M]. p \<in> t <->
wenzelm
parents: 13428
diff changeset
  1176
               (\<exists>x[M]. \<exists>y[M]. \<exists>z[M]. \<exists>xy[M]. \<exists>yz[M].
wenzelm
parents: 13428
diff changeset
  1177
                pair(M,x,z,p) & pair(M,x,y,xy) & pair(M,y,z,yz) &
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1178
                xy \<in> s & yz \<in> r)" *)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1179
constdefs composition_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
  1180
  "composition_fm(r,s,t) ==
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1181
     Forall(Iff(Member(0,succ(t)),
13429
wenzelm
parents: 13428
diff changeset
  1182
             Exists(Exists(Exists(Exists(Exists(
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1183
              And(pair_fm(4,2,5),
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1184
               And(pair_fm(4,3,1),
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1185
                And(pair_fm(3,2,0),
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1186
                 And(Member(1,s#+6), Member(0,r#+6))))))))))))"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1187
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1188
lemma composition_type [TC]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1189
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> composition_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
  1190
by (simp add: composition_fm_def)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1191
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1192
lemma arity_composition_fm [simp]:
13429
wenzelm
parents: 13428
diff changeset
  1193
     "[| x \<in> nat; y \<in> nat; z \<in> nat |]
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1194
      ==> arity(composition_fm(x,y,z)) = succ(x) \<union> succ(y) \<union> succ(z)"
13429
wenzelm
parents: 13428
diff changeset
  1195
by (simp add: composition_fm_def succ_Un_distrib [symmetric] Un_ac)
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1196
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1197
lemma sats_composition_fm [simp]:
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1198
   "[| x \<in> nat; y \<in> nat; z \<in> nat; env \<in> list(A)|]
13429
wenzelm
parents: 13428
diff changeset
  1199
    ==> sats(A, composition_fm(x,y,z), env) <->
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1200
        composition(**A, nth(x,env), nth(y,env), nth(z,env))"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1201
by (simp add: composition_fm_def composition_def)
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1202
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1203
lemma composition_iff_sats:
13429
wenzelm
parents: 13428
diff changeset
  1204
      "[| nth(i,env) = x; nth(j,env) = y; nth(k,env) = z;
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1205
          i \<in> nat; j \<in> nat; k \<in> nat; env \<in> list(A)|]
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1206
       ==> composition(**A, x, y, z) <-> sats(A, composition_fm(i,j,k), env)"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1207
by simp
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1208
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1209
theorem composition_reflection:
13429
wenzelm
parents: 13428
diff changeset
  1210
     "REFLECTS[\<lambda>x. composition(L,f(x),g(x),h(x)),
13323
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1211
               \<lambda>i x. composition(**Lset(i),f(x),g(x),h(x))]"
2c287f50c9f3 More relativization, reflection and proofs of separation
paulson
parents: 13316
diff changeset
  1212
apply (simp only: composition_def setclass_simps)
13429
wenzelm
parents: 13428
diff changeset
  1213
apply (intro FOL_reflections pair_reflection)
13314
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1214
done
84b9de3cbc91 Defining a meta-existential quantifier.
paulson
parents: 13309
diff changeset
  1215
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1216
13339
0f89104dd377 Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents: 13323
diff changeset
  1217
subsubsection{*Injections, Internalized*}
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1218
13429
wenzelm
parents: 13428
diff changeset
  1219
(* "injection(M,A,B,f) ==
wenzelm
parents: 13428
diff changeset
  1220
        typed_function(M,A,B,f) &
wenzelm
parents: 13428
diff changeset
  1221
        (\<forall>x[M]. \<forall>x'[M]. \<forall>y[M]. \<forall>p[M]. \<forall>p'[M].
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1222
          pair(M,x,y,p) --> pair(M,x',y,p') --> p\<in>f --> p'\<in>f --> x=x')" *)
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1223
constdefs injection_fm :: "[i,i,i]=>i"
13429
wenzelm
parents: 13428
diff changeset
  1224
 "injection_fm(A,B,f) ==
13309
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1225
    And(typed_function_fm(A,B,f),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1226
       Forall(Forall(Forall(Forall(Forall(
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1227
         Implies(pair_fm(4,2,1),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1228
                 Implies(pair_fm(3,2,0),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1229
                         Implies(Member(1,f#+5),
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1230
                                 Implies(Member(0,f#+5), Equal(4,3)))))))))))"
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1231
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1232
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1233
lemma injection_type [TC]:
a6adee8ea75a reflection for more internal formulas
paulson
parents: 13306
diff changeset
  1234
     "[| x \<in> nat; y \<in> nat; z \<in> nat |] ==> injection_fm(x,y,z) \<in> formula"
13429
wenzelm
parents: 13428
diff changeset
  1235
by (simp add: injection_fm_def)
13309