Theorem ifeq1dadc 3564

Description: Conditional equality. (Contributed by Jeff Madsen, 2-Sep-2009.)

Hypotheses

Ref	Expression
ifeq1dadc.1	⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐵)
ifeq1dadc.dc	⊢ (𝜑 → DECID 𝜓)

Assertion

Ref	Expression
ifeq1dadc	⊢ (𝜑 → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶))

Proof of Theorem ifeq1dadc

Step	Hyp	Ref	Expression
1		ifeq1dadc.1	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐵)
2	1	ifeq1d 3551	. 2 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶))
3		iffalse 3542	. . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐶) = 𝐶)
4		iffalse 3542	. . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐵, 𝐶) = 𝐶)
5	3, 4	eqtr4d 2213	. . 3 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶))
6	5	adantl 277	. 2 ⊢ ((𝜑 ∧ ¬ 𝜓) → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶))
7		ifeq1dadc.dc	. . 3 ⊢ (𝜑 → DECID 𝜓)
8		exmiddc 836	. . 3 ⊢ (DECID 𝜓 → (𝜓 ∨ ¬ 𝜓))
9	7, 8	syl 14	. 2 ⊢ (𝜑 → (𝜓 ∨ ¬ 𝜓))
10	2, 6, 9	mpjaodan 798	1 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 708  DECID wdc 834   = wceq 1353  ifcif 3534

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-dc 835  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rab 2464  df-v 2739  df-un 3133  df-if 3535

This theorem is referenced by:  sumeq2  11366  isumss  11398  prodeq2  11564  lgsval2lem  14347  lgsval4lem  14348  lgsneg  14361  lgsmod  14363  lgsdilem2  14373