HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem mtbird 537
Description: A deduction from a biconditional, similar to modus tollens.
Hypotheses
Ref Expression
mtbird.min |- (ph -> -. ch)
mtbird.maj |- (ph -> (ps <-> ch))
Assertion
Ref Expression
mtbird |- (ph -> -. ps)

Proof of Theorem mtbird
StepHypRef Expression
1 mtbird.min . 2 |- (ph -> -. ch)
2 mtbird.maj . . 3 |- (ph -> (ps <-> ch))
32biimpd 135 . 2 |- (ph -> (ps -> ch))
41, 3mtod 95 1 |- (ph -> -. ps)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127
This theorem is referenced by:  php 3409  onomeneq 3414  rankr1 3518  cardnn 3631  cardaleph 3690  addnidpi 3822  zbtwnre 4619  znnenlem 4929  strlem1 5691
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128
metamath.org