let IAlph, OAlph be non empty set ; :: thesis: for w being FinSequence of IAlph
for tfsm1, tfsm2 being non empty Mealy-FSM over IAlph,OAlph
for q21 being State of tfsm2
for tfsm being non empty finite Mealy-FSM over IAlph,OAlph
for q being State of tfsm st tfsm = tfsm1 -Mealy_union tfsm2 & q21 = q holds
(q21,w) -admissible = (q,w) -admissible

let w be FinSequence of IAlph; :: thesis: for tfsm1, tfsm2 being non empty Mealy-FSM over IAlph,OAlph
for q21 being State of tfsm2
for tfsm being non empty finite Mealy-FSM over IAlph,OAlph
for q being State of tfsm st tfsm = tfsm1 -Mealy_union tfsm2 & q21 = q holds
(q21,w) -admissible = (q,w) -admissible

let tfsm1, tfsm2 be non empty Mealy-FSM over IAlph,OAlph; :: thesis: for q21 being State of tfsm2
for tfsm being non empty finite Mealy-FSM over IAlph,OAlph
for q being State of tfsm st tfsm = tfsm1 -Mealy_union tfsm2 & q21 = q holds
(q21,w) -admissible = (q,w) -admissible

let q21 be State of tfsm2; :: thesis: for tfsm being non empty finite Mealy-FSM over IAlph,OAlph
for q being State of tfsm st tfsm = tfsm1 -Mealy_union tfsm2 & q21 = q holds
(q21,w) -admissible = (q,w) -admissible

let tfsm be non empty finite Mealy-FSM over IAlph,OAlph; :: thesis: for q being State of tfsm st tfsm = tfsm1 -Mealy_union tfsm2 & q21 = q holds
(q21,w) -admissible = (q,w) -admissible

let q be State of tfsm; :: thesis: ( tfsm = tfsm1 -Mealy_union tfsm2 & q21 = q implies (q21,w) -admissible = (q,w) -admissible )
set q9 = q21;
assume that
A1: tfsm = tfsm1 -Mealy_union tfsm2 and
A2: q21 = q ; :: thesis: (q21,w) -admissible = (q,w) -admissible
set ad9 = (q21,w) -admissible ;
set ad = (q,w) -admissible ;
defpred S1[ Nat] means ( 1 <= $1 & $1 <= len ((q21,w) -admissible) implies ((q21,w) -admissible) . $1 = ((q,w) -admissible) . $1 );
A3: for k being Nat st S1[k] holds
S1[k + 1]
proof
let k be Nat; :: thesis: ( S1[k] implies S1[k + 1] )
assume A4: ( 1 <= k & k <= len ((q21,w) -admissible) implies ((q21,w) -admissible) . k = ((q,w) -admissible) . k ) ; :: thesis: S1[k + 1]
assume that
1 <= k + 1 and
A5: k + 1 <= len ((q21,w) -admissible) ; :: thesis: ((q21,w) -admissible) . (k + 1) = ((q,w) -admissible) . (k + 1)
A6: ( k = 0 or ( 0 < k & 0 + 1 = 1 ) ) ;
per cases ( k = 0 or 1 <= k ) by A6, NAT_1:13;
suppose A7: k = 0 ; :: thesis: ((q21,w) -admissible) . (k + 1) = ((q,w) -admissible) . (k + 1)
hence ((q21,w) -admissible) . (k + 1) = q21 by Def2
.= ((q,w) -admissible) . (k + 1) by A2, A7, Def2 ;
:: thesis: verum
end;
suppose A8: 1 <= k ; :: thesis: ((q21,w) -admissible) . (k + 1) = ((q,w) -admissible) . (k + 1)
k + 1 <= (len w) + 1 by A5, Def2;
then A9: k <= len w by XREAL_1:6;
then consider w9k being Element of IAlph, q9k, q9k1 being Element of tfsm2 such that
A10: ( w9k = w . k & q9k = ((q21,w) -admissible) . k ) and
A11: ( q9k1 = ((q21,w) -admissible) . (k + 1) & w9k -succ_of q9k = q9k1 ) by A8, Def2;
A12: ex wk being Element of IAlph ex qk, qk1 being Element of tfsm st
( wk = w . k & qk = ((q,w) -admissible) . k & qk1 = ((q,w) -admissible) . (k + 1) & wk -succ_of qk = qk1 ) by A8, A9, Def2;
len w <= (len w) + 1 by NAT_1:11;
then A13: k <= (len w) + 1 by A9, XXREAL_0:2;
dom the Tran of tfsm2 = [: the carrier of tfsm2,IAlph:] by FUNCT_2:def 1;
hence ((q21,w) -admissible) . (k + 1) = ( the Tran of tfsm1 +* the Tran of tfsm2) . [q9k,w9k] by A11, FUNCT_4:13
.= ((q,w) -admissible) . (k + 1) by A1, A4, A8, A10, A12, A13, Def2, Def24 ;
:: thesis: verum
end;
end;
end;
A14: S1[ 0 ] ;
A15: for k being Nat holds S1[k] from NAT_1:sch 2(A14, A3);
len ((q21,w) -admissible) = (len w) + 1 by Def2
.= len ((q,w) -admissible) by Def2 ;
hence (q21,w) -admissible = (q,w) -admissible by A15, FINSEQ_1:14; :: thesis: verum