Supplied pass world: an admitted return-enabled pass has an admitted one-pass inverse
ProvedAPFPaper5.Worlds.PassWorld.pass_is_undone_with_the_way_backIn the supplied pass world, every admitted pass in the return-enabled world is followed by an admitted pass from the other context that executes back to the original state.
Publication scope: All states, fragments, costs, capacities, protocol membership, actual alignments and singleton admissible sets for A2/BW are supplied data. Satisfaction of declared forms on them certifies no original physical instance. B02 r2 is handled as the current finite-combination clause; r3 is not installed. The total flip results are not partial-pass coverage results. The total double-counts the pool once at each context and is fixed by construction; no rate, phase, sine law or A2 preference for moving is derived. Paper 24/27 comparisons are motivating analogies only.
import Theorems.Thm_APFPaper5_Worlds_PassWorld_wBoth_serves import Theorems.Thm_APFPaper5_Worlds_PassWorld_occupant_runs_wBoth import Theorems.Thm_APFPaper5_Worlds_PassWorld_card_need import Theorems.Thm_APFPaper5_Worlds_PassWorld_here_markOnly import Theorems.Thm_APFPaper5_Worlds_PassWorld_dS_markOnly import Theorems.Thm_APFPaper5_Worlds_PassWorld_eight_hold import Theorems.Thm_APFPaper5_Worlds_PassWorld_alignment_holds_relation import Definitions.Def_APFB02_HoldOnDistinctions set_option autoImplicit false open APFPaper1.Continuation namespace APFPaper5.Worlds.PassWorld end APFPaper5.Worlds.PassWorld open APFPaper5.Worlds.PassWorld /-! ### The floor is paid for keeping the pool, not for crossing -/ /-! ### With the way back: over and back -/
theorem APFPaper5.Worlds.PassWorld.pass_is_undone_with_the_way_back (g : Ctx) (x : G) (hx : K true g x (wPass g)) :
K true (other g) (flip x) (wPass (other g)) ∧
Executes (step true) (wPass (other g)).2 (flip x) x := by sorry