Definition df-eldisj 38699

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

As of now, disjoint elementhood is defined as "partition" in set.mm : compare df-prt 38865 with dfeldisj5 38713. See also the comments of dfmembpart2 38762 and of df-parts 38757. (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 38205	. 2 wff ElDisj 𝐴
3		cep 5537	. . . . 5 class E
4	3	ccnv 5637	. . . 4 class ◡ E
5	4, 1	cres 5640	. . 3 class (◡ E ↾ 𝐴)
6	5	wdisjALTV 38203	. 2 wff Disj (◡ E ↾ 𝐴)
7	2, 6	wb 206	1 wff ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))

This definition is referenced by:  dfeldisj2  38710  dfeldisj3  38711  dfeldisj4  38712  eleldisjseldisj  38721  eldisjss  38730  eldisjeq  38733  eldisjn0elb  38737  dfmembpart2  38762  eldisjim  38776  eldisjim2  38777  eldisjn0el  38798  eldisjlem19  38802  eqvreldisj3  38818