SQL ( ∀x / p→q ) & Discrete Mathematics

( ∀x) P ≡ ¬(∃x(¬P))

$(\forall x)P\equiv \neg (\exists x(\neg P))$

$(\forall x)P \equiv \neg (\exists x(\neg P))$

全称量词 Universal Quantifier $\forall :$
$\forall xP(x)⟺P(x)$ for all values of $x$ in the (restricted) domain

存在量词 Existential Quantifier $\exists :$
$\exists xP(x)⟺$ There exists (at least) an element $x$ in the domain such that $P(x)$

德·摩根定律 De Morgan’s Laws for quantifiers:
$\neg \forall xP(x)\equiv \exists x\neg P(x)$

---

p→q ≡ ¬p∨q

$p\to q\equiv \neg p\vee q$

$p \rightarrow q \equiv \neg p \vee q$

蕴涵定律 Implication Law:
$p\to q\equiv \neg p\vee q$

---

REF: https://blog.csdn.net/liteng607/article/details/104649755