Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 11:33:58 +0100] rev 519
Change equiv_trans2 to EQUALS_RSP, since we can prove it for any quotient type, not only for eqv relations.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 11:06:43 +0100] rev 518
compose_tac instead of rtac to avoid unification; some code cleaning.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 10:36:35 +0100] rev 517
Got to about 5 seconds for the longest proof. APPLY_RSP_TAC' solves the quotient internally without instantiation resulting in a faster proof.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 10:12:17 +0100] rev 516
Using APPLY_RSP1; again a little bit faster.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 09:33:32 +0100] rev 515
Fixes after big merge.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 09:25:27 +0100] rev 514
The big merge; probably non-functional.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 09:08:51 +0100] rev 513
Testing the new tactic everywhere
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 09:01:13 +0100] rev 512
First version of the deterministic rep-abs-inj-tac.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 09:18:46 +0100] rev 511
Changing = to \<equiv> in case if we want to use simp.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 04 Dec 2009 09:10:31 +0100] rev 510
Even better: Completely got rid of the simps in both quotient_tac and inj_repabs_tac