Description: Partition-Equivalence Theorem with general R while preserving the restricted converse epsilon relation of mpet2 (as opposed to petincnvepres ). A class is a partition by a range Cartesian product with general R and the restricted converse element class if and only if the cosets by the range Cartesian product are in an equivalence relation on it. Cf. br1cossxrncnvepres .
This theorem (together with pets and pet2 ) is the main result of my investigation into set theory. It is no more general than the conventional Member Partition-Equivalence Theorem mpet , mpet2 and mpet3 (because you cannot set R in this theorem in such a way that you get mpet2 ), i.e., it is not the hypothetical General Partition-Equivalence Theorem gpet |- ( R Part A <-> ,R ErALTV A ) , but this one has a general part that mpet2 lacks: R , which is sufficient for my future application of set theory, for my purpose outside of set theory. (Contributed by Peter Mazsa, 23-Sep-2021)
Ref | Expression | ||
---|---|---|---|
Assertion | pet | Could not format assertion : No typesetting found for |- ( ( R |X. ( `' _E |` A ) ) Part A <-> ,~ ( R |X. ( `' _E |` A ) ) ErALTV A ) with typecode |- |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pet2 | |
|
2 | dfpart2 | Could not format ( ( R |X. ( `' _E |` A ) ) Part A <-> ( Disj ( R |X. ( `' _E |` A ) ) /\ ( dom ( R |X. ( `' _E |` A ) ) /. ( R |X. ( `' _E |` A ) ) ) = A ) ) : No typesetting found for |- ( ( R |X. ( `' _E |` A ) ) Part A <-> ( Disj ( R |X. ( `' _E |` A ) ) /\ ( dom ( R |X. ( `' _E |` A ) ) /. ( R |X. ( `' _E |` A ) ) ) = A ) ) with typecode |- | |
3 | dferALTV2 | |
|
4 | 1 2 3 | 3bitr4i | Could not format ( ( R |X. ( `' _E |` A ) ) Part A <-> ,~ ( R |X. ( `' _E |` A ) ) ErALTV A ) : No typesetting found for |- ( ( R |X. ( `' _E |` A ) ) Part A <-> ,~ ( R |X. ( `' _E |` A ) ) ErALTV A ) with typecode |- |