Theorem reu2eqd 3697

Description: Deduce equality from restricted uniqueness, deduction version. (Contributed by Thierry Arnoux, 27-Nov-2019.)

Hypotheses

Ref	Expression
reu2eqd.1	⊢ (𝑥 = 𝐵 → (𝜓 ↔ 𝜒))
reu2eqd.2	⊢ (𝑥 = 𝐶 → (𝜓 ↔ 𝜃))
reu2eqd.3	⊢ (𝜑 → ∃!𝑥 ∈ 𝐴 𝜓)
reu2eqd.4	⊢ (𝜑 → 𝐵 ∈ 𝐴)
reu2eqd.5	⊢ (𝜑 → 𝐶 ∈ 𝐴)
reu2eqd.6	⊢ (𝜑 → 𝜒)
reu2eqd.7	⊢ (𝜑 → 𝜃)

Assertion

Ref	Expression
reu2eqd	⊢ (𝜑 → 𝐵 = 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜒,𝑥   𝜃,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem reu2eqd

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		reu2eqd.6	. 2 ⊢ (𝜑 → 𝜒)
2		reu2eqd.7	. 2 ⊢ (𝜑 → 𝜃)
3		reu2eqd.3	. . . . 5 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐴 𝜓)
4		reu2 3686	. . . . 5 ⊢ (∃!𝑥 ∈ 𝐴 𝜓 ↔ (∃𝑥 ∈ 𝐴 𝜓 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜓 ∧ [𝑦 / 𝑥]𝜓) → 𝑥 = 𝑦)))
5	3, 4	sylib 221	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜓 ∧ [𝑦 / 𝑥]𝜓) → 𝑥 = 𝑦)))
6	5	simprd 501	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜓 ∧ [𝑦 / 𝑥]𝜓) → 𝑥 = 𝑦))
7		reu2eqd.4	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
8		reu2eqd.5	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝐴)
9		nfv 1949	. . . . . . 7 ⊢ Ⅎ𝑥𝜒
10		nfs1v 2196	. . . . . . 7 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜓
11	9, 10	nfan 1934	. . . . . 6 ⊢ Ⅎ𝑥(𝜒 ∧ [𝑦 / 𝑥]𝜓)
12		nfv 1949	. . . . . 6 ⊢ Ⅎ𝑥 𝐵 = 𝑦
13	11, 12	nfim 1931	. . . . 5 ⊢ Ⅎ𝑥((𝜒 ∧ [𝑦 / 𝑥]𝜓) → 𝐵 = 𝑦)
14		nfv 1949	. . . . 5 ⊢ Ⅎ𝑦((𝜒 ∧ 𝜃) → 𝐵 = 𝐶)
15		reu2eqd.1	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝜓 ↔ 𝜒))
16	15	anbi1d 643	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝜓 ∧ [𝑦 / 𝑥]𝜓) ↔ (𝜒 ∧ [𝑦 / 𝑥]𝜓)))
17		eqeq1 2767	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥 = 𝑦 ↔ 𝐵 = 𝑦))
18	16, 17	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝐵 → (((𝜓 ∧ [𝑦 / 𝑥]𝜓) → 𝑥 = 𝑦) ↔ ((𝜒 ∧ [𝑦 / 𝑥]𝜓) → 𝐵 = 𝑦)))
19		nfv 1949	. . . . . . . 8 ⊢ Ⅎ𝑥𝜃
20		reu2eqd.2	. . . . . . . 8 ⊢ (𝑥 = 𝐶 → (𝜓 ↔ 𝜃))
21	19, 20	sbhypf 3513	. . . . . . 7 ⊢ (𝑦 = 𝐶 → ([𝑦 / 𝑥]𝜓 ↔ 𝜃))
22	21	anbi2d 642	. . . . . 6 ⊢ (𝑦 = 𝐶 → ((𝜒 ∧ [𝑦 / 𝑥]𝜓) ↔ (𝜒 ∧ 𝜃)))
23		eqeq2 2775	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝐵 = 𝑦 ↔ 𝐵 = 𝐶))
24	22, 23	imbi12d 347	. . . . 5 ⊢ (𝑦 = 𝐶 → (((𝜒 ∧ [𝑦 / 𝑥]𝜓) → 𝐵 = 𝑦) ↔ ((𝜒 ∧ 𝜃) → 𝐵 = 𝐶)))
25	13, 14, 18, 24	rspc2 3588	. . . 4 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜓 ∧ [𝑦 / 𝑥]𝜓) → 𝑥 = 𝑦) → ((𝜒 ∧ 𝜃) → 𝐵 = 𝐶)))
26	7, 8, 25	syl2anc 596	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜓 ∧ [𝑦 / 𝑥]𝜓) → 𝑥 = 𝑦) → ((𝜒 ∧ 𝜃) → 𝐵 = 𝐶)))
27	6, 26	mpd 16	. 2 ⊢ (𝜑 → ((𝜒 ∧ 𝜃) → 𝐵 = 𝐶))
28	1, 2, 27	mp2and 712	1 ⊢ (𝜑 → 𝐵 = 𝐶)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  [wsb 2101   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∃!wreu 3367

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-reu 3370

This theorem is used by:  qtophmeo  24191  footeq  29256  mideulem2  29267  lmieq  29353  fineqvnttrclse  35933  upciclem3  50615