Skip to content
Snippets Groups Projects
Commit cac67ba3 authored by Ralf Jung's avatar Ralf Jung
Browse files

shorter proof by Robbert

parent 42981d63
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
Showing
with 3 additions and 7 deletions
iris/algebra/big_op.v
+ 3
− 7
View file @ cac67ba3
...@@ -484,14 +484,10 @@ Section gset. ...@@ -484,14 +484,10 @@ Section gset.
NoDup l → NoDup l →
([^o set] x ∈ list_to_set l, f x) ≡ [^o list] x ∈ l, f x. ([^o set] x ∈ list_to_set l, f x) ≡ [^o list] x ∈ l, f x.
Proof. Proof.
induction l as [|x l IHl]; intros Hnodup. induction 1 as [|x l ?? IHl].
- rewrite big_opS_empty //. - rewrite big_opS_empty //.
- inversion Hnodup; subst; clear Hnodup. - rewrite /= big_opS_union; last set_solver.
rewrite /= big_opS_union; last first. by rewrite big_opS_singleton IHl.
{ rewrite disjoint_singleton_l.
rewrite elem_of_list_to_set //. }
rewrite big_opS_singleton.
f_equiv. apply IHl; auto.
Qed. Qed.
End gset. End gset.
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment