I'm still bitter about "De Morgan's Laws". There are two of them:
1. If two things are not both true, then one or more of them is false.
2. If neither of two things is true, then both of them are false.
Of course this is obvious to everyone. Writing it down did not merit having it named after yourself. I guarantee many other people had also written it down earlier.
But for an even more obvious theorem that was actually difficult to prove (Rolle's theorem isn't), see https://en.wikipedia.org/wiki/Jordan_curve_theorem
("Any path which begins in the interior of a closed curve, and ends in the exterior of the same curve, must cross the curve at some point.")
"The first formal proof of the Jordan curve theorem was created by Hales in the HOL Light system, in January 2005, and contained about 60,000 lines. Another rigorous 6,500-line formal proof was produced in 2005 by an international team of mathematicians using the Mizar system. Both the Mizar and the HOL Light proof rely on libraries of previously proved theorems, so these two sizes are not comparable."
The title of this paper is not misleading at all. They basically just reinvented Riemann sum in 1994.
And you can bet a lot of node developers will get tripped up by those if they need to simplfy or rewrite an if statement
It's "obvious" but not so much (especially for the time), and shows the importance of publishing (formalizing and adding your name) to things that might be obvious but maybe not
If you had to squint at it and turn that into P(B|A) = P(A & B) / P(A), you'd realize that you can simply multiply the top and bottom by P(A), then pull out the remaining P(A)/P(B).
P(A & B) / P(B)
= P(A & B) * P(A) / (P(A) * P(B))
= P(A & B) / P(A) * P(A) / P(B)
= P(B | A) * P(A) / P(B).To wit, what you stated is not De Morgan's law.
> De Morgan is given credit for stating the laws in the terms of modern formal logic, and incorporating them into the language of logic