Skip to content

[Refractor] contradiction over ⊥-elim in ¬¬-pull def #2659

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

Merged
jamesmckinna merged 3 commits into from
Mar 15, 2025
Merged

[Refractor] contradiction over ⊥-elim in ¬¬-pull def #2659

Changes from 2 commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
37158c5
[Refractor] contradiction over ⊥-elim in ¬¬-pull def
jmougeot Mar 12, 2025
eceed78
remove bot/elim
jmougeot Mar 12, 2025
0cce3f7
Update src/Relation/Nullary/Universe.agda
jamesmckinna Mar 15, 2025
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: 3 additions & 3 deletions src/Relation/Nullary/Universe.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,14 +12,14 @@ open import Data.Sum.Base as Sum hiding (map)
open import Data.Sum.Relation.Binary.Pointwise using (_⊎ₛ_; inj₁; inj₂)
open import Data.Product.Base as Product hiding (map)
open import Data.Product.Relation.Binary.Pointwise.NonDependent using (_×ₛ_)
open import Data.Empty using (⊥; ⊥-elim)
open import Data.Empty using (⊥)
open import Effect.Applicative using (RawApplicative)
open import Effect.Monad using (RawMonad)
open import Function.Base using (_∘_; id)
open import Function.Indexed.Relation.Binary.Equality using (≡-setoid)
open import Level using (Level; _⊔_; suc; Lift; lift; lower)
open import Relation.Nullary.Negation
using (¬_; ¬¬-Monad; ¬¬-map; negated-stable)
using (¬_; ¬¬-Monad; ¬¬-map; negated-stable; contradiction)
open import Relation.Binary.Core using (Rel)
open import Relation.Binary.Bundles using (Setoid)
import Relation.Binary.Construct.Always as Always using (setoid)
Expand Down Expand Up @@ -123,7 +123,7 @@ private
⟦ F ⟧ (¬ ¬ P) → ¬ ¬ ⟦ F ⟧ P
¬¬-pull = sequence rawApplicative
(λ f → f lower)
(λ f g → g (λ x → ⊥-elim (f x (λ y → g (λ _ → y)))))
(λ f g → g (λ x → contradiction (λ y → g (λ _ → y)) (f x)))

¬¬-remove : ∀ {p} (F : PropF p) {P} →
¬ ¬ ⟦ F ⟧ (¬ ¬ P) → ¬ ¬ ⟦ F ⟧ P
Expand Down