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

Theorem erim2 36789
Description: Equivalence relation on its natural domain implies that the class of coelements on the domain is equal to the relation (this is prter3 36896 in a more convenient form , see also erim 36790). (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
erim2 (𝑅𝑉 → (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → ∼ 𝐴 = 𝑅))

Proof of Theorem erim2
Dummy variables 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relcoels 36547 . . . 4 Rel ∼ 𝐴
21a1i 11 . . 3 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → Rel ∼ 𝐴)
3 eqvrelrel 36710 . . . 4 ( EqvRel 𝑅 → Rel 𝑅)
43ad2antrl 725 . . 3 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → Rel 𝑅)
5 brcoels 36558 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥𝐴𝑦 ↔ ∃𝑢𝐴 (𝑥𝑢𝑦𝑢)))
65el2v 3440 . . . 4 (𝑥𝐴𝑦 ↔ ∃𝑢𝐴 (𝑥𝑢𝑦𝑢))
7 simpll 764 . . . . . . . . . . . 12 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → EqvRel 𝑅)
8 simprl 768 . . . . . . . . . . . . 13 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑢𝐴)
9 simplr 766 . . . . . . . . . . . . 13 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → (dom 𝑅 / 𝑅) = 𝐴)
108, 9eleqtrrd 2842 . . . . . . . . . . . 12 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑢 ∈ (dom 𝑅 / 𝑅))
11 simprr 770 . . . . . . . . . . . 12 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑥𝑢)
12 eqvrelqsel 36729 . . . . . . . . . . . 12 (( EqvRel 𝑅𝑢 ∈ (dom 𝑅 / 𝑅) ∧ 𝑥𝑢) → 𝑢 = [𝑥]𝑅)
137, 10, 11, 12syl3anc 1370 . . . . . . . . . . 11 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → 𝑢 = [𝑥]𝑅)
1413eleq2d 2824 . . . . . . . . . 10 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → (𝑦𝑢𝑦 ∈ [𝑥]𝑅))
15 elecALTV 36405 . . . . . . . . . . 11 ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑦 ∈ [𝑥]𝑅𝑥𝑅𝑦))
1615el2v 3440 . . . . . . . . . 10 (𝑦 ∈ [𝑥]𝑅𝑥𝑅𝑦)
1714, 16bitrdi 287 . . . . . . . . 9 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢𝐴𝑥𝑢)) → (𝑦𝑢𝑥𝑅𝑦))
1817anassrs 468 . . . . . . . 8 (((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑢𝐴) ∧ 𝑥𝑢) → (𝑦𝑢𝑥𝑅𝑦))
1918pm5.32da 579 . . . . . . 7 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑢𝐴) → ((𝑥𝑢𝑦𝑢) ↔ (𝑥𝑢𝑥𝑅𝑦)))
2019rexbidva 3225 . . . . . 6 (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → (∃𝑢𝐴 (𝑥𝑢𝑦𝑢) ↔ ∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦)))
2120adantl 482 . . . . 5 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (∃𝑢𝐴 (𝑥𝑢𝑦𝑢) ↔ ∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦)))
22 simpll 764 . . . . . . . . . . 11 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → EqvRel 𝑅)
23 simpr 485 . . . . . . . . . . 11 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → 𝑥𝑅𝑦)
2422, 23eqvrelcl 36725 . . . . . . . . . 10 ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → 𝑥 ∈ dom 𝑅)
2524adantll 711 . . . . . . . . 9 (((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → 𝑥 ∈ dom 𝑅)
26 eqvrelim 36714 . . . . . . . . . . . . . 14 ( EqvRel 𝑅 → dom 𝑅 = ran 𝑅)
2726ad2antrl 725 . . . . . . . . . . . . 13 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → dom 𝑅 = ran 𝑅)
2827eleq2d 2824 . . . . . . . . . . . 12 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅𝑥 ∈ ran 𝑅))
29 dmqseqim2 36769 . . . . . . . . . . . . . 14 (𝑅𝑉 → (Rel 𝑅 → ((dom 𝑅 / 𝑅) = 𝐴 → (𝑥 ∈ ran 𝑅𝑥 𝐴))))
303, 29syl5 34 . . . . . . . . . . . . 13 (𝑅𝑉 → ( EqvRel 𝑅 → ((dom 𝑅 / 𝑅) = 𝐴 → (𝑥 ∈ ran 𝑅𝑥 𝐴))))
3130imp32 419 . . . . . . . . . . . 12 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ ran 𝑅𝑥 𝐴))
3228, 31bitrd 278 . . . . . . . . . . 11 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅𝑥 𝐴))
33 eluni2 4843 . . . . . . . . . . 11 (𝑥 𝐴 ↔ ∃𝑢𝐴 𝑥𝑢)
3432, 33bitrdi 287 . . . . . . . . . 10 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅 ↔ ∃𝑢𝐴 𝑥𝑢))
3534adantr 481 . . . . . . . . 9 (((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑥 ∈ dom 𝑅 ↔ ∃𝑢𝐴 𝑥𝑢))
3625, 35mpbid 231 . . . . . . . 8 (((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → ∃𝑢𝐴 𝑥𝑢)
3736ex 413 . . . . . . 7 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 → ∃𝑢𝐴 𝑥𝑢))
3837pm4.71rd 563 . . . . . 6 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 ↔ (∃𝑢𝐴 𝑥𝑢𝑥𝑅𝑦)))
39 r19.41v 3276 . . . . . 6 (∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦) ↔ (∃𝑢𝐴 𝑥𝑢𝑥𝑅𝑦))
4038, 39bitr4di 289 . . . . 5 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 ↔ ∃𝑢𝐴 (𝑥𝑢𝑥𝑅𝑦)))
4121, 40bitr4d 281 . . . 4 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (∃𝑢𝐴 (𝑥𝑢𝑦𝑢) ↔ 𝑥𝑅𝑦))
426, 41syl5bb 283 . . 3 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝐴𝑦𝑥𝑅𝑦))
432, 4, 42eqbrrdv 5703 . 2 ((𝑅𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → ∼ 𝐴 = 𝑅)
4443ex 413 1 (𝑅𝑉 → (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → ∼ 𝐴 = 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wrex 3065  Vcvv 3432   cuni 4839   class class class wbr 5074  dom cdm 5589  ran crn 5590  Rel wrel 5594  [cec 8496   / cqs 8497  ccoels 36334   EqvRel weqvrel 36350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-id 5489  df-eprel 5495  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ec 8500  df-qs 8504  df-coss 36537  df-coels 36538  df-refrel 36630  df-symrel 36658  df-trrel 36688  df-eqvrel 36698
This theorem is referenced by:  erim  36790
  Copyright terms: Public domain W3C validator