ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  brprcneu GIF version

Theorem brprcneu 5414
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 dtruex 4474 . . . . . . . . 9 𝑦 ¬ 𝑦 = 𝑥
2 equcom 1682 . . . . . . . . . . 11 (𝑥 = 𝑦𝑦 = 𝑥)
32notbii 657 . . . . . . . . . 10 𝑥 = 𝑦 ↔ ¬ 𝑦 = 𝑥)
43exbii 1584 . . . . . . . . 9 (∃𝑦 ¬ 𝑥 = 𝑦 ↔ ∃𝑦 ¬ 𝑦 = 𝑥)
51, 4mpbir 145 . . . . . . . 8 𝑦 ¬ 𝑥 = 𝑦
65jctr 313 . . . . . . 7 (∅ ∈ 𝐹 → (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
7 19.42v 1878 . . . . . . 7 (∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ∃𝑦 ¬ 𝑥 = 𝑦))
86, 7sylibr 133 . . . . . 6 (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))
9 opprc1 3727 . . . . . . . 8 𝐴 ∈ V → ⟨𝐴, 𝑥⟩ = ∅)
109eleq1d 2208 . . . . . . 7 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
11 opprc1 3727 . . . . . . . . . . . 12 𝐴 ∈ V → ⟨𝐴, 𝑦⟩ = ∅)
1211eleq1d 2208 . . . . . . . . . . 11 𝐴 ∈ V → (⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ∅ ∈ 𝐹))
1310, 12anbi12d 464 . . . . . . . . . 10 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹)))
14 anidm 393 . . . . . . . . . 10 ((∅ ∈ 𝐹 ∧ ∅ ∈ 𝐹) ↔ ∅ ∈ 𝐹)
1513, 14syl6bb 195 . . . . . . . . 9 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ ∅ ∈ 𝐹))
1615anbi1d 460 . . . . . . . 8 𝐴 ∈ V → (((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ (∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
1716exbidv 1797 . . . . . . 7 𝐴 ∈ V → (∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦)))
1810, 17imbi12d 233 . . . . . 6 𝐴 ∈ V → ((⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)) ↔ (∅ ∈ 𝐹 → ∃𝑦(∅ ∈ 𝐹 ∧ ¬ 𝑥 = 𝑦))))
198, 18mpbiri 167 . . . . 5 𝐴 ∈ V → (⟨𝐴, 𝑥⟩ ∈ 𝐹 → ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦)))
20 df-br 3930 . . . . 5 (𝐴𝐹𝑥 ↔ ⟨𝐴, 𝑥⟩ ∈ 𝐹)
21 df-br 3930 . . . . . . . 8 (𝐴𝐹𝑦 ↔ ⟨𝐴, 𝑦⟩ ∈ 𝐹)
2220, 21anbi12i 455 . . . . . . 7 ((𝐴𝐹𝑥𝐴𝐹𝑦) ↔ (⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
2322anbi1i 453 . . . . . 6 (((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
2423exbii 1584 . . . . 5 (∃𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) ↔ ∃𝑦((⟨𝐴, 𝑥⟩ ∈ 𝐹 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ∧ ¬ 𝑥 = 𝑦))
2519, 20, 243imtr4g 204 . . . 4 𝐴 ∈ V → (𝐴𝐹𝑥 → ∃𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
2625eximdv 1852 . . 3 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ∃𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦)))
27 exanaliim 1626 . . . . . 6 (∃𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ¬ ∀𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
2827eximi 1579 . . . . 5 (∃𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
29 exnalim 1625 . . . . 5 (∃𝑥 ¬ ∀𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦) → ¬ ∀𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
3028, 29syl 14 . . . 4 (∃𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ¬ ∀𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
31 breq2 3933 . . . . . 6 (𝑥 = 𝑦 → (𝐴𝐹𝑥𝐴𝐹𝑦))
3231mo4 2060 . . . . 5 (∃*𝑥 𝐴𝐹𝑥 ↔ ∀𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
3332notbii 657 . . . 4 (¬ ∃*𝑥 𝐴𝐹𝑥 ↔ ¬ ∀𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) → 𝑥 = 𝑦))
3430, 33sylibr 133 . . 3 (∃𝑥𝑦((𝐴𝐹𝑥𝐴𝐹𝑦) ∧ ¬ 𝑥 = 𝑦) → ¬ ∃*𝑥 𝐴𝐹𝑥)
3526, 34syl6 33 . 2 𝐴 ∈ V → (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
36 eu5 2046 . . . 4 (∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
3736notbii 657 . . 3 (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
38 imnan 679 . . 3 ((∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥) ↔ ¬ (∃𝑥 𝐴𝐹𝑥 ∧ ∃*𝑥 𝐴𝐹𝑥))
3937, 38bitr4i 186 . 2 (¬ ∃!𝑥 𝐴𝐹𝑥 ↔ (∃𝑥 𝐴𝐹𝑥 → ¬ ∃*𝑥 𝐴𝐹𝑥))
4035, 39sylibr 133 1 𝐴 ∈ V → ¬ ∃!𝑥 𝐴𝐹𝑥)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wal 1329  wex 1468  wcel 1480  ∃!weu 1999  ∃*wmo 2000  Vcvv 2686  c0 3363  cop 3530   class class class wbr 3929
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-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-setind 4452
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-br 3930
This theorem is referenced by:  fvprc  5415
  Copyright terms: Public domain W3C validator