Definition df-er 6513

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 6514 we derive a more typical definition. We show that an equivalence relation is reflexive, symmetric, and transitive in erref 6533, ersymb 6527, and ertr 6528. (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 6510	. 2 wff 𝑅 Er 𝐴
4	2	wrel 4616	. . 3 wff Rel 𝑅
5	2	cdm 4611	. . . 4 class dom 𝑅
6	5, 1	wceq 1348	. . 3 wff dom 𝑅 = 𝐴
7	2	ccnv 4610	. . . . 5 class ◡𝑅
8	2, 2	ccom 4615	. . . . 5 class (𝑅 ∘ 𝑅)
9	7, 8	cun 3119	. . . 4 class (◡𝑅 ∪ (𝑅 ∘ 𝑅))
10	9, 2	wss 3121	. . 3 wff (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅
11	4, 6, 10	w3a 973	. 2 wff (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅)
12	3, 11	wb 104	1 wff (𝑅 Er 𝐴 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅))

This definition is referenced by:  dfer2  6514  ereq1  6520  ereq2  6521  errel  6522  erdm  6523  ersym  6525  ertr  6528  xpider  6584