Definition df-eldisj 37242

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

As of now, disjoint elementhood is defined as "partition" in set.mm : compare df-prt 37407 with dfeldisj5 37256. See also the comments of dfmembpart2 37305 and of df-parts 37300. (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 36743	. 2 wff ElDisj 𝐴
3		cep 5541	. . . . 5 class E
4	3	ccnv 5637	. . . 4 class ◡ E
5	4, 1	cres 5640	. . 3 class (◡ E ↾ 𝐴)
6	5	wdisjALTV 36741	. 2 wff Disj (◡ E ↾ 𝐴)
7	2, 6	wb 205	1 wff ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))

This definition is referenced by:  dfeldisj2  37253  dfeldisj3  37254  dfeldisj4  37255  eleldisjseldisj  37264  eldisjss  37273  eldisjeq  37276  eldisjn0elb  37280  dfmembpart2  37305  eldisjim  37319  eldisjim2  37320  eldisjn0el  37341  eldisjlem19  37345  eqvreldisj3  37361