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

Theorem petseq 39575
Description: Generalized partition-equivalence identification.

The partition-side scheme PetParts and the equivalence-side scheme PetErs define the same class of spans (pairs 𝑟, 𝑛).

This plays the same organizational role for lifted spans that mpets 39555 plays for carriers: mpets 39555 identifies MembParts with CoMembErs at the membership-carrier level, while petseq 39575 identifies the corresponding span-level predicates built from Parts and Ers.

Unlike the earlier broad pets 39565, the bridge used here is the type-safe span theorem typesafepets 39574, which restricts to membership block-carriers. Since typedness (𝑟 ∈ Rels and the appropriate carrier condition) is now built directly into PetParts and PetErs, this theorem can be used downstream without repeatedly re-establishing basic typing premises. (Contributed by Peter Mazsa, 19-Feb-2026.)

Assertion
Ref Expression
petseq PetParts = PetErs

Proof of Theorem petseq
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 typesafepets 39574 . . . . . . 7 ((𝑛 ∈ MembParts ∧ 𝑟 ∈ V) → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
21elvd 3468 . . . . . 6 (𝑛 ∈ MembParts → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
32adantl 486 . . . . 5 ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
43pm5.32i 584 . . . 4 (((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛) ↔ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
5 mpets 39555 . . . . . 6 MembParts = CoMembErs
65eleq2i 2862 . . . . 5 (𝑛 ∈ MembParts ↔ 𝑛 ∈ CoMembErs )
76anbi2i 634 . . . 4 ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ↔ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ))
84, 7bianbi 638 . . 3 (((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛) ↔ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
98opabbii 5183 . 2 {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛)}
10 df-petparts 39567 . 2 PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)}
11 df-peters 39568 . 2 PetErs = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛)}
129, 10, 113eqtr4i 2803 1 PetParts = PetErs
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1568  wcel 2150  Vcvv 3462   class class class wbr 5114  {copab 5178   E cep 5564  ccnv 5664  cres 5667  cxrn 38773  ccoss 38782   Rels crels 38784   Ers cers 38807   PetErs cpeters 38809   CoMembErs ccomembers 38811   Parts cparts 38822   MembParts cmembparts 38824   PetParts cpetparts 38826
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5340  ax-pr 5408  ax-un 7736
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2099  df-mo 2574  df-eu 2604  df-clab 2749  df-cleq 2762  df-clel 2845  df-nfc 2919  df-ne 2966  df-ral 3087  df-rex 3097  df-rmo 3376  df-rab 3424  df-v 3464  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5560  df-eprel 5565  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fo 6546  df-fv 6548  df-1st 7989  df-2nd 7990  df-ec 8699  df-qs 8703  df-xrn 38979  df-rels 39039  df-coss 39100  df-coels 39101  df-ssr 39177  df-refs 39189  df-refrels 39190  df-refrel 39191  df-cnvrefs 39204  df-cnvrefrels 39205  df-cnvrefrel 39206  df-syms 39221  df-symrels 39222  df-symrel 39223  df-trs 39255  df-trrels 39256  df-trrel 39257  df-eqvrels 39267  df-eqvrel 39268  df-coeleqvrel 39270  df-dmqss 39321  df-dmqs 39322  df-ers 39347  df-erALTV 39348  df-comembers 39349  df-comember 39350  df-funALTV 39366  df-disjss 39387  df-disjs 39388  df-disjALTV 39389  df-eldisj 39391  df-parts 39467  df-part 39468  df-membparts 39469  df-membpart 39470  df-petparts 39567  df-peters 39568
This theorem is referenced by:  pets2eq  39576
  Copyright terms: Public domain W3C validator