let n be natural non empty number ; for X being set
for J being non empty Signature ex Q being non empty non void n PC-correct QC-correct QCLangSignature over X st
( the carrier of Q misses the carrier of J & the carrier' of Q misses the carrier' of J )
let X be set ; for J being non empty Signature ex Q being non empty non void n PC-correct QC-correct QCLangSignature over X st
( the carrier of Q misses the carrier of J & the carrier' of Q misses the carrier' of J )
let J be non empty Signature; ex Q being non empty non void n PC-correct QC-correct QCLangSignature over X st
( the carrier of Q misses the carrier of J & the carrier' of Q misses the carrier' of J )
set Q = the non empty non void n PC-correct QC-correct QCLangSignature over X;
reconsider A = [: the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X,{ the carrier of J}:] as non empty set ;
reconsider B = [: the carrier' of the non empty non void n PC-correct QC-correct QCLangSignature over X,{ the carrier' of J}:] as non empty set ;
reconsider f = pr1 ( the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X,{ the carrier of J}) as Function of A, the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X ;
reconsider g = pr1 ( the carrier' of the non empty non void n PC-correct QC-correct QCLangSignature over X,{ the carrier' of J}) as Function of B, the carrier' of the non empty non void n PC-correct QC-correct QCLangSignature over X ;
( f is one-to-one & rng f = the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X )
by FUNCT_3:44;
then reconsider f1 = f " as Function of the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X,A by FUNCT_2:25;
A1:
( g is one-to-one & rng g = the carrier' of the non empty non void n PC-correct QC-correct QCLangSignature over X )
by FUNCT_3:44;
then reconsider g1 = g " as Function of the carrier' of the non empty non void n PC-correct QC-correct QCLangSignature over X,B by FUNCT_2:25;
deffunc H1( object ) -> set = f1 * (In ($1,( the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X *)));
consider ff being Function such that
A2:
( dom ff = the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X * & ( for p being object st p in the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X * holds
ff . p = H1(p) ) )
from FUNCT_1:sch 3();
rng ff c= A *
then reconsider ff = ff as Function of ( the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X *),(A *) by A2, FUNCT_2:2;
reconsider Ar = (ff * the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X) * g as Function of B,(A *) ;
reconsider re = (f1 * the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X) * g as Function of B,A ;
A5:
( the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X in the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X & the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X = dom f1 )
by FUNCT_2:def 1;
then reconsider fs = f1 . the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X as Element of A by FUNCT_1:102;
rng (g1 * the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X) c= B
;
then reconsider co = g1 * the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X as FinSequence of B by FINSEQ_1:def 4;
reconsider qu = g1 * the quantifiers of the non empty non void n PC-correct QC-correct QCLangSignature over X as Function of [: the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,X:],B ;
set QQ = QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #);
A6:
QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) is n PC-correct
proof
(
rng the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X c= the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X & the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X = dom g1 )
by FUNCT_2:def 1;
then A7:
(
dom the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
= dom the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X &
dom the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X = Seg (len the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X) )
by RELAT_1:27, FINSEQ_1:def 3;
then
len the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
= len the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X
by FINSEQ_1:def 3;
hence
len the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
>= n + 5
by Def4;
AOFA_L00:def 4 ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) | {n,(n + 1),(n + 2),(n + 3),(n + 4),(n + 5)} is one-to-one & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5) is_of_type {} , the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 1) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ... & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 4) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) )
( the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
| {n,(n + 1),(n + 2),(n + 3),(n + 4),(n + 5)} = g1 * ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X | {n,(n + 1),(n + 2),(n + 3),(n + 4),(n + 5)}) &
g1 is
one-to-one & the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X | {n,(n + 1),(n + 2),(n + 3),(n + 4),(n + 5)} is
one-to-one )
by Def4, RELAT_1:83;
hence
the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
| {n,(n + 1),(n + 2),(n + 3),(n + 4),(n + 5)} is
one-to-one
;
( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5) is_of_type {} , the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 1) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ... & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 4) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) )
(
0 < n &
n <= n + 5 &
n + 5
<= len the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by Def4, NAT_1:12;
then
(
0 + 1
<= n &
n <= len the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by NAT_1:13, XXREAL_0:2;
then A8:
(
g1 . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . n) = the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. n & the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. n in B &
B = dom g & the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . n in the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by A7, FUNCT_1:13, FUNCT_1:102, FUNCT_2:def 1, FINSEQ_3:25;
( 1
<= (n + 4) + 1 &
(n + 4) + 1
= n + 5 &
n + 5
<= len the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by Def4, NAT_1:12;
then A9:
(
g1 . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + 5)) = the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. (n + 5) & the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. (n + 5) in B &
B = dom g & the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . (n + 5) in the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by A7, FUNCT_1:13, FUNCT_1:102, FUNCT_2:def 1, FINSEQ_3:25;
A10:
<* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*> in the
carrier of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X *
by FINSEQ_1:def 11;
A11:
<*> the
carrier of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X in the
carrier of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X *
by FINSEQ_1:def 11;
A12:
the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . n is_of_type <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>, the
formula-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X
by Def4;
A13:
the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . (n + 5) is_of_type {} , the
formula-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X
by Def4;
thus the
Arity of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n) =
(ff * the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n))
by A8, FUNCT_1:13
.=
ff . ( the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n)))
by A8, FUNCT_1:102, FUNCT_2:15
.=
ff . <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>
by A12, A1, A8, FUNCT_1:35
.=
f1 * (In (<* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>,( the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X *)))
by A2, A10
.=
f1 * <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>
by A10, SUBSET_1:def 8
.=
<* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>
by A5, FINSEQ_2:34
;
AOFA_A00:def 8 ( the ResultSort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n) = the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5) is_of_type {} , the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 1) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ... & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 4) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) )
thus the
ResultSort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n) =
(f1 * the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n))
by A8, FUNCT_1:13
.=
f1 . ( the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . n)))
by A8, FUNCT_1:102, FUNCT_2:15
.=
the
formula-sort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
by A12, A1, A8, FUNCT_1:35
;
( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5) is_of_type {} , the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 1) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ... & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 4) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) )
thus the
Arity of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5)) =
(ff * the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5)))
by A9, FUNCT_1:13
.=
ff . ( the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5))))
by A9, FUNCT_1:102, FUNCT_2:15
.=
ff . {}
by A13, A1, A9, FUNCT_1:35
.=
f1 * (In ({},( the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X *)))
by A2, A11
.=
f1 * {}
by A11, SUBSET_1:def 8
.=
{}
;
AOFA_A00:def 8 ( the ResultSort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5)) = the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 1) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ... & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 4) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) )
thus the
ResultSort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5)) =
(f1 * the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5)))
by A9, FUNCT_1:13
.=
f1 . ( the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 5))))
by A9, FUNCT_1:102, FUNCT_2:15
.=
the
formula-sort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
by A13, A1, A9, FUNCT_1:35
;
the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 1) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ... & the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + 4) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)
the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . (n + 1) is_of_type <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>, the
formula-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X & ... & the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . (n + 4) is_of_type <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>, the
formula-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X
by Def4;
then A14:
( the
Arity of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + 1)) = <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*> & the
ResultSort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + 1)) = the
formula-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X ) & ... & ( the
Arity of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + 4)) = <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*> & the
ResultSort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + 4)) = the
formula-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by AOFA_A00:def 9;
let i be
natural number ;
( not 1 <= i or not i <= 4 or the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) )
assume A15:
( 1
<= i &
i <= 4 )
;
the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)
then
(
i <= n + i &
n + i <= n + 4 &
n + 4
<= (n + 4) + 1 &
(n + 4) + 1
= n + 5 &
n + 5
<= len the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by Def4, XREAL_1:6, NAT_1:12;
then
( 1
<= n + i &
n + i <= n + 5 &
n + 5
<= len the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by A15, XXREAL_0:2;
then
( 1
<= n + i &
n + i <= len the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by XXREAL_0:2;
then A16:
(
g1 . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + i)) = the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. (n + i) & the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. (n + i) in B &
B = dom g & the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . (n + i) in the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by A7, FUNCT_1:13, FUNCT_1:102, FUNCT_2:def 1, FINSEQ_3:25;
A17:
<* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*> in the
carrier of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X *
by FINSEQ_1:def 11;
thus the
Arity of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i)) =
(ff * the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i)))
by A16, FUNCT_1:13
.=
ff . ( the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i))))
by A16, FUNCT_1:102, FUNCT_2:15
.=
ff . ( the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + i)))
by A1, A16, FUNCT_1:35
.=
ff . <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>
by A15, A14
.=
f1 * (In (<* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>,( the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X *)))
by A2, A17
.=
f1 * <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X, the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>
by A17, SUBSET_1:def 8
.=
<* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #), the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>
by FINSEQ_2:36
;
AOFA_A00:def 8 the ResultSort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i)) = the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)
thus the
ResultSort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i)) =
(f1 * the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i)))
by A16, FUNCT_1:13
.=
f1 . ( the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (n + i))))
by A16, FUNCT_1:102, FUNCT_2:15
.=
f1 . ( the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X . ( the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X . (n + i)))
by A1, A16, FUNCT_1:35
.=
the
formula-sort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
by A15, A14
;
verum
end;
QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) is QC-correct
proof
thus
the
quant-sort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
= {1,2}
by Def5;
AOFA_L00:def 5 ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) is one-to-one & rng the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) misses rng the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ( for q, x being object st q in the quant-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & x in X holds
the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) ) )
the
quantifiers of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X is
one-to-one
by Def5;
hence
the
quantifiers of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #) is
one-to-one
;
( rng the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) misses rng the connectives of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & ( for q, x being object st q in the quant-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & x in X holds
the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) ) )
(
rng co = g1 .: (rng the connectives of the non empty non void n PC-correct QC-correct QCLangSignature over X) &
dom g1 = the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X &
rng qu = g1 .: (rng the quantifiers of the non empty non void n PC-correct QC-correct QCLangSignature over X) &
rng the
quantifiers of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X misses rng the
connectives of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X )
by Def5, RELSET_2:52, FUNCT_2:def 1;
hence
rng the
quantifiers of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
misses rng the
connectives of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
by Lem6;
for q, x being object st q in the quant-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & x in X holds
the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)
let q,
x be
object ;
( q in the quant-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) & x in X implies the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) )
assume A18:
(
q in the
quant-sort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #) &
x in X )
;
the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x) is_of_type <* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>, the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)
then
[q,x] in [: the quant-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #),X:]
by ZFMISC_1:87;
then A19:
( the
quantifiers of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . (
q,
x)
in the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X & the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X = dom g1 & the
quantifiers of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. (
q,
x)
in B &
B = dom g )
by FUNCT_2:def 1, FUNCT_2:5;
A20:
<* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*> in the
carrier of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X *
by FINSEQ_1:def 11;
A21:
the
quantifiers of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X . (
q,
x)
is_of_type <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>, the
formula-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X
by A18, Def5;
thus the
Arity of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x)) =
(ff * the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x)))
by A19, FUNCT_1:13
.=
ff . ( the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x))))
by A19, FUNCT_1:102, FUNCT_2:15
.=
ff . ( the Arity of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . (g1 . ( the quantifiers of the non empty non void n PC-correct QC-correct QCLangSignature over X . [q,x]))))
by A18, ZFMISC_1:87, FUNCT_2:15
.=
ff . <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>
by A21, A1, A19, FUNCT_1:35
.=
f1 * (In (<* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>,( the carrier of the non empty non void n PC-correct QC-correct QCLangSignature over X *)))
by A2, A20
.=
f1 * <* the formula-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X*>
by A20, SUBSET_1:def 8
.=
<* the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)*>
by FINSEQ_2:35
;
AOFA_A00:def 8 the ResultSort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x)) = the formula-sort of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #)
thus the
ResultSort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
. ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x)) =
(f1 * the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X) . (g . ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x)))
by A19, FUNCT_1:13
.=
f1 . ( the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . ( the quantifiers of QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) . (q,x))))
by A19, FUNCT_1:102, FUNCT_2:15
.=
f1 . ( the ResultSort of the non empty non void n PC-correct QC-correct QCLangSignature over X . (g . (g1 . ( the quantifiers of the non empty non void n PC-correct QC-correct QCLangSignature over X . [q,x]))))
by A18, ZFMISC_1:87, FUNCT_2:15
.=
the
formula-sort of
QCLangSignature(#
A,
B,
Ar,
re,
fs,
co, the
quant-sort of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X,
qu #)
by A21, A1, A19, FUNCT_1:35
;
verum
end;
then reconsider QQ = QCLangSignature(# A,B,Ar,re,fs,co, the quant-sort of the non empty non void n PC-correct QC-correct QCLangSignature over X,qu #) as non empty non void n PC-correct QC-correct QCLangSignature over X by A6;
take
QQ
; ( the carrier of QQ misses the carrier of J & the carrier' of QQ misses the carrier' of J )
thus
the carrier of QQ misses the carrier of J
the carrier' of QQ misses the carrier' of Jproof
assume
the
carrier of
QQ meets the
carrier of
J
;
contradiction
then consider a being
object such that A22:
(
a in the
carrier of
QQ &
a in the
carrier of
J )
by XBOOLE_0:3;
consider b,
c being
object such that A23:
(
b in the
carrier of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X &
c in { the carrier of J} &
a = [b,c] )
by A22, ZFMISC_1:def 2;
reconsider c =
c as
set by TARSKI:1;
(
c in {b,c} &
{b,c} in {{b,c},{b}} &
{{b,c},{b}} in c )
by A22, A23, TARSKI:def 1, TARSKI:def 2;
hence
contradiction
by XREGULAR:7;
verum
end;
thus
the carrier' of QQ misses the carrier' of J
verumproof
assume
the
carrier' of
QQ meets the
carrier' of
J
;
contradiction
then consider a being
object such that A24:
(
a in the
carrier' of
QQ &
a in the
carrier' of
J )
by XBOOLE_0:3;
consider b,
c being
object such that A25:
(
b in the
carrier' of the non
empty non
void n PC-correct QC-correct QCLangSignature over
X &
c in { the carrier' of J} &
a = [b,c] )
by A24, ZFMISC_1:def 2;
reconsider c =
c as
set by TARSKI:1;
(
c in {b,c} &
{b,c} in {{b,c},{b}} &
{{b,c},{b}} in c )
by A24, A25, TARSKI:def 1, TARSKI:def 2;
hence
contradiction
by XREGULAR:7;
verum
end;