Definition df-disj 3959

Description: A collection of classes B ( x ) is disjoint when for each element y, it is in B ( x ) for at most one x. (Contributed by Mario Carneiro, 14-Nov-2016.) (Revised by NM, 16-Jun-2017.)

Assertion

Ref	Expression
df-disj	|- (Disj x e. A B <-> A. y E* x e. A y e. B )

Distinct variable groups:   x, y   y, A   y, B

Allowed substitution hints:   A( x)   B( x)

Detailed syntax breakdown of Definition df-disj

Step	Hyp	Ref	Expression
1		vx	. . 3 setvar x
2		cA	. . 3 class A
3		cB	. . 3 class B
4	1, 2, 3	wdisj 3958	. 2 wff Disj x e. A B
5		vy	. . . . . 6 setvar y
6	5	cv 1342	. . . . 5 class y
7	6, 3	wcel 2136	. . . 4 wff y e. B
8	7, 1, 2	wrmo 2446	. . 3 wff E* x e. A y e. B
9	8, 5	wal 1341	. 2 wff A. y E* x e. A y e. B
10	4, 9	wb 104	1 wff (Disj x e. A B <-> A. y E* x e. A y e. B )

This definition is referenced by:  dfdisj2  3960  disjss2  3961  cbvdisj  3968  nfdisj1  3971  disjnim  3972  disjiun  3976  disjxp1  6200