1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(*i $Id: Mapaxioms.v,v 1.4.2.1 2004/07/16 19:31:04 herbelin Exp $ i*)
Require Import Bool.
Require Import Sumbool.
Require Import ZArith.
Require Import Addr.
Require Import Adist.
Require Import Addec.
Require Import Map.
Require Import Fset.
Section MapAxioms.
Variables A B C : Set.
Lemma eqm_sym : forall f f':ad -> option A, eqm A f f' -> eqm A f' f.
Proof.
unfold eqm in |- *. intros. rewrite H. reflexivity.
Qed.
Lemma eqm_refl : forall f:ad -> option A, eqm A f f.
Proof.
unfold eqm in |- *. trivial.
Qed.
Lemma eqm_trans :
forall f f' f'':ad -> option A, eqm A f f' -> eqm A f' f'' -> eqm A f f''.
Proof.
unfold eqm in |- *. intros. rewrite H. exact (H0 a).
Qed.
Definition eqmap (m m':Map A) := eqm A (MapGet A m) (MapGet A m').
Lemma eqmap_sym : forall m m':Map A, eqmap m m' -> eqmap m' m.
Proof.
intros. unfold eqmap in |- *. apply eqm_sym. assumption.
Qed.
Lemma eqmap_refl : forall m:Map A, eqmap m m.
Proof.
intros. unfold eqmap in |- *. apply eqm_refl.
Qed.
Lemma eqmap_trans :
forall m m' m'':Map A, eqmap m m' -> eqmap m' m'' -> eqmap m m''.
Proof.
intros. exact (eqm_trans (MapGet A m) (MapGet A m') (MapGet A m'') H H0).
Qed.
Lemma MapPut_as_Merge :
forall (m:Map A) (a:ad) (y:A),
eqmap (MapPut A m a y) (MapMerge A m (M1 A a y)).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapPut_semantics A m a y a0).
rewrite (MapMerge_semantics A m (M1 A a y) a0). unfold MapGet at 2 in |- *.
elim (sumbool_of_bool (ad_eq a a0)); intro H; rewrite H; reflexivity.
Qed.
Lemma MapPut_ext :
forall m m':Map A,
eqmap m m' ->
forall (a:ad) (y:A), eqmap (MapPut A m a y) (MapPut A m' a y).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapPut_semantics A m' a y a0).
rewrite (MapPut_semantics A m a y a0).
case (ad_eq a a0); [ reflexivity | apply H ].
Qed.
Lemma MapPut_behind_as_Merge :
forall (m:Map A) (a:ad) (y:A),
eqmap (MapPut_behind A m a y) (MapMerge A (M1 A a y) m).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapPut_behind_semantics A m a y a0).
rewrite (MapMerge_semantics A (M1 A a y) m a0). reflexivity.
Qed.
Lemma MapPut_behind_ext :
forall m m':Map A,
eqmap m m' ->
forall (a:ad) (y:A),
eqmap (MapPut_behind A m a y) (MapPut_behind A m' a y).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapPut_behind_semantics A m' a y a0).
rewrite (MapPut_behind_semantics A m a y a0). rewrite (H a0). reflexivity.
Qed.
Lemma MapMerge_empty_m_1 : forall m:Map A, MapMerge A (M0 A) m = m.
Proof.
trivial.
Qed.
Lemma MapMerge_empty_m : forall m:Map A, eqmap (MapMerge A (M0 A) m) m.
Proof.
unfold eqmap, eqm in |- *. trivial.
Qed.
Lemma MapMerge_m_empty_1 : forall m:Map A, MapMerge A m (M0 A) = m.
Proof.
simple induction m; trivial.
Qed.
Lemma MapMerge_m_empty : forall m:Map A, eqmap (MapMerge A m (M0 A)) m.
Proof.
unfold eqmap, eqm in |- *. intros. rewrite MapMerge_m_empty_1. reflexivity.
Qed.
Lemma MapMerge_empty_l :
forall m m':Map A, eqmap (MapMerge A m m') (M0 A) -> eqmap m (M0 A).
Proof.
unfold eqmap, eqm in |- *. intros. cut (MapGet A (MapMerge A m m') a = MapGet A (M0 A) a).
rewrite (MapMerge_semantics A m m' a). case (MapGet A m' a). trivial.
intros. discriminate H0.
exact (H a).
Qed.
Lemma MapMerge_empty_r :
forall m m':Map A, eqmap (MapMerge A m m') (M0 A) -> eqmap m' (M0 A).
Proof.
unfold eqmap, eqm in |- *. intros. cut (MapGet A (MapMerge A m m') a = MapGet A (M0 A) a).
rewrite (MapMerge_semantics A m m' a). case (MapGet A m' a). trivial.
intros. discriminate H0.
exact (H a).
Qed.
Lemma MapMerge_assoc :
forall m m' m'':Map A,
eqmap (MapMerge A (MapMerge A m m') m'')
(MapMerge A m (MapMerge A m' m'')).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapMerge_semantics A (MapMerge A m m') m'' a).
rewrite (MapMerge_semantics A m (MapMerge A m' m'') a). rewrite (MapMerge_semantics A m m' a).
rewrite (MapMerge_semantics A m' m'' a).
case (MapGet A m'' a); case (MapGet A m' a); trivial.
Qed.
Lemma MapMerge_idempotent : forall m:Map A, eqmap (MapMerge A m m) m.
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapMerge_semantics A m m a).
case (MapGet A m a); trivial.
Qed.
Lemma MapMerge_ext :
forall m1 m2 m'1 m'2:Map A,
eqmap m1 m'1 ->
eqmap m2 m'2 -> eqmap (MapMerge A m1 m2) (MapMerge A m'1 m'2).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapMerge_semantics A m1 m2 a).
rewrite (MapMerge_semantics A m'1 m'2 a). rewrite (H a). rewrite (H0 a). reflexivity.
Qed.
Lemma MapMerge_ext_l :
forall m1 m'1 m2:Map A,
eqmap m1 m'1 -> eqmap (MapMerge A m1 m2) (MapMerge A m'1 m2).
Proof.
intros. apply MapMerge_ext. assumption.
apply eqmap_refl.
Qed.
Lemma MapMerge_ext_r :
forall m1 m2 m'2:Map A,
eqmap m2 m'2 -> eqmap (MapMerge A m1 m2) (MapMerge A m1 m'2).
Proof.
intros. apply MapMerge_ext. apply eqmap_refl.
assumption.
Qed.
Lemma MapMerge_RestrTo_l :
forall m m' m'':Map A,
eqmap (MapMerge A (MapDomRestrTo A A m m') m'')
(MapDomRestrTo A A (MapMerge A m m'') (MapMerge A m' m'')).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapMerge_semantics A (MapDomRestrTo A A m m') m'' a).
rewrite (MapDomRestrTo_semantics A A m m' a).
rewrite
(MapDomRestrTo_semantics A A (MapMerge A m m'') (MapMerge A m' m'') a)
.
rewrite (MapMerge_semantics A m' m'' a). rewrite (MapMerge_semantics A m m'' a).
case (MapGet A m'' a); case (MapGet A m' a); reflexivity.
Qed.
Lemma MapRemove_as_RestrBy :
forall (m:Map A) (a:ad) (y:B),
eqmap (MapRemove A m a) (MapDomRestrBy A B m (M1 B a y)).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapRemove_semantics A m a a0).
rewrite (MapDomRestrBy_semantics A B m (M1 B a y) a0). elim (sumbool_of_bool (ad_eq a a0)).
intro H. rewrite H. rewrite (ad_eq_complete a a0 H). rewrite (M1_semantics_1 B a0 y).
reflexivity.
intro H. rewrite H. rewrite (M1_semantics_2 B a a0 y H). reflexivity.
Qed.
Lemma MapRemove_ext :
forall m m':Map A,
eqmap m m' -> forall a:ad, eqmap (MapRemove A m a) (MapRemove A m' a).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapRemove_semantics A m' a a0).
rewrite (MapRemove_semantics A m a a0).
case (ad_eq a a0); [ reflexivity | apply H ].
Qed.
Lemma MapDomRestrTo_empty_m_1 :
forall m:Map B, MapDomRestrTo A B (M0 A) m = M0 A.
Proof.
trivial.
Qed.
Lemma MapDomRestrTo_empty_m :
forall m:Map B, eqmap (MapDomRestrTo A B (M0 A) m) (M0 A).
Proof.
unfold eqmap, eqm in |- *. trivial.
Qed.
Lemma MapDomRestrTo_m_empty_1 :
forall m:Map A, MapDomRestrTo A B m (M0 B) = M0 A.
Proof.
simple induction m; trivial.
Qed.
Lemma MapDomRestrTo_m_empty :
forall m:Map A, eqmap (MapDomRestrTo A B m (M0 B)) (M0 A).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrTo_m_empty_1 m). reflexivity.
Qed.
Lemma MapDomRestrTo_assoc :
forall (m:Map A) (m':Map B) (m'':Map C),
eqmap (MapDomRestrTo A C (MapDomRestrTo A B m m') m'')
(MapDomRestrTo A B m (MapDomRestrTo B C m' m'')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrTo_semantics A C (MapDomRestrTo A B m m') m'' a).
rewrite (MapDomRestrTo_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A B m (MapDomRestrTo B C m' m'') a).
rewrite (MapDomRestrTo_semantics B C m' m'' a).
case (MapGet C m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapDomRestrTo_idempotent :
forall m:Map A, eqmap (MapDomRestrTo A A m m) m.
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrTo_semantics A A m m a).
case (MapGet A m a); trivial.
Qed.
Lemma MapDomRestrTo_Dom :
forall (m:Map A) (m':Map B),
eqmap (MapDomRestrTo A B m m') (MapDomRestrTo A unit m (MapDom B m')).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrTo_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A unit m (MapDom B m') a).
elim (sumbool_of_bool (in_FSet a (MapDom B m'))). intro H.
elim (MapDom_semantics_2 B m' a H). intros y H0. rewrite H0. unfold in_FSet, in_dom in H.
generalize H. case (MapGet unit (MapDom B m') a); trivial. intro H1. discriminate H1.
intro H. rewrite (MapDom_semantics_4 B m' a H). unfold in_FSet, in_dom in H.
generalize H. case (MapGet unit (MapDom B m') a). trivial.
intros H0 H1. discriminate H1.
Qed.
Lemma MapDomRestrBy_empty_m_1 :
forall m:Map B, MapDomRestrBy A B (M0 A) m = M0 A.
Proof.
trivial.
Qed.
Lemma MapDomRestrBy_empty_m :
forall m:Map B, eqmap (MapDomRestrBy A B (M0 A) m) (M0 A).
Proof.
unfold eqmap, eqm in |- *. trivial.
Qed.
Lemma MapDomRestrBy_m_empty_1 :
forall m:Map A, MapDomRestrBy A B m (M0 B) = m.
Proof.
simple induction m; trivial.
Qed.
Lemma MapDomRestrBy_m_empty :
forall m:Map A, eqmap (MapDomRestrBy A B m (M0 B)) m.
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrBy_m_empty_1 m). reflexivity.
Qed.
Lemma MapDomRestrBy_Dom :
forall (m:Map A) (m':Map B),
eqmap (MapDomRestrBy A B m m') (MapDomRestrBy A unit m (MapDom B m')).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrBy_semantics A unit m (MapDom B m') a).
elim (sumbool_of_bool (in_FSet a (MapDom B m'))). intro H.
elim (MapDom_semantics_2 B m' a H). intros y H0. rewrite H0.
unfold in_FSet, in_dom in H. generalize H. case (MapGet unit (MapDom B m') a); trivial.
intro H1. discriminate H1.
intro H. rewrite (MapDom_semantics_4 B m' a H). unfold in_FSet, in_dom in H.
generalize H. case (MapGet unit (MapDom B m') a). trivial.
intros H0 H1. discriminate H1.
Qed.
Lemma MapDomRestrBy_m_m_1 :
forall m:Map A, eqmap (MapDomRestrBy A A m m) (M0 A).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrBy_semantics A A m m a).
case (MapGet A m a); trivial.
Qed.
Lemma MapDomRestrBy_By :
forall (m:Map A) (m' m'':Map B),
eqmap (MapDomRestrBy A B (MapDomRestrBy A B m m') m'')
(MapDomRestrBy A B m (MapMerge B m' m'')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrBy_semantics A B (MapDomRestrBy A B m m') m'' a).
rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrBy_semantics A B m (MapMerge B m' m'') a).
rewrite (MapMerge_semantics B m' m'' a).
case (MapGet B m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapDomRestrBy_By_comm :
forall (m:Map A) (m':Map B) (m'':Map C),
eqmap (MapDomRestrBy A C (MapDomRestrBy A B m m') m'')
(MapDomRestrBy A B (MapDomRestrBy A C m m'') m').
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrBy_semantics A C (MapDomRestrBy A B m m') m'' a).
rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrBy_semantics A B (MapDomRestrBy A C m m'') m' a).
rewrite (MapDomRestrBy_semantics A C m m'' a).
case (MapGet C m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapDomRestrBy_To :
forall (m:Map A) (m':Map B) (m'':Map C),
eqmap (MapDomRestrBy A C (MapDomRestrTo A B m m') m'')
(MapDomRestrTo A B m (MapDomRestrBy B C m' m'')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrBy_semantics A C (MapDomRestrTo A B m m') m'' a).
rewrite (MapDomRestrTo_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A B m (MapDomRestrBy B C m' m'') a).
rewrite (MapDomRestrBy_semantics B C m' m'' a).
case (MapGet C m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapDomRestrBy_To_comm :
forall (m:Map A) (m':Map B) (m'':Map C),
eqmap (MapDomRestrBy A C (MapDomRestrTo A B m m') m'')
(MapDomRestrTo A B (MapDomRestrBy A C m m'') m').
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrBy_semantics A C (MapDomRestrTo A B m m') m'' a).
rewrite (MapDomRestrTo_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A B (MapDomRestrBy A C m m'') m' a).
rewrite (MapDomRestrBy_semantics A C m m'' a).
case (MapGet C m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapDomRestrTo_By :
forall (m:Map A) (m':Map B) (m'':Map C),
eqmap (MapDomRestrTo A C (MapDomRestrBy A B m m') m'')
(MapDomRestrTo A C m (MapDomRestrBy C B m'' m')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrTo_semantics A C (MapDomRestrBy A B m m') m'' a).
rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A C m (MapDomRestrBy C B m'' m') a).
rewrite (MapDomRestrBy_semantics C B m'' m' a).
case (MapGet C m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapDomRestrTo_By_comm :
forall (m:Map A) (m':Map B) (m'':Map C),
eqmap (MapDomRestrTo A C (MapDomRestrBy A B m m') m'')
(MapDomRestrBy A B (MapDomRestrTo A C m m'') m').
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrTo_semantics A C (MapDomRestrBy A B m m') m'' a).
rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrBy_semantics A B (MapDomRestrTo A C m m'') m' a).
rewrite (MapDomRestrTo_semantics A C m m'' a).
case (MapGet C m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapDomRestrTo_To_comm :
forall (m:Map A) (m':Map B) (m'':Map C),
eqmap (MapDomRestrTo A C (MapDomRestrTo A B m m') m'')
(MapDomRestrTo A B (MapDomRestrTo A C m m'') m').
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrTo_semantics A C (MapDomRestrTo A B m m') m'' a).
rewrite (MapDomRestrTo_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A B (MapDomRestrTo A C m m'') m' a).
rewrite (MapDomRestrTo_semantics A C m m'' a).
case (MapGet C m'' a); case (MapGet B m' a); trivial.
Qed.
Lemma MapMerge_DomRestrTo :
forall (m m':Map A) (m'':Map B),
eqmap (MapDomRestrTo A B (MapMerge A m m') m'')
(MapMerge A (MapDomRestrTo A B m m'') (MapDomRestrTo A B m' m'')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrTo_semantics A B (MapMerge A m m') m'' a).
rewrite (MapMerge_semantics A m m' a).
rewrite
(MapMerge_semantics A (MapDomRestrTo A B m m'')
(MapDomRestrTo A B m' m'') a).
rewrite (MapDomRestrTo_semantics A B m' m'' a).
rewrite (MapDomRestrTo_semantics A B m m'' a).
case (MapGet B m'' a); case (MapGet A m' a); trivial.
Qed.
Lemma MapMerge_DomRestrBy :
forall (m m':Map A) (m'':Map B),
eqmap (MapDomRestrBy A B (MapMerge A m m') m'')
(MapMerge A (MapDomRestrBy A B m m'') (MapDomRestrBy A B m' m'')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDomRestrBy_semantics A B (MapMerge A m m') m'' a).
rewrite (MapMerge_semantics A m m' a).
rewrite
(MapMerge_semantics A (MapDomRestrBy A B m m'')
(MapDomRestrBy A B m' m'') a).
rewrite (MapDomRestrBy_semantics A B m' m'' a).
rewrite (MapDomRestrBy_semantics A B m m'' a).
case (MapGet B m'' a); case (MapGet A m' a); trivial.
Qed.
Lemma MapDelta_empty_m_1 : forall m:Map A, MapDelta A (M0 A) m = m.
Proof.
trivial.
Qed.
Lemma MapDelta_empty_m : forall m:Map A, eqmap (MapDelta A (M0 A) m) m.
Proof.
unfold eqmap, eqm in |- *. trivial.
Qed.
Lemma MapDelta_m_empty_1 : forall m:Map A, MapDelta A m (M0 A) = m.
Proof.
simple induction m; trivial.
Qed.
Lemma MapDelta_m_empty : forall m:Map A, eqmap (MapDelta A m (M0 A)) m.
Proof.
unfold eqmap, eqm in |- *. intros. rewrite MapDelta_m_empty_1. reflexivity.
Qed.
Lemma MapDelta_nilpotent : forall m:Map A, eqmap (MapDelta A m m) (M0 A).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDelta_semantics A m m a).
case (MapGet A m a); trivial.
Qed.
Lemma MapDelta_as_Merge :
forall m m':Map A,
eqmap (MapDelta A m m')
(MapMerge A (MapDomRestrBy A A m m') (MapDomRestrBy A A m' m)).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite (MapDelta_semantics A m m' a).
rewrite
(MapMerge_semantics A (MapDomRestrBy A A m m') (
MapDomRestrBy A A m' m) a).
rewrite (MapDomRestrBy_semantics A A m' m a).
rewrite (MapDomRestrBy_semantics A A m m' a).
case (MapGet A m a); case (MapGet A m' a); trivial.
Qed.
Lemma MapDelta_as_DomRestrBy :
forall m m':Map A,
eqmap (MapDelta A m m')
(MapDomRestrBy A A (MapMerge A m m') (MapDomRestrTo A A m m')).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDelta_semantics A m m' a).
rewrite
(MapDomRestrBy_semantics A A (MapMerge A m m') (
MapDomRestrTo A A m m') a).
rewrite (MapDomRestrTo_semantics A A m m' a). rewrite (MapMerge_semantics A m m' a).
case (MapGet A m a); case (MapGet A m' a); trivial.
Qed.
Lemma MapDelta_as_DomRestrBy_2 :
forall m m':Map A,
eqmap (MapDelta A m m')
(MapDomRestrBy A A (MapMerge A m m') (MapDomRestrTo A A m' m)).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDelta_semantics A m m' a).
rewrite
(MapDomRestrBy_semantics A A (MapMerge A m m') (
MapDomRestrTo A A m' m) a).
rewrite (MapDomRestrTo_semantics A A m' m a). rewrite (MapMerge_semantics A m m' a).
case (MapGet A m a); case (MapGet A m' a); trivial.
Qed.
Lemma MapDelta_sym :
forall m m':Map A, eqmap (MapDelta A m m') (MapDelta A m' m).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDelta_semantics A m m' a).
rewrite (MapDelta_semantics A m' m a).
case (MapGet A m a); case (MapGet A m' a); trivial.
Qed.
Lemma MapDelta_ext :
forall m1 m2 m'1 m'2:Map A,
eqmap m1 m'1 ->
eqmap m2 m'2 -> eqmap (MapDelta A m1 m2) (MapDelta A m'1 m'2).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDelta_semantics A m1 m2 a).
rewrite (MapDelta_semantics A m'1 m'2 a). rewrite (H a). rewrite (H0 a). reflexivity.
Qed.
Lemma MapDelta_ext_l :
forall m1 m'1 m2:Map A,
eqmap m1 m'1 -> eqmap (MapDelta A m1 m2) (MapDelta A m'1 m2).
Proof.
intros. apply MapDelta_ext. assumption.
apply eqmap_refl.
Qed.
Lemma MapDelta_ext_r :
forall m1 m2 m'2:Map A,
eqmap m2 m'2 -> eqmap (MapDelta A m1 m2) (MapDelta A m1 m'2).
Proof.
intros. apply MapDelta_ext. apply eqmap_refl.
assumption.
Qed.
Lemma MapDom_Split_1 :
forall (m:Map A) (m':Map B),
eqmap m (MapMerge A (MapDomRestrTo A B m m') (MapDomRestrBy A B m m')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite
(MapMerge_semantics A (MapDomRestrTo A B m m') (
MapDomRestrBy A B m m') a).
rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A B m m' a).
case (MapGet B m' a); case (MapGet A m a); trivial.
Qed.
Lemma MapDom_Split_2 :
forall (m:Map A) (m':Map B),
eqmap m (MapMerge A (MapDomRestrBy A B m m') (MapDomRestrTo A B m m')).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite
(MapMerge_semantics A (MapDomRestrBy A B m m') (
MapDomRestrTo A B m m') a).
rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A B m m' a).
case (MapGet B m' a); case (MapGet A m a); trivial.
Qed.
Lemma MapDom_Split_3 :
forall (m:Map A) (m':Map B),
eqmap
(MapDomRestrTo A A (MapDomRestrTo A B m m') (MapDomRestrBy A B m m'))
(M0 A).
Proof.
unfold eqmap, eqm in |- *. intros.
rewrite
(MapDomRestrTo_semantics A A (MapDomRestrTo A B m m')
(MapDomRestrBy A B m m') a).
rewrite (MapDomRestrBy_semantics A B m m' a).
rewrite (MapDomRestrTo_semantics A B m m' a).
case (MapGet B m' a); case (MapGet A m a); trivial.
Qed.
End MapAxioms.
Lemma MapDomRestrTo_ext :
forall (A B:Set) (m1:Map A) (m2:Map B) (m'1:Map A)
(m'2:Map B),
eqmap A m1 m'1 ->
eqmap B m2 m'2 ->
eqmap A (MapDomRestrTo A B m1 m2) (MapDomRestrTo A B m'1 m'2).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrTo_semantics A B m1 m2 a).
rewrite (MapDomRestrTo_semantics A B m'1 m'2 a). rewrite (H a). rewrite (H0 a). reflexivity.
Qed.
Lemma MapDomRestrTo_ext_l :
forall (A B:Set) (m1:Map A) (m2:Map B) (m'1:Map A),
eqmap A m1 m'1 ->
eqmap A (MapDomRestrTo A B m1 m2) (MapDomRestrTo A B m'1 m2).
Proof.
intros. apply MapDomRestrTo_ext; [ assumption | apply eqmap_refl ].
Qed.
Lemma MapDomRestrTo_ext_r :
forall (A B:Set) (m1:Map A) (m2 m'2:Map B),
eqmap B m2 m'2 ->
eqmap A (MapDomRestrTo A B m1 m2) (MapDomRestrTo A B m1 m'2).
Proof.
intros. apply MapDomRestrTo_ext; [ apply eqmap_refl | assumption ].
Qed.
Lemma MapDomRestrBy_ext :
forall (A B:Set) (m1:Map A) (m2:Map B) (m'1:Map A)
(m'2:Map B),
eqmap A m1 m'1 ->
eqmap B m2 m'2 ->
eqmap A (MapDomRestrBy A B m1 m2) (MapDomRestrBy A B m'1 m'2).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDomRestrBy_semantics A B m1 m2 a).
rewrite (MapDomRestrBy_semantics A B m'1 m'2 a). rewrite (H a). rewrite (H0 a). reflexivity.
Qed.
Lemma MapDomRestrBy_ext_l :
forall (A B:Set) (m1:Map A) (m2:Map B) (m'1:Map A),
eqmap A m1 m'1 ->
eqmap A (MapDomRestrBy A B m1 m2) (MapDomRestrBy A B m'1 m2).
Proof.
intros. apply MapDomRestrBy_ext; [ assumption | apply eqmap_refl ].
Qed.
Lemma MapDomRestrBy_ext_r :
forall (A B:Set) (m1:Map A) (m2 m'2:Map B),
eqmap B m2 m'2 ->
eqmap A (MapDomRestrBy A B m1 m2) (MapDomRestrBy A B m1 m'2).
Proof.
intros. apply MapDomRestrBy_ext; [ apply eqmap_refl | assumption ].
Qed.
Lemma MapDomRestrBy_m_m :
forall (A:Set) (m:Map A),
eqmap A (MapDomRestrBy A unit m (MapDom A m)) (M0 A).
Proof.
intros. apply eqmap_trans with (m' := MapDomRestrBy A A m m). apply eqmap_sym.
apply MapDomRestrBy_Dom.
apply MapDomRestrBy_m_m_1.
Qed.
Lemma FSetDelta_assoc :
forall s s' s'':FSet,
eqmap unit (MapDelta _ (MapDelta _ s s') s'')
(MapDelta _ s (MapDelta _ s' s'')).
Proof.
unfold eqmap, eqm in |- *. intros. rewrite (MapDelta_semantics unit (MapDelta unit s s') s'' a).
rewrite (MapDelta_semantics unit s s' a).
rewrite (MapDelta_semantics unit s (MapDelta unit s' s'') a).
rewrite (MapDelta_semantics unit s' s'' a).
case (MapGet _ s a); case (MapGet _ s' a); case (MapGet _ s'' a); trivial.
intros. elim u. elim u1. reflexivity.
Qed.
Lemma FSet_ext :
forall s s':FSet,
(forall a:ad, in_FSet a s = in_FSet a s') -> eqmap unit s s'.
Proof.
unfold in_FSet, eqmap, eqm in |- *. intros. elim (sumbool_of_bool (in_dom _ a s)). intro H0.
elim (in_dom_some _ s a H0). intros y H1. rewrite (H a) in H0. elim (in_dom_some _ s' a H0).
intros y' H2. rewrite H1. rewrite H2. elim y. elim y'. reflexivity.
intro H0. rewrite (in_dom_none _ s a H0). rewrite (H a) in H0. rewrite (in_dom_none _ s' a H0).
reflexivity.
Qed.
Lemma FSetUnion_comm :
forall s s':FSet, eqmap unit (FSetUnion s s') (FSetUnion s' s).
Proof.
intros. apply FSet_ext. intro. rewrite in_FSet_union. rewrite in_FSet_union. apply orb_comm.
Qed.
Lemma FSetUnion_assoc :
forall s s' s'':FSet,
eqmap unit (FSetUnion (FSetUnion s s') s'')
(FSetUnion s (FSetUnion s' s'')).
Proof.
exact (MapMerge_assoc unit).
Qed.
Lemma FSetUnion_M0_s : forall s:FSet, eqmap unit (FSetUnion (M0 unit) s) s.
Proof.
exact (MapMerge_empty_m unit).
Qed.
Lemma FSetUnion_s_M0 : forall s:FSet, eqmap unit (FSetUnion s (M0 unit)) s.
Proof.
exact (MapMerge_m_empty unit).
Qed.
Lemma FSetUnion_idempotent : forall s:FSet, eqmap unit (FSetUnion s s) s.
Proof.
exact (MapMerge_idempotent unit).
Qed.
Lemma FSetInter_comm :
forall s s':FSet, eqmap unit (FSetInter s s') (FSetInter s' s).
Proof.
intros. apply FSet_ext. intro. rewrite in_FSet_inter. rewrite in_FSet_inter. apply andb_comm.
Qed.
Lemma FSetInter_assoc :
forall s s' s'':FSet,
eqmap unit (FSetInter (FSetInter s s') s'')
(FSetInter s (FSetInter s' s'')).
Proof.
exact (MapDomRestrTo_assoc unit unit unit).
Qed.
Lemma FSetInter_M0_s :
forall s:FSet, eqmap unit (FSetInter (M0 unit) s) (M0 unit).
Proof.
exact (MapDomRestrTo_empty_m unit unit).
Qed.
Lemma FSetInter_s_M0 :
forall s:FSet, eqmap unit (FSetInter s (M0 unit)) (M0 unit).
Proof.
exact (MapDomRestrTo_m_empty unit unit).
Qed.
Lemma FSetInter_idempotent : forall s:FSet, eqmap unit (FSetInter s s) s.
Proof.
exact (MapDomRestrTo_idempotent unit).
Qed.
Lemma FSetUnion_Inter_l :
forall s s' s'':FSet,
eqmap unit (FSetUnion (FSetInter s s') s'')
(FSetInter (FSetUnion s s'') (FSetUnion s' s'')).
Proof.
intros. apply FSet_ext. intro. rewrite in_FSet_union. rewrite in_FSet_inter.
rewrite in_FSet_inter. rewrite in_FSet_union. rewrite in_FSet_union.
case (in_FSet a s); case (in_FSet a s'); case (in_FSet a s''); reflexivity.
Qed.
Lemma FSetUnion_Inter_r :
forall s s' s'':FSet,
eqmap unit (FSetUnion s (FSetInter s' s''))
(FSetInter (FSetUnion s s') (FSetUnion s s'')).
Proof.
intros. apply FSet_ext. intro. rewrite in_FSet_union. rewrite in_FSet_inter.
rewrite in_FSet_inter. rewrite in_FSet_union. rewrite in_FSet_union.
case (in_FSet a s); case (in_FSet a s'); case (in_FSet a s''); reflexivity.
Qed.
Lemma FSetInter_Union_l :
forall s s' s'':FSet,
eqmap unit (FSetInter (FSetUnion s s') s'')
(FSetUnion (FSetInter s s'') (FSetInter s' s'')).
Proof.
intros. apply FSet_ext. intro. rewrite in_FSet_inter. rewrite in_FSet_union.
rewrite in_FSet_union. rewrite in_FSet_inter. rewrite in_FSet_inter.
case (in_FSet a s); case (in_FSet a s'); case (in_FSet a s''); reflexivity.
Qed.
Lemma FSetInter_Union_r :
forall s s' s'':FSet,
eqmap unit (FSetInter s (FSetUnion s' s''))
(FSetUnion (FSetInter s s') (FSetInter s s'')).
Proof.
intros. apply FSet_ext. intro. rewrite in_FSet_inter. rewrite in_FSet_union.
rewrite in_FSet_union. rewrite in_FSet_inter. rewrite in_FSet_inter.
case (in_FSet a s); case (in_FSet a s'); case (in_FSet a s''); reflexivity.
Qed.
|
