let IAlph, OAlph be non empty set ; for tfsm being non empty finite Mealy-FSM over IAlph,OAlph
for CRtfsm1, CRtfsm2 being non empty finite reduced connected Mealy-FSM over IAlph,OAlph st the carrier of CRtfsm1 misses the carrier of CRtfsm2 & CRtfsm1,CRtfsm2 -are_equivalent & tfsm = CRtfsm1 -Mealy_union CRtfsm2 holds
for Q being State of (the_reduction_of tfsm) ex q1, q2 being Element of Q st
( q1 in the carrier of CRtfsm1 & q2 in the carrier of CRtfsm2 & ( for q being Element of Q holds
( q = q1 or q = q2 ) ) )
let tfsm be non empty finite Mealy-FSM over IAlph,OAlph; for CRtfsm1, CRtfsm2 being non empty finite reduced connected Mealy-FSM over IAlph,OAlph st the carrier of CRtfsm1 misses the carrier of CRtfsm2 & CRtfsm1,CRtfsm2 -are_equivalent & tfsm = CRtfsm1 -Mealy_union CRtfsm2 holds
for Q being State of (the_reduction_of tfsm) ex q1, q2 being Element of Q st
( q1 in the carrier of CRtfsm1 & q2 in the carrier of CRtfsm2 & ( for q being Element of Q holds
( q = q1 or q = q2 ) ) )
let CRtfsm1, CRtfsm2 be non empty finite reduced connected Mealy-FSM over IAlph,OAlph; ( the carrier of CRtfsm1 misses the carrier of CRtfsm2 & CRtfsm1,CRtfsm2 -are_equivalent & tfsm = CRtfsm1 -Mealy_union CRtfsm2 implies for Q being State of (the_reduction_of tfsm) ex q1, q2 being Element of Q st
( q1 in the carrier of CRtfsm1 & q2 in the carrier of CRtfsm2 & ( for q being Element of Q holds
( q = q1 or q = q2 ) ) ) )
set rtfsm1 = CRtfsm1;
set rtfsm2 = CRtfsm2;
assume that
A1:
the carrier of CRtfsm1 misses the carrier of CRtfsm2
and
A2:
CRtfsm1,CRtfsm2 -are_equivalent
and
A3:
tfsm = CRtfsm1 -Mealy_union CRtfsm2
; for Q being State of (the_reduction_of tfsm) ex q1, q2 being Element of Q st
( q1 in the carrier of CRtfsm1 & q2 in the carrier of CRtfsm2 & ( for q being Element of Q holds
( q = q1 or q = q2 ) ) )
set ISrtfsm2 = the InitS of CRtfsm2;
set ISrtfsm1 = the InitS of CRtfsm1;
A4:
the carrier of CRtfsm1 /\ the carrier of CRtfsm2 = {}
by A1;
set Stfsm = the carrier of tfsm;
set Srtfsm2 = the carrier of CRtfsm2;
set Srtfsm1 = the carrier of CRtfsm1;
set rtfsm = the_reduction_of tfsm;
set Srtfsm = the carrier of (the_reduction_of tfsm);
assume
ex Q being State of (the_reduction_of tfsm) st
for q1, q2 being Element of Q holds
( not q1 in the carrier of CRtfsm1 or not q2 in the carrier of CRtfsm2 or ex q being Element of Q st
( not q = q1 & not q = q2 ) )
; contradiction
then consider Q being Element of (the_reduction_of tfsm) such that
A5:
for q1, q2 being Element of Q holds
( not q1 in the carrier of CRtfsm1 or not q2 in the carrier of CRtfsm2 or ex q being Element of Q st
( not q = q1 & not q = q2 ) )
;
A6:
the carrier of (the_reduction_of tfsm) = final_states_partition tfsm
by Def18;
then reconsider Q = Q as Subset of the carrier of tfsm by TARSKI:def 3;
union (final_states_partition tfsm) =
the carrier of tfsm
by EQREL_1:def 4
.=
the carrier of CRtfsm1 \/ the carrier of CRtfsm2
by A3, Def24
;
then A7:
Q c= the carrier of CRtfsm1 \/ the carrier of CRtfsm2
by A6, ZFMISC_1:74;
Q in the carrier of (the_reduction_of tfsm)
;
then A8:
Q in final_states_partition tfsm
by Def18;
then A9:
Q <> {}
;
then consider q being Element of the carrier of tfsm such that
A10:
q in Q
by SUBSET_1:4;
per cases
( q in the carrier of CRtfsm1 or q in the carrier of CRtfsm2 )
by A10, A7, XBOOLE_0:def 3;
suppose A11:
q in the
carrier of
CRtfsm1
;
contradictionset Q9 =
Q \ {q};
now not Q \ {q} = {} reconsider q =
q as
Element of the
carrier of
CRtfsm1 by A11;
q is
accessible
by Def22;
then consider w being
FinSequence of
IAlph such that A31:
the
InitS of
CRtfsm1,
w -leads_to q
;
set adl = the
InitS of
CRtfsm2 leads_to_under w;
A32:
now the InitS of CRtfsm2 leads_to_under w in Qreconsider q =
q as
Element of the
carrier of
tfsm ;
assume A33:
not the
InitS of
CRtfsm2 leads_to_under w in Q
;
contradictionreconsider q1 =
q as
Element of the
carrier of
CRtfsm1 ;
the
InitS of
CRtfsm2 leads_to_under w in the
carrier of
CRtfsm1 \/ the
carrier of
CRtfsm2
by XBOOLE_0:def 3;
then reconsider adl = the
InitS of
CRtfsm2 leads_to_under w as
Element of the
carrier of
tfsm by A3, Def24;
A34:
for
Y being
Element of the
carrier of
(the_reduction_of tfsm) holds
( not
q in Y or not
adl in Y )
reconsider adl2 =
adl as
Element of the
carrier of
CRtfsm2 ;
final_states_partition tfsm is
final
by Def15;
then
not
q,
adl -are_equivalent
by A6, A34;
then consider dseq being
FinSequence of
IAlph such that A37:
(
q,
dseq)
-response <> (
adl,
dseq)
-response
;
(
q,
dseq)
-response = (
q1,
dseq)
-response
by A1, A3, Th53;
then A38:
(
q1,
dseq)
-response <> (
adl2,
dseq)
-response
by A3, A37, Th55;
the
InitS of
CRtfsm2,
w -leads_to adl2
by Def5;
then
( the
InitS of
CRtfsm1,
(w ^ dseq))
-response <> ( the
InitS of
CRtfsm2,
(w ^ dseq))
-response
by A31, A38, Th12;
hence
contradiction
by A2;
verum end; assume A39:
Q \ {q} = {}
;
contradictionhence
contradiction
by A32;
verum end; hence
contradiction
by A12;
verum end; suppose A41:
q in the
carrier of
CRtfsm2
;
contradictionset Q9 =
Q \ {q};
now not Q \ {q} = {} reconsider q =
q as
Element of the
carrier of
CRtfsm2 by A41;
q is
accessible
by Def22;
then consider w being
FinSequence of
IAlph such that A61:
the
InitS of
CRtfsm2,
w -leads_to q
;
set adl = the
InitS of
CRtfsm1 leads_to_under w;
A62:
now the InitS of CRtfsm1 leads_to_under w in Qreconsider q =
q as
Element of the
carrier of
tfsm ;
assume A63:
not the
InitS of
CRtfsm1 leads_to_under w in Q
;
contradictionreconsider q1 =
q as
Element of the
carrier of
CRtfsm2 ;
the
InitS of
CRtfsm1 leads_to_under w in the
carrier of
CRtfsm1 \/ the
carrier of
CRtfsm2
by XBOOLE_0:def 3;
then reconsider adl = the
InitS of
CRtfsm1 leads_to_under w as
Element of the
carrier of
tfsm by A3, Def24;
A64:
for
Y being
Element of the
carrier of
(the_reduction_of tfsm) holds
( not
q in Y or not
adl in Y )
reconsider adl2 =
adl as
Element of the
carrier of
CRtfsm1 ;
final_states_partition tfsm is
final
by Def15;
then
not
q,
adl -are_equivalent
by A6, A64;
then consider dseq being
FinSequence of
IAlph such that A67:
(
q,
dseq)
-response <> (
adl,
dseq)
-response
;
(
q,
dseq)
-response = (
q1,
dseq)
-response
by A3, Th55;
then A68:
(
q1,
dseq)
-response <> (
adl2,
dseq)
-response
by A1, A3, A67, Th53;
the
InitS of
CRtfsm1,
w -leads_to adl2
by Def5;
then
( the
InitS of
CRtfsm2,
(w ^ dseq))
-response <> ( the
InitS of
CRtfsm1,
(w ^ dseq))
-response
by A61, A68, Th12;
hence
contradiction
by A2;
verum end; assume A69:
Q \ {q} = {}
;
contradictionhence
contradiction
by A62;
verum end; hence
contradiction
by A42;
verum end; end;