Theorem brprcneu 5619

Description: If 𝐴 is a proper class and 𝐹 is any class, then there is no unique set which is related to 𝐴 through the binary relation 𝐹. (Contributed by Scott Fenton, 7-Oct-2017.)

Assertion

Ref	Expression
brprcneu	⊢ (¬ 𝐴 ∈ V → ¬ ∃!𝑥 𝐴𝐹𝑥)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem brprcneu

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dtruex 4650	. . . . . . . . 9 ⊢ ∃𝑦 ¬ 𝑦 = 𝑥
2		equcom 1752	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥)
3	2	notbii 672	. . . . . . . . . 10 ⊢ (¬ 𝑥 = 𝑦 ↔ ¬ 𝑦 = 𝑥)
4	3	exbii 1651	. . . . . . . . 9 ⊢ (∃𝑦 ¬ 𝑥 = 𝑦 ↔ ∃𝑦 ¬ 𝑦 = 𝑥)
5	1, 4	mpbir 146	. . . . . . . 8 ⊢ ∃𝑦 ¬ 𝑥 = 𝑦
6	5	jctr 315	. . . . . . 7 ⊢ (∅ ∈ 𝐹 → (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
7		19.42v 1953	. . . . . . 7 ⊢ (∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
8	6, 7	sylibr 134	. . . . . 6 ⊢ (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))
9		opprc1 3878	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → ⟨𝐴, 𝑥⟩ = ∅)
10	9	eleq1d 2298	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
11		opprc1 3878	. . . . . . . . . . . 12 ⊢ (¬ 𝐴 ∈ V → ⟨𝐴, 𝑦⟩ = ∅)
12	11	eleq1d 2298	. . . . . . . . . . 11 ⊢ (¬ 𝐴 ∈ V → (⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
13	10, 12	anbi12d 473	. . . . . . . . . 10 ⊢ (¬ 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹)))
14		anidm 396	. . . . . . . . . 10 ⊢ ((∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹) ↔ ∅ ∈ 𝐹)
15	13, 14	bitrdi 196	. . . . . . . . 9 ⊢ (¬ 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ ∅ ∈ 𝐹))
16	15	anbi1d 465	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
17	16	exbidv 1871	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
18	10, 17	imbi12d 234	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)) ↔ (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))))
19	8, 18	mpbiri 168	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)))
20		df-br 4083	. . . . 5 ⊢ (𝐴𝐹𝑥 ↔ ⟨𝐴, 𝑥⟩ ∈ 𝐹)
21		df-br 4083	. . . . . . . 8 ⊢ (𝐴𝐹𝑦 ↔ ⟨𝐴, 𝑦⟩ ∈ 𝐹)
22	20, 21	anbi12i 460	. . . . . . 7 ⊢ ((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ↔ (⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
23	22	anbi1i 458	. . . . . 6 ⊢ (((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
24	23	exbii 1651	. . . . 5 ⊢ (∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
25	19, 20, 24	3imtr4g 205	. . . 4 ⊢ (¬ 𝐴 ∈ V → (𝐴𝐹𝑥 → ∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
26	25	eximdv 1926	. . 3 ⊢ (¬ 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ∃𝑥∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
27		exanaliim 1693	. . . . . 6 ⊢ (∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ¬ ∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
28	27	eximi 1646	. . . . 5 ⊢ (∃𝑥∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
29		exnalim 1692	. . . . 5 ⊢ (∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦) → ¬ ∀𝑥∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
30	28, 29	syl 14	. . . 4 ⊢ (∃𝑥∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ¬ ∀𝑥∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
31		breq2 4086	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴𝐹𝑥 ↔ 𝐴𝐹𝑦))
32	31	mo4 2139	. . . . 5 ⊢ (∃*𝑥 𝐴𝐹𝑥 ↔ ∀𝑥∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
33	32	notbii 672	. . . 4 ⊢ (¬ ∃*𝑥 𝐴𝐹𝑥 ↔ ¬ ∀𝑥∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
34	30, 33	sylibr 134	. . 3 ⊢ (∃𝑥∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ¬ ∃*𝑥 𝐴𝐹𝑥)
35	26, 34	syl6 33	. 2 ⊢ (¬ 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
36		eu5 2125	. . . 4 ⊢ (∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
37	36	notbii 672	. . 3 ⊢ (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
38		imnan 694	. . 3 ⊢ ((∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥) ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
39	37, 38	bitr4i 187	. 2 ⊢ (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
40	35, 39	sylibr 134	1 ⊢ (¬ 𝐴 ∈ V → ¬ ∃!𝑥 𝐴𝐹𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104  ∀wal 1393  ∃wex 1538  ∃!weu 2077  ∃*wmo 2078   ∈ wcel 2200  Vcvv 2799  ∅c0 3491  ⟨cop 3669   class class class wbr 4082

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-setind 4628

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4083

This theorem is referenced by:  fvprc  5620