Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:39:17 +0100] rev 1250
With permute_rsp we can lift the instance proofs :).
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:36:07 +0100] rev 1249
Note the instance proofs, since they can be easily lifted.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:13:22 +0100] rev 1248
More refactoring and removed references to the global simpset in Perm.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:55:09 +0100] rev 1247
Factor-out 'prove_perm_empty'; I plan to use it in defining permutations on the lifted type.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:37:51 +0100] rev 1246
Regularize finite support proof for trm1
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:09:34 +0100] rev 1245
Made the fv-supp proof much more straightforward.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 12:06:55 +0100] rev 1244
Regularize the proofs about finite support.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 11:28:34 +0100] rev 1243
Respects of permute and constructors.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 11:03:30 +0100] rev 1242
Generate fv_rsp automatically.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 10:59:31 +0100] rev 1241
Define the constants automatically.