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

Unlike the earlier broad pets 39287, the bridge used here is the type-safe span theorem typesafepets 39296, 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 39296 . . . . . . 7 ((𝑛 ∈ MembParts ∧ 𝑟 ∈ V) → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
21elvd 3435 . . . . . 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 39277 . . . . . 6 MembParts = CoMembErs
65eleq2i 2828 . . . . 5 (𝑛 ∈ MembParts ↔ 𝑛 ∈ CoMembErs )
76anbi2i 624 . . . 4 ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ↔ (𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ))
84, 7bianbi 628 . . 3 (((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛) ↔ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
98opabbii 5152 . 2 {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛)}
10 df-petparts 39289 . 2 PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)}
11 df-peters 39290 . 2 PetErs = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛)}
129, 10, 113eqtr4i 2769 1 PetParts = PetErs
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wcel 2114  Vcvv 3429   class class class wbr 5085  {copab 5147   E cep 5530  ccnv 5630  cres 5633  cxrn 38495  ccoss 38504   Rels crels 38506   Ers cers 38529   PetErs cpeters 38531   CoMembErs ccomembers 38533   Parts cparts 38544   MembParts cmembparts 38546   PetParts cpetparts 38548
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-eprel 5531  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fo 6504  df-fv 6506  df-1st 7942  df-2nd 7943  df-ec 8645  df-qs 8649  df-xrn 38701  df-rels 38761  df-coss 38822  df-coels 38823  df-ssr 38899  df-refs 38911  df-refrels 38912  df-refrel 38913  df-cnvrefs 38926  df-cnvrefrels 38927  df-cnvrefrel 38928  df-syms 38943  df-symrels 38944  df-symrel 38945  df-trs 38977  df-trrels 38978  df-trrel 38979  df-eqvrels 38989  df-eqvrel 38990  df-coeleqvrel 38992  df-dmqss 39043  df-dmqs 39044  df-ers 39069  df-erALTV 39070  df-comembers 39071  df-comember 39072  df-funALTV 39088  df-disjss 39109  df-disjs 39110  df-disjALTV 39111  df-eldisj 39113  df-parts 39189  df-part 39190  df-membparts 39191  df-membpart 39192  df-petparts 39289  df-peters 39290
This theorem is referenced by:  pets2eq  39298
  Copyright terms: Public domain W3C validator