Theorem moeq3 3684

Description: "At most one" property of equality (split into 3 cases). (The first two hypotheses could be eliminated with longer proof.) (Contributed by NM, 23-Apr-1995.)

Hypotheses

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

Assertion

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

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

Proof of Theorem moeq3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq2 2781	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴))
2	1	anbi2d 641	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜑 ∧ 𝑥 = 𝑦) ↔ (𝜑 ∧ 𝑥 = 𝐴)))
3		biidd 265	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ↔ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵)))
4		biidd 265	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜓 ∧ 𝑥 = 𝐶) ↔ (𝜓 ∧ 𝑥 = 𝐶)))
5	2, 3, 4	3orbi123d 1461	. . . . 5 ⊢ (𝑦 = 𝐴 → (((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) ↔ ((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
6	5	eubidv 2620	. . . 4 ⊢ (𝑦 = 𝐴 → (∃!𝑥((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) ↔ ∃!𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
7		vex 3467	. . . . 5 ⊢ 𝑦 ∈ V
8		moeq3.1	. . . . 5 ⊢ 𝐵 ∈ V
9		moeq3.2	. . . . 5 ⊢ 𝐶 ∈ V
10		moeq3.3	. . . . 5 ⊢ ¬ (𝜑 ∧ 𝜓)
11	7, 8, 9, 10	eueq3 3683	. . . 4 ⊢ ∃!𝑥((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))
12	6, 11	vtoclg 3531	. . 3 ⊢ (𝐴 ∈ V → ∃!𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))
13		eumo 2612	. . 3 ⊢ (∃!𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))
14	12, 13	syl 18	. 2 ⊢ (𝐴 ∈ V → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))
15		eqvisset 3483	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → 𝐴 ∈ V)
16		pm2.21 124	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (𝐴 ∈ V → 𝑥 = 𝑦))
17	15, 16	syl5 35	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (𝑥 = 𝐴 → 𝑥 = 𝑦))
18	17	anim2d 623	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → ((𝜑 ∧ 𝑥 = 𝐴) → (𝜑 ∧ 𝑥 = 𝑦)))
19	18	orim1d 981	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (((𝜑 ∧ 𝑥 = 𝐴) ∨ ((¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))) → ((𝜑 ∧ 𝑥 = 𝑦) ∨ ((¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))))
20		3orass 1104	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) ↔ ((𝜑 ∧ 𝑥 = 𝐴) ∨ ((¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
21		3orass 1104	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) ↔ ((𝜑 ∧ 𝑥 = 𝑦) ∨ ((¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
22	19, 20, 21	3imtr4g 299	. . . 4 ⊢ (¬ 𝐴 ∈ V → (((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) → ((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
23	22	alrimiv 1954	. . 3 ⊢ (¬ 𝐴 ∈ V → ∀𝑥(((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) → ((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
24		euimmo 2650	. . 3 ⊢ (∀𝑥(((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) → ((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))) → (∃!𝑥((𝜑 ∧ 𝑥 = 𝑦) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)) → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))))
25	23, 11, 24	mpisyl 22	. 2 ⊢ (¬ 𝐴 ∈ V → ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶)))
26	14, 25	pm2.61i 184	1 ⊢ ∃*𝑥((𝜑 ∧ 𝑥 = 𝐴) ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝑥 = 𝐵) ∨ (𝜓 ∧ 𝑥 = 𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ wo 860   ∨ w3o 1100  ∀wal 1565   = wceq 1567   ∈ wcel 2149  ∃*wmo 2571  ∃!weu 2602  Vcvv 3463

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-tru 1570  df-ex 1807  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-v 3465

This theorem is referenced by:  tz7.44lem1  8392