MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  brprcneu Structured version   Visualization version   GIF version

Theorem brprcneu 6656
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.
StepHypRef Expression
1 dtru 5263 . . . . . . . . 9 ¬ ∀𝑦 𝑦 = 𝑥
2 exnal 1823 . . . . . . . . . 10 (∃𝑦 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑦 𝑥 = 𝑦)
3 equcom 2021 . . . . . . . . . . 11 (𝑥 = 𝑦𝑦 = 𝑥)
43albii 1816 . . . . . . . . . 10 (∀𝑦 𝑥 = 𝑦 ↔ ∀𝑦 𝑦 = 𝑥)
52, 4xchbinx 336 . . . . . . . . 9 (∃𝑦 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑦 𝑦 = 𝑥)
61, 5mpbir 233 . . . . . . . 8 𝑦 ¬ 𝑥 = 𝑦
76jctr 527 . . . . . . 7 (∅ ∈ 𝐹 → (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
8 19.42v 1950 . . . . . . 7 (∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
97, 8sylibr 236 . . . . . 6 (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))
10 opprc1 4820 . . . . . . . 8 𝐴 ∈ V → ⟨𝐴, 𝑥⟩ = ∅)
1110eleq1d 2897 . . . . . . 7 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
12 opprc1 4820 . . . . . . . . . . . 12 𝐴 ∈ V → ⟨𝐴, 𝑦⟩ = ∅)
1312eleq1d 2897 . . . . . . . . . . 11 𝐴 ∈ V → (⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
1411, 13anbi12d 632 . . . . . . . . . 10 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹)))
15 anidm 567 . . . . . . . . . 10 ((∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹) ↔ ∅ ∈ 𝐹)
1614, 15syl6bb 289 . . . . . . . . 9 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ ∅ ∈ 𝐹))
1716anbi1d 631 . . . . . . . 8 𝐴 ∈ V → (((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
1817exbidv 1918 . . . . . . 7 𝐴 ∈ V → (∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
1911, 18imbi12d 347 . . . . . 6 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)) ↔ (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))))
209, 19mpbiri 260 . . . . 5 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)))
21 df-br 5059 . . . . 5 (𝐴𝐹𝑥 ↔ ⟨𝐴, 𝑥⟩ ∈ 𝐹)
22 df-br 5059 . . . . . . . 8 (𝐴𝐹𝑦 ↔ ⟨𝐴, 𝑦⟩ ∈ 𝐹)
2321, 22anbi12i 628 . . . . . . 7 ((𝐴𝐹𝑥𝐴𝐹𝑦) ↔ (⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
2423anbi1i 625 . . . . . 6 (((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
2524exbii 1844 . . . . 5 (∃𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
2620, 21, 253imtr4g 298 . . . 4 𝐴 ∈ V → (𝐴𝐹𝑥 → ∃𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
2726eximdv 1914 . . 3 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ∃𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
28 exnal 1823 . . . 4 (∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ∀𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
29 exanali 1855 . . . . 5 (∃𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ¬ ∀𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
3029exbii 1844 . . . 4 (∃𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
31 breq2 5062 . . . . . 6 (𝑥 = 𝑦 → (𝐴𝐹𝑥𝐴𝐹𝑦))
3231mo4 2646 . . . . 5 (∃*𝑥 𝐴𝐹𝑥 ↔ ∀𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
3332notbii 322 . . . 4 (¬ ∃*𝑥 𝐴𝐹𝑥 ↔ ¬ ∀𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
3428, 30, 333bitr4ri 306 . . 3 (¬ ∃*𝑥 𝐴𝐹𝑥 ↔ ∃𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦))
3527, 34syl6ibr 254 . 2 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
36 df-eu 2650 . . . 4 (∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
3736notbii 322 . . 3 (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
38 imnan 402 . . 3 ((∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥) ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
3937, 38bitr4i 280 . 2 (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
4035, 39sylibr 236 1 𝐴 ∈ V → ¬ ∃!𝑥 𝐴𝐹𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398  wal 1531  wex 1776  wcel 2110  ∃*wmo 2616  ∃!weu 2649  Vcvv 3494  c0 4290  cop 4566   class class class wbr 5058
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-nul 5202  ax-pow 5258
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-br 5059
This theorem is referenced by:  fvprc  6657  eubrv  43264
  Copyright terms: Public domain W3C validator