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

Theorem sylnbi 333
Description: A mixed syllogism inference from a biconditional and an implication. Useful for substituting an antecedent with a definition. (Contributed by Wolf Lammen, 16-Dec-2013.)
Hypotheses
Ref Expression
sylnbi.1 (𝜑 ↔ 𝜓)
sylnbi.2 (¬ 𝜓 → 𝜒)
Assertion
Ref Expression
sylnbi (¬ 𝜑 → 𝜒)

Proof of Theorem sylnbi
StepHypRef Expression
1 sylnbi.1 . . 3 (𝜑 ↔ 𝜓)
21notbii 323 . 2 (¬ 𝜑 ↔ ¬ 𝜓)
3 sylnbi.2 . 2 (¬ 𝜓 → 𝜒)
42, 3sylbi 220 1 (¬ 𝜑 → 𝜒)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209
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
This theorem is used by:  sylnbir  334  reuun2  4273  opswap  6243  iotanul  6537  riotaund  7439  ndmovcom  7632  suppssov1  8242  suppssov2  8243  suppssfv  8247  brtpos  8280  ranklim  9885  rankuni  9906  setrec2lem1  10001  ituniiun  10527  hashprb  14568  1mavmul  22893  nonbooli  32283  disjunsn  33260  onvf1odlem4  36034  bj-rest10b  38201  disjrnmpt2  46408  ndmaovcl  48478  ndmaovcom  48480  lindslinindsimp1  49774  lmdfval  51037  cmdfval  51038
  Copyright terms: Public domain W3C validator