( ∀x) P ≡ ¬(∃x(¬P))
( ∀ x ) P ≡ ¬ ( ∃ x ( ¬ P ) ) (\forall x)P \equiv \neg (\exists x(\neg P)) (∀x)P≡¬(∃x(¬P))
$(\forall x)P \equiv \neg (\exists x(\neg P))$
全称量词 Universal Quantifier
∀
:
\forall :
∀:
∀
x
P
(
x
)
⟺
P
(
x
)
\forall xP(x) \iff P(x)
∀xP(x)⟺P(x) for all values of
x
x
x in the (restricted) domain
存在量词 Existential Quantifier
∃
:
\exist:
∃:
∃
x
P
(
x
)
⟺
\exist xP(x) \iff
∃xP(x)⟺ There exists (at least) an element
x
x
x in the domain such that
P
(
x
)
P(x)
P(x)
德·摩根定律 De Morgan’s Laws for quantifiers:
¬
∀
x
P
(
x
)
≡
∃
x
¬
P
(
x
)
\neg \forall xP(x) \equiv \exist x \neg P(x)
¬∀xP(x)≡∃x¬P(x)
p→q ≡ ¬p∨q
p → q ≡ ¬ p ∨ q p \rightarrow q \equiv \neg p \vee q p→q≡¬p∨q
$p \rightarrow q \equiv \neg p \vee q$
蕴涵定律 Implication Law:
p
→
q
≡
¬
p
∨
q
p→q≡¬p∨q
p→q≡¬p∨q
REF: https://blog.csdn.net/liteng607/article/details/104649755