Theorem xornan2 1549

Description: XOR implies NAND (written with the ⊼ connector). (Contributed by BJ, 19-Apr-2019.)

Assertion

Ref	Expression
xornan2	⊢ ((𝜑 ⊻ 𝜓) → (𝜑 ⊼ 𝜓))

Proof of Theorem xornan2

Step	Hyp	Ref	Expression
1		xornan 1548	. 2 ⊢ ((𝜑 ⊻ 𝜓) → ¬ (𝜑 ∧ 𝜓))
2		df-nan 1521	. 2 ⊢ ((𝜑 ⊼ 𝜓) ↔ ¬ (𝜑 ∧ 𝜓))
3	1, 2	sylibr 237	1 ⊢ ((𝜑 ⊻ 𝜓) → (𝜑 ⊼ 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   ⊼ wnan 1520   ⊻ wxo 1540

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-nan 1521  df-xor 1541

This theorem is used by: (None)