Skip to content

[ deprecate ] names for deMorgan lemmas in Data.Fin.Properties #2837

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.

Sign up for GitHub

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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

[ deprecate ] names for deMorgan lemmas in Data.Fin.Properties #2837

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
6 changes: 6 additions & 0 deletions CHANGELOG.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -46,6 +46,12 @@ Deprecated names
interchange ↦ medial
```

* In `Data.Fin.Properties`:
```agda
¬∀⟶∃¬-smallest ↦ ¬∀⇒∃¬-smallest
¬∀⟶∃¬- ↦ ¬∀⇒∃¬
```

New modules
-----------

Expand Down
25 changes: 19 additions & 6 deletions src/Data/Fin/Properties.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1052,20 +1052,20 @@ private
-- If a decidable predicate P over a finite set is sometimes false,
-- then we can find the smallest value for which this is the case.

¬∀⟶∃¬-smallest : ∀ n {p} (P : Pred (Fin n) p) → Decidable P →
¬∀⇒∃¬-smallest : ∀ n {p} (P : Pred (Fin n) p) → Decidable P →
¬ (∀ i → P i) → ∃ λ i → ¬ P i × ((j : Fin′ i) → P (inject j))
¬∀⟶∃¬-smallest zero P P? ¬∀P = contradiction (λ()) ¬∀P
¬∀⟶∃¬-smallest (suc n) P P? ¬∀P with P? zero
¬∀⇒∃¬-smallest zero P P? ¬∀P = contradiction (λ()) ¬∀P
¬∀⇒∃¬-smallest (suc n) P P? ¬∀P with P? zero
... | false because [¬P₀] = (zero , invert [¬P₀] , λ ())
... | true because [P₀] = map suc (map id (∀-cons (invert [P₀])))
(¬∀⟶∃¬-smallest n (P ∘ suc) (P? ∘ suc) (¬∀P ∘ (∀-cons (invert [P₀]))))
(¬∀⇒∃¬-smallest n (P ∘ suc) (P? ∘ suc) (¬∀P ∘ (∀-cons (invert [P₀]))))

-- When P is a decidable predicate over a finite set the following
-- lemma can be proved.

¬∀⟶∃¬ : ∀ n {p} (P : Pred (Fin n) p) → Decidable P →
¬∀⇒∃¬ : ∀ n {p} (P : Pred (Fin n) p) → Decidable P →
¬ (∀ i → P i) → (∃ λ i → ¬ P i)
¬∀⟶∃¬ n P P? ¬P = map id proj₁ (¬∀⟶∃¬-smallest n P P? ¬P)
¬∀⇒∃¬ n P P? ¬P = map id proj₁ (¬∀⇒∃¬-smallest n P P? ¬P)

------------------------------------------------------------------------
-- Properties of functions to and from Fin
Expand Down Expand Up @@ -1277,3 +1277,16 @@ Please use <⇒<′ instead."
"Warning: <′⇒≺ was deprecated in v2.0.
Please use <′⇒< instead."
#-}

-- Version 2.4

¬∀⟶∃¬-smallest = ¬∀⇒∃¬-smallest
{-# WARNING_ON_USAGE ¬∀⟶∃¬-smallest
"Warning: ¬∀⟶∃¬-smallest was deprecated in v2.4.
Please use ¬∀⇒∃¬-smallest instead."
#-}
¬∀⟶∃¬ = ¬∀⇒∃¬
{-# WARNING_ON_USAGE ¬∀⟶∃¬
"Warning: ¬∀⟶∃¬ was deprecated in v2.4.
Please use ¬∀⇒∃¬ instead."
#-}