Theorem erimeq2 39440

Description: Equivalence relation on its natural domain implies that the class of coelements on the domain is equal to the relation (this is prter3 39684 in a more convenient form , see also erimeq 39441). (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.

Step	Hyp	Ref	Expression
1		relcoels 39191	. . . 4 ⊢ Rel ∼ 𝐴
2	1	a1i 11	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → Rel ∼ 𝐴)
3		eqvrelrel 39358	. . . 4 ⊢ ( EqvRel 𝑅 → Rel 𝑅)
4	3	ad2antrl 740	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → Rel 𝑅)
5		brcoels 39202	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥 ∼ 𝐴𝑦 ↔ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢)))
6	5	el2v 3462	. . . 4 ⊢ (𝑥 ∼ 𝐴𝑦 ↔ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢))
7		simpll 778	. . . . . . . . . . . 12 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → EqvRel 𝑅)
8		simprl 782	. . . . . . . . . . . . 13 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → 𝑢 ∈ 𝐴)
9		simplr 780	. . . . . . . . . . . . 13 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → (dom 𝑅 / 𝑅) = 𝐴)
10	8, 9	eleqtrrd 2866	. . . . . . . . . . . 12 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → 𝑢 ∈ (dom 𝑅 / 𝑅))
11		simprr 784	. . . . . . . . . . . 12 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → 𝑥 ∈ 𝑢)
12		eqvrelqsel 39377	. . . . . . . . . . . 12 ⊢ (( EqvRel 𝑅 ∧ 𝑢 ∈ (dom 𝑅 / 𝑅) ∧ 𝑥 ∈ 𝑢) → 𝑢 = [𝑥]𝑅)
13	7, 10, 11, 12	syl3anc 1398	. . . . . . . . . . 11 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → 𝑢 = [𝑥]𝑅)
14	13	eleq2d 2849	. . . . . . . . . 10 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → (𝑦 ∈ 𝑢 ↔ 𝑦 ∈ [𝑥]𝑅))
15		elecALTV 38948	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑦 ∈ [𝑥]𝑅 ↔ 𝑥𝑅𝑦))
16	15	el2v 3462	. . . . . . . . . 10 ⊢ (𝑦 ∈ [𝑥]𝑅 ↔ 𝑥𝑅𝑦)
17	14, 16	bitrdi 290	. . . . . . . . 9 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ 𝑥 ∈ 𝑢)) → (𝑦 ∈ 𝑢 ↔ 𝑥𝑅𝑦))
18	17	anassrs 472	. . . . . . . 8 ⊢ (((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑢 ∈ 𝐴) ∧ 𝑥 ∈ 𝑢) → (𝑦 ∈ 𝑢 ↔ 𝑥𝑅𝑦))
19	18	pm5.32da 589	. . . . . . 7 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑢 ∈ 𝐴) → ((𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) ↔ (𝑥 ∈ 𝑢 ∧ 𝑥𝑅𝑦)))
20	19	rexbidva 3187	. . . . . 6 ⊢ (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → (∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) ↔ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑥𝑅𝑦)))
21	20	adantl 486	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) ↔ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑥𝑅𝑦)))
22		simpll 778	. . . . . . . . . . 11 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → EqvRel 𝑅)
23		simpr 489	. . . . . . . . . . 11 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → 𝑥𝑅𝑦)
24	22, 23	eqvrelcl 39373	. . . . . . . . . 10 ⊢ ((( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) ∧ 𝑥𝑅𝑦) → 𝑥 ∈ dom 𝑅)
25	24	adantll 726	. . . . . . . . 9 ⊢ (((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → 𝑥 ∈ dom 𝑅)
26		eqvrelim 39362	. . . . . . . . . . . . . 14 ⊢ ( EqvRel 𝑅 → dom 𝑅 = ran 𝑅)
27	26	ad2antrl 740	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → dom 𝑅 = ran 𝑅)
28	27	eleq2d 2849	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅 ↔ 𝑥 ∈ ran 𝑅))
29		dmqseqim2 39419	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ 𝑉 → (Rel 𝑅 → ((dom 𝑅 / 𝑅) = 𝐴 → (𝑥 ∈ ran 𝑅 ↔ 𝑥 ∈ ∪ 𝐴))))
30	3, 29	syl5 35	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ 𝑉 → ( EqvRel 𝑅 → ((dom 𝑅 / 𝑅) = 𝐴 → (𝑥 ∈ ran 𝑅 ↔ 𝑥 ∈ ∪ 𝐴))))
31	30	imp32 423	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ ran 𝑅 ↔ 𝑥 ∈ ∪ 𝐴))
32	28, 31	bitrd 282	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅 ↔ 𝑥 ∈ ∪ 𝐴))
33		eluni2 4876	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
34	32, 33	bitrdi 290	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∈ dom 𝑅 ↔ ∃𝑢 ∈ 𝐴 𝑥 ∈ 𝑢))
35	34	adantr 485	. . . . . . . . 9 ⊢ (((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑥 ∈ dom 𝑅 ↔ ∃𝑢 ∈ 𝐴 𝑥 ∈ 𝑢))
36	25, 35	mpbid 235	. . . . . . . 8 ⊢ (((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) ∧ 𝑥𝑅𝑦) → ∃𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
37	36	ex 417	. . . . . . 7 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 → ∃𝑢 ∈ 𝐴 𝑥 ∈ 𝑢))
38	37	pm4.71rd 571	. . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 ↔ (∃𝑢 ∈ 𝐴 𝑥 ∈ 𝑢 ∧ 𝑥𝑅𝑦)))
39		r19.41v 3195	. . . . . 6 ⊢ (∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑥𝑅𝑦) ↔ (∃𝑢 ∈ 𝐴 𝑥 ∈ 𝑢 ∧ 𝑥𝑅𝑦))
40	38, 39	bitr4di 292	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥𝑅𝑦 ↔ ∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑥𝑅𝑦)))
41	21, 40	bitr4d 285	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (∃𝑢 ∈ 𝐴 (𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) ↔ 𝑥𝑅𝑦))
42	6, 41	bitrid 286	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → (𝑥 ∼ 𝐴𝑦 ↔ 𝑥𝑅𝑦))
43	2, 4, 42	eqbrrdv 5779	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ ( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) → ∼ 𝐴 = 𝑅)
44	43	ex 417	1 ⊢ (𝑅 ∈ 𝑉 → (( EqvRel 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴) → ∼ 𝐴 = 𝑅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  Vcvv 3455  ∪ cuni 4872   class class class wbr 5109  dom cdm 5661  ran crn 5662  Rel wrel 5666  [cec 8688   / cqs 8689   ∼ ccoels 38861   EqvRel weqvrel 38877

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735  ax-sep 5257  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-id 5556  df-eprel 5561  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ec 8692  df-qs 8696  df-coss 39178  df-coels 39179  df-refrel 39269  df-symrel 39301  df-trrel 39335  df-eqvrel 39346

This theorem is used by:  erimeq  39441