Universal Generalisation/Proof System

Theorem

Let $\LL$ be a specific signature for the language of predicate logic.

Let $\mathscr H$ be Hilbert proof system instance 1 for predicate logic.


Let $\map {\mathbf A} x$ be a WFF of $\LL$.

Let $\FF$ be a collection of WFFs of $\LL$.


Let $c$ be an arbitrary constant symbol which is not in $\LL$.

Let $\LL'$ be the signature $\LL$ extended with the constant symbol $c$.


Suppose that we have the provable consequence (in $\LL'$):

$\FF \vdash_{\mathscr H} \map {\mathbf A} c$

Then we may infer (in $\LL$):

$\FF \vdash_{\mathscr H} \forall x: \map {\mathbf A} x$


Proof


Work In Progress
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by completing it.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{WIP}} from the code.


Sources

  • 2009: Kenneth Kunen: The Foundations of Mathematics ... (previous) ... (next): $\text{II}.11$ Some Strategies for Constructing Proofs: Lemma $\text{II}.11.8$: Quantifier Rules (result statement)
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.