Theorem biorfi 735

Description: A wff is equivalent to its disjunction with falsehood. (Contributed by NM, 23-Mar-1995.)

Hypothesis

Ref	Expression
biorfi.1	|- -. ph

Assertion

Ref	Expression
biorfi	|- ( ps <-> ( ps \/ ph ) )

Proof of Theorem biorfi

Step	Hyp	Ref	Expression
1		biorfi.1	. 2 |- -. ph
2		orc 701	. . 3 |- ( ps -> ( ps \/ ph ) )
3		orel2 715	. . 3 |- ( -. ph -> ( ( ps \/ ph ) -> ps ) )
4	2, 3	impbid2 142	. 2 |- ( -. ph -> ( ps <-> ( ps \/ ph ) ) )
5	1, 4	ax-mp 5	1 |- ( ps <-> ( ps \/ ph ) )

Syntax hints:   -. wn 3   <-> wb 104   \/ wo 697

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in2 604  ax-io 698

This theorem depends on definitions:  df-bi 116

This theorem is referenced by:  pm4.43  933  dn1dc  944  excxor  1356  un0  3396  opthprc  4590  frec0g  6294