Theorem dfpetparts2 40095

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 40065 / dfdisjs7 40066): 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 5812	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
2		df-blockliftfix 39604	. . . . 5 ⊢ BlockLiftFix = {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}
3	2	ineq2i 4117	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
4		xrncnvepresex 39554	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ 𝑟 ∈ V) → (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
5	4	el2v 3461	. . . . . 6 ⊢ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
6		brparts2 39998	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ((𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)))
7	6	el2v1 39352	. . . . . 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 5175	. . . 4 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
10	1, 3, 9	3eqtr4ri 2797	. . 3 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix )
11	10	ineq2i 4117	. 2 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
12		inopab 5812	. . 3 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
13		df-xp 5661	. . . 4 ⊢ ( Rels × MembParts ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )}
14	13	ineq1i 4116	. . 3 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
15		df-petparts 40091	. . 3 ⊢ PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
16	12, 14, 15	3eqtr4ri 2797	. 2 ⊢ PetParts = (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
17		inass 4127	. 2 ⊢ ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix ) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
18	11, 16, 17	3eqtr4i 2796	1 ⊢ PetParts = ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix )

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092   class class class wbr 5106  {copab 5170   E cep 5554   × cxp 5653  ^◡ccnv 5654  dom cdm 5655   ↾ cres 5657   / cqs 8741   ⋉ cxrn 39297   BlockLiftFix cblockliftfix 39304   Rels crels 39308   Disjs cdisjs 39341   Parts cparts 39346   MembParts cmembparts 39348   PetParts cpetparts 39350

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-eprel 5555  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fo 6561  df-fv 6563  df-1st 8022  df-2nd 8023  df-ec 8744  df-qs 8748  df-xrn 39503  df-blockliftfix 39604  df-dmqss 39845  df-parts 39991  df-petparts 40091

This theorem is used by:  dfpet2parts2  40096