let IIG be non empty finite non void Circuit-like monotonic ManySortedSign ; :: thesis: for SCS being non-empty Circuit of IIG
for InpFs being InputFuncs of SCS st commute InpFs is constant & not InputVertices IIG is empty holds
for s1, s2 being State of SCS holds (Computation s1,InpFs) . (depth SCS) = (Computation s2,InpFs) . (depth SCS)
let SCS be non-empty Circuit of IIG; :: thesis: for InpFs being InputFuncs of SCS st commute InpFs is constant & not InputVertices IIG is empty holds
for s1, s2 being State of SCS holds (Computation s1,InpFs) . (depth SCS) = (Computation s2,InpFs) . (depth SCS)
let InpFs be InputFuncs of SCS; :: thesis: ( commute InpFs is constant & not InputVertices IIG is empty implies for s1, s2 being State of SCS holds (Computation s1,InpFs) . (depth SCS) = (Computation s2,InpFs) . (depth SCS) )
assume A1:
( commute InpFs is constant & not InputVertices IIG is empty )
; :: thesis: for s1, s2 being State of SCS holds (Computation s1,InpFs) . (depth SCS) = (Computation s2,InpFs) . (depth SCS)
then A2:
IIG is with_input_V
by MSAFREE2:def 4;
let s1, s2 be State of SCS; :: thesis: (Computation s1,InpFs) . (depth SCS) = (Computation s2,InpFs) . (depth SCS)
reconsider dSCS = depth SCS as Element of NAT by ORDINAL1:def 13;
reconsider Cs1 = (Computation s1,InpFs) . dSCS as State of SCS ;
reconsider Cs2 = (Computation s2,InpFs) . dSCS as State of SCS ;
reconsider iv = (commute InpFs) . 0 as InputValues of SCS by A2, CIRCUIT1:2;
hence
(Computation s1,InpFs) . (depth SCS) = (Computation s2,InpFs) . (depth SCS)
by FUNCT_1:9; :: thesis: verum