Let [tex]\varphi[/tex] and [tex]\psi[/tex] both be formulae, and let [tex]\Gamma[/tex] be a set of formulae.(adsbygoogle = window.adsbygoogle || []).push({});

If [tex]\Gamma \cup \{\varphi\} \models \psi[/tex], then [tex]\Gamma \models (\varphi \rightarrow \psi)[/tex]

This is the principle by which the rule of inference known as Conditional Introduction is justified, but I cannot seem to find a proof for it, though the claim in the text is that it is an easy proof. Does anybody know what the proof is?

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Proof of the Deduction Principle

Loading...

Similar Threads - Proof Deduction Principle | Date |
---|---|

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

I Cantor's decimal proof that (0,1) is uncountable | Sep 27, 2017 |

A A "Proof Formula" for all maths or formal logic? | Apr 19, 2017 |

I Regarding Cantor's diagonal proof. | Feb 28, 2017 |

I Proof to the Expression of Poisson Distribution | Oct 7, 2016 |

**Physics Forums - The Fusion of Science and Community**