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

Theorem biantru 300
Description: A wff is equivalent to its conjunction with truth. (Contributed by NM, 5-Aug-1993.)
Hypothesis
Ref Expression
biantru.1  |-  ph
Assertion
Ref Expression
biantru  |-  ( ps  <->  ( ps  /\  ph )
)

Proof of Theorem biantru
StepHypRef Expression
1 biantru.1 . 2  |-  ph
2 iba 298 . 2  |-  ( ph  ->  ( ps  <->  ( ps  /\ 
ph ) ) )
31, 2ax-mp 5 1  |-  ( ps  <->  ( ps  /\  ph )
)
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  pm4.71  387  mpbiran2  931  isset  2732  rexcom4b  2751  eueq  2897  ssrabeq  3229  a9evsep  4104  pwunim  4264  elvv  4666  elvvv  4667  resopab  4928  funfn  5218  dffn2  5339  dffn3  5348  dffn4  5416  fsn  5657  ixp0x  6692  ac6sfi  6864  fimax2gtri  6867  xrmaxiflemcom  11190  trirec0xor  13924
  Copyright terms: Public domain W3C validator