Definition df-eldisj 39159

Description: Define the disjoint element relation predicate, i.e., the disjoint elementhood predicate. Read: the elements of 𝐴 are disjoint. The element of the disjoint elements class and the disjoint elementhood predicate are the same, that is (𝐴 ∈ ElDisjs ↔ ElDisj 𝐴) when 𝐴 is a set, see eleldisjseldisj 39196.

As of now, disjoint elementhood is defined as "partition" in set.mm : compare df-prt 39364 with dfeldisj5 39180. See also the comments of dfmembpart2 39240 and of df-parts 39235. (Contributed by Peter Mazsa, 17-Jul-2021.)

Assertion

Ref	Expression
df-eldisj	⊢ ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))

Detailed syntax breakdown of Definition df-eldisj

Step	Hyp	Ref	Expression
1		cA	. . 3 class 𝐴
2	1	weldisj 38588	. 2 wff ElDisj 𝐴
3		cep 5517	. . . . 5 class E
4	3	ccnv 5617	. . . 4 class ◡ E
5	4, 1	cres 5620	. . 3 class (◡ E ↾ 𝐴)
6	5	wdisjALTV 38586	. 2 wff Disj (◡ E ↾ 𝐴)
7	2, 6	wb 207	1 wff ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))

This definition is referenced by:  dfeldisj2  39177  dfeldisj3  39178  dfeldisj4  39179  eleldisjseldisj  39196  eldisjss  39205  eldisjeq  39208  eldisjn0elb  39212  dfmembpart2  39240  eldisjim  39254  eldisjim2  39255  eldisjn0el  39276  eldisjlem19  39280  eqvreldisj3  39296