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

Theorem dfpetparts2 39313
Description: Alternate definition of PetParts as typedness + disjoint-span + block-lift equilibrium.

This theorem is the key modularization step. It decomposes PetParts into the intersection of three orthogonal modules:

(T) typedness: 𝑟, 𝑛⟩ ∈ ( Rels × MembParts ),

(D) disjoint-span: (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs,

(E) semantic equilibrium: 𝑟, 𝑛⟩ ∈ BlockLiftFix, i.e. the carrier 𝑛 is a fixpoint of the induced block-generation operator.

Conceptually, (D) provides the disjointness/quotient discipline for the lifted span, while (E) prevents hidden carrier drift (refinement or coarsening of what counts as a block) by enforcing the fixpoint equation. The point of this theorem is that these constraints can be imposed and reused independently by later constructions, while their intersection recovers the intended Parts-based notion.

This mirrors the internal packaging of Disjs (see dfdisjs6 39283 / dfdisjs7 39284): for disjoint relations, the "map layer + carrier layer" decomposition is internal via QMap and ElDisjs; for PetParts, the carrier 𝑛 is an external parameter, so the additional carrier stability must be factored explicitly as BlockLiftFix. (Contributed by Peter Mazsa, 20-Feb-2026.) (Revised by Peter Mazsa, 25-Feb-2026.)

Assertion
Ref Expression
dfpetparts2 PetParts = ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix )
Distinct variable group:   𝑛,𝑟

Proof of Theorem dfpetparts2
StepHypRef Expression
1 inopab 5780 . . . 4 ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛)}
2 df-blockliftfix 38822 . . . . 5 BlockLiftFix = {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛}
32ineq2i 4158 . . . 4 ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛})
4 xrncnvepresex 38772 . . . . . . 7 ((𝑛 ∈ V ∧ 𝑟 ∈ V) → (𝑟 ⋉ ( E ↾ 𝑛)) ∈ V)
54el2v 3437 . . . . . 6 (𝑟 ⋉ ( E ↾ 𝑛)) ∈ V
6 brparts2 39216 . . . . . . 7 ((𝑛 ∈ V ∧ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ V) → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛)))
76el2v1 38570 . . . . . 6 ((𝑟 ⋉ ( E ↾ 𝑛)) ∈ V → ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛)))
85, 7ax-mp 5 . . . . 5 ((𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛))
98opabbii 5153 . . . 4 {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ ( E ↾ 𝑛)) / (𝑟 ⋉ ( E ↾ 𝑛))) = 𝑛)}
101, 3, 93eqtr4ri 2771 . . 3 {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix )
1110ineq2i 4158 . 2 (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛}) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
12 inopab 5780 . . 3 ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)}
13 df-xp 5632 . . . 4 ( Rels × MembParts ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )}
1413ineq1i 4157 . . 3 (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛})
15 df-petparts 39309 . . 3 PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛)}
1612, 14, 153eqtr4ri 2771 . 2 PetParts = (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) Parts 𝑛})
17 inass 4169 . 2 ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix ) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
1811, 16, 173eqtr4i 2770 1 PetParts = ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ ( E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix )
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wcel 2114  Vcvv 3430  cin 3889   class class class wbr 5086  {copab 5148   E cep 5525   × cxp 5624  ccnv 5625  dom cdm 5626  cres 5628   / cqs 8637  cxrn 38515   BlockLiftFix cblockliftfix 38522   Rels crels 38526   Disjs cdisjs 38559   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-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-blockliftfix 38822  df-dmqss 39063  df-parts 39209  df-petparts 39309
This theorem is referenced by:  dfpet2parts2  39314
  Copyright terms: Public domain W3C validator