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

Theorem biantru 302
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 300 . 2  |-  ( ph  ->  ( ps  <->  ( ps  /\ 
ph ) ) )
31, 2ax-mp 5 1  |-  ( ps  <->  ( ps  /\  ph )
)
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  pm4.71  393  mpbiran2  954  isset  2828  rexcom4b  2847  eueq  2997  ssrabeq  3336  a9evsep  4253  pwunim  4429  elvv  4835  elvvv  4836  resopab  5105  funfn  5405  dffn2  5533  dffn3  5542  dffn4  5619  fsn  5874  ixp0x  7002  ac6sfi  7196  fimax2gtri  7200  nninfwlporlemd  7506  ccatrcan  11474  xrmaxiflemcom  11998  plyun0  15820  trirec0xor  17068
  Copyright terms: Public domain W3C validator