let S be Language; R2 S is Correct
now set f =
R2 S;
set R =
P2 S;
set Q =
S -sequents ;
set E =
TheEqSymbOf S;
set N =
TheNorSymbOf S;
set FF =
AllFormulasOf S;
set TT =
AllTermsOf S;
set SS =
AllSymbolsOf S;
set F =
S -firstChar ;
set C =
S -multiCat ;
let X be
set ;
( X is S -correct implies (R2 S) . X is S -correct )assume B0:
X is
S -correct
;
(R2 S) . X is S -correct now let U be non
empty set ;
for I being Element of U -InterpretersOf S
for x being b1 -satisfied set
for psi being wff string of S st [x,psi] in (R2 S) . X holds
I -TruthEval psi = 1set II =
U -InterpretersOf S;
let I be
Element of
U -InterpretersOf S;
for x being I -satisfied set
for psi being wff string of S st [x,psi] in (R2 S) . X holds
I -TruthEval psi = 1let x be
I -satisfied set ;
for psi being wff string of S st [x,psi] in (R2 S) . X holds
I -TruthEval psi = 1let psi be
wff string of
S;
( [x,psi] in (R2 S) . X implies I -TruthEval psi = 1 )set s =
[x,psi];
set TE =
I -TermEval ;
set d =
U -deltaInterpreter ;
CC0:
(
([x,psi] `1) \+\ x = {} &
([x,psi] `2) \+\ psi = {} )
;
assume DD1:
[x,psi] in (R2 S) . X
;
I -TruthEval psi = 1then D1:
(
[x,psi] in S -sequents &
[X,[x,psi]] in P2 S )
by Lm1e;
then
X in dom (P2 S)
by RELAT_1:def 4;
then reconsider Seqts =
X as
S -correct Subset of
(S -sequents) by B0;
reconsider seqt =
[x,psi] as
Element of
S -sequents by DD1, Lm1e;
seqt Rule2 Seqts
by D1, DefP2;
then consider t being
termal string of
S such that D2:
seqt `2 = (<*(TheEqSymbOf S)*> ^ t) ^ t
by Def2;
(I -TermEval) . t = (I -TermEval) . t
;
then
I -AtomicEval ((<*(TheEqSymbOf S)*> ^ t) ^ t) = 1
by Lm36;
hence
I -TruthEval psi = 1
by CC0, D2, FOMODEL0:29;
verum end; hence
(R2 S) . X is
S -correct
by FOMODEL2:def 44;
verum end;
hence
R2 S is Correct
by RuleCorr; verum