Theorem 2.13.1 #13

Closed
opened 2024-04-25 13:28:05 +00:00 by michael · 2 comments
Owner

For all m, n : N we have (m = n) ≃ \texttt{code}(m, n).

For all $m, n : N$ we have $(m = n) ≃ \texttt{code}(m, n)$.
Author
Owner

This proof in the book:

image

not sure how the third line transitions to the fourth line

This proof in the book: ![image](/attachments/fdbb5132-3248-4773-9378-34793ca0471c) not sure how the third line transitions to the fourth line
michael added this to the (deleted) project 2024-04-25 13:44:15 +00:00
michael modified the project from (deleted) to research 2024-05-24 01:34:36 +00:00
Author
Owner

solved by lemma 2.3.10

solved by lemma 2.3.10
Sign in to join this conversation.
No milestone
No project
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference: michael/type-theory#13
No description provided.