recordForm swap ne
ProvedAPFPaper5.K2.recordForm_swap_neapfapf-referencepullbacks-v46-2026-11
Result: recordForm swap ne. All parameters and hypotheses are retained in the declaration below.
theorem recordForm_swap_ne {W : Type*} [Fintype W] [DecidableEq W] (w : W → ℝ) (a b : W)
(hw : w a ≠ w b) :
recordForm w (fun c => if Equiv.swap a b c = a then (1 : ℝ) else 0)
(fun c => if Equiv.swap a b c = a then (1 : ℝ) else 0) ≠
recordForm w (fun c => if c = a then (1 : ℝ) else 0) (fun c => if c = a then (1 : ℝ) else 0)
Module context and limits: OccupantHoldsWithPartsAtUnit adds a strictly positive epsilon and that unit price for each maintained record. Conditional count, finite ladder, novelty-floor and permutation identities follow; unequal-price and BW counterexamples retain their exact domains. This unit-cost hypothesis and the identification of epsilon with physical B05 are not installed.
Source scope parameters:
variable {D P R Record : Type*}
variable (wholeResource : P → R) (calibration : R → NNReal) (maintained : P → Set Record)
(sufficient : P → Set Record → D → Prop) (usesToRealize : P → D → Set Record → Prop)
(cost : Record → ℝ)
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_occupant_at_unit_cost_Vocabulary import Definitions.Def_APFPaper1_occupant_and_its_parts_Vocabulary import Theorems.Thm_APFPaper1_Source_part_cost_eq_sum import Theorems.Thm_APFPaper1_Source_occupantHoldsWithParts_of_everyFamilyOccupied import Theorems.Thm_APFB06_ResidueWorldR2_occupant_holds_pair_with_parts import Theorems.Thm_APFB06_OverheadWorld_no_occupant_holds_pair_with_parts import Theorems.Thm_APFB06_DiscountWorld_no_occupant_holds_pair_with_parts import Theorems.Thm_APFPaper1_Source_each_eq_floor_of_sum_le import Theorems.Thm_APFPaper1_Source_sum_eq_card_mul_of_each_eq import Theorems.Thm_APFPaper1_Source_each_eq_floor_iff import Theorems.Thm_APFPaper1_Source_needed_records_at_floor_iff import Definitions.Def_APFB06_unequal_record_costs_world_Vocabulary import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_billU_ge_one import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_one_le_costU import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_two_le_costU import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_costU_single_A import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_floorU_holds import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_eight_hold import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_A2_at_protocol_binding import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_BW_at_protocol_binding import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_realized_isOccupant import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_occupant_holds_pair_with_parts import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_record_costs_forced import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_no_unit_record_cost import Definitions.Def_APFPaper5_K2_StateClass import Mathlib.Tactic.Linarith set_option autoImplicit false universe apfNative_u_1
Formal statement
theorem APFPaper5.K2.recordForm_swap_ne :
∀ {W : Type apfNative_u_1} [inst : Fintype.{apfNative_u_1} W] [inst_1 : DecidableEq.{apfNative_u_1 + 1} W]
(w : W → Real) (a b : W) (hw : @Ne.{1} Real (w a) (w b)),
@Ne.{1} Real
(@APFPaper5.K2.recordForm.{apfNative_u_1} W inst w
(fun (c : W) =>
@ite.{1} Real
(@Eq.{apfNative_u_1 + 1} W
(@DFunLike.coe.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1} (Equiv.Perm.{apfNative_u_1 + 1} W)
W (fun (x : W) => W)
(@EquivLike.toFunLike.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1}
(Equiv.Perm.{apfNative_u_1 + 1} W) W W
(@Equiv.instEquivLike.{apfNative_u_1 + 1, apfNative_u_1 + 1} W W))
(@Equiv.swap.{apfNative_u_1 + 1} W inst_1 a b) c)
a)
(inst_1
(@DFunLike.coe.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1} (Equiv.Perm.{apfNative_u_1 + 1} W)
W (fun (x : W) => W)
(@EquivLike.toFunLike.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1}
(Equiv.Perm.{apfNative_u_1 + 1} W) W W
(@Equiv.instEquivLike.{apfNative_u_1 + 1, apfNative_u_1 + 1} W W))
(@Equiv.swap.{apfNative_u_1 + 1} W inst_1 a b) c)
a)
(@OfNat.ofNat.{0} Real (nat_lit 1) (@One.toOfNat1.{0} Real Real.instOne))
(@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)))
fun (c : W) =>
@ite.{1} Real
(@Eq.{apfNative_u_1 + 1} W
(@DFunLike.coe.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1} (Equiv.Perm.{apfNative_u_1 + 1} W) W
(fun (x : W) => W)
(@EquivLike.toFunLike.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1}
(Equiv.Perm.{apfNative_u_1 + 1} W) W W (@Equiv.instEquivLike.{apfNative_u_1 + 1, apfNative_u_1 + 1} W W))
(@Equiv.swap.{apfNative_u_1 + 1} W inst_1 a b) c)
a)
(inst_1
(@DFunLike.coe.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1} (Equiv.Perm.{apfNative_u_1 + 1} W) W
(fun (x : W) => W)
(@EquivLike.toFunLike.{apfNative_u_1 + 1, apfNative_u_1 + 1, apfNative_u_1 + 1}
(Equiv.Perm.{apfNative_u_1 + 1} W) W W (@Equiv.instEquivLike.{apfNative_u_1 + 1, apfNative_u_1 + 1} W W))
(@Equiv.swap.{apfNative_u_1 + 1} W inst_1 a b) c)
a)
(@OfNat.ofNat.{0} Real (nat_lit 1) (@One.toOfNat1.{0} Real Real.instOne))
(@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)))
(@APFPaper5.K2.recordForm.{apfNative_u_1} W inst w
(fun (c : W) =>
@ite.{1} Real (@Eq.{apfNative_u_1 + 1} W c a) (inst_1 c a)
(@OfNat.ofNat.{0} Real (nat_lit 1) (@One.toOfNat1.{0} Real Real.instOne))
(@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)))
fun (c : W) =>
@ite.{1} Real (@Eq.{apfNative_u_1 + 1} W c a) (inst_1 c a)
(@OfNat.ofNat.{0} Real (nat_lit 1) (@One.toOfNat1.{0} Real Real.instOne))
(@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero))) := by sorry
Source
['Theorems.Thm_APFPaper1_occupant_at_unit_cost:274; pullbacks v46; source SHA-256 3a2a2670634f02e0d11cf9323e61290e6f56c8f6077bc6b25d694afd945df08d']