Theorem dfor2 899

Description: Logical 'or' expressed in terms of implication only. Theorem *5.25 of [WhiteheadRussell] p. 124. (Contributed by NM, 12-Aug-2004.) (Proof shortened by Wolf Lammen, 20-Oct-2012.)

Assertion

Ref	Expression
dfor2	⊢ ((𝜑 ∨ 𝜓) ↔ ((𝜑 → 𝜓) → 𝜓))

Proof of Theorem dfor2

Step	Hyp	Ref	Expression
1		pm2.62 897	. 2 ⊢ ((𝜑 ∨ 𝜓) → ((𝜑 → 𝜓) → 𝜓))
2		pm2.68 898	. 2 ⊢ (((𝜑 → 𝜓) → 𝜓) → (𝜑 ∨ 𝜓))
3	1, 2	impbii 208	1 ⊢ ((𝜑 ∨ 𝜓) ↔ ((𝜑 → 𝜓) → 𝜓))

Syntax hints:   → wi 4   ↔ wb 205   ∨ wo 844

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 206  df-or 845

This theorem is referenced by:  imimorb  948  ifpim23g  41102