547 - Proving trans using ≡-Reasoning is circular
This commit is contained in:
parent
8c9782d9b6
commit
40b63478ba
1 changed files with 8 additions and 0 deletions
|
@ -268,6 +268,14 @@ simplifies to a chain of applications of `trans` that ends in `trans e
|
|||
refl`, where `e` is a term that proves some equality, even though `e`
|
||||
alone would do.
|
||||
|
||||
#### Exercise `trans` and `≡-Reasoning` (practice)
|
||||
|
||||
Sadly, we cannot use the definition of trans' using ≡-Reasoning as the definition
|
||||
for trans. Can you see why? (Hint: look at the definition of `_≡⟨_⟩_`)
|
||||
|
||||
```
|
||||
-- Your code goes here
|
||||
```
|
||||
|
||||
## Chains of equations, another example
|
||||
|
||||
|
|
Loading…
Reference in a new issue