Definition df-eldisj 39130

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 39167.

As of now, disjoint elementhood is defined as "partition" in set.mm : compare df-prt 39335 with dfeldisj5 39151. See also the comments of dfmembpart2 39211 and of df-parts 39206. (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 38559	. 2 wff ElDisj 𝐴
3		cep 5524	. . . . 5 class E
4	3	ccnv 5624	. . . 4 class ◡ E
5	4, 1	cres 5627	. . 3 class (◡ E ↾ 𝐴)
6	5	wdisjALTV 38557	. 2 wff Disj (◡ E ↾ 𝐴)
7	2, 6	wb 206	1 wff ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))

This definition is referenced by:  dfeldisj2  39148  dfeldisj3  39149  dfeldisj4  39150  eleldisjseldisj  39167  eldisjss  39176  eldisjeq  39179  eldisjn0elb  39183  dfmembpart2  39211  eldisjim  39225  eldisjim2  39226  eldisjn0el  39247  eldisjlem19  39251  eqvreldisj3  39267