let x be bound_QC-variable; :: thesis: for h being QC-formula holds still_not-bound_in h c= still_not-bound_in (h . x)
defpred S₁[ QC-formula] means still_not-bound_in $1 c= still_not-bound_in ($1 . x);
A1: for p being Element of QC-WFF st S₁[p] holds
S₁[ 'not' p]

proof

let p be Element of QC-WFF ; :: thesis: ( S₁[p] implies S₁[ 'not' p] )
still_not-bound_in (('not' p) . x) = still_not-bound_in ('not' (p . x)) by CQC_LANG:32
.= still_not-bound_in (p . x) by QC_LANG3:11 ;
hence ( S₁[p] implies S₁[ 'not' p] ) by QC_LANG3:11; :: thesis: verum

end;

A2: for p, q being Element of QC-WFF st S₁[p] & S₁[q] holds
S₁[p '&' q]

proof

let p, q be Element of QC-WFF ; :: thesis: ( S₁[p] & S₁[q] implies S₁[p '&' q] )
assume that
A3: S₁[p] and
A4: S₁[q] ; :: thesis: S₁[p '&' q]
A5: still_not-bound_in ((p '&' q) . x) = still_not-bound_in ((p . x) '&' (q . x)) by CQC_LANG:34
.= (still_not-bound_in (p . x)) \/ (still_not-bound_in (q . x)) by QC_LANG3:14 ;
still_not-bound_in (p '&' q) = (still_not-bound_in p) \/ (still_not-bound_in q) by QC_LANG3:14;
hence S₁[p '&' q] by A3, A4, A5, XBOOLE_1:13; :: thesis: verum

end;

A6: for x being bound_QC-variable
for p being Element of QC-WFF st S₁[p] holds
S₁[ All (x,p)]

proof

let y be bound_QC-variable; :: thesis: for p being Element of QC-WFF st S₁[p] holds
S₁[ All (y,p)]
let p be Element of QC-WFF ; :: thesis: ( S₁[p] implies S₁[ All (y,p)] )
assume A7: S₁[p] ; :: thesis: S₁[ All (y,p)]

per cases ( y = x or y <> x ) ;

suppose y = x ; :: thesis: S₁[ All (y,p)]

hence S₁[ All (y,p)] by CQC_LANG:37; :: thesis: verum

end;

suppose A8: y <> x ; :: thesis: S₁[ All (y,p)]

A9: still_not-bound_in (All (y,p)) = (still_not-bound_in p) \ {y} by QC_LANG3:16;
still_not-bound_in ((All (y,p)) . x) = still_not-bound_in (All (y,(p . x))) by A8, CQC_LANG:38
.= (still_not-bound_in (p . x)) \ {y} by QC_LANG3:16 ;
hence S₁[ All (y,p)] by A7, A9, XBOOLE_1:33; :: thesis: verum

end;

end;

end;

A10: for k being Element of NAT
for P being QC-pred_symbol of k
for ll being QC-variable_list of k holds S₁[P ! ll]

proof

let k be Element of NAT ; :: thesis: for P being QC-pred_symbol of k
for ll being QC-variable_list of k holds S₁[P ! ll]
let P be QC-pred_symbol of k; :: thesis: for ll being QC-variable_list of k holds S₁[P ! ll]
let ll be QC-variable_list of k; :: thesis: S₁[P ! ll]
A11: still_not-bound_in ((P ! ll) . x) = still_not-bound_in (P ! (Subst (ll,((a. 0) .--> x)))) by CQC_LANG:30
.= still_not-bound_in (Subst (ll,((a. 0) .--> x))) by QC_LANG3:9 ;
still_not-bound_in ll c= still_not-bound_in (Subst (ll,((a. 0) .--> x))) by Th61;
hence S₁[P ! ll] by A11, QC_LANG3:9; :: thesis: verum

end;

A12: S₁[ VERUM ] by CQC_LANG:28;
thus for h being QC-formula holds S₁[h] from QC_LANG1:sch 1(A10, A12, A1, A2, A6); :: thesis: verum