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

Theorem bianfi 536
Description: A wff conjoined with falsehood is false. (Contributed by NM, 21-Jun-1993.) (Proof shortened by Wolf Lammen, 26-Nov-2012.)
Hypothesis
Ref Expression
bianfi.1 ¬ 𝜑
Assertion
Ref Expression
bianfi (𝜑 ↔ (𝜓𝜑))

Proof of Theorem bianfi
StepHypRef Expression
1 bianfi.1 . 2 ¬ 𝜑
21intnan 489 . 2 ¬ (𝜓𝜑)
31, 22false 378 1 (𝜑 ↔ (𝜓𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wa 398
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 209  df-an 399
This theorem is referenced by:  in0  4343  opthprc  5609  ind1a  31271
  Copyright terms: Public domain W3C validator