Theorem dfpetparts2 39649

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 39619 / dfdisjs7 39620): 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

Step	Hyp	Ref	Expression
1		inopab 5815	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
2		df-blockliftfix 39158	. . . . 5 ⊢ BlockLiftFix = {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}
3	2	ineq2i 4169	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
4		xrncnvepresex 39108	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ 𝑟 ∈ V) → (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
5	4	el2v 3461	. . . . . 6 ⊢ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
6		brparts2 39552	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ((𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)))
7	6	el2v1 38906	. . . . . 6 ⊢ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V → ((𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)))
8	5, 7	ax-mp 5	. . . . 5 ⊢ ((𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛))
9	8	opabbii 5177	. . . 4 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
10	1, 3, 9	3eqtr4ri 2796	. . 3 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix )
11	10	ineq2i 4169	. 2 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
12		inopab 5815	. . 3 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
13		df-xp 5666	. . . 4 ⊢ ( Rels × MembParts ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )}
14	13	ineq1i 4168	. . 3 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
15		df-petparts 39645	. . 3 ⊢ PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
16	12, 14, 15	3eqtr4ri 2796	. 2 ⊢ PetParts = (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
17		inass 4179	. 2 ⊢ ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix ) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
18	11, 16, 17	3eqtr4i 2795	1 ⊢ PetParts = ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix )

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  Vcvv 3454   ∩ cin 3903   class class class wbr 5108  {copab 5172   E cep 5559   × cxp 5658  ^◡ccnv 5659  dom cdm 5660   ↾ cres 5662   / cqs 8691   ⋉ cxrn 38851   BlockLiftFix cblockliftfix 38858   Rels crels 38862   Disjs cdisjs 38895   Parts cparts 38900   MembParts cmembparts 38902   PetParts cpetparts 38904

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-eprel 5560  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fo 6542  df-fv 6544  df-1st 7984  df-2nd 7985  df-ec 8694  df-qs 8698  df-xrn 39057  df-blockliftfix 39158  df-dmqss 39399  df-parts 39545  df-petparts 39645

This theorem is used by:  dfpet2parts2  39650