let S be Language; :: thesis: S -formulasOfMaxDepth 0 = AtomicFormulasOf S
set U = the non empty set ;
set AF = AtomicFormulasOf S;
set II = the non empty set -InterpretersOf S;
set I = the Element of the non empty set -InterpretersOf S;
reconsider z = 0 as Element of NAT ;
A1: [:( the non empty set -InterpretersOf S),(AtomicFormulasOf S):] = dom (S -TruthEval the non empty set ) by FUNCT_2:def 1
.= dom (((S, the non empty set ) -TruthEval) . z) by Def19
.= dom ((S, the non empty set ) -TruthEval 0) by Def20 ;
now :: thesis: for x being object st x in AtomicFormulasOf S holds
x in S -formulasOfMaxDepth 0
end;
then A2: AtomicFormulasOf S c= S -formulasOfMaxDepth 0 ;
now :: thesis: for x being object st x in S -formulasOfMaxDepth 0 holds
x in AtomicFormulasOf S
end;
then S -formulasOfMaxDepth 0 c= AtomicFormulasOf S ;
hence S -formulasOfMaxDepth 0 = AtomicFormulasOf S by A2; :: thesis: verum