Theorem rb-imdf 1750

Description: The definition of implication, in terms of ∨ and ¬. (Contributed by Anthony Hart, 17-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
rb-imdf	⊢ ¬ (¬ (¬ (𝜑 → 𝜓) ∨ (¬ 𝜑 ∨ 𝜓)) ∨ ¬ (¬ (¬ 𝜑 ∨ 𝜓) ∨ (𝜑 → 𝜓)))

Proof of Theorem rb-imdf

Step	Hyp	Ref	Expression
1		imor 853	. 2 ⊢ ((𝜑 → 𝜓) ↔ (¬ 𝜑 ∨ 𝜓))
2		rb-bijust 1749	. 2 ⊢ (((𝜑 → 𝜓) ↔ (¬ 𝜑 ∨ 𝜓)) ↔ ¬ (¬ (¬ (𝜑 → 𝜓) ∨ (¬ 𝜑 ∨ 𝜓)) ∨ ¬ (¬ (¬ 𝜑 ∨ 𝜓) ∨ (𝜑 → 𝜓))))
3	1, 2	mpbi 230	1 ⊢ ¬ (¬ (¬ (𝜑 → 𝜓) ∨ (¬ 𝜑 ∨ 𝜓)) ∨ ¬ (¬ (¬ 𝜑 ∨ 𝜓) ∨ (𝜑 → 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∨ wo 847

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 207  df-or 848

This theorem is referenced by:  re1axmp  1764  re2luk1  1765  re2luk2  1766  re2luk3  1767