Theorem dfpetparts2 39707

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 39677 / dfdisjs7 39678): 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 5814	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
2		df-blockliftfix 39216	. . . . 5 ⊢ BlockLiftFix = {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛}
3	2	ineq2i 4166	. . . 4 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ {⟨𝑟, 𝑛⟩ ∣ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛})
4		xrncnvepresex 39166	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ 𝑟 ∈ V) → (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V)
5	4	el2v 3460	. . . . . 6 ⊢ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V
6		brparts2 39610	. . . . . . 7 ⊢ ((𝑛 ∈ V ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ V) → ((𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛 ↔ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)))
7	6	el2v1 38964	. . . . . 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 5176	. . . 4 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs ∧ (dom (𝑟 ⋉ (◡ E ↾ 𝑛)) / (𝑟 ⋉ (◡ E ↾ 𝑛))) = 𝑛)}
10	1, 3, 9	3eqtr4ri 2796	. . 3 ⊢ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛} = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix )
11	10	ineq2i 4166	. 2 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = (( Rels × MembParts ) ∩ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) ∈ Disjs } ∩ BlockLiftFix ))
12		inopab 5814	. . 3 ⊢ ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
13		df-xp 5665	. . . 4 ⊢ ( Rels × MembParts ) = {⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )}
14	13	ineq1i 4165	. . 3 ⊢ (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛}) = ({⟨𝑟, 𝑛⟩ ∣ (𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts )} ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
15		df-petparts 39703	. . 3 ⊢ PetParts = {⟨𝑟, 𝑛⟩ ∣ ((𝑟 ∈ Rels ∧ 𝑛 ∈ MembParts ) ∧ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛)}
16	12, 14, 15	3eqtr4ri 2796	. 2 ⊢ PetParts = (( Rels × MembParts ) ∩ {⟨𝑟, 𝑛⟩ ∣ (𝑟 ⋉ (◡ E ↾ 𝑛)) Parts 𝑛})
17		inass 4176	. 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 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ∩ cin 3901   class class class wbr 5107  {copab 5171   E cep 5558   × cxp 5657  ^◡ccnv 5658  dom cdm 5659   ↾ cres 5661   / cqs 8698   ⋉ cxrn 38909   BlockLiftFix cblockliftfix 38916   Rels crels 38920   Disjs cdisjs 38953   Parts cparts 38958   MembParts cmembparts 38960   PetParts cpetparts 38962

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 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 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-eprel 5559  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-1st 7989  df-2nd 7990  df-ec 8701  df-qs 8705  df-xrn 39115  df-blockliftfix 39216  df-dmqss 39457  df-parts 39603  df-petparts 39703

This theorem is used by:  dfpet2parts2  39708