Theorem ifpbibib 39869

Description: Factor conditional logic operator over biimplication in terms 2 and 3. (Contributed by RP, 21-Apr-2020.)

Assertion

Ref	Expression
ifpbibib	⊢ (if-(𝜑, (𝜓 ↔ 𝜒), (𝜃 ↔ 𝜏)) ↔ (if-(𝜑, 𝜓, 𝜃) ↔ if-(𝜑, 𝜒, 𝜏)))

Proof of Theorem ifpbibib

Step	Hyp	Ref	Expression
1		dfifp2 1059	. 2 ⊢ (if-(𝜑, (𝜓 ↔ 𝜒), (𝜃 ↔ 𝜏)) ↔ ((𝜑 → (𝜓 ↔ 𝜒)) ∧ (¬ 𝜑 → (𝜃 ↔ 𝜏))))
2		dfbi2 477	. . . . . 6 ⊢ ((𝜓 ↔ 𝜒) ↔ ((𝜓 → 𝜒) ∧ (𝜒 → 𝜓)))
3	2	imbi2i 338	. . . . 5 ⊢ ((𝜑 → (𝜓 ↔ 𝜒)) ↔ (𝜑 → ((𝜓 → 𝜒) ∧ (𝜒 → 𝜓))))
4		jcab 520	. . . . 5 ⊢ ((𝜑 → ((𝜓 → 𝜒) ∧ (𝜒 → 𝜓))) ↔ ((𝜑 → (𝜓 → 𝜒)) ∧ (𝜑 → (𝜒 → 𝜓))))
5	3, 4	bitri 277	. . . 4 ⊢ ((𝜑 → (𝜓 ↔ 𝜒)) ↔ ((𝜑 → (𝜓 → 𝜒)) ∧ (𝜑 → (𝜒 → 𝜓))))
6		dfbi2 477	. . . . . 6 ⊢ ((𝜃 ↔ 𝜏) ↔ ((𝜃 → 𝜏) ∧ (𝜏 → 𝜃)))
7	6	imbi2i 338	. . . . 5 ⊢ ((¬ 𝜑 → (𝜃 ↔ 𝜏)) ↔ (¬ 𝜑 → ((𝜃 → 𝜏) ∧ (𝜏 → 𝜃))))
8		jcab 520	. . . . 5 ⊢ ((¬ 𝜑 → ((𝜃 → 𝜏) ∧ (𝜏 → 𝜃))) ↔ ((¬ 𝜑 → (𝜃 → 𝜏)) ∧ (¬ 𝜑 → (𝜏 → 𝜃))))
9	7, 8	bitri 277	. . . 4 ⊢ ((¬ 𝜑 → (𝜃 ↔ 𝜏)) ↔ ((¬ 𝜑 → (𝜃 → 𝜏)) ∧ (¬ 𝜑 → (𝜏 → 𝜃))))
10	5, 9	anbi12i 628	. . 3 ⊢ (((𝜑 → (𝜓 ↔ 𝜒)) ∧ (¬ 𝜑 → (𝜃 ↔ 𝜏))) ↔ (((𝜑 → (𝜓 → 𝜒)) ∧ (𝜑 → (𝜒 → 𝜓))) ∧ ((¬ 𝜑 → (𝜃 → 𝜏)) ∧ (¬ 𝜑 → (𝜏 → 𝜃)))))
11		an4 654	. . 3 ⊢ ((((𝜑 → (𝜓 → 𝜒)) ∧ (𝜑 → (𝜒 → 𝜓))) ∧ ((¬ 𝜑 → (𝜃 → 𝜏)) ∧ (¬ 𝜑 → (𝜏 → 𝜃)))) ↔ (((𝜑 → (𝜓 → 𝜒)) ∧ (¬ 𝜑 → (𝜃 → 𝜏))) ∧ ((𝜑 → (𝜒 → 𝜓)) ∧ (¬ 𝜑 → (𝜏 → 𝜃)))))
12	10, 11	bitri 277	. 2 ⊢ (((𝜑 → (𝜓 ↔ 𝜒)) ∧ (¬ 𝜑 → (𝜃 ↔ 𝜏))) ↔ (((𝜑 → (𝜓 → 𝜒)) ∧ (¬ 𝜑 → (𝜃 → 𝜏))) ∧ ((𝜑 → (𝜒 → 𝜓)) ∧ (¬ 𝜑 → (𝜏 → 𝜃)))))
13		dfifp2 1059	. . . . 5 ⊢ (if-(𝜑, (𝜓 → 𝜒), (𝜃 → 𝜏)) ↔ ((𝜑 → (𝜓 → 𝜒)) ∧ (¬ 𝜑 → (𝜃 → 𝜏))))
14		ifpimimb 39863	. . . . 5 ⊢ (if-(𝜑, (𝜓 → 𝜒), (𝜃 → 𝜏)) ↔ (if-(𝜑, 𝜓, 𝜃) → if-(𝜑, 𝜒, 𝜏)))
15	13, 14	bitr3i 279	. . . 4 ⊢ (((𝜑 → (𝜓 → 𝜒)) ∧ (¬ 𝜑 → (𝜃 → 𝜏))) ↔ (if-(𝜑, 𝜓, 𝜃) → if-(𝜑, 𝜒, 𝜏)))
16		dfifp2 1059	. . . . 5 ⊢ (if-(𝜑, (𝜒 → 𝜓), (𝜏 → 𝜃)) ↔ ((𝜑 → (𝜒 → 𝜓)) ∧ (¬ 𝜑 → (𝜏 → 𝜃))))
17		ifpimimb 39863	. . . . 5 ⊢ (if-(𝜑, (𝜒 → 𝜓), (𝜏 → 𝜃)) ↔ (if-(𝜑, 𝜒, 𝜏) → if-(𝜑, 𝜓, 𝜃)))
18	16, 17	bitr3i 279	. . . 4 ⊢ (((𝜑 → (𝜒 → 𝜓)) ∧ (¬ 𝜑 → (𝜏 → 𝜃))) ↔ (if-(𝜑, 𝜒, 𝜏) → if-(𝜑, 𝜓, 𝜃)))
19	15, 18	anbi12i 628	. . 3 ⊢ ((((𝜑 → (𝜓 → 𝜒)) ∧ (¬ 𝜑 → (𝜃 → 𝜏))) ∧ ((𝜑 → (𝜒 → 𝜓)) ∧ (¬ 𝜑 → (𝜏 → 𝜃)))) ↔ ((if-(𝜑, 𝜓, 𝜃) → if-(𝜑, 𝜒, 𝜏)) ∧ (if-(𝜑, 𝜒, 𝜏) → if-(𝜑, 𝜓, 𝜃))))
20		dfbi2 477	. . 3 ⊢ ((if-(𝜑, 𝜓, 𝜃) ↔ if-(𝜑, 𝜒, 𝜏)) ↔ ((if-(𝜑, 𝜓, 𝜃) → if-(𝜑, 𝜒, 𝜏)) ∧ (if-(𝜑, 𝜒, 𝜏) → if-(𝜑, 𝜓, 𝜃))))
21	19, 20	bitr4i 280	. 2 ⊢ ((((𝜑 → (𝜓 → 𝜒)) ∧ (¬ 𝜑 → (𝜃 → 𝜏))) ∧ ((𝜑 → (𝜒 → 𝜓)) ∧ (¬ 𝜑 → (𝜏 → 𝜃)))) ↔ (if-(𝜑, 𝜓, 𝜃) ↔ if-(𝜑, 𝜒, 𝜏)))
22	1, 12, 21	3bitri 299	1 ⊢ (if-(𝜑, (𝜓 ↔ 𝜒), (𝜃 ↔ 𝜏)) ↔ (if-(𝜑, 𝜓, 𝜃) ↔ if-(𝜑, 𝜒, 𝜏)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398  if-wif 1057

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 209  df-an 399  df-or 844  df-ifp 1058

This theorem is referenced by:  ifpxorxorb  39870