User loginNavigation 
Other free theoremsGiven, f : ∀a:*. a → a → a we can take a = {x,y} to show that for a particular x,y, either: f x y = x, or f x y = y My question is how to formally reason that f is uniformly defined by one of those equations. What property of f is needed? Informally, it's easy to reason that there is nothing f could branch on, but I don't see how to generalize. Thanks By Matt M at 20111022 19:51  LtU Forum  previous forum topic  next forum topic  other blogs  4887 reads

Browse archives
Active forum topics 
Recent comments
2 days 15 hours ago
3 days 14 hours ago
4 days 17 hours ago
6 days 14 hours ago
1 week 1 day ago
1 week 1 day ago
1 week 1 day ago
1 week 1 day ago
2 weeks 4 days ago
3 weeks 19 hours ago