| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > moeq3dc | GIF version | ||
| Description: "At most one" property of equality (split into 3 cases). (Contributed by Jim Kingdon, 7-Jul-2018.) |
| Ref | Expression |
|---|---|
| moeq3dc.1 | ⊢ 𝐴 ∈ V |
| moeq3dc.2 | ⊢ 𝐵 ∈ V |
| moeq3dc.3 | ⊢ 𝐶 ∈ V |
| moeq3dc.4 | ⊢ ¬ (𝜑 ∧ 𝜓) |
| Ref | Expression |
|---|---|
| moeq3dc | ⊢ (DECID 𝜑 → (DECID 𝜓 → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))) |
| 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 2951 | . 2 ⊢ (DECID 𝜑 → (DECID 𝜓 → ∃!𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))) |
| 6 | eumo 2087 | . 2 ⊢ (∃!𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))) | |
| 7 | 5, 6 | syl6 33 | 1 ⊢ (DECID 𝜑 → (DECID 𝜓 → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 710 DECID wdc 836 ∨ w3o 980 = wceq 1373 ∃!weu 2055 ∃*wmo 2056 ∈ wcel 2177 Vcvv 2773 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-v 2775 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |