Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Mixed connectives
pm3.1
Next ⟩
pm3.11
Metamath Proof Explorer
Ascii
Unicode
Theorem
pm3.1
Description:
Theorem *3.1 of
WhiteheadRussell
p. 111.
(Contributed by
NM
, 3-Jan-2005)
Ref
Expression
Assertion
pm3.1
⊢
φ
∧
ψ
→
¬
¬
φ
∨
¬
ψ
Proof
Step
Hyp
Ref
Expression
1
anor
⊢
φ
∧
ψ
↔
¬
¬
φ
∨
¬
ψ
2
1
biimpi
⊢
φ
∧
ψ
→
¬
¬
φ
∨
¬
ψ