any two part states are one state
ProvedAPFPaper1.RecordOccupant.any_two_part_states_are_one_stateapfapf-referencepullbacks-v39-2026-11
Result: any two part states are one state. All parameters and hypotheses are retained in the declaration below.
theorem any_two_part_states_are_one_state (reads : D → X → Bool)
(hB02 : APFB02.EveryCombinationHeld reads) (A : Set D) [DecidablePred (· ∈ A)] (S : Finset D)
(x y : X) : ∃ z : X, ∀ d ∈ S, reads d z = if d ∈ A then reads d x else reads d y
Module context and limits: IsProductAcross is equality of readings on the two sides of a cut. Every state is its own such product; EveryCombinationHeld gives finite recombination. This is not quantum state factorization or physical local tomography.
Source scope parameters:
variable {X D : Type*}
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Preamble
import Definitions.Def_APFPaper1_RecordOccupant_products_across_a_cut_Vocabulary
import Definitions.Def_APFB02_EachTakesBothSides
set_option autoImplicit false
namespace APFPaper1.RecordOccupant
end APFPaper1.RecordOccupant
open APFPaper1
open APFPaper1.RecordOccupant
variable {X D : Type*}
Formal statement
theorem APFPaper1.RecordOccupant.any_two_part_states_are_one_state (reads : D → X → Bool)
(hB02 : APFB02.EveryCombinationHeld reads) (A : Set D) [DecidablePred (· ∈ A)] (S : Finset D)
(x y : X) : ∃ z : X, ∀ d ∈ S, reads d z = if d ∈ A then reads d x else reads d y := by sorry
Source
['Theorems.Thm_APFPaper1_RecordOccupant_products_across_a_cut:51; pullbacks v39; source SHA-256 5076686a0b996cdce81f0bc04d7e6a785ccd4e30e78d18dcb8dadf0c87c14beb']