Theorem dfpeters2 39709

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 39707 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 39487	. . . . . . 7 ⊢ (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛)))
2	1	elv 3458	. . . . . 6 ⊢ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛))
3		1cossxrncnvepresex 39247	. . . . . . . . . 10 ⊢ ((𝑛 ∈ V ∧ 𝑟 ∈ V) → ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
4	3	el2v 3460	. . . . . . . . 9 ⊢ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
5		brdmqss 39465	. . . . . . . . 9 ⊢ ((𝑛 ∈ V ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
6	4, 5	mpan2 704	. . . . . . . 8 ⊢ (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
7	6	elv 3458	. . . . . . 7 ⊢ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)
8	7	anbi2i 635	. . . . . 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 5176	. . . 4 ⊢ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
11		inopab 5814	. . . 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 4166	. 2 ⊢ (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = (( Rels × CoMembErs ) ∩ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}))
14		inopab 5814	. . 3 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
15		df-xp 5665	. . . 4 ⊢ ( Rels × CoMembErs ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )}
16	15	ineq1i 4165	. . 3 ⊢ (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
17		df-peters 39704	. . 3 ⊢ PetErs = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
18	14, 16, 17	3eqtr4ri 2796	. 2 ⊢ PetErs = (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
19		inass 4176	. 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 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ∩ cin 3901   class class class wbr 5107  {copab 5171   E cep 5558   × cxp 5657  ^◡ccnv 5658  dom cdm 5659   ↾ cres 5661   / cqs 8698   ⋉ cxrn 38909   ≀ ccoss 38918   Rels crels 38920   EqvRels ceqvrels 38934   DomainQss cdmqss 38941   Ers cers 38943   PetErs cpeters 38945   CoMembErs ccomembers 38947

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-eprel 5559  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-1st 7989  df-2nd 7990  df-ec 8701  df-qs 8705  df-xrn 39115  df-coss 39236  df-dmqss 39457  df-ers 39483  df-peters 39704

This theorem is used by: (None)