Metamath Proof Explorer


Theorem dfpeters2

Description: Alternate definition of PetErs in fully modular form.

This expands the Ers n predicate into:

(i) a typedness module ( Rels X. CoMembErs ) ,

(ii) an equivalence module for the coset relation ,( r |X. (`' _E |`n ) ) e. EqvRels ,

(iii) the corresponding quotient-carrier (domain quotient) equation dom ,( ... ) /. ,( ... ) = n .

This is the equivalence-side counterpart of the modular decomposition dfpetparts2 on the partition side. (Contributed by Peter Mazsa, 25-Feb-2026)

Ref Expression
Assertion dfpeters2 Could not format assertion : No typesetting found for |- PetErs = ( ( ( Rels X. CoMembErs ) i^i { <. r , n >. | ,~ ( r |X. ( `' _E |` n ) ) e. EqvRels } ) i^i { <. r , n >. | ( dom ,~ ( r |X. ( `' _E |` n ) ) /. ,~ ( r |X. ( `' _E |` n ) ) ) = n } ) with typecode |-

Proof

Step Hyp Ref Expression
1 brers n V r E -1 n Ers n r E -1 n EqvRels r E -1 n DomainQss n
2 1 elv r E -1 n Ers n r E -1 n EqvRels r E -1 n DomainQss n
3 1cossxrncnvepresex n V r V r E -1 n V
4 3 el2v r E -1 n V
5 brdmqss n V r E -1 n V r E -1 n DomainQss n dom r E -1 n / r E -1 n = n
6 4 5 mpan2 n V r E -1 n DomainQss n dom r E -1 n / r E -1 n = n
7 6 elv r E -1 n DomainQss n dom r E -1 n / r E -1 n = n
8 7 anbi2i r E -1 n EqvRels r E -1 n DomainQss n r E -1 n EqvRels dom r E -1 n / r E -1 n = n
9 2 8 bitri r E -1 n Ers n r E -1 n EqvRels dom r E -1 n / r E -1 n = n
10 9 opabbii r n | r E -1 n Ers n = r n | r E -1 n EqvRels dom r E -1 n / r E -1 n = n
11 inopab r n | r E -1 n EqvRels r n | dom r E -1 n / r E -1 n = n = r n | r E -1 n EqvRels dom r E -1 n / r E -1 n = n
12 10 11 eqtr4i r n | r E -1 n Ers n = r n | r E -1 n EqvRels r n | dom r E -1 n / r E -1 n = n
13 12 ineq2i Rels × CoMembErs r n | r E -1 n Ers n = Rels × CoMembErs r n | r E -1 n EqvRels r n | dom r E -1 n / r E -1 n = n
14 inopab r n | r Rels n CoMembErs r n | r E -1 n Ers n = r n | r Rels n CoMembErs r E -1 n Ers n
15 df-xp Rels × CoMembErs = r n | r Rels n CoMembErs
16 15 ineq1i Rels × CoMembErs r n | r E -1 n Ers n = r n | r Rels n CoMembErs r n | r E -1 n Ers n
17 df-peters Could not format PetErs = { <. r , n >. | ( ( r e. Rels /\ n e. CoMembErs ) /\ ,~ ( r |X. ( `' _E |` n ) ) Ers n ) } : No typesetting found for |- PetErs = { <. r , n >. | ( ( r e. Rels /\ n e. CoMembErs ) /\ ,~ ( r |X. ( `' _E |` n ) ) Ers n ) } with typecode |-
18 14 16 17 3eqtr4ri Could not format PetErs = ( ( Rels X. CoMembErs ) i^i { <. r , n >. | ,~ ( r |X. ( `' _E |` n ) ) Ers n } ) : No typesetting found for |- PetErs = ( ( Rels X. CoMembErs ) i^i { <. r , n >. | ,~ ( r |X. ( `' _E |` n ) ) Ers n } ) with typecode |-
19 inass Rels × CoMembErs r n | r E -1 n EqvRels r n | dom r E -1 n / r E -1 n = n = Rels × CoMembErs r n | r E -1 n EqvRels r n | dom r E -1 n / r E -1 n = n
20 13 18 19 3eqtr4i Could not format PetErs = ( ( ( Rels X. CoMembErs ) i^i { <. r , n >. | ,~ ( r |X. ( `' _E |` n ) ) e. EqvRels } ) i^i { <. r , n >. | ( dom ,~ ( r |X. ( `' _E |` n ) ) /. ,~ ( r |X. ( `' _E |` n ) ) ) = n } ) : No typesetting found for |- PetErs = ( ( ( Rels X. CoMembErs ) i^i { <. r , n >. | ,~ ( r |X. ( `' _E |` n ) ) e. EqvRels } ) i^i { <. r , n >. | ( dom ,~ ( r |X. ( `' _E |` n ) ) /. ,~ ( r |X. ( `' _E |` n ) ) ) = n } ) with typecode |-