Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > df-eldisj | Structured version Visualization version GIF version |
Description: Define the disjoint
elementhood 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 36840.
As of now, disjoint elementhood is defined as "partition" in set.mm : compare df-prt 36886 with dfeldisj5 36832. See also the comments of ~? dfmembpart2 and of ~? df-parts . (Contributed by Peter Mazsa, 17-Jul-2021.) |
Ref | Expression |
---|---|
df-eldisj | ⊢ ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cA | . . 3 class 𝐴 | |
2 | 1 | weldisj 36369 | . 2 wff ElDisj 𝐴 |
3 | cep 5494 | . . . . 5 class E | |
4 | 3 | ccnv 5588 | . . . 4 class ◡ E |
5 | 4, 1 | cres 5591 | . . 3 class (◡ E ↾ 𝐴) |
6 | 5 | wdisjALTV 36367 | . 2 wff Disj (◡ E ↾ 𝐴) |
7 | 2, 6 | wb 205 | 1 wff ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴)) |
Colors of variables: wff setvar class |
This definition is referenced by: dfeldisj2 36829 dfeldisj3 36830 dfeldisj4 36831 eleldisjseldisj 36840 eldisjss 36849 eldisjeq 36852 |
Copyright terms: Public domain | W3C validator |