Skip to content

Removing lemmas #79

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
wants to merge 19 commits into
base: master
Choose a base branch
from
Draft
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 0 additions & 7 deletions theories/VLSM/Lib/FinExtras.v
Original file line number Diff line number Diff line change
Expand Up @@ -11,13 +11,6 @@ Fixpoint up_to_n_listing
| S n' => n' :: up_to_n_listing n'
end.

Lemma up_to_n_listing_length
(n : nat)
: length (up_to_n_listing n) = n.
Proof.
induction n; simpl; congruence.
Qed.

Lemma up_to_n_full
(n : nat)
: forall i, i < n <-> i ∈ up_to_n_listing n.
Expand Down
9 changes: 0 additions & 9 deletions theories/VLSM/Lib/FinFunExtras.v
Original file line number Diff line number Diff line change
Expand Up @@ -68,13 +68,4 @@ Proof.
by destruct a;simpl;congruence.
Qed.

Lemma right_finite
(sum_finite : Listing sum_listing)
: Listing (right_listing sum_finite).
Proof.
revert sum_finite.
apply map_option_listing with (g:=inr); [| done].
by destruct a;simpl;congruence.
Qed.

End sum_listing.
Loading