Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > df-disj | Structured version Visualization version Unicode version |
Description: A collection of classes is disjoint when for each element , it is in for at most one . (Contributed by Mario Carneiro, 14-Nov-2016.) (Revised by NM, 16-Jun-2017.) |
Ref | Expression |
---|---|
df-disj | Disj |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vx | . . 3 | |
2 | cA | . . 3 | |
3 | cB | . . 3 | |
4 | 1, 2, 3 | wdisj 4620 | . 2 Disj |
5 | vy | . . . . . 6 | |
6 | 5 | cv 1482 | . . . . 5 |
7 | 6, 3 | wcel 1990 | . . . 4 |
8 | 7, 1, 2 | wrmo 2915 | . . 3 |
9 | 8, 5 | wal 1481 | . 2 |
10 | 4, 9 | wb 196 | 1 Disj |
Colors of variables: wff setvar class |
This definition is referenced by: dfdisj2 4622 disjss2 4623 cbvdisj 4630 nfdisj1 4633 disjor 4634 disjiun 4640 cbvdisjf 29385 disjss1f 29386 disjorf 29392 disjin 29399 disjin2 29400 disjrdx 29404 ddemeas 30299 iccpartdisj 41373 |
Copyright terms: Public domain | W3C validator |