MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nanor Structured version   Visualization version   GIF version

Theorem nanor 1525
Description: Alternative denial in terms of disjunction and negation. This explains the name "alternative denial". (Contributed by BJ, 19-Oct-2022.)
Assertion
Ref Expression
nanor ((𝜑 ⊼ 𝜓) ↔ (¬ 𝜑 ∨ ¬ 𝜓))

Proof of Theorem nanor
StepHypRef Expression
1 df-nan 1522 . 2 ((𝜑 ⊼ 𝜓) ↔ ¬ (𝜑 ∧ 𝜓))
2 ianor 997 . 2 (¬ (𝜑 ∧ 𝜓) ↔ (¬ 𝜑 ∨ ¬ 𝜓))
31, 2bitri 278 1 ((𝜑 ⊼ 𝜓) ↔ (¬ 𝜑 ∨ ¬ 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∨ wo 861   ⊼ wnan 1521
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 402  df-or 862  df-nan 1522
This theorem is used by:  elnanelprv  36173  wl-df3maxtru1  38395
  Copyright terms: Public domain W3C validator