equal
deleted
inserted
replaced
357 (*--------------------------------------------------------------------------- |
357 (*--------------------------------------------------------------------------- |
358 filter A`sch = proj1`ex --> zip`(filter A`sch)`(proj2`ex) = ex |
358 filter A`sch = proj1`ex --> zip`(filter A`sch)`(proj2`ex) = ex |
359 lemma for eliminating non admissible equations in assumptions |
359 lemma for eliminating non admissible equations in assumptions |
360 --------------------------------------------------------------------------- *) |
360 --------------------------------------------------------------------------- *) |
361 |
361 |
|
362 (* Versuich |
|
363 goal thy "(y~= nil & Map fst`x <<y) --> x= Zip`y`(Map snd`x)"; |
|
364 by (Seq_induct_tac "x" [] 1); |
|
365 by (Seq_case_simp_tac "y" 2); |
|
366 by (pair_tac "a" 1); |
|
367 by (Auto_tac()); |
|
368 |
|
369 *) |
|
370 |
362 goal thy "!! sch ex. \ |
371 goal thy "!! sch ex. \ |
363 \ Filter (%a. a:act AB)`sch = filter_act`ex \ |
372 \ Filter (%a. a:act AB)`sch = filter_act`ex \ |
364 \ ==> ex = Zip`(Filter (%a. a:act AB)`sch)`(Map snd`ex)"; |
373 \ ==> ex = Zip`(Filter (%a. a:act AB)`sch)`(Map snd`ex)"; |
365 by (asm_full_simp_tac (simpset() addsimps [filter_act_def]) 1); |
374 by (asm_full_simp_tac (simpset() addsimps [filter_act_def]) 1); |
366 by (rtac (Zip_Map_fst_snd RS sym) 1); |
375 by (rtac (Zip_Map_fst_snd RS sym) 1); |