defpred S1[ set ] means $1 in InputVertices IIG;
deffunc H1( set ) -> set = s . $1;
deffunc H2( Vertex of IIG) -> Element of Result (action_at $1),SCS = (Den (action_at $1),SCS) . ((action_at $1) depends_on_in s);
consider f being ManySortedSet of such that
A1:
for v being Vertex of IIG st v in the carrier of IIG holds
( ( S1[v] implies f . v = H1(v) ) & ( not S1[v] implies f . v = H2(v) ) )
from PRE_CIRC:sch 2();
A2:
dom f = the carrier of IIG
by PARTFUN1:def 4;
A3:
dom the Sorts of SCS = the carrier of IIG
by PARTFUN1:def 4;
A4:
InputVertices IIG misses InnerVertices IIG
by XBOOLE_1:79;
then reconsider f = f as State of SCS by A2, A3, CARD_3:def 5;
take
f
; :: thesis: for v being Vertex of IIG holds
( ( v in InputVertices IIG implies f . v = s . v ) & ( v in InnerVertices IIG implies f . v = (Den (action_at v),SCS) . ((action_at v) depends_on_in s) ) )
let v be Vertex of IIG; :: thesis: ( ( v in InputVertices IIG implies f . v = s . v ) & ( v in InnerVertices IIG implies f . v = (Den (action_at v),SCS) . ((action_at v) depends_on_in s) ) )
thus
( v in InputVertices IIG implies f . v = s . v )
by A1; :: thesis: ( v in InnerVertices IIG implies f . v = (Den (action_at v),SCS) . ((action_at v) depends_on_in s) )
assume
v in InnerVertices IIG
; :: thesis: f . v = (Den (action_at v),SCS) . ((action_at v) depends_on_in s)
then
not v in InputVertices IIG
by A4, XBOOLE_0:3;
hence
f . v = (Den (action_at v),SCS) . ((action_at v) depends_on_in s)
by A1; :: thesis: verum