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 39317
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 39297 plays for carriers: mpets 39297 identifies MembParts with CoMembErs at the membership-carrier level, while petseq 39317 identifies the corresponding span-level predicates built from Parts and Ers.

Unlike the earlier broad pets 39307, the bridge used here is the type-safe span theorem typesafepets 39316, 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 39316 . . . . . . 7 ((𝑛 ∈ MembParts ∧ 𝑟 ∈ V) → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
21elvd 3436 . . . . . 6 (𝑛 ∈ MembParts → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
32adantl 481 . . . . 5 ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
43pm5.32i 574 . . . 4 (((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛) ↔ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
5 mpets 39297 . . . . . 6 MembParts = CoMembErs
65eleq2i 2829 . . . . 5 (𝑛 ∈ MembParts ↔ 𝑛 ∈ CoMembErs )
76anbi2i 624 . . . 4 ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ↔ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ))
84, 7bianbi 628 . . 3 (((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛) ↔ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
98opabbii 5153 . 2 {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛)}
10 df-petparts 39309 . 2 PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)}
11 df-peters 39310 . 2 PetErs = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛)}
129, 10, 113eqtr4i 2770 1 PetParts = PetErs
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wcel 2114  Vcvv 3430   class class class wbr 5086  {copab 5148   E cep 5525  ccnv 5625  cres 5628  cxrn 38515  ccoss 38524   Rels crels 38526   Ers cers 38549   PetErs cpeters 38551   CoMembErs ccomembers 38553   Parts cparts 38564   MembParts cmembparts 38566   PetParts cpetparts 38568
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-eprel 5526  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-fo 6500  df-fv 6502  df-1st 7937  df-2nd 7938  df-ec 8640  df-qs 8644  df-xrn 38721  df-rels 38781  df-coss 38842  df-coels 38843  df-ssr 38919  df-refs 38931  df-refrels 38932  df-refrel 38933  df-cnvrefs 38946  df-cnvrefrels 38947  df-cnvrefrel 38948  df-syms 38963  df-symrels 38964  df-symrel 38965  df-trs 38997  df-trrels 38998  df-trrel 38999  df-eqvrels 39009  df-eqvrel 39010  df-coeleqvrel 39012  df-dmqss 39063  df-dmqs 39064  df-ers 39089  df-erALTV 39090  df-comembers 39091  df-comember 39092  df-funALTV 39108  df-disjss 39129  df-disjs 39130  df-disjALTV 39131  df-eldisj 39133  df-parts 39209  df-part 39210  df-membparts 39211  df-membpart 39212  df-petparts 39309  df-peters 39310
This theorem is referenced by:  pets2eq  39318
  Copyright terms: Public domain W3C validator