Theorem ifpdfbi 1067

Description: Define the biconditional as conditional logic operator. (Contributed by RP, 20-Apr-2020.) (Proof shortened by Wolf Lammen, 30-Apr-2024.)

Assertion

Ref	Expression
ifpdfbi	⊢ ((𝜑 ↔ 𝜓) ↔ if-(𝜑, 𝜓, ¬ 𝜓))

Proof of Theorem ifpdfbi

Step	Hyp	Ref	Expression
1		con34b 315	. . 3 ⊢ ((𝜓 → 𝜑) ↔ (¬ 𝜑 → ¬ 𝜓))
2	1	anbi2i 622	. 2 ⊢ (((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) ↔ ((𝜑 → 𝜓) ∧ (¬ 𝜑 → ¬ 𝜓)))
3		dfbi2 474	. 2 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)))
4		dfifp2 1061	. 2 ⊢ (if-(𝜑, 𝜓, ¬ 𝜓) ↔ ((𝜑 → 𝜓) ∧ (¬ 𝜑 → ¬ 𝜓)))
5	2, 3, 4	3bitr4i 302	1 ⊢ ((𝜑 ↔ 𝜓) ↔ if-(𝜑, 𝜓, ¬ 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395  if-wif 1059

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-an 396  df-or 844  df-ifp 1060

This theorem is referenced by:  wl-df3xor2  35619  wl-2xor  35633  ifpbiidcor  41043  ifpbicor  41044