now let x be
set ;
( ( x in SepQuadruples VERUM implies x = [VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)] ) & ( x = [VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)] implies x in SepQuadruples VERUM ) )thus
(
x in SepQuadruples VERUM implies
x = [VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)] )
( x = [VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)] implies x in SepQuadruples VERUM )proof
assume A1:
x in SepQuadruples VERUM
;
x = [VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)]
then consider q being
Element of
CQC-WFF ,
k being
Element of
NAT ,
K being
Finite_Subset of
bound_QC-variables,
f being
Element of
Funcs (
bound_QC-variables,
bound_QC-variables)
such that A2:
x = [q,k,K,f]
by DOMAIN_1:10;
A3:
now given x being
Element of
bound_QC-variables ,
l being
Element of
NAT ,
h being
Element of
Funcs (
bound_QC-variables,
bound_QC-variables)
such that
l + 1
= k
and
h +* ({x} --> (x. l)) = f
and A4:
(
[(All (x,q)),l,K,h] in SepQuadruples VERUM or
[(All (x,q)),l,(K \ {.x.}),h] in SepQuadruples VERUM )
;
contradiction
All (
x,
q)
is_subformula_of VERUM
by A4, Th36;
then
All (
x,
q)
= VERUM
by QC_LANG2:79;
hence
contradiction
by QC_LANG1:18, QC_LANG1:def 19;
verum end;
hence
x = [VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)]
by A1, A2, A7, A5, A3, Th23, Th35;
verum
end; thus
(
x = [VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)] implies
x in SepQuadruples VERUM )
by Th23, Th31;
verum end;
hence
SepQuadruples VERUM = {[VERUM,0,({}. bound_QC-variables),(id bound_QC-variables)]}
by TARSKI:def 1; verum