Theorem biass 388

Description: Associative law for the biconditional. An axiom of system DS in Vladimir Lifschitz, "On calculational proofs", Annals of Pure and Applied Logic, 113:207-224, 2002, http://www.cs.utexas.edu/users/ai-lab/pub-view.php?PubID=26805. Interestingly, this law was not included in Principia Mathematica but was apparently first noted by Jan Lukasiewicz circa 1923. (Contributed by NM, 8-Jan-2005.) (Proof shortened by Juha Arpiainen, 19-Jan-2006.) (Proof shortened by Wolf Lammen, 21-Sep-2013.)

Assertion

Ref	Expression
biass	⊢ (((𝜑 ↔ 𝜓) ↔ 𝜒) ↔ (𝜑 ↔ (𝜓 ↔ 𝜒)))

Proof of Theorem biass

Step	Hyp	Ref	Expression
1		pm5.501 369	. . . 4 ⊢ (𝜑 → (𝜓 ↔ (𝜑 ↔ 𝜓)))
2	1	bibi1d 346	. . 3 ⊢ (𝜑 → ((𝜓 ↔ 𝜒) ↔ ((𝜑 ↔ 𝜓) ↔ 𝜒)))
3		pm5.501 369	. . 3 ⊢ (𝜑 → ((𝜓 ↔ 𝜒) ↔ (𝜑 ↔ (𝜓 ↔ 𝜒))))
4	2, 3	bitr3d 284	. 2 ⊢ (𝜑 → (((𝜑 ↔ 𝜓) ↔ 𝜒) ↔ (𝜑 ↔ (𝜓 ↔ 𝜒))))
5		nbbn 386	. . . 4 ⊢ ((¬ 𝜓 ↔ 𝜒) ↔ ¬ (𝜓 ↔ 𝜒))
6		nbn2 373	. . . . 5 ⊢ (¬ 𝜑 → (¬ 𝜓 ↔ (𝜑 ↔ 𝜓)))
7	6	bibi1d 346	. . . 4 ⊢ (¬ 𝜑 → ((¬ 𝜓 ↔ 𝜒) ↔ ((𝜑 ↔ 𝜓) ↔ 𝜒)))
8	5, 7	bitr3id 288	. . 3 ⊢ (¬ 𝜑 → (¬ (𝜓 ↔ 𝜒) ↔ ((𝜑 ↔ 𝜓) ↔ 𝜒)))
9		nbn2 373	. . 3 ⊢ (¬ 𝜑 → (¬ (𝜓 ↔ 𝜒) ↔ (𝜑 ↔ (𝜓 ↔ 𝜒))))
10	8, 9	bitr3d 284	. 2 ⊢ (¬ 𝜑 → (((𝜑 ↔ 𝜓) ↔ 𝜒) ↔ (𝜑 ↔ (𝜓 ↔ 𝜒))))
11	4, 10	pm2.61i 184	1 ⊢ (((𝜑 ↔ 𝜓) ↔ 𝜒) ↔ (𝜑 ↔ (𝜓 ↔ 𝜒)))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209

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

This theorem is used by:  birot  389  biluk  390  xorass  1545  had0  1634  had1OLD  1635  currybi  36374  wl-3xorbi2  38317