MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-disj Structured version   Unicode version

Definition df-disj 4251
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
StepHypRef Expression
1 vx . . 3  setvar  x
2 cA . . 3  class  A
3 cB . . 3  class  B
41, 2, 3wdisj 4250 . 2  wff Disj  x  e.  A  B
5 vy . . . . . 6  setvar  y
65cv 1361 . . . . 5  class  y
76, 3wcel 1755 . . . 4  wff  y  e.  B
87, 1, 2wrmo 2708 . . 3  wff  E* x  e.  A  y  e.  B
98, 5wal 1360 . 2  wff  A. y E* x  e.  A  y  e.  B
104, 9wb 184 1  wff  (Disj  x  e.  A  B  <->  A. y E* x  e.  A  y  e.  B )
Colors of variables: wff setvar class
This definition is referenced by:  dfdisj2  4252  disjss2  4253  cbvdisj  4260  nfdisj1  4263  disjor  4264  disjiun  4270  cbvdisjf  25741  disjss1f  25742  disjorf  25747  disjin  25753  disjrdx  25757  ddemeas  26506
  Copyright terms: Public domain W3C validator