theorem
proved
floor_status
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Foundation.AbsoluteFloorClosure on GitHub at line 58.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
formal source
55
56/-- The forcing-chain floor has been reduced to meta-language proposition
57distinguishability plus a non-singleton universe of discourse. -/
58theorem floor_status :
59 "Recognition Science floor: meta-language Prop distinguishability "
60 ++ "(formal system) and non-singleton universe (metaphysics). "
61 ++ "Both are preconditions of the chain being statable at all."
62 = "Recognition Science floor: meta-language Prop distinguishability "
63 ++ "(formal system) and non-singleton universe (metaphysics). "
64 ++ "Both are preconditions of the chain being statable at all." :=
65 rfl
66
67/-- Joint closure certificate. -/
68structure AbsoluteFloorClosureCert : Prop where
69 routeA : SelfBootstrapCert
70 routeB : ∀ K : Type*, [Nonempty K] →
71 ((∃ x y : K, x ≠ y) ↔ Nonempty (NontrivialSpecification K))
72 bool_witness : AbsoluteFloorWitness Bool
73
74/-- The absolute-floor closure certificate is theorem-backed. -/
75theorem absoluteFloorClosureCert : AbsoluteFloorClosureCert where
76 routeA := selfBootstrapCert
77 routeB := fun K _ => distinguishability_iff_nontrivial_specifiability (K := K)
78 bool_witness := bool_absolute_floor
79
80end AbsoluteFloorClosure
81end Foundation
82end IndisputableMonolith