Proposed r3 is r2 plus domain completeness
ProvedAPFB02.r3_iff_r2_and_completeapfapf-referencesib-v66-pullbacks-v22-2026-11
The factored proposed r3 predicate is equivalent to r2 together with DomainComplete at every context.
Publication scope: Fintype D and the separation hypothesis are essential to the bijection. No finiteness of the whole physical distinction domain follows from capacity alone. Proposed r3 is not installed.
Preamble
import Definitions.Def_APF_B02_DeclaredInput_r3_whole_proposed import Definitions.Def_APF_B02_DeclaredInput_r3_proposed import Definitions.Def_APF_B01_DeclaredInput import Theorems.Thm_APFB02_r2_whole_iff_r2_init import Theorems.Thm_APFB02_first_sentence_of_r2_whole import Theorems.Thm_APFB02_per_distinction_nonvacuity_at_r2 import Theorems.Thm_APFB02_everyCombinationHeld_iff_list import Theorems.Thm_APFB02_r2_iff_r2_init import Theorems.Thm_APFB02_admits_iff import Theorems.Thm_APFB02_admits_respects_profiles import Theorems.Thm_APFB02_admissions_tell_apart import Theorems.Thm_APFB02_toldApart_iff_admissions_settled import Theorems.Thm_APFB02_toldApart_iff_domainComplete import Theorems.Thm_APFB02_separations_fixed_by_profiles import Theorems.Thm_APFB02_no_separation_iff_same_profile import Theorems.Thm_APFPaper5_Worlds_world_N_has_an_unlisted_separator import Theorems.Thm_APFPaper5_Worlds_world_N_domain_not_complete set_option autoImplicit false namespace APFB02 end APFB02 open APFB02
Formal statement
theorem APFB02.r3_iff_r2_and_complete {Context : Type*} {X Q P Record : Context → Type*}
(Cont : (g : Context) → X g → Q g → Prop)
(Delta : (g : Context) → (X g → Bool) → Prop)
(maintained : (g : Context) → P g → Record g → Prop)
(sufficient : (g : Context) → P g → (Record g → Prop) →
{d : X g → Bool // Delta g d} → Prop)
(usesToRealize : (g : Context) → P g →
{d : X g → Bool // Delta g d} → (Record g → Prop) → Prop) :
B02SourceMeaning_r3 Cont Delta maintained sufficient usesToRealize ↔
(B02SourceMeaning_r2 Cont Delta maintained sufficient usesToRealize ∧
∀ g : Context,
DomainComplete (Cont g)
(fun (d : {f : X g → Bool // Delta g f}) (x : X g) => d.val x)) := by sorry
Source
['C:/Users/brook/My Drive/__APF Library/Artifacts_2026-11-15_session/astra/sib_v66_publication/source/Theorems/Thm_APFB02_r3_carries_r2.lean:87 (source SHA256 dcee5a4bda16408f7c91bed421c0bd74cdf58b287d3c96a5c871cc6252634e11; APFB02.r3_iff_r2_and_complete)', 'C:/Users/brook/My Drive/__APF Library/Artifacts_2026-11-15_session/astra/sib_v66_publication/reviews/rv2_v66_v22_review.json (SHA256 365ce42aeeada41fa76b7443fe2b5af6017c7fdeb2bb28169266b6dbba622948; modules[Theorems.Thm_APFB02_r3_carries_r2].declarations[APFB02.r3_iff_r2_and_complete])']