Theorem eusvobj2 7400

Description: Specify the same property in two ways when class 𝐵(𝑦) is single-valued. (Contributed by NM, 1-Nov-2010.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)

Hypothesis

Ref	Expression
eusvobj1.1	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
eusvobj2	⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐵(𝑦)

Proof of Theorem eusvobj2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		euabsn2 4729	. . 3 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑧{𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧})
2		eleq2 2822	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 ∈ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} ↔ 𝑥 ∈ {𝑧}))
3		abid 2713	. . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} ↔ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵)
4		velsn 4644	. . . . . 6 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
5	2, 3, 4	3bitr3g 312	. . . . 5 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ 𝑥 = 𝑧))
6		nfre1 3282	. . . . . . . . 9 ⊢ Ⅎ𝑦∃𝑦 ∈ 𝐴 𝑥 = 𝐵
7	6	nfab 2909	. . . . . . . 8 ⊢ Ⅎ𝑦{𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵}
8	7	nfeq1 2918	. . . . . . 7 ⊢ Ⅎ𝑦{𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧}
9		eusvobj1.1	. . . . . . . . 9 ⊢ 𝐵 ∈ V
10	9	elabrex 7241	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → 𝐵 ∈ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵})
11		eleq2 2822	. . . . . . . . 9 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} ↔ 𝐵 ∈ {𝑧}))
12	9	elsn 4643	. . . . . . . . . 10 ⊢ (𝐵 ∈ {𝑧} ↔ 𝐵 = 𝑧)
13		eqcom 2739	. . . . . . . . . 10 ⊢ (𝐵 = 𝑧 ↔ 𝑧 = 𝐵)
14	12, 13	bitri 274	. . . . . . . . 9 ⊢ (𝐵 ∈ {𝑧} ↔ 𝑧 = 𝐵)
15	11, 14	bitrdi 286	. . . . . . . 8 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} ↔ 𝑧 = 𝐵))
16	10, 15	imbitrid 243	. . . . . . 7 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (𝑦 ∈ 𝐴 → 𝑧 = 𝐵))
17	8, 16	ralrimi 3254	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → ∀𝑦 ∈ 𝐴 𝑧 = 𝐵)
18		eqeq1 2736	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝐵 ↔ 𝑧 = 𝐵))
19	18	ralbidv 3177	. . . . . 6 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑧 = 𝐵))
20	17, 19	syl5ibrcom 246	. . . . 5 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 = 𝑧 → ∀𝑦 ∈ 𝐴 𝑥 = 𝐵))
21	5, 20	sylbid 239	. . . 4 ⊢ ({𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∀𝑦 ∈ 𝐴 𝑥 = 𝐵))
22	21	exlimiv 1933	. . 3 ⊢ (∃𝑧{𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∀𝑦 ∈ 𝐴 𝑥 = 𝐵))
23	1, 22	sylbi 216	. 2 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∀𝑦 ∈ 𝐴 𝑥 = 𝐵))
24		euex 2571	. . 3 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∃𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵)
25		rexn0 4510	. . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝐴 ≠ ∅)
26	25	exlimiv 1933	. . 3 ⊢ (∃𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝐴 ≠ ∅)
27		r19.2z 4494	. . . 4 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵) → ∃𝑦 ∈ 𝐴 𝑥 = 𝐵)
28	27	ex 413	. . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 = 𝐵))
29	24, 26, 28	3syl 18	. 2 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 = 𝐵))
30	23, 29	impbid 211	1 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∃!weu 2562  {cab 2709   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  Vcvv 3474  ∅c0 4322  {csn 4628

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-nul 4323  df-sn 4629

This theorem is referenced by:  eusvobj1  7401