Eliminating impossible branches in Coq dependent pattern matching
I’m having troubles with understanding pattern matching on dependent types. Let’s say we have following code:
I’m having troubles with understanding pattern matching on dependent types. Let’s say we have following code: