Created
June 21, 2020 20:39
-
-
Save JakobBruenker/74ae7747632a3e7a02222dd1771ba6ab to your computer and use it in GitHub Desktop.
Equality of Pairs
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| open import Agda.Builtin.Sigma | |
| open import Agda.Builtin.Equality | |
| lemma : ∀ {a b} {A : Set a} {B : A → Set b} {x x' : A} {p p' : B} | |
| → (x , p) ≡ (x' , p') → ((x ≡ x') , (p ≡ p')) | |
| lemma = ? | |
| {- | |
| Checking Test (/home/user/agda/combinators/Test.agda). | |
| /home/user/agda/combinators/Test.agda:4,64-65 | |
| A → Set b should be a sort, but it isn't | |
| when checking that the expression B has type _6 | |
| -} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment