NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  mpand Unicode version

Theorem mpand 656
Description: A deduction based on modus ponens. (Contributed by NM, 12-Dec-2004.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)
Hypotheses
Ref Expression
mpand.1
mpand.2
Assertion
Ref Expression
mpand

Proof of Theorem mpand
StepHypRef Expression
1 mpand.1 . 2
2 mpand.2 . . 3
32ancomsd 440 . 2
41, 3mpan2d 655 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wa 358
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 177  df-an 360
This theorem is referenced by:  mpani  657  mp2and  660  ecase2d  906  peano5  4409  sfinltfin  4535  vfinspss  4551  fvopab3ig  5387  ovig  5597  ncssfin  6151
  Copyright terms: Public domain W3C validator