Avail: mono
ProvedCircuitLowerBound.Inf.Avail.monoalgorithmsanthropic-eth-16a5ce4complexity-theory
The Avail construction uses the mono property established by this source lemma. The formal statement records the complete hypotheses and conclusion.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_CircuitLowerBoundInfinitelyOftenStatement import Definitions.Def_CircuitLowerBound_Closed import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Inf import Theorems.Thm_CircuitLowerBound_Acc_mono import Theorems.Thm_Groundwork_Prog_Evaluator_Correct_mono import Theorems.Thm_Groundwork_Prog_PNet_Presents_mono import Theorems.Thm_Groundwork_Stepped_Reaches_mono import Theorems.Thm_Groundwork_Stepped_Runs_mono import Theorems.Thm_Groundwork_TM_Frag_Within_mono import Theorems.Thm_Sat3_DecidesTM_mono import Theorems.Thm_Sat3_InRateTM_mono import Theorems.Thm_Sat3_InTimeTM_mono set_option autoImplicit false section section open CircuitLowerBound CircuitLowerBound.Inf open ENP
Formal statement
theorem CircuitLowerBound.Inf.Avail.mono {n : ℕ} {C : Circuit} {g : List Bool → Bool} (h : Avail n C g) (D : Circuit) : Avail n (C ++ D) g := by sorrySource