Theorem dfpetparts2 39824

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 39794 / dfdisjs7 39795): 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 5803	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
2		df-blockliftfix 39333	. . . . 5 ⊢ BlockLiftFix = {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}
3	2	ineq2i 4162	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
4		xrncnvepresex 39283	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ 𝑟 ∈ V) → (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
5	4	el2v 3457	. . . . . 6 ⊢ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
6		brparts2 39727	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ((𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)))
7	6	el2v1 39081	. . . . . 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 5171	. . . 4 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
10	1, 3, 9	3eqtr4ri 2794	. . 3 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix )
11	10	ineq2i 4162	. 2 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
12		inopab 5803	. . 3 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
13		df-xp 5653	. . . 4 ⊢ ( Rels × MembParts ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )}
14	13	ineq1i 4161	. . 3 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
15		df-petparts 39820	. . 3 ⊢ PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
16	12, 14, 15	3eqtr4ri 2794	. 2 ⊢ PetParts = (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
17		inass 4172	. 2 ⊢ ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix ) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
18	11, 16, 17	3eqtr4i 2793	1 ⊢ PetParts = ((( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs }) ∩ BlockLiftFix )

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∩ cin 3897   class class class wbr 5102  {copab 5166   E cep 5546   × cxp 5645  ^◡ccnv 5646  dom cdm 5647   ↾ cres 5649   / cqs 8694   ⋉ cxrn 39026   BlockLiftFix cblockliftfix 39033   Rels crels 39037   Disjs cdisjs 39070   Parts cparts 39075   MembParts cmembparts 39077   PetParts cpetparts 39079

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-eprel 5547  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fo 6533  df-fv 6535  df-1st 7984  df-2nd 7985  df-ec 8697  df-qs 8701  df-xrn 39232  df-blockliftfix 39333  df-dmqss 39574  df-parts 39720  df-petparts 39820

This theorem is used by:  dfpet2parts2  39825