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

Theorem nannan 1526
Description: Nested alternative denials. (Contributed by Jeff Hoffman, 19-Nov-2007.) (Proof shortened by Wolf Lammen, 26-Jun-2020.)
Assertion
Ref Expression
nannan ((𝜑 ⊼ (𝜓 ⊼ 𝜒)) ↔ (𝜑 → (𝜓 ∧ 𝜒)))

Proof of Theorem nannan
StepHypRef Expression
1 dfnan2 1523 . 2 ((𝜑 ⊼ (𝜓 ⊼ 𝜒)) ↔ (𝜑 → ¬ (𝜓 ⊼ 𝜒)))
2 nanan 1522 . . 3 ((𝜓 ∧ 𝜒) ↔ ¬ (𝜓 ⊼ 𝜒))
32imbi2i 339 . 2 ((𝜑 → (𝜓 ∧ 𝜒)) ↔ (𝜑 → ¬ (𝜓 ⊼ 𝜒)))
41, 3bitr4i 281 1 ((𝜑 ⊼ (𝜓 ⊼ 𝜒)) ↔ (𝜑 → (𝜓 ∧ 𝜒)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ⊼ wnan 1520
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-nan 1521
This theorem is used by:  nanim  1527  nanbi  1529  nanass  1539  nic-mp  1703  nic-ax  1705  waj-ax  37295  lukshef-ax2  37296  arg-ax  37297
  Copyright terms: Public domain W3C validator