13901 | Predicate logic uses propositional connectives and variables, plus new introduction and elimination rules [Lemmon] |
13903 | Universal elimination if you start with the universal, introduction if you want to end with it [Lemmon] |
13906 | With finite named objects, we can generalise with &-Intro, but otherwise we need ∀-Intro [Lemmon] |
13907 | If you pick an arbitrary triangle, things proved of it are true of all triangles [Lemmon] |
13904 | Universal Elimination (UE) lets us infer that an object has F, from all things having F [Lemmon] |
13908 | UE all-to-one; UI one-to-all; EI arbitrary-to-one; EE proof-to-one [Lemmon] |