-
Notifications
You must be signed in to change notification settings - Fork 2
/
StdppExtras.v
695 lines (624 loc) · 20.6 KB
/
StdppExtras.v
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
From VLSM.Lib Require Import Itauto.
From stdpp Require Import prelude.
From VLSM.Lib Require Import Preamble ListExtras.
(** * Utility: Std++ General Results *)
Lemma elem_of_take {A : Type} (l : list A) (n : nat) (x : A) :
elem_of x (take n l) -> elem_of x l.
Proof.
generalize dependent n.
induction l; intros n H.
- by simpl in H; destruct n; simpl in H; inversion H.
- destruct n; [by inversion H |].
simpl in H.
apply elem_of_cons in H as [-> | H].
+ by left.
+ by right; eapply IHl.
Qed.
Lemma map_tail [A B : Type] (f : A -> B) (l : list A) :
map f (tail l) = tail (map f l).
Proof.
by destruct l.
Qed.
Lemma nth_error_stdpp_last {A : Type} (l : list A) :
nth_error l (length l - 1) = last l.
Proof.
induction l; [done |].
destruct l; [done |]; cbn in *.
by rewrite <- IHl, Nat.sub_0_r.
Qed.
Lemma last_last_error {A : Type} (l : list A) :
last_error l = last l.
Proof.
induction l; [done |].
rewrite last_cons, <- IHl; clear IHl.
destruct l; [done |]; cbn; f_equal.
induction l; [done |]; cbn.
rewrite <- IHl.
by destruct l.
Qed.
Lemma existsb_Exists {A} (f : A -> bool) :
forall l, existsb f l = true <-> Exists (fun x => f x = true) l.
Proof.
intro l.
rewrite Exists_exists, existsb_exists.
apply exist_proper; intros x.
by rewrite elem_of_list_In.
Qed.
Lemma Exists_last
{A : Type}
(l : list A)
(P : A -> Prop)
(Pdec : forall a, Decision (P a))
(Hsomething : Exists P l)
: exists (prefix : list A)
(suffix : list A)
(last : A),
P last /\
l = prefix ++ [last] ++ suffix /\
~ Exists P suffix.
Proof.
induction l using rev_ind; [by inversion Hsomething |].
destruct (decide (P x)).
- exists l, nil, x.
rewrite Exists_nil.
by itauto.
- apply Exists_app in Hsomething.
destruct Hsomething; [| by inversion H; [| inversion H1]].
specialize (IHl H); clear H.
destruct IHl as [prefix [suffix [last [Hf [-> Hnone_after]]]]].
exists prefix, (suffix ++ [x]), last.
simpl. rewrite <- app_assoc. simpl.
rewrite Exists_app. rewrite Exists_cons. rewrite Exists_nil.
by itauto.
Qed.
Lemma existsb_last
{A : Type}
(l : list A)
(f : A -> bool)
(Hsomething : existsb f l = true) :
exists (prefix : list A)
(suffix : list A)
(last : A),
(f last = true) /\
l = prefix ++ [last] ++ suffix /\
(existsb f suffix = false).
Proof.
setoid_rewrite <-not_true_iff_false.
setoid_rewrite existsb_Exists.
apply Exists_last.
- by typeclasses eauto.
- by apply existsb_Exists.
Qed.
Lemma existsb_forall {A} (f : A -> bool) :
forall l, existsb f l = false <-> forall x, x ∈ l -> f x = false.
Proof.
intro l.
setoid_rewrite <- not_true_iff_false.
by rewrite existsb_Exists, <- Forall_Exists_neg, Forall_forall.
Qed.
Lemma existsb_first
{A : Type}
(l : list A)
(f : A -> bool)
(Hsomething : existsb f l = true) :
exists (prefix : list A)
(suffix : list A)
(first : A),
(f first = true) /\
l = prefix ++ [first] ++ suffix /\
(existsb f prefix = false).
Proof.
setoid_rewrite <-not_true_iff_false.
setoid_rewrite existsb_Exists.
apply Exists_first.
- by typeclasses eauto.
- by apply existsb_Exists.
Qed.
(*
Returns all elements <<X>> of <<l>> such that <<X>> does not compare less
than any other element w.r.t to the precedes relation.
*)
Definition maximal_elements_list
{A} (precedes : relation A) `{!RelDecision precedes} (l : list A)
: list A :=
filter (fun a => Forall (fun b => ~ precedes a b) l) l.
Example maximal_elements_list1 : maximal_elements_list Nat.lt [1; 4; 2; 4] = [4; 4].
Proof. by itauto. Qed.
Example maximal_elements_list2 : maximal_elements_list Nat.le [1; 4; 2; 4] = [].
Proof. by itauto. Qed.
(**
Returns all elements <<x>> of a set <<S>> such that <<x>> does not compare less
than any other element in <<S>> w.r.t to a given precedes relation.
*)
Definition maximal_elements_set
`{HfinSetMessage : FinSet A SetA}
(precedes : relation A) `{!RelDecision precedes} (s : SetA)
: SetA :=
filter (fun a => set_Forall (fun b => ~ precedes a b) s) s.
Lemma filter_ext_elem_of {A} P Q
`{forall (x : A), Decision (P x)} `{forall (x : A), Decision (Q x)} (l : list A) :
(forall a, a ∈ l -> (P a <-> Q a)) ->
filter P l = filter Q l.
Proof.
induction l; intros.
- by rewrite 2 filter_nil.
- rewrite 2 filter_cons.
setoid_rewrite elem_of_cons in H1.
by destruct (decide (P a)), (decide (Q a)); [rewrite IHl | ..]; firstorder.
Qed.
Lemma ext_elem_of_filter {A} P Q
`{forall (x : A), Decision (P x)} `{forall (x : A), Decision (Q x)}
(l : list A) :
filter P l = filter Q l -> forall a, a ∈ l -> (P a <-> Q a).
Proof.
intros.
split; intros.
- by eapply elem_of_list_filter; rewrite <- H1; apply elem_of_list_filter.
- by eapply elem_of_list_filter; rewrite H1; apply elem_of_list_filter.
Qed.
Lemma filter_complement {X} P Q
`{forall (x : X), Decision (P x)} `{forall (x : X), Decision (Q x)}
(l : list X) :
filter P l = filter Q l <->
filter (fun x => ~ P x) l = filter (fun x => ~ Q x) l.
Proof.
split; intros.
- specialize (ext_elem_of_filter P Q l H1) as Hext.
apply filter_ext_elem_of.
intros.
specialize (Hext a H2).
by rewrite Hext; itauto.
- apply filter_ext_elem_of. intros.
specialize (ext_elem_of_filter _ _ l H1 a H2) as Hext; cbn in Hext.
by destruct (decide (P a)), (decide (Q a)); itauto.
Qed.
Lemma NoDup_elem_of_remove A (l l' : list A) a :
NoDup (l ++ a :: l') -> NoDup (l ++ l') /\ a ∉ l ++ l'.
Proof.
intros Hnda.
apply NoDup_app in Hnda.
destruct Hnda as [Hnd [Ha Hnda]].
apply NoDup_cons in Hnda.
setoid_rewrite elem_of_cons in Ha.
destruct Hnda as [Ha' Hnd']; split.
- by apply NoDup_app; firstorder.
- by rewrite elem_of_app; firstorder.
Qed.
Lemma list_lookup_lt [A] (is : list A) :
forall i, is_Some (is !! i) ->
forall j, j < i -> is_Some (is !! j).
Proof.
intros; apply lookup_lt_is_Some.
by etransitivity; [| apply lookup_lt_is_Some].
Qed.
Lemma list_difference_singleton_not_in `{EqDecision A} :
forall (l : list A) (a : A), a ∉ l ->
list_difference l [a] = l.
Proof.
intros l a; induction l; [done |].
rewrite not_elem_of_cons; intros [Hna0 Hnal]; cbn.
case_decide as Ha0; [by apply elem_of_list_singleton in Ha0 |].
by rewrite IHl.
Qed.
Lemma list_difference_singleton_length_in `{EqDecision A} :
forall (l : list A) (a : A), a ∈ l ->
length (list_difference l [a]) < length l.
Proof.
intros l a; induction l; cbn; [by inversion 1 |].
case_decide as Ha0; rewrite elem_of_list_singleton in Ha0.
- subst; intros _.
destruct (decide (a ∈ l)).
+ by etransitivity; [apply IHl | lia].
+ by rewrite list_difference_singleton_not_in; [lia |].
- by inversion 1; subst; [done |]; cbn; spec IHl; [| lia].
Qed.
Lemma longer_subseteq_has_dups `{EqDecision A} :
forall l1 l2 : list A, l1 ⊆ l2 -> length l1 > length l2 ->
exists (i1 i2 : nat) (a : A), i1 <> i2 /\ l1 !! i1 = Some a /\ l1 !! i2 = Some a.
Proof.
induction l1; [by inversion 2 |].
intros l2 Hl12 Hlen12.
destruct (decide (a ∈ l1)).
- exists 0.
apply elem_of_list_lookup_1 in e as [i2 Hi2].
by exists (S i2), a.
- edestruct (IHl1 (list_difference l2 [a]))
as (i1 & i2 & a' & Hi12 & Hli1 & Hli2); cycle 2.
+ by exists (S i1), (S i2), a'; cbn; itauto.
+ intros x Hx.
rewrite elem_of_list_difference, elem_of_list_singleton.
by split; [apply Hl12; right | by contradict n; subst].
+ cbn in Hlen12.
assert (Ha : a ∈ l2) by (apply Hl12; left).
by specialize (list_difference_singleton_length_in _ _ Ha) as Hlen'; lia.
Qed.
Lemma ForAllSuffix2_lookup [A : Type] (R : A -> A -> Prop) l
: ForAllSuffix2 R l <-> forall n a b, l !! n = Some a -> l !! (S n) = Some b -> R a b.
Proof.
split.
- induction 1; cbn; [by inversion 2 |].
destruct n as [| n']; cbn.
+ by destruct l; do 2 inversion 1; subst.
+ by intros; eapply IHForAllSuffix.
- induction l as [| a [| b l']]; cbn.
+ by constructor.
+ by repeat constructor.
+ constructor.
* by apply (H 0).
* by apply IHl; intro n; apply (H (S n)).
Qed.
Lemma stdpp_nat_le_sum (x y : nat) : x <= y <-> exists z, y = x + z.
Proof.
split.
- by exists (y - x); lia.
- by intros [z ->]; lia.
Qed.
Lemma ForAllSuffix2_transitive_lookup
[A : Type] (R : A -> A -> Prop) {HT : Transitive R} (l : list A)
: ForAllSuffix2 R l <-> forall m n a b, m < n -> l !! m = Some a -> l !! n = Some b -> R a b.
Proof.
rewrite ForAllSuffix2_lookup.
split; intro Hall; [| by intros n a b; apply Hall; lia].
intros m n a b Hlt.
apply stdpp_nat_le_sum in Hlt as [k ->]; rewrite Nat.add_comm.
revert a b; induction k; cbn; [by apply Hall |].
intros a b Ha Hb.
assert (Hlt : k + S m < length l) by (apply lookup_lt_Some in Hb; lia).
apply lookup_lt_is_Some in Hlt as [c Hc].
by transitivity c; [apply IHk | eapply Hall].
Qed.
(**
If the <<n>>-th element of <<l>> is <<x>>, then we can decompose long enough
suffixes of <<l>> into <<x>> and a suffix shorter by 1.
*)
Lemma lastn_length_cons :
forall {A : Type} (n : nat) (l : list A) (x : A),
l !! n = Some x -> lastn (length l - n) l = x :: lastn (length l - S n) l.
Proof.
intros A n l x H.
unfold lastn.
rewrite <- rev_length, <- !skipn_rev, rev_involutive.
by apply drop_S.
Qed.
Lemma list_subseteq_filter {A} P Q
`{forall (x : A), Decision (P x)} `{forall (x : A), Decision (Q x)} :
(forall a, P a -> Q a) ->
forall s : list A, filter P s ⊆ filter Q s.
Proof.
induction s; cbn; intros x Hin; [done |].
by destruct (decide (P a)), (decide (Q a)); cbn in *; rewrite ?elem_of_cons in *; itauto.
Qed.
Lemma filter_length_fn {A} P Q
`{forall (x : A), Decision (P x)} `{forall (x : A), Decision (Q x)}
s (Hfg : Forall (fun a => P a -> Q a) s) :
length (filter P s) <= length (filter Q s).
Proof.
induction s; simpl; [lia |].
inversion Hfg; subst. specialize (IHs H4).
rewrite 2 filter_cons.
by destruct (decide (P a)), (decide (Q a)); cbn; itauto lia.
Qed.
Lemma nth_error_filter
{A} P `{forall (x : A), Decision (P x)}
(l : list A)
(n : nat)
(a : A)
(Hnth : nth_error (filter P l) n = Some a)
: exists (nth : nat),
nth_error_filter_index P l n = Some nth
/\ nth_error l nth = Some a.
Proof.
generalize dependent a. generalize dependent n.
induction l.
- by intros []; cbn; inversion 1.
- intros. rewrite filter_cons in Hnth. simpl. destruct (decide (P a)).
+ destruct n.
* by inversion Hnth; subst; exists 0.
* simpl in Hnth.
specialize (IHl n a0 Hnth).
destruct IHl as [nth [Hnth' Ha0]].
exists (S nth).
by rewrite Hnth'.
+ specialize (IHl n a0 Hnth).
destruct IHl as [nth [Hnth' Ha0]].
exists (S nth).
by rewrite Hnth'.
Qed.
Lemma filter_subseteq {A} P `{forall (x : A), Decision (P x)} (s1 s2 : list A) :
s1 ⊆ s2 ->
filter P s1 ⊆ filter P s2.
Proof.
induction s1; intros; intro x; intros.
- by apply not_elem_of_nil in H1.
- rewrite filter_cons in H1.
destruct (decide (P a)).
+ rewrite elem_of_cons in H1.
destruct H1.
* subst; apply elem_of_list_filter.
by split; [| apply H0; left].
* apply IHs1; [| done].
by intros y Hel; apply H0; right.
+ apply IHs1; [| done].
by intros y Hel; apply H0; right.
Qed.
Lemma filter_subseteq_fn {A} P Q
`{forall (x : A), Decision (P x)} `{forall (x : A), Decision (Q x)} :
(forall a, P a -> Q a) ->
forall (s : list A), filter P s ⊆ filter Q s.
Proof.
induction s; cbn; intros x H2; [by inversion H2 |].
destruct (decide (P a)), (decide (Q a)); rewrite ?elem_of_cons in H2.
- by destruct H2 as [-> |]; [left | right; apply IHs].
- by itauto.
- by right; apply IHs.
- by itauto.
Qed.
Lemma Forall_filter_nil {A} P `{forall (x : A), Decision (P x)} l :
Forall (fun a : A => ~ P a) l <-> filter P l = [].
Proof.
rewrite Forall_forall.
split; intro Hnone.
- induction l; cbn; [done |].
setoid_rewrite elem_of_cons in Hnone.
by rewrite decide_False; auto.
- intros x Hel Px.
by eapply filter_nil_not_elem_of in Px.
Qed.
Lemma occurrences_ordering
{A : Type}
(a b : A)
(la1 la2 lb1 lb2 : list A)
(Heq : la1 ++ a :: la2 = lb1 ++ b :: lb2)
(Ha : a ∉ b :: lb2)
: exists lab : list A, lb1 = la1 ++ a :: lab.
Proof.
generalize dependent lb2. generalize dependent la2.
generalize dependent b. generalize dependent lb1.
generalize dependent a.
induction la1; intros; destruct lb1 as [| b0 lb1]; simpl in *
; inversion Heq; subst.
- by contradict Ha; left.
- by exists lb1.
- by contradict Ha; rewrite elem_of_cons, elem_of_app, elem_of_cons; auto.
- specialize (IHla1 a0 lb1 b la2 lb2 H1 Ha).
destruct IHla1 as [la0b Hla0b].
by exists la0b; subst.
Qed.
Lemma list_max_elem_of_exists
(l : list nat)
(nz : list_max l > 0) :
list_max l ∈ l.
Proof.
induction l; simpl in *; [lia |].
rewrite elem_of_cons.
by destruct (Nat.max_spec_le a (list_max l)) as [[H ->] | [H ->]]; itauto lia.
Qed.
Lemma omap_subseteq
{A B : Type}
(f : A -> option B)
(l1 l2 : list A)
(Hincl : l1 ⊆ l2)
: omap f l1 ⊆ omap f l2.
Proof.
by intros b; rewrite !elem_of_list_omap; firstorder.
Qed.
Lemma elem_of_cat_option
{A : Type}
(l : list (option A))
(a : A)
: a ∈ cat_option l <-> exists b : option A, b ∈ l /\ b = Some a.
Proof.
by apply elem_of_list_omap.
Qed.
Lemma list_max_elem_of_exists2
(l : list nat)
(Hne : l <> []) :
list_max l ∈ l.
Proof.
destruct (list_max l) eqn: eq_max.
- destruct l; [by itauto congruence |].
specialize (list_max_le (n :: l) 0) as Hle.
destruct Hle as [Hle _].
rewrite eq_max in Hle. spec Hle. apply Nat.le_refl.
rewrite Forall_forall in Hle.
specialize (Hle n). spec Hle. left.
assert (Hn0 : n = 0) by lia.
by rewrite Hn0; left.
- specialize (list_max_elem_of_exists l) as Hmax.
by rewrite <- eq_max; itauto lia.
Qed.
Lemma mode_not_empty
`{EqDecision A}
(l : list A)
(Hne : l <> []) :
mode l <> [].
Proof.
destruct l; [done |].
remember (a :: l) as l'.
remember (List.map (count_occ decide_eq l') l') as occurrences.
assert (Hmaxp : list_max occurrences > 0). {
rewrite Heqoccurrences, Heql'; cbn.
by rewrite decide_True; [lia |].
}
assert (exists a, (count_occ decide_eq l' a) = list_max occurrences). {
assert (list_max occurrences ∈ occurrences).
{
apply list_max_exists.
by destruct occurrences; [cbn in Hmaxp; lia |].
}
rewrite Heqoccurrences, elem_of_list_fmap in H.
destruct H as (x & Heq & Hin).
by rewrite Heqoccurrences; eauto.
}
assert (exists a, a ∈ mode l'). {
destruct H.
exists x.
unfold mode.
apply elem_of_list_filter.
specialize (count_occ_In decide_eq l' x); rewrite <- elem_of_list_In.
by itauto congruence.
}
intros contra; rewrite contra in H0.
destruct H0 as [? H0].
by apply elem_of_nil in H0.
Qed.
(**
When a list contains two elements, either they are equal or we can split
the list into three parts separated by the elements (and this can be done
in two ways, depending on the order of the elements).
*)
Lemma elem_of_list_split_2 :
forall {A : Type} (l : list A) (x y : A),
x ∈ l -> y ∈ l ->
x = y \/ exists l1 l2 l3 : list A,
l = l1 ++ x :: l2 ++ y :: l3 \/ l = l1 ++ y :: l2 ++ x :: l3.
Proof.
intros A x y l Hx Hy.
apply elem_of_list_split in Hx as (l1 & l2 & ->).
rewrite elem_of_app, elem_of_cons in Hy.
destruct Hy as [Hy | [-> | Hy]]; [| by left |].
- apply elem_of_list_split in Hy as (l11 & l12 & ->).
right; exists l11, l12, l2; right; cbn.
by rewrite <- app_assoc.
- apply elem_of_list_split in Hy as (l21 & l22 & ->).
by right; exists l1, l21, l22; left; cbn.
Qed.
Lemma mjoin_app {A} (l1 l2 : list (list A)) :
mjoin (l1 ++ l2) = mjoin l1 ++ mjoin l2.
Proof.
induction l1; cbn; [done |].
replace (mjoin (l1 ++ l2)) with (mjoin l1 ++ mjoin l2).
by rewrite app_assoc.
Qed.
Lemma mbind_app `(f : A -> list B) (l1 l2 : list A) :
mbind f (l1 ++ l2) = mbind f l1 ++ mbind f l2.
Proof. by induction l1; [| cbn; rewrite IHl1, app_assoc]. Qed.
Lemma mbind_nils :
forall {A B : Type} (f : A -> list B) (l : list A),
Forall (fun x : A => f x = []) l ->
mbind f l = [].
Proof.
induction 1; cbn; [done |].
by rewrite H, IHForall; cbn.
Qed.
Lemma list_subseteq_inv_app :
forall {A : Type} (l1 l2 l3 : list A),
l1 ++ l2 ⊆ l3 -> l1 ⊆ l3 /\ l2 ⊆ l3.
Proof.
unfold subseteq, list_subseteq.
intros A l1 l2 l3 Hsub.
split; intros x Hin.
- by apply Hsub, elem_of_app; left.
- by apply Hsub, elem_of_app; right.
Qed.
#[export] Instance sum_list_with_proper `(f : index -> nat) :
Proper ((≡ₚ) ==> (=)) (sum_list_with f).
Proof.
induction 1; cbn; [done | ..].
- by rewrite IHPermutation.
- by lia.
- by congruence.
Qed.
Lemma sum_list_with_ext_forall index (f g : index -> nat) (l : list index) :
(forall (i : index), i ∈ l -> f i = g i) ->
sum_list_with f l = sum_list_with g l.
Proof.
induction l; cbn; intros Heq; [done |].
rewrite Heq by left.
rewrite IHl; [done |].
by intros; apply Heq; right.
Qed.
Lemma sum_list_with_zero `(f : index -> nat) (l : list index) :
sum_list_with f l = 0 <-> forall (i : index), i ∈ l -> f i = 0.
Proof.
split.
- intros Hsum i Hi.
apply sum_list_with_in with (f := f) in Hi.
by lia.
- induction l; intros Hall; cbn; [done |].
rewrite Hall by left.
rewrite IHl; [done |].
by intros; apply Hall; right.
Qed.
Lemma dsig_NoDup_map `(P : A -> Prop) `{Pdec : forall a, Decision (P a)} :
forall (l : list (dsig P)),
NoDup l <-> NoDup (map proj1_sig l).
Proof.
split.
- induction 1 as [| da dl Hda]; cbn; constructor; [| done].
rewrite elem_of_list_fmap.
intros (_da & Heq & H_da).
by apply dsig_eq in Heq as <-.
- induction l; cbn; [by constructor |].
rewrite !NoDup_cons.
intros [Ha ?]; split; [| by apply IHl].
by contradict Ha; apply elem_of_list_fmap; eexists.
Qed.
Lemma is_Some_proj_elim {A : Type}
(m : option A) (Hsome : is_Some m) (f : A) (H : m = Some f) :
is_Some_proj Hsome = f.
Proof. by intros; subst. Qed.
Definition set_Forall2 `{ElemOf A C} (R : relation A) (X : C) :=
forall x y : A, x ∈ X -> y ∈ X -> x <> y -> R x y.
Definition set_Exists2 `{ElemOf A C} (R : relation A) (X : C) :=
exists x y : A, x ∈ X /\ y ∈ X /\ x <> y /\ R x y.
Section sec_Forall2_Exists2_props.
Context
`{SemiSet A C}
(R : relation A)
.
Lemma set_Forall2_empty : set_Forall2 R (∅ : C).
Proof. by unfold set_Forall2; set_solver. Qed.
Lemma set_Forall2_singleton (x : A) : set_Forall2 R ({[ x ]} : C).
Proof. by unfold set_Forall2; set_solver. Qed.
Lemma set_Forall2_pair (x y : A) :
x <> y -> set_Forall2 R ({[ x; y ]} : C) <-> R x y /\ R y x.
Proof. by unfold set_Forall2; set_solver. Qed.
Lemma set_Forall2_union (X Y : C) :
set_Forall2 R X -> set_Forall2 R Y ->
(forall x y : A, x ∈ X -> y ∈ Y -> x <> y -> R x y /\ R y x) ->
set_Forall2 R (X ∪ Y).
Proof. by unfold set_Forall2; set_solver. Qed.
Lemma set_Forall2_union_inv_1 (X Y : C) :
set_Forall2 R (X ∪ Y) -> set_Forall2 R X.
Proof. by unfold set_Forall2; set_solver. Qed.
Lemma set_Forall2_union_inv_2 (X Y : C) :
set_Forall2 R (X ∪ Y) -> set_Forall2 R Y.
Proof. by unfold set_Forall2; set_solver. Qed.
Lemma set_Exists2_empty : ~ set_Exists2 R (∅ : C).
Proof. by unfold set_Exists2; set_solver. Qed.
Lemma set_Exists2_singleton x : ~ set_Exists2 R ({[ x ]} : C).
Proof. by unfold set_Exists2; set_solver. Qed.
Lemma set_Exists2_pair (x y : A) :
set_Exists2 R ({[ x; y ]} : C) <-> x <> y /\ (R x y \/ R y x).
Proof.
split; [by unfold set_Exists2; set_solver |].
intros [? []].
- by exists x, y; set_solver.
- by exists y, x; set_solver.
Qed.
Lemma set_Exists2_union_1 (X Y : C) :
set_Exists2 R X -> set_Exists2 R (X ∪ Y).
Proof. by intros [x [y Hxy]]; exists x, y; set_solver. Qed.
Lemma set_Exists2_union_2 (X Y : C) :
set_Exists2 R Y -> set_Exists2 R (X ∪ Y).
Proof. by intros [x [y Hxy]]; exists x, y; set_solver. Qed.
Lemma set_Exists2_union_3 (X Y : C) (x y : A) :
x ∈ X -> y ∈ Y -> x <> y -> R x y -> set_Exists2 R (X ∪ Y).
Proof. by exists x, y; set_solver. Qed.
Lemma set_Exists2_union_4 (X Y : C) (x y : A) :
x ∈ X -> y ∈ Y -> x <> y -> R y x -> set_Exists2 R (X ∪ Y).
Proof. by intros; exists y, x; set_solver. Qed.
Lemma set_Exists2_union_inv (X Y : C) :
set_Exists2 R (X ∪ Y) ->
set_Exists2 R X \/ set_Exists2 R Y \/
exists x y : A, x ∈ X /\ y ∈ Y /\ x <> y /\ (R x y \/ R y x).
Proof.
intros (x & y & Hx & Hy & Hneq & Hxy).
apply elem_of_union in Hx as [], Hy as [].
- by left; exists x, y.
- by right; right; exists x, y; repeat split; [.. | left].
- by right; right; exists y, x; repeat split; [.. | right].
- by right; left; exists x, y.
Qed.
End sec_Forall2_Exists2_props.