Theorem dfpeters2 39949

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 39947 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 39727	. . . . . . 7 ⊢ (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛)))
2	1	elv 3455	. . . . . 6 ⊢ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛))
3		1cossxrncnvepresex 39487	. . . . . . . . . 10 ⊢ ((𝑛 ∈ V ∧ 𝑟 ∈ V) → ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
4	3	el2v 3457	. . . . . . . . 9 ⊢ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
5		brdmqss 39705	. . . . . . . . 9 ⊢ ((𝑛 ∈ V ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
6	4, 5	mpan2 704	. . . . . . . 8 ⊢ (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
7	6	elv 3455	. . . . . . 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 5171	. . . 4 ⊢ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
11		inopab 5806	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
12	10, 11	eqtr4i 2786	. . 3 ⊢ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
13	12	ineq2i 4114	. 2 ⊢ (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = (( Rels × CoMembErs ) ∩ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}))
14		inopab 5806	. . 3 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
15		df-xp 5656	. . . 4 ⊢ ( Rels × CoMembErs ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )}
16	15	ineq1i 4113	. . 3 ⊢ (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
17		df-peters 39944	. . 3 ⊢ PetErs = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
18	14, 16, 17	3eqtr4ri 2794	. 2 ⊢ PetErs = (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
19		inass 4124	. 2 ⊢ ((( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels }) ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = (( Rels × CoMembErs ) ∩ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}))
20	13, 18, 19	3eqtr4i 2793	1 ⊢ PetErs = ((( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels }) ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∩ cin 4089   class class class wbr 5102  {copab 5166   E cep 5549   × cxp 5648  ^◡ccnv 5649  dom cdm 5650   ↾ cres 5652   / cqs 8716   ⋉ cxrn 39149   ≀ ccoss 39158   Rels crels 39160   EqvRels ceqvrels 39174   DomainQss cdmqss 39181   Ers cers 39183   PetErs cpeters 39185   CoMembErs ccomembers 39187

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-eprel 5550  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546  df-1st 8001  df-2nd 8002  df-ec 8719  df-qs 8723  df-xrn 39355  df-coss 39476  df-dmqss 39697  df-ers 39723  df-peters 39944

This theorem is used by: (None)