Much tidying including "qed" instead of result(), and even qed_spec_mp,
and Safe_tac instead of step_tac
(* Title: SubUnion.ML
ID: $Id$
Author: Ole Rasmussen
Copyright 1995 University of Cambridge
Logic Image: ZF
*)
open SubUnion;
fun rotate n i = EVERY(replicate n (etac revcut_rl i));
(* ------------------------------------------------------------------------- *)
(* Specialisation of comp-rules *)
(* ------------------------------------------------------------------------- *)
val compD1 =Scomp.dom_subset RS subsetD RS SigmaD1;
val compD2 =Scomp.dom_subset RS subsetD RS SigmaD2;
val regD =Sreg.dom_subset RS subsetD;
(* ------------------------------------------------------------------------- *)
(* Equality rules for union *)
(* ------------------------------------------------------------------------- *)
goalw SubUnion.thy [union_def]
"!!u.n:nat==>Var(n) un Var(n)=Var(n)";
by (Asm_simp_tac 1);
by (simp_tac (rank_ss addsimps redexes.con_defs) 1);
qed "union_Var";
goalw SubUnion.thy [union_def]
"!!u.[|u:redexes; v:redexes|]==>Fun(u) un Fun(v)=Fun(u un v)";
by (Asm_simp_tac 1);
by (simp_tac (rank_ss addsimps redexes.con_defs) 1);
qed "union_Fun";
goalw SubUnion.thy [union_def]
"!!u.[|b1:bool; b2:bool; u1:redexes; v1:redexes; u2:redexes; v2:redexes|]==> \
\ App(b1,u1,v1) un App(b2,u2,v2)=App(b1 or b2,u1 un u2,v1 un v2)";
by (Asm_simp_tac 1);
by (simp_tac (rank_ss addsimps redexes.con_defs) 1);
qed "union_App";
Addsimps (Ssub.intrs@bool_typechecks@
Sreg.intrs@Scomp.intrs@
[or_1 RSN (3,or_commute RS trans),
or_0 RSN (3,or_commute RS trans),
union_App,union_Fun,union_Var,compD2,compD1,regD]);
AddIs Scomp.intrs;
AddSEs [Sreg.mk_cases redexes.con_defs "regular(App(b,f,a))",
Sreg.mk_cases redexes.con_defs "regular(Fun(b))",
Sreg.mk_cases redexes.con_defs "regular(Var(b))",
Scomp.mk_cases redexes.con_defs "Fun(u) ~ Fun(t)",
Scomp.mk_cases redexes.con_defs "u ~ Fun(t)",
Scomp.mk_cases redexes.con_defs "u ~ Var(n)",
Scomp.mk_cases redexes.con_defs "u ~ App(b,t,a)",
Scomp.mk_cases redexes.con_defs "Fun(t) ~ v",
Scomp.mk_cases redexes.con_defs "App(b,f,a) ~ v",
Scomp.mk_cases redexes.con_defs "Var(n) ~ u"
];
(* ------------------------------------------------------------------------- *)
(* comp proofs *)
(* ------------------------------------------------------------------------- *)
goal SubUnion.thy "!!u.u:redexes ==> u ~ u";
by (eresolve_tac [redexes.induct] 1);
by (ALLGOALS Fast_tac);
qed "comp_refl";
goal SubUnion.thy
"!!u.u ~ v ==> v ~ u";
by (etac Scomp.induct 1);
by (ALLGOALS Fast_tac);
qed "comp_sym";
goal SubUnion.thy
"u ~ v <-> v ~ u";
by (fast_tac (!claset addIs [comp_sym]) 1);
qed "comp_sym_iff";
goal SubUnion.thy
"!!u.u ~ v ==> ALL w.v ~ w-->u ~ w";
by (etac Scomp.induct 1);
by (ALLGOALS Fast_tac);
qed_spec_mp "comp_trans";
(* ------------------------------------------------------------------------- *)
(* union proofs *)
(* ------------------------------------------------------------------------- *)
goal SubUnion.thy
"!!u.u ~ v ==> u <== (u un v)";
by (etac Scomp.induct 1);
by (etac boolE 3);
by (ALLGOALS Asm_full_simp_tac);
qed "union_l";
goal SubUnion.thy
"!!u.u ~ v ==> v <== (u un v)";
by (etac Scomp.induct 1);
by (eres_inst_tac [("c","b2")] boolE 3);
by (ALLGOALS Asm_full_simp_tac);
qed "union_r";
goal SubUnion.thy
"!!u.u ~ v ==> u un v = v un u";
by (etac Scomp.induct 1);
by (ALLGOALS(asm_simp_tac (!simpset addsimps [or_commute])));
qed "union_sym";
(* ------------------------------------------------------------------------- *)
(* regular proofs *)
(* ------------------------------------------------------------------------- *)
goal SubUnion.thy
"!!u.u ~ v ==> regular(u)-->regular(v)-->regular(u un v)";
by (etac Scomp.induct 1);
by (ALLGOALS(asm_full_simp_tac
(!simpset setloop(SELECT_GOAL (safe_tac (!claset))))));
by (dres_inst_tac [("psi", "regular(Fun(?u) un ?v)")] asm_rl 1);
by (Asm_full_simp_tac 1);
qed_spec_mp "union_preserve_regular";