ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  simplbiim Unicode version

Theorem simplbiim 391
Description: Implication from an eliminated conjunct equivalent to the antecedent. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
Hypotheses
Ref Expression
simplbiim.1  |-  ( ph  <->  ( ps  /\  ch )
)
simplbiim.2  |-  ( ch 
->  th )
Assertion
Ref Expression
simplbiim  |-  ( ph  ->  th )

Proof of Theorem simplbiim
StepHypRef Expression
1 simplbiim.1 . 2  |-  ( ph  <->  ( ps  /\  ch )
)
2 simplbiim.2 . . 3  |-  ( ch 
->  th )
32adantl 277 . 2  |-  ( ( ps  /\  ch )  ->  th )
41, 3sylbi 121 1  |-  ( ph  ->  th )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108
This proof depends on definitions:  df-bi 117
This theorem is used by:  mpodifsnif  6181  ixpm  7012  finct  7456  apsscn  8975  zltaddlt1le  10410  pfxccatin12lem3  11504  oddnn02np1  12647  dvdsprmpweqnn  13115  sgrpass  13723  drnglring  14607  ausgrusgrben  16409
  Copyright terms: Public domain W3C validator