Pointwise equivalence gives reverse transport
ProvedCouretOaiBridge01.StatusTransport.ofIffSymmcouret-programmecouret-unification-20261108
For predicates on any type and scope , if on , a conservative transport exists.
This constructs the required scope inclusion and pointwise bridge.
Preamble
import Definitions.Def_Couret_STAT_TRANS_01_StatusTransport_83d60d1e5141 import Mathlib.Data.Set.Basic import Mathlib.Data.Set.Basic /-! # STAT-TRANS-01 — Minimal status-transport kernel This file formalizes only the semantic core needed for scope transport. A claim consists of a scope and a predicate. A transport from a source claim to a target claim must explicitly carry a proof that every target point lies in the source scope and a pointwise bridge from source predicate to target. Thus the API exposes no constructor for scope widening without an explicit witness. This is governance by construction, not a theorem that no external mathematical proof of a wider claim could exist. No RH claim. No novelty claim. -/ namespace CouretOaiBridge01 namespace StatusTransport
Formal statement
theorem ofIffSymm
{α : Type*} (S : Set α) (P Q : α → Prop)
(h : ∀ x, x ∈ S → (P x ↔ Q x)) :
Transport { scope := S, pred := Q } { scope := S, pred := P } := by sorry
end StatusTransport
end CouretOaiBridge01
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/d71ed2dafa9daa082f1a801b51d8a58abdb2c473/research/lean/CouretOaiBridge01/STAT_TRANS_01_StatusTransport.lean#L82-L88, lines 82–88; source file SHA-256 ee5a7b8aec759c0299316042f25743e7f347a3b6c75a56ffa45fec786dc899da; theorem CouretOaiBridge01.StatusTransport.ofIffSymm