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

Unlike the earlier broad pets 39246, the bridge used here is the type-safe span theorem typesafepets 39255, 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 39255 . . . . . . 7 ((𝑛 ∈ MembParts ∧ 𝑟 ∈ V) → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛))
21elvd 3448 . . . . . 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 39236 . . . . . 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 5167 . 2 {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ CoMembErs ) ∧ ≀ (𝑟 ⋉ ( E ↾ 𝑛)) Ers 𝑛)}
10 df-petparts 39248 . 2 PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)}
11 df-peters 39249 . 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 3442   class class class wbr 5100  {copab 5162   E cep 5533  ccnv 5633  cres 5636  cxrn 38454  ccoss 38463   Rels crels 38465   Ers cers 38488   PetErs cpeters 38490   CoMembErs ccomembers 38492   Parts cparts 38503   MembParts cmembparts 38505   PetParts cpetparts 38507
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 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692
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 3352  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-eprel 5534  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-fo 6508  df-fv 6510  df-1st 7945  df-2nd 7946  df-ec 8649  df-qs 8653  df-xrn 38660  df-rels 38720  df-coss 38781  df-coels 38782  df-ssr 38858  df-refs 38870  df-refrels 38871  df-refrel 38872  df-cnvrefs 38885  df-cnvrefrels 38886  df-cnvrefrel 38887  df-syms 38902  df-symrels 38903  df-symrel 38904  df-trs 38936  df-trrels 38937  df-trrel 38938  df-eqvrels 38948  df-eqvrel 38949  df-coeleqvrel 38951  df-dmqss 39002  df-dmqs 39003  df-ers 39028  df-erALTV 39029  df-comembers 39030  df-comember 39031  df-funALTV 39047  df-disjss 39068  df-disjs 39069  df-disjALTV 39070  df-eldisj 39072  df-parts 39148  df-part 39149  df-membparts 39150  df-membpart 39151  df-petparts 39248  df-peters 39249
This theorem is referenced by:  pets2eq  39257
  Copyright terms: Public domain W3C validator