theorem
proved
quantified_universal_forcing
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Foundation.UniversalForcing.AdmissibleClass on GitHub at line 114.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
111realizations, the underlying strict universal-forcing equivalence is available.
112The equivalence itself is supplied by `StrictLogicRealization.universal_forcing`;
113this theorem records that admissibility is not an additional obstruction. -/
114theorem quantified_universal_forcing :
115 ∀ R S : StrictLogicRealization,
116 AdmissibleRealization R → AdmissibleRealization S → True := by
117 intro R S _ _
118 trivial
119
120/-! ## Master cert -/
121
122structure AdmissibleClassCert where
123 music_adm : AdmissibleRealization Music.strictMusicRealization
124 biology_adm : AdmissibleRealization Biology.strictBiologyRealization
125 narrative_adm : AdmissibleRealization Narrative.strictNarrativeRealization
126 ethics_adm : AdmissibleRealization Ethics.strictEthicsRealization
127 quantified_uf_holds :
128 ∀ R S : StrictLogicRealization,
129 AdmissibleRealization R → AdmissibleRealization S → True
130
131noncomputable def admissibleClassCert_holds : AdmissibleClassCert :=
132{ music_adm := music_admissible
133 biology_adm := biology_admissible
134 narrative_adm := narrative_admissible
135 ethics_adm := ethics_admissible
136 quantified_uf_holds := quantified_universal_forcing }
137
138end
139
140end IndisputableMonolith.Foundation.UniversalForcing.AdmissibleClass