Theorem dfpeters2 39651

Description: Alternate definition of PetErs in fully modular form.

This expands the Ers 𝑛 predicate into:

(i) a typedness module ( Rels × CoMembErs ),

(ii) an equivalence module for the coset relation ≀ (𝑟 ⋉ (^◡ E ↾ 𝑛)) ∈ EqvRels,

(iii) the corresponding quotient-carrier (domain quotient) equation dom ≀ (...) / ≀ (...) = 𝑛.

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

Assertion

Ref	Expression
dfpeters2	⊢ PetErs = ((( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels }) ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})

Distinct variable group:   𝑛,𝑟

Proof of Theorem dfpeters2

Step	Hyp	Ref	Expression
1		brers 39429	. . . . . . 7 ⊢ (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛)))
2	1	elv 3459	. . . . . 6 ⊢ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛))
3		1cossxrncnvepresex 39189	. . . . . . . . . 10 ⊢ ((𝑛 ∈ V ∧ 𝑟 ∈ V) → ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
4	3	el2v 3461	. . . . . . . . 9 ⊢ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
5		brdmqss 39407	. . . . . . . . 9 ⊢ ((𝑛 ∈ V ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
6	4, 5	mpan2 703	. . . . . . . 8 ⊢ (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
7	6	elv 3459	. . . . . . 7 ⊢ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)
8	7	anbi2i 634	. . . . . 6 ⊢ (( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛) ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
9	2, 8	bitri 278	. . . . 5 ⊢ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
10	9	opabbii 5177	. . . 4 ⊢ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
11		inopab 5815	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
12	10, 11	eqtr4i 2788	. . 3 ⊢ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
13	12	ineq2i 4169	. 2 ⊢ (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = (( Rels × CoMembErs ) ∩ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}))
14		inopab 5815	. . 3 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
15		df-xp 5666	. . . 4 ⊢ ( Rels × CoMembErs ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )}
16	15	ineq1i 4168	. . 3 ⊢ (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
17		df-peters 39646	. . 3 ⊢ PetErs = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
18	14, 16, 17	3eqtr4ri 2796	. 2 ⊢ PetErs = (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
19		inass 4179	. 2 ⊢ ((( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels }) ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = (( Rels × CoMembErs ) ∩ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}))
20	13, 18, 19	3eqtr4i 2795	1 ⊢ PetErs = ((( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels }) ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  Vcvv 3454   ∩ cin 3903   class class class wbr 5108  {copab 5172   E cep 5559   × cxp 5658  ^◡ccnv 5659  dom cdm 5660   ↾ cres 5662   / cqs 8691   ⋉ cxrn 38851   ≀ ccoss 38860   Rels crels 38862   EqvRels ceqvrels 38876   DomainQss cdmqss 38883   Ers cers 38885   PetErs cpeters 38887   CoMembErs ccomembers 38889

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-eprel 5560  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fo 6542  df-fv 6544  df-1st 7984  df-2nd 7985  df-ec 8694  df-qs 8698  df-xrn 39057  df-coss 39178  df-dmqss 39399  df-ers 39425  df-peters 39646

This theorem is used by: (None)