Theorem moeq3dc 2979

Description: "At most one" property of equality (split into 3 cases). (Contributed by Jim Kingdon, 7-Jul-2018.)

Hypotheses

Ref	Expression
moeq3dc.1	⊢ 𝐴 ∈ V
moeq3dc.2	⊢ 𝐵 ∈ V
moeq3dc.3	⊢ 𝐶 ∈ V
moeq3dc.4	⊢ ¬ (𝜑 ∧ 𝜓)

Assertion

Ref	Expression
moeq3dc	⊢ (DECID 𝜑 → (DECID 𝜓 → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))

Distinct variable groups:   𝜑,𝑥   𝜓,𝑥   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem moeq3dc

Step	Hyp	Ref	Expression
1		moeq3dc.1	. . 3 ⊢ 𝐴 ∈ V
2		moeq3dc.2	. . 3 ⊢ 𝐵 ∈ V
3		moeq3dc.3	. . 3 ⊢ 𝐶 ∈ V
4		moeq3dc.4	. . 3 ⊢ ¬ (𝜑 ∧ 𝜓)
5	1, 2, 3, 4	eueq3dc 2977	. 2 ⊢ (DECID 𝜑 → (DECID 𝜓 → ∃!𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
6		eumo 2109	. 2 ⊢ (∃!𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))
7	5, 6	syl6 33	1 ⊢ (DECID 𝜑 → (DECID 𝜓 → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 713  DECID wdc 839   ∨ w3o 1001   = wceq 1395  ∃!weu 2077  ∃*wmo 2078   ∈ wcel 2200  Vcvv 2799

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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-v 2801

This theorem is referenced by: (None)