Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  erimeq2 Structured version   Visualization version   GIF version

Theorem erimeq2 39336
Description: Equivalence relation on its natural domain implies that the class of coelements on the domain is equal to the relation (this is prter3 39580 in a more convenient form , see also erimeq 39337). (Contributed by Rodolfo Medina, 19-Oct-2010.) (Proof shortened by Mario Carneiro, 12-Aug-2015.) (Revised by Peter Mazsa, 29-Dec-2021.)
Assertion
Ref Expression
erimeq2 (𝑅𝑉 → (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → ∼ 𝐴 = 𝑅))

Proof of Theorem erimeq2
Dummy variables 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relcoels 39087 . . . 4 Rel ∼ 𝐴
21a1i 11 . . 3 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → Rel ∼ 𝐴)
3 eqvrelrel 39254 . . . 4 ( EqvRel 𝑅 → Rel 𝑅)
43ad2antrl 740 . . 3 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → Rel 𝑅)
5 brcoels 39098 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥𝐴𝑦 ↔ ∃𝑢𝐴 (𝑥𝑢𝑦𝑢)))
65el2v 3470 . . . 4 (𝑥𝐴𝑦 ↔ ∃𝑢𝐴 (𝑥𝑢𝑦𝑢))
7 simpll 778 . . . . . . . . . . . 12 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → EqvRel 𝑅)
8 simprl 782 . . . . . . . . . . . . 13 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑢𝐴)
9 simplr 780 . . . . . . . . . . . . 13 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → (dom 𝑅 / 𝑅) = 𝐴)
108, 9eleqtrrd 2872 . . . . . . . . . . . 12 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑢 ∈ (dom 𝑅 / 𝑅))
11 simprr 784 . . . . . . . . . . . 12 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑥𝑢)
12 eqvrelqsel 39273 . . . . . . . . . . . 12 (( EqvRel 𝑅𝑢 ∈ (dom 𝑅 / 𝑅) ∧ 𝑥𝑢) → 𝑢 = [𝑥]𝑅)
137, 10, 11, 12syl3anc 1396 . . . . . . . . . . 11 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑢 = [𝑥]𝑅)
1413eleq2d 2855 . . . . . . . . . 10 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → (𝑦𝑢𝑦 ∈ [𝑥]𝑅))
15 elecALTV 38844 . . . . . . . . . . 11 ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑦 ∈ [𝑥]𝑅𝑥𝑅𝑦))
1615el2v 3470 . . . . . . . . . 10 (𝑦 ∈ [𝑥]𝑅𝑥𝑅𝑦)
1714, 16bitrdi 290 . . . . . . . . 9 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → (𝑦𝑢𝑥𝑅𝑦))
1817anassrs 472 . . . . . . . 8 (((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑢𝐴) ∧ 𝑥𝑢) → (𝑦𝑢𝑥𝑅𝑦))
1918pm5.32da 589 . . . . . . 7 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑢𝐴) → ((𝑥𝑢𝑦𝑢) ↔ (𝑥𝑢𝑥𝑅𝑦)))
2019rexbidva 3193 . . . . . 6 (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → (∃𝑢𝐴 (𝑥𝑢𝑦𝑢) ↔ ∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦)))
2120adantl 486 . . . . 5 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (∃𝑢𝐴 (𝑥𝑢𝑦𝑢) ↔ ∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦)))
22 simpll 778 . . . . . . . . . . 11 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → EqvRel 𝑅)
23 simpr 489 . . . . . . . . . . 11 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → 𝑥𝑅𝑦)
2422, 23eqvrelcl 39269 . . . . . . . . . 10 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → 𝑥 ∈ dom 𝑅)
2524adantll 726 . . . . . . . . 9 (((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → 𝑥 ∈ dom 𝑅)
26 eqvrelim 39258 . . . . . . . . . . . . . 14 ( EqvRel 𝑅 → dom 𝑅 = ran 𝑅)
2726ad2antrl 740 . . . . . . . . . . . . 13 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → dom 𝑅 = ran 𝑅)
2827eleq2d 2855 . . . . . . . . . . . 12 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅𝑥 ∈ ran 𝑅))
29 dmqseqim2 39315 . . . . . . . . . . . . . 14 (𝑅𝑉 → (Rel 𝑅 → ((dom 𝑅 / 𝑅) = 𝐴 → (𝑥 ∈ ran 𝑅𝑥 𝐴))))
303, 29syl5 35 . . . . . . . . . . . . 13 (𝑅𝑉 → ( EqvRel 𝑅 → ((dom 𝑅 / 𝑅) = 𝐴 → (𝑥 ∈ ran 𝑅𝑥 𝐴))))
3130imp32 423 . . . . . . . . . . . 12 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ ran 𝑅𝑥 𝐴))
3228, 31bitrd 282 . . . . . . . . . . 11 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅𝑥 𝐴))
33 eluni2 4880 . . . . . . . . . . 11 (𝑥 𝐴 ↔ ∃𝑢𝐴 𝑥𝑢)
3432, 33bitrdi 290 . . . . . . . . . 10 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅 ↔ ∃𝑢𝐴 𝑥𝑢))
3534adantr 485 . . . . . . . . 9 (((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑥 ∈ dom 𝑅 ↔ ∃𝑢𝐴 𝑥𝑢))
3625, 35mpbid 235 . . . . . . . 8 (((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → ∃𝑢𝐴 𝑥𝑢)
3736ex 417 . . . . . . 7 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 → ∃𝑢𝐴 𝑥𝑢))
3837pm4.71rd 571 . . . . . 6 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 ↔ (∃𝑢𝐴 𝑥𝑢𝑥𝑅𝑦)))
39 r19.41v 3201 . . . . . 6 (∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦) ↔ (∃𝑢𝐴 𝑥𝑢𝑥𝑅𝑦))
4038, 39bitr4di 292 . . . . 5 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 ↔ ∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦)))
4121, 40bitr4d 285 . . . 4 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (∃𝑢𝐴 (𝑥𝑢𝑦𝑢) ↔ 𝑥𝑅𝑦))
426, 41bitrid 286 . . 3 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝐴𝑦𝑥𝑅𝑦))
432, 4, 42eqbrrdv 5780 . 2 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → ∼ 𝐴 = 𝑅)
4443ex 417 1 (𝑅𝑉 → (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → ∼ 𝐴 = 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wrex 3095  Vcvv 3463   cuni 4876   class class class wbr 5113  dom cdm 5662  ran crn 5663  Rel wrel 5667  [cec 8692   / cqs 8693  ccoels 38757   EqvRel weqvrel 38773
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-11 2198  ax-ext 2741  ax-sep 5261  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-id 5557  df-eprel 5562  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-ec 8696  df-qs 8700  df-coss 39074  df-coels 39075  df-refrel 39165  df-symrel 39197  df-trrel 39231  df-eqvrel 39242
This theorem is referenced by:  erimeq  39337
  Copyright terms: Public domain W3C validator