Theorem biorfi 665

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

Hypothesis

Ref	Expression
biorfi.1	⊢ ¬ 𝜑

Assertion

Ref	Expression
biorfi	⊢ (𝜓 ↔ (𝜓 ∨ 𝜑))

Proof of Theorem biorfi

Step	Hyp	Ref	Expression
1		biorfi.1	. 2 ⊢ ¬ 𝜑
2		orc 633	. . 3 ⊢ (𝜓 → (𝜓 ∨ 𝜑))
3		orel2 645	. . 3 ⊢ (¬ 𝜑 → ((𝜓 ∨ 𝜑) → 𝜓))
4	2, 3	impbid2 131	. 2 ⊢ (¬ 𝜑 → (𝜓 ↔ (𝜓 ∨ 𝜑)))
5	1, 4	ax-mp 7	1 ⊢ (𝜓 ↔ (𝜓 ∨ 𝜑))

Syntax hints:  ¬ wn 3   ↔ wb 98   ∨ wo 629

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in2 545  ax-io 630

This theorem depends on definitions:  df-bi 110

This theorem is referenced by:  pm4.43  856  dn1dc  867  excxor  1269  un0  3251  opthprc  4391  frec0g  5983  dcdc  9901