Theorem reusv3 4389

Description: Two ways to express single-valuedness of a class expression 𝐶(𝑦). See reusv1 4387 for the connection to uniqueness. (Contributed by NM, 27-Dec-2012.)

Hypotheses

Ref	Expression
reusv3.1	⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
reusv3.2	⊢ (𝑦 = 𝑧 → 𝐶 = 𝐷)

Assertion

Ref	Expression
reusv3	⊢ (∃𝑦 ∈ 𝐵 (𝜑 ∧ 𝐶 ∈ 𝐴) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐶,𝑧   𝑥,𝐷,𝑦   𝜑,𝑥,𝑧   𝜓,𝑥,𝑦   𝑥,𝐴,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑧)   𝐶(𝑦)   𝐷(𝑧)

Proof of Theorem reusv3

Step	Hyp	Ref	Expression
1		reusv3.1	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
2		reusv3.2	. . . . . 6 ⊢ (𝑦 = 𝑧 → 𝐶 = 𝐷)
3	2	eleq1d 2209	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝐶 ∈ 𝐴 ↔ 𝐷 ∈ 𝐴))
4	1, 3	anbi12d 465	. . . 4 ⊢ (𝑦 = 𝑧 → ((𝜑 ∧ 𝐶 ∈ 𝐴) ↔ (𝜓 ∧ 𝐷 ∈ 𝐴)))
5	4	cbvrexv 2658	. . 3 ⊢ (∃𝑦 ∈ 𝐵 (𝜑 ∧ 𝐶 ∈ 𝐴) ↔ ∃𝑧 ∈ 𝐵 (𝜓 ∧ 𝐷 ∈ 𝐴))
6		nfra2xy 2478	. . . . 5 ⊢ Ⅎ𝑧∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)
7		nfv 1509	. . . . 5 ⊢ Ⅎ𝑧∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)
8	6, 7	nfim 1552	. . . 4 ⊢ Ⅎ𝑧(∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))
9		risset 2466	. . . . . 6 ⊢ (𝐷 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝐷)
10		ralcom 2597	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
11		impexp 261	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ (𝜑 → (𝜓 → 𝐶 = 𝐷)))
12		bi2.04 247	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 → (𝜓 → 𝐶 = 𝐷)) ↔ (𝜓 → (𝜑 → 𝐶 = 𝐷)))
13	11, 12	bitri 183	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ (𝜓 → (𝜑 → 𝐶 = 𝐷)))
14	13	ralbii 2444	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑦 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ ∀𝑦 ∈ 𝐵 (𝜓 → (𝜑 → 𝐶 = 𝐷)))
15		r19.21v 2512	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑦 ∈ 𝐵 (𝜓 → (𝜑 → 𝐶 = 𝐷)) ↔ (𝜓 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷)))
16	14, 15	bitri 183	. . . . . . . . . . . . . . 15 ⊢ (∀𝑦 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ (𝜓 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷)))
17	16	ralbii 2444	. . . . . . . . . . . . . 14 ⊢ (∀𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧 ∈ 𝐵 (𝜓 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷)))
18	10, 17	bitri 183	. . . . . . . . . . . . 13 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧 ∈ 𝐵 (𝜓 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷)))
19		rsp 2483	. . . . . . . . . . . . 13 ⊢ (∀𝑧 ∈ 𝐵 (𝜓 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷)) → (𝑧 ∈ 𝐵 → (𝜓 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷))))
20	18, 19	sylbi 120	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → (𝑧 ∈ 𝐵 → (𝜓 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷))))
21	20	com3l 81	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝐵 → (𝜓 → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷))))
22	21	imp31 254	. . . . . . . . . 10 ⊢ (((𝑧 ∈ 𝐵 ∧ 𝜓) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) → ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷))
23		eqeq1 2147	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐷 → (𝑥 = 𝐶 ↔ 𝐷 = 𝐶))
24		eqcom 2142	. . . . . . . . . . . . 13 ⊢ (𝐷 = 𝐶 ↔ 𝐶 = 𝐷)
25	23, 24	syl6bb 195	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐷 → (𝑥 = 𝐶 ↔ 𝐶 = 𝐷))
26	25	imbi2d 229	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐷 → ((𝜑 → 𝑥 = 𝐶) ↔ (𝜑 → 𝐶 = 𝐷)))
27	26	ralbidv 2438	. . . . . . . . . 10 ⊢ (𝑥 = 𝐷 → (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ↔ ∀𝑦 ∈ 𝐵 (𝜑 → 𝐶 = 𝐷)))
28	22, 27	syl5ibrcom 156	. . . . . . . . 9 ⊢ (((𝑧 ∈ 𝐵 ∧ 𝜓) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) → (𝑥 = 𝐷 → ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)))
29	28	reximdv 2536	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝐵 ∧ 𝜓) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) → (∃𝑥 ∈ 𝐴 𝑥 = 𝐷 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)))
30	29	ex 114	. . . . . . 7 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝜓) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → (∃𝑥 ∈ 𝐴 𝑥 = 𝐷 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))))
31	30	com23 78	. . . . . 6 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝜓) → (∃𝑥 ∈ 𝐴 𝑥 = 𝐷 → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))))
32	9, 31	syl5bi 151	. . . . 5 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝜓) → (𝐷 ∈ 𝐴 → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))))
33	32	expimpd 361	. . . 4 ⊢ (𝑧 ∈ 𝐵 → ((𝜓 ∧ 𝐷 ∈ 𝐴) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))))
34	8, 33	rexlimi 2545	. . 3 ⊢ (∃𝑧 ∈ 𝐵 (𝜓 ∧ 𝐷 ∈ 𝐴) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)))
35	5, 34	sylbi 120	. 2 ⊢ (∃𝑦 ∈ 𝐵 (𝜑 ∧ 𝐶 ∈ 𝐴) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)))
36	1, 2	reusv3i 4388	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
37	35, 36	impbid1 141	1 ⊢ (∃𝑦 ∈ 𝐵 (𝜑 ∧ 𝐶 ∈ 𝐴) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷) ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1332   ∈ wcel 1481  ∀wral 2417  ∃wrex 2418

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122

This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423

This theorem is referenced by: (None)