Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfpeters2 Structured version   Visualization version   GIF version

Theorem dfpeters2 39826
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 39824 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
StepHypRef Expression
1 brers 39604 . . . . . . 7 (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛)))
21elv 3455 . . . . . 6 ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛))
3 1cossxrncnvepresex 39364 . . . . . . . . . 10 ((𝑛 ∈ V ∧ 𝑟 ∈ V) → ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
43el2v 3457 . . . . . . . . 9 ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
5 brdmqss 39582 . . . . . . . . 9 ((𝑛 ∈ V ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
64, 5mpan2 704 . . . . . . . 8 (𝑛 ∈ V → ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
76elv 3455 . . . . . . 7 ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛 ↔ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)
87anbi2i 635 . . . . . 6 (( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) DomainQss 𝑛) ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
92, 8bitri 278 . . . . 5 ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛 ↔ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
109opabbii 5171 . . . 4 {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
11 inopab 5803 . . . 4 ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ( ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels ∧ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
1210, 11eqtr4i 2786 . . 3 {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
1312ineq2i 4162 . 2 (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = (( Rels × CoMembErs ) ∩ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}))
14 inopab 5803 . . 3 ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
15 df-xp 5653 . . . 4 ( Rels × CoMembErs ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )}
1615ineq1i 4161 . . 3 (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs )} ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
17 df-peters 39821 . . 3 PetErs = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛)}
1814, 16, 173eqtr4ri 2794 . 2 PetErs = (( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) Ers 𝑛})
19 inass 4172 . 2 ((( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels }) ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = (( Rels × CoMembErs ) ∩ ({⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}))
2013, 18, 193eqtr4i 2793 1 PetErs = ((( Rels × CoMembErs ) ∩ {⟨𝑟, 𝑛⟩ ∣ ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ EqvRels }) ∩ {⟨𝑟, 𝑛⟩ ∣ (dom ≀ (𝑟 ⋉ (◡ E ↾ 𝑛)) / ≀ (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∩ cin 3897   class class class wbr 5102  {copab 5166   E cep 5546   × cxp 5645  ◡ccnv 5646  dom cdm 5647   ↾ cres 5649   / cqs 8694   ⋉ cxrn 39026   ≀ ccoss 39035   Rels crels 39037   EqvRels ceqvrels 39051   DomainQss cdmqss 39058   Ers cers 39060   PetErs cpeters 39062   CoMembErs ccomembers 39064
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 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 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-dif 3901  df-un 3903  df-in 3905  df-ss 3915  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 5542  df-eprel 5547  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fo 6533  df-fv 6535  df-1st 7984  df-2nd 7985  df-ec 8697  df-qs 8701  df-xrn 39232  df-coss 39353  df-dmqss 39574  df-ers 39600  df-peters 39821
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator