src/HOL/WF.ML
author berghofe
Tue, 30 May 2000 18:02:49 +0200
changeset 9001 93af64f54bf2
parent 8703 816d8f6513be
child 9108 9fff97d29837
permissions -rw-r--r--
the is now defined using primrec, avoiding explicit use of arbitrary.
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
     1
(*  Title:      HOL/wf.ML
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
     3
    Author:     Tobias Nipkow, with minor changes by Konrad Slind
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
     4
    Copyright   1992  University of Cambridge/1995 TU Munich
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
     6
Wellfoundedness, induction, and  recursion
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     7
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     8
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
     9
Goal "x = y ==> H x z = H y z";
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
    10
by (Asm_simp_tac 1);
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
    11
val H_cong2 = (*freeze H!*)
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
    12
	      read_instantiate [("H","H")] (result());
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    13
5579
32f99ca617b7 new: wfUNIVI
nipkow
parents: 5521
diff changeset
    14
val [prem] = Goalw [wf_def]
32f99ca617b7 new: wfUNIVI
nipkow
parents: 5521
diff changeset
    15
 "[| !!P x. [| !x. (!y. (y,x) : r --> P(y)) --> P(x) |] ==> P(x) |] ==> wf(r)";
32f99ca617b7 new: wfUNIVI
nipkow
parents: 5521
diff changeset
    16
by (Clarify_tac 1);
32f99ca617b7 new: wfUNIVI
nipkow
parents: 5521
diff changeset
    17
by (rtac prem 1);
32f99ca617b7 new: wfUNIVI
nipkow
parents: 5521
diff changeset
    18
by (assume_tac 1);
32f99ca617b7 new: wfUNIVI
nipkow
parents: 5521
diff changeset
    19
qed "wfUNIVI";
32f99ca617b7 new: wfUNIVI
nipkow
parents: 5521
diff changeset
    20
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    21
(*Restriction to domain A.  If r is well-founded over A then wf(r)*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    22
val [prem1,prem2] = Goalw [wf_def]
8703
816d8f6513be Times -> <*>
nipkow
parents: 8265
diff changeset
    23
 "[| r <= A <*> A;  \
972
e61b058d58d2 changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents: 950
diff changeset
    24
\    !!x P. [| ! x. (! y. (y,x) : r --> P(y)) --> P(x);  x:A |] ==> P(x) |]  \
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    25
\ ==>  wf(r)";
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
    26
by (blast_tac (claset() addSEs [prem1 RS subsetD RS SigmaE2] addIs [prem2]) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    27
qed "wfI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    28
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    29
val major::prems = Goalw [wf_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    30
    "[| wf(r);          \
972
e61b058d58d2 changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents: 950
diff changeset
    31
\       !!x.[| ! y. (y,x): r --> P(y) |] ==> P(x) \
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    32
\    |]  ==>  P(a)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    33
by (rtac (major RS spec RS mp RS spec) 1);
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
    34
by (blast_tac (claset() addIs prems) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    35
qed "wf_induct";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    36
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    37
(*Perform induction on i, then prove the wf(r) subgoal using prems. *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    38
fun wf_ind_tac a prems i = 
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    39
    EVERY [res_inst_tac [("a",a)] wf_induct i,
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
    40
           rename_last_tac a ["1"] (i+1),
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
    41
           ares_tac prems i];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    42
5452
b38332431a8c New theorem wf_not_sym and well-formed wf_asym
paulson
parents: 5337
diff changeset
    43
Goal "wf(r) ==> ! x. (a,x):r --> (x,a)~:r";
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    44
by (wf_ind_tac "a" [] 1);
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2637
diff changeset
    45
by (Blast_tac 1);
5452
b38332431a8c New theorem wf_not_sym and well-formed wf_asym
paulson
parents: 5337
diff changeset
    46
qed_spec_mp "wf_not_sym";
b38332431a8c New theorem wf_not_sym and well-formed wf_asym
paulson
parents: 5337
diff changeset
    47
b38332431a8c New theorem wf_not_sym and well-formed wf_asym
paulson
parents: 5337
diff changeset
    48
(* [| wf(r);  (a,x):r;  ~P ==> (x,a):r |] ==> P *)
b38332431a8c New theorem wf_not_sym and well-formed wf_asym
paulson
parents: 5337
diff changeset
    49
bind_thm ("wf_asym", wf_not_sym RS swap);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    50
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    51
Goal "[| wf(r);  (a,a): r |] ==> P";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    52
by (blast_tac (claset() addEs [wf_asym]) 1);
1618
372880456b5b Library changes for mutilated checkerboard
paulson
parents: 1552
diff changeset
    53
qed "wf_irrefl";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    54
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
    55
(*transitive closure of a wf relation is wf! *)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    56
Goal "wf(r) ==> wf(r^+)";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    57
by (stac wf_def 1);
3708
56facaebf3e3 Changed some proofs to use Clarify_tac
paulson
parents: 3457
diff changeset
    58
by (Clarify_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    59
(*must retain the universal formula for later use!*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    60
by (rtac allE 1 THEN assume_tac 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    61
by (etac mp 1);
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    62
by (eres_inst_tac [("a","x")] wf_induct 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
    63
by (blast_tac (claset() addEs [tranclE]) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    64
qed "wf_trancl";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    65
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    66
4762
afebaa81f148 added wf_converse_trancl, adapted proof of wfrec
oheimb
parents: 4750
diff changeset
    67
val wf_converse_trancl = prove_goal thy 
afebaa81f148 added wf_converse_trancl, adapted proof of wfrec
oheimb
parents: 4750
diff changeset
    68
"!!X. wf (r^-1) ==> wf ((r^+)^-1)" (K [
afebaa81f148 added wf_converse_trancl, adapted proof of wfrec
oheimb
parents: 4750
diff changeset
    69
	stac (trancl_converse RS sym) 1,
afebaa81f148 added wf_converse_trancl, adapted proof of wfrec
oheimb
parents: 4750
diff changeset
    70
	etac wf_trancl 1]);
afebaa81f148 added wf_converse_trancl, adapted proof of wfrec
oheimb
parents: 4750
diff changeset
    71
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    72
(*----------------------------------------------------------------------------
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    73
 * Minimal-element characterization of well-foundedness
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    74
 *---------------------------------------------------------------------------*)
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    75
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    76
Goalw [wf_def] "wf r ==> x:Q --> (? z:Q. ! y. (y,z):r --> y~:Q)";
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
    77
by (dtac spec 1);
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    78
by (etac (mp RS spec) 1);
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    79
by (Blast_tac 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    80
val lemma1 = result();
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    81
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
    82
Goalw [wf_def] "(! Q x. x:Q --> (? z:Q. ! y. (y,z):r --> y~:Q)) ==> wf r";
3708
56facaebf3e3 Changed some proofs to use Clarify_tac
paulson
parents: 3457
diff changeset
    83
by (Clarify_tac 1);
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    84
by (dres_inst_tac [("x", "{x. ~ P x}")] spec 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    85
by (Blast_tac 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    86
val lemma2 = result();
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    87
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
    88
Goal "wf r = (! Q x. x:Q --> (? z:Q. ! y. (y,z):r --> y~:Q))";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
    89
by (blast_tac (claset() addSIs [lemma1, lemma2]) 1);
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    90
qed "wf_eq_minimal";
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
    91
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
    92
(*---------------------------------------------------------------------------
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
    93
 * Wellfoundedness of subsets
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
    94
 *---------------------------------------------------------------------------*)
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
    95
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5132
diff changeset
    96
Goal "[| wf(r);  p<=r |] ==> wf(p)";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
    97
by (full_simp_tac (simpset() addsimps [wf_eq_minimal]) 1);
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
    98
by (Fast_tac 1);
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
    99
qed "wf_subset";
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   100
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   101
(*---------------------------------------------------------------------------
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   102
 * Wellfoundedness of the empty relation.
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   103
 *---------------------------------------------------------------------------*)
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   104
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
   105
Goal "wf({})";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   106
by (simp_tac (simpset() addsimps [wf_def]) 1);
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   107
qed "wf_empty";
5281
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   108
AddIffs [wf_empty];
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   109
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   110
(*---------------------------------------------------------------------------
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   111
 * Wellfoundedness of `insert'
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   112
 *---------------------------------------------------------------------------*)
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   113
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
   114
Goal "wf(insert (y,x) r) = (wf(r) & (x,y) ~: r^*)";
3457
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   115
by (rtac iffI 1);
4350
1983e4054fd8 updated for latest Blast_tac, which treats equality differently
paulson
parents: 4153
diff changeset
   116
 by (blast_tac (claset() addEs [wf_trancl RS wf_irrefl] 
1983e4054fd8 updated for latest Blast_tac, which treats equality differently
paulson
parents: 4153
diff changeset
   117
	addIs [rtrancl_into_trancl1,wf_subset,impOfSubs rtrancl_mono]) 1);
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   118
by (asm_full_simp_tac (simpset() addsimps [wf_eq_minimal]) 1);
4153
e534c4c32d54 Ran expandshort, especially to introduce Safe_tac
paulson
parents: 4089
diff changeset
   119
by Safe_tac;
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   120
by (EVERY1[rtac allE, assume_tac, etac impE, Blast_tac]);
3457
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   121
by (etac bexE 1);
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   122
by (rename_tac "a" 1);
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   123
by (case_tac "a = x" 1);
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   124
 by (res_inst_tac [("x","a")]bexI 2);
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   125
  by (assume_tac 3);
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   126
 by (Blast_tac 2);
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   127
by (case_tac "y:Q" 1);
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   128
 by (Blast_tac 2);
4059
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3919
diff changeset
   129
by (res_inst_tac [("x","{z. z:Q & (z,y) : r^*}")] allE 1);
3457
a8ab7c64817c Ran expandshort
paulson
parents: 3439
diff changeset
   130
 by (assume_tac 1);
4059
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3919
diff changeset
   131
by (thin_tac "! Q. (? x. x : Q) --> ?P Q" 1);	(*essential for speed*)
4350
1983e4054fd8 updated for latest Blast_tac, which treats equality differently
paulson
parents: 4153
diff changeset
   132
(*Blast_tac with new substOccur fails*)
1983e4054fd8 updated for latest Blast_tac, which treats equality differently
paulson
parents: 4153
diff changeset
   133
by (best_tac (claset() addIs [rtrancl_into_rtrancl2]) 1);
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   134
qed "wf_insert";
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   135
AddIffs [wf_insert];
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   136
5281
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   137
(*---------------------------------------------------------------------------
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   138
 * Wellfoundedness of `disjoint union'
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   139
 *---------------------------------------------------------------------------*)
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   140
5330
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   141
(*Intuition behind this proof for the case of binary union:
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   142
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   143
  Goal: find an (R u S)-min element of a nonempty subset A.
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   144
  by case distinction:
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   145
  1. There is a step a -R-> b with a,b : A.
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   146
     Pick an R-min element z of the (nonempty) set {a:A | EX b:A. a -R-> b}.
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   147
     By definition, there is z':A s.t. z -R-> z'. Because z is R-min in the
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   148
     subset, z' must be R-min in A. Because z' has an R-predecessor, it cannot
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   149
     have an S-successor and is thus S-min in A as well.
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   150
  2. There is no such step.
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   151
     Pick an S-min element of A. In this case it must be an R-min
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   152
     element of A as well.
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   153
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   154
*)
8c9fadda81f4 added comment
paulson
parents: 5318
diff changeset
   155
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   156
Goal "[| !i:I. wf(r i); \
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   157
\        !i:I.!j:I. r i ~= r j --> Domain(r i) Int Range(r j) = {} & \
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   158
\                                  Domain(r j) Int Range(r i) = {} \
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   159
\     |] ==> wf(UN i:I. r i)";
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   160
by (asm_full_simp_tac (HOL_basic_ss addsimps [wf_eq_minimal]) 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   161
by (Clarify_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   162
by (rename_tac "A a" 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   163
by (case_tac "? i:I. ? a:A. ? b:A. (b,a) : r i" 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   164
 by (Clarify_tac 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   165
 by (EVERY1[dtac bspec, assume_tac,
5281
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   166
           eres_inst_tac[("x","{a. a:A & (? b:A. (b,a) : r i)}")]allE]);
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   167
 by (EVERY1[etac allE,etac impE]);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   168
  by (Blast_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   169
 by (Clarify_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   170
 by (rename_tac "z'" 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   171
 by (res_inst_tac [("x","z'")] bexI 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   172
  by (assume_tac 2);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   173
 by (Clarify_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   174
 by (rename_tac "j" 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   175
 by (case_tac "r j = r i" 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   176
  by (EVERY1[etac allE,etac impE,assume_tac]);
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   177
  by (Asm_full_simp_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   178
  by (Blast_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   179
 by (blast_tac (claset() addEs [equalityE]) 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   180
by (Asm_full_simp_tac 1);
5521
7970832271cc added wrapper for bspec
oheimb
parents: 5452
diff changeset
   181
by (fast_tac (claset() delWrapper "bspec") 1); (*faster than Blast_tac*)
5281
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   182
qed "wf_UN";
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   183
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   184
Goalw [Union_def]
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   185
 "[| !r:R. wf r; \
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   186
\    !r:R.!s:R. r ~= s --> Domain r Int Range s = {} & \
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   187
\                          Domain s Int Range r = {} \
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   188
\ |] ==> wf(Union R)";
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   189
by (rtac wf_UN 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   190
by (Blast_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   191
by (Blast_tac 1);
5281
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   192
qed "wf_Union";
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   193
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   194
Goal "[| wf r; wf s; Domain r Int Range s = {}; Domain s Int Range r = {} \
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   195
\     |] ==> wf(r Un s)";
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   196
by (rtac (simplify (simpset()) (read_instantiate[("R","{r,s}")]wf_Union)) 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   197
by (Blast_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   198
by (Blast_tac 1);
5281
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   199
qed "wf_Un";
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   200
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   201
(*---------------------------------------------------------------------------
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   202
 * Wellfoundedness of `image'
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   203
 *---------------------------------------------------------------------------*)
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   204
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   205
Goal "[| wf r; inj f |] ==> wf(prod_fun f f `` r)";
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   206
by (asm_full_simp_tac (HOL_basic_ss addsimps [wf_eq_minimal]) 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   207
by (Clarify_tac 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   208
by (case_tac "? p. f p : Q" 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   209
by (eres_inst_tac [("x","{p. f p : Q}")]allE 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   210
by (fast_tac (claset() addDs [injD]) 1);
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   211
by (Blast_tac 1);
5281
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   212
qed "wf_prod_fun_image";
f4d16517b360 List now contains some lexicographic orderings.
nipkow
parents: 5278
diff changeset
   213
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   214
(*** acyclic ***)
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   215
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   216
Goalw [acyclic_def] "!x. (x, x) ~: r^+ ==> acyclic r";
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   217
by (assume_tac 1);
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   218
qed "acyclicI";
4750
f83cd6a06676 added acyclicI
oheimb
parents: 4746
diff changeset
   219
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   220
Goalw [acyclic_def] "wf r ==> acyclic r";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   221
by (blast_tac (claset() addEs [wf_trancl RS wf_irrefl]) 1);
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   222
qed "wf_acyclic";
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   223
5452
b38332431a8c New theorem wf_not_sym and well-formed wf_asym
paulson
parents: 5337
diff changeset
   224
Goalw [acyclic_def] "acyclic(insert (y,x) r) = (acyclic r & (x,y) ~: r^*)";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   225
by (simp_tac (simpset() addsimps [trancl_insert]) 1);
5452
b38332431a8c New theorem wf_not_sym and well-formed wf_asym
paulson
parents: 5337
diff changeset
   226
by (blast_tac (claset() addIs [rtrancl_trans]) 1);
3413
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   227
qed "acyclic_insert";
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   228
AddIffs [acyclic_insert];
c1f63cc3a768 Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents: 3320
diff changeset
   229
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
   230
Goalw [acyclic_def] "acyclic(r^-1) = acyclic r";
4746
a5dcd7e4a37d inverse -> converse
paulson
parents: 4686
diff changeset
   231
by (simp_tac (simpset() addsimps [trancl_converse]) 1);
a5dcd7e4a37d inverse -> converse
paulson
parents: 4686
diff changeset
   232
qed "acyclic_converse";
8265
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   233
AddIffs [acyclic_converse];
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   234
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   235
Goalw [acyclic_def,antisym_def] "acyclic r ==> antisym(r^*)";
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   236
by(blast_tac (claset() addEs [rtranclE]
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   237
     addIs [rtrancl_into_trancl1,rtrancl_trancl_trancl]) 1);
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   238
qed "acyclic_impl_antisym_rtrancl";
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   239
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   240
(* Other direction:
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   241
acyclic = no loops
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   242
antisym = only self loops
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   243
Goalw [acyclic_def,antisym_def] "antisym(r^* ) ==> acyclic(r - Id)";
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   244
==> "antisym(r^* ) = acyclic(r - Id)";
187cada50e19 A few lemmas and some Adds.
nipkow
parents: 7570
diff changeset
   245
*)
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   246
6433
228237ec56e5 Added new thms.
nipkow
parents: 5579
diff changeset
   247
Goalw [acyclic_def] "[| acyclic s; r <= s |] ==> acyclic r";
6814
d96d4977f94e expandshort
paulson
parents: 6433
diff changeset
   248
by (blast_tac (claset() addIs [trancl_mono]) 1);
6433
228237ec56e5 Added new thms.
nipkow
parents: 5579
diff changeset
   249
qed "acyclic_subset";
228237ec56e5 Added new thms.
nipkow
parents: 5579
diff changeset
   250
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   251
(** cut **)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   252
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   253
(*This rewrite rule works upon formulae; thus it requires explicit use of
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   254
  H_cong to expose the equality*)
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   255
Goalw [cut_def] "(cut f r x = cut g r x) = (!y. (y,x):r --> f(y)=g(y))";
4686
74a12e86b20b Removed `addsplits [expand_if]'
nipkow
parents: 4350
diff changeset
   256
by (simp_tac (HOL_ss addsimps [expand_fun_eq]) 1);
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   257
qed "cuts_eq";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   258
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5132
diff changeset
   259
Goalw [cut_def] "(x,a):r ==> (cut f r a)(x) = f(x)";
1552
6f71b5d46700 Ran expandshort
paulson
parents: 1485
diff changeset
   260
by (asm_simp_tac HOL_ss 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   261
qed "cut_apply";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   262
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   263
(*** is_recfun ***)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   264
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
   265
Goalw [is_recfun_def,cut_def]
5148
74919e8f221c More tidying and removal of "\!\!... from Goal commands
paulson
parents: 5143
diff changeset
   266
    "[| is_recfun r H a f;  ~(b,a):r |] ==> f(b) = arbitrary";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   267
by (etac ssubst 1);
1552
6f71b5d46700 Ran expandshort
paulson
parents: 1485
diff changeset
   268
by (asm_simp_tac HOL_ss 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   269
qed "is_recfun_undef";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   270
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   271
(*** NOTE! some simplifications need a different Solver!! ***)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   272
fun indhyp_tac hyps =
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   273
    (cut_facts_tac hyps THEN'
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   274
       DEPTH_SOLVE_1 o (ares_tac [TrueI] ORELSE'
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
   275
                        eresolve_tac [transD, mp, allE]));
7570
a9391550eea1 Mod because of new solver interface.
nipkow
parents: 7499
diff changeset
   276
val wf_super_ss = HOL_ss addSolver (mk_solver "WF" indhyp_tac);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   277
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   278
Goalw [is_recfun_def,cut_def]
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   279
    "[| wf(r);  trans(r);  is_recfun r H a f;  is_recfun r H b g |] ==> \
972
e61b058d58d2 changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents: 950
diff changeset
   280
    \ (x,a):r --> (x,b):r --> f(x)=g(x)";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   281
by (etac wf_induct 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   282
by (REPEAT (rtac impI 1 ORELSE etac ssubst 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   283
by (asm_simp_tac (wf_super_ss addcongs [if_cong]) 1);
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1475
diff changeset
   284
qed_spec_mp "is_recfun_equal";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   285
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   286
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   287
val prems as [wfr,transr,recfa,recgb,_] = goalw WF.thy [cut_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   288
    "[| wf(r);  trans(r); \
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   289
\       is_recfun r H a f;  is_recfun r H b g;  (b,a):r |] ==> \
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   290
\    cut f r b = g";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   291
val gundef = recgb RS is_recfun_undef
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   292
and fisg   = recgb RS (recfa RS (transr RS (wfr RS is_recfun_equal)));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   293
by (cut_facts_tac prems 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   294
by (rtac ext 1);
4686
74a12e86b20b Removed `addsplits [expand_if]'
nipkow
parents: 4350
diff changeset
   295
by (asm_simp_tac (wf_super_ss addsimps [gundef,fisg]) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   296
qed "is_recfun_cut";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   297
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   298
(*** Main Existence Lemma -- Basic Properties of the_recfun ***)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   299
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   300
Goalw [the_recfun_def]
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   301
    "is_recfun r H a f ==> is_recfun r H a (the_recfun r H a)";
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   302
by (eres_inst_tac [("P", "is_recfun r H a")] selectI 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   303
qed "is_the_recfun";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   304
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   305
Goal "[| wf(r);  trans(r) |] ==> is_recfun r H a (the_recfun r H a)";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   306
by (wf_ind_tac "a" [] 1);
4821
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   307
by (res_inst_tac [("f","cut (%y. H (the_recfun r H y) y) r a1")]
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   308
                 is_the_recfun 1);
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   309
by (rewtac is_recfun_def);
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   310
by (stac cuts_eq 1);
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   311
by (Clarify_tac 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   312
by (rtac H_cong2 1);
4821
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   313
by (subgoal_tac
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   314
         "the_recfun r H y = cut(%x. H(cut(the_recfun r H y) r x) x) r y" 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   315
 by (Blast_tac 2);
4821
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   316
by (etac ssubst 1);
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   317
by (simp_tac (HOL_ss addsimps [cuts_eq]) 1);
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   318
by (Clarify_tac 1);
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   319
by (stac cut_apply 1);
5132
24f992a25adc isatool expandshort;
wenzelm
parents: 5069
diff changeset
   320
 by (fast_tac (claset() addDs [transD]) 1);
4821
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   321
by (fold_tac [is_recfun_def]);
bfbaea156f43 Modifications due to improved simplifier.
nipkow
parents: 4762
diff changeset
   322
by (asm_simp_tac (wf_super_ss addsimps[is_recfun_cut]) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   323
qed "unfold_the_recfun";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   324
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   325
Goal "[| wf r; trans r; (x,a) : r; (x,b) : r |] \
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   326
\     ==> the_recfun r H a x = the_recfun r H b x";
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   327
by (best_tac (claset() addIs [is_recfun_equal, unfold_the_recfun]) 1);
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   328
qed "the_recfun_equal";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   329
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   330
(** Removal of the premise trans(r) **)
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   331
val th = rewrite_rule[is_recfun_def]
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   332
                     (trans_trancl RSN (2,(wf_trancl RS unfold_the_recfun)));
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   333
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
   334
Goalw [wfrec_def]
5148
74919e8f221c More tidying and removal of "\!\!... from Goal commands
paulson
parents: 5143
diff changeset
   335
    "wf(r) ==> wfrec r H a = H (cut (wfrec r H) r a) a";
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   336
by (rtac H_cong2 1);
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   337
by (simp_tac (HOL_ss addsimps [cuts_eq]) 1);
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   338
by (rtac allI 1);
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   339
by (rtac impI 1);
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   340
by (res_inst_tac [("a1","a")] (th RS ssubst) 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   341
by (assume_tac 1);
7499
23e090051cb8 isatool expandshort;
wenzelm
parents: 7249
diff changeset
   342
by (ftac wf_trancl 1);
23e090051cb8 isatool expandshort;
wenzelm
parents: 7249
diff changeset
   343
by (ftac r_into_trancl 1);
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   344
by (asm_simp_tac (HOL_ss addsimps [cut_apply]) 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   345
by (rtac H_cong2 1);    (*expose the equality of cuts*)
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   346
by (simp_tac (HOL_ss addsimps [cuts_eq, cut_apply, r_into_trancl]) 1);
7249
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   347
by (blast_tac (claset() addIs [the_recfun_equal, transD, trans_trancl, 
4886664d7033 tidied some proofs
paulson
parents: 6814
diff changeset
   348
			       r_into_trancl]) 1);
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   349
qed "wfrec";
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   350
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   351
(*---------------------------------------------------------------------------
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   352
 * This form avoids giant explosions in proofs.  NOTE USE OF == 
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   353
 *---------------------------------------------------------------------------*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5281
diff changeset
   354
val rew::prems = goal thy
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   355
    "[| f==wfrec r H;  wf(r) |] ==> f(a) = H (cut f r a) a";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   356
by (rewtac rew);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   357
by (REPEAT (resolve_tac (prems@[wfrec]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   358
qed "def_wfrec";
1475
7f5a4cd08209 expanded tabs; renamed subtype to typedef;
clasohm
parents: 1465
diff changeset
   359
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   360
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   361
(**** TFL variants ****)
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   362
5278
a903b66822e2 even more tidying of Goal commands
paulson
parents: 5148
diff changeset
   363
Goal "!R. wf R --> (!P. (!x. (!y. (y,x):R --> P y) --> P x) --> (!x. P x))";
3708
56facaebf3e3 Changed some proofs to use Clarify_tac
paulson
parents: 3457
diff changeset
   364
by (Clarify_tac 1);
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   365
by (res_inst_tac [("r","R"),("P","P"), ("a","x")] wf_induct 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   366
by (assume_tac 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   367
by (Blast_tac 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   368
qed"tfl_wf_induct";
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   369
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
   370
Goal "!f R. (x,a):R --> (cut f R a)(x) = f(x)";
3708
56facaebf3e3 Changed some proofs to use Clarify_tac
paulson
parents: 3457
diff changeset
   371
by (Clarify_tac 1);
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   372
by (rtac cut_apply 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   373
by (assume_tac 1);
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   374
qed"tfl_cut_apply";
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   375
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4821
diff changeset
   376
Goal "!M R f. (f=wfrec R M) --> wf R --> (!x. f x = M (cut f R x) x)";
3708
56facaebf3e3 Changed some proofs to use Clarify_tac
paulson
parents: 3457
diff changeset
   377
by (Clarify_tac 1);
4153
e534c4c32d54 Ran expandshort, especially to introduce Safe_tac
paulson
parents: 4089
diff changeset
   378
by (etac wfrec 1);
3198
295287618e30 New proofs for TFL
paulson
parents: 2935
diff changeset
   379
qed "tfl_wfrec";