Definition df-er 6811

Description: Define the equivalence relation predicate. Our notation is not standard. A formal notation doesn't seem to exist in the literature; instead only informal English tends to be used. The present definition, although somewhat cryptic, nicely avoids dummy variables. In dfer2 6812 we derive a more typical definition. We show that an equivalence relation is reflexive, symmetric, and transitive in erref 6831, ersymb 6825, and ertr 6826. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 2-Nov-2015.)

Assertion

Ref	Expression
df-er	⊢ (𝑅 Er 𝐴 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅))

Detailed syntax breakdown of Definition df-er

Step	Hyp	Ref	Expression
1		cA	. . 3 class 𝐴
2		cR	. . 3 class 𝑅
3	1, 2	wer 6808	. 2 wff 𝑅 Er 𝐴
4	2	wrel 4781	. . 3 wff Rel 𝑅
5	2	cdm 4776	. . . 4 class dom 𝑅
6	5, 1	wceq 1402	. . 3 wff dom 𝑅 = 𝐴
7	2	ccnv 4775	. . . . 5 class ◡𝑅
8	2, 2	ccom 4780	. . . . 5 class (𝑅 ∘ 𝑅)
9	7, 8	cun 3218	. . . 4 class (◡𝑅 ∪ (𝑅 ∘ 𝑅))
10	9, 2	wss 3220	. . 3 wff (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅
11	4, 6, 10	w3a 1009	. 2 wff (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅)
12	3, 11	wb 105	1 wff (𝑅 Er 𝐴 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅))

This definition is used by:  dfer2  6812  ereq1  6818  ereq2  6819  errel  6820  erdm  6821  ersym  6823  ertr  6826  xpider  6884