Theorem dfbi3 1065

Description: An alternate definition of the biconditional. Theorem *5.23 of [WhiteheadRussell] p. 124. (Contributed by NM, 27-Jun-2002.) (Proof shortened by Wolf Lammen, 3-Nov-2013.) (Proof shortened by NM, 29-Oct-2021.)

Assertion

Ref	Expression
dfbi3	⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓)))

Proof of Theorem dfbi3

Step	Hyp	Ref	Expression
1		con34b 319	. . 3 ⊢ ((𝜓 → 𝜑) ↔ (¬ 𝜑 → ¬ 𝜓))
2	1	anbi2i 635	. 2 ⊢ (((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) ↔ ((𝜑 → 𝜓) ∧ (¬ 𝜑 → ¬ 𝜓)))
3		dfbi2 480	. 2 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)))
4		cases2 1063	. 2 ⊢ (((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓)) ↔ ((𝜑 → 𝜓) ∧ (¬ 𝜑 → ¬ 𝜓)))
5	2, 3, 4	3bitr4i 306	1 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862

This theorem is used by:  pm5.24  1066  ifpdfbi  1086  nanbi  1529  raaan2  4477  2reu4lem  4478  ifbi  4504  sqf11  27466  bj-dfbi4  37443