Theorem brprcneuALT 6876

Description: Alternate proof of brprcneu 6875 using ax-pow 5338 instead of ax-pr 5406. (Contributed by Scott Fenton, 7-Oct-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem brprcneuALT

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dtruALT2 5343	. . . . . . . . 9 ⊢ ¬ ∀𝑦 𝑦 = 𝑥
2		exnal 1860	. . . . . . . . . 10 ⊢ (∃𝑦 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑦 𝑥 = 𝑦)
3		equcom 2051	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥)
4	3	albii 1852	. . . . . . . . . 10 ⊢ (∀𝑦 𝑥 = 𝑦 ↔ ∀𝑦 𝑦 = 𝑥)
5	2, 4	xchbinx 337	. . . . . . . . 9 ⊢ (∃𝑦 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑦 𝑦 = 𝑥)
6	1, 5	mpbir 234	. . . . . . . 8 ⊢ ∃𝑦 ¬ 𝑥 = 𝑦
7	6	jctr 534	. . . . . . 7 ⊢ (∅ ∈ 𝐹 → (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
8		19.42v 1986	. . . . . . 7 ⊢ (∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
9	7, 8	sylibr 237	. . . . . 6 ⊢ (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))
10		opprc1 4864	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → ⟨𝐴, 𝑥⟩ = ∅)
11	10	eleq1d 2850	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
12		opprc1 4864	. . . . . . . . . . . 12 ⊢ (¬ 𝐴 ∈ V → ⟨𝐴, 𝑦⟩ = ∅)
13	12	eleq1d 2850	. . . . . . . . . . 11 ⊢ (¬ 𝐴 ∈ V → (⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
14	11, 13	anbi12d 644	. . . . . . . . . 10 ⊢ (¬ 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹)))
15		anidm 575	. . . . . . . . . 10 ⊢ ((∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹) ↔ ∅ ∈ 𝐹)
16	14, 15	bitrdi 290	. . . . . . . . 9 ⊢ (¬ 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ ∅ ∈ 𝐹))
17	16	anbi1d 643	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
18	17	exbidv 1954	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
19	11, 18	imbi12d 347	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)) ↔ (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))))
20	9, 19	mpbiri 261	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)))
21		df-br 5112	. . . . 5 ⊢ (𝐴𝐹𝑥 ↔ ⟨𝐴, 𝑥⟩ ∈ 𝐹)
22		df-br 5112	. . . . . . . 8 ⊢ (𝐴𝐹𝑦 ↔ ⟨𝐴, 𝑦⟩ ∈ 𝐹)
23	21, 22	anbi12i 640	. . . . . . 7 ⊢ ((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ↔ (⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
24	23	anbi1i 636	. . . . . 6 ⊢ (((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
25	24	exbii 1881	. . . . 5 ⊢ (∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
26	20, 21, 25	3imtr4g 299	. . . 4 ⊢ (¬ 𝐴 ∈ V → (𝐴𝐹𝑥 → ∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
27	26	eximdv 1950	. . 3 ⊢ (¬ 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ∃𝑥∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
28		exnal 1860	. . . 4 ⊢ (∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ∀𝑥∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
29		exanali 1892	. . . . 5 ⊢ (∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ¬ ∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
30	29	exbii 1881	. . . 4 ⊢ (∃𝑥∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
31		breq2 5115	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴𝐹𝑥 ↔ 𝐴𝐹𝑦))
32	31	mo4 2596	. . . . 5 ⊢ (∃*𝑥 𝐴𝐹𝑥 ↔ ∀𝑥∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
33	32	notbii 323	. . . 4 ⊢ (¬ ∃*𝑥 𝐴𝐹𝑥 ↔ ¬ ∀𝑥∀𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) → 𝑥 = 𝑦))
34	28, 30, 33	3bitr4ri 307	. . 3 ⊢ (¬ ∃*𝑥 𝐴𝐹𝑥 ↔ ∃𝑥∃𝑦((𝐴𝐹𝑥 ∧ 𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦))
35	27, 34	imbitrrdi 255	. 2 ⊢ (¬ 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
36		df-eu 2599	. . . 4 ⊢ (∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
37	36	notbii 323	. . 3 ⊢ (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
38		imnan 405	. . 3 ⊢ ((∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥) ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
39	37, 38	bitr4i 281	. 2 ⊢ (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
40	35, 39	sylibr 237	1 ⊢ (¬ 𝐴 ∈ V → ¬ ∃!𝑥 𝐴𝐹𝑥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812   ∈ wcel 2146  ∃*wmo 2567  ∃!weu 2598  Vcvv 3457  ∅c0 4286  ⟨cop 4597   class class class wbr 5111

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-nul 5271  ax-pow 5338

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112

This theorem is used by:  fvprcALT  6878