let p be Element of CQC-WFF ; :: thesis: for x being bound_QC-variable
for X being Subset of CQC-WFF holds (All (x,p)) => p in { F where F is Element of CQC-WFF : ex f being FinSequence of [:CQC-WFF,Proof_Step_Kinds:] st
( f is_a_proof_wrt X & Effect f = F ) }
let x be bound_QC-variable; :: thesis: for X being Subset of CQC-WFF holds (All (x,p)) => p in { F where F is Element of CQC-WFF : ex f being FinSequence of [:CQC-WFF,Proof_Step_Kinds:] st
( f is_a_proof_wrt X & Effect f = F ) }
let X be Subset of CQC-WFF; :: thesis: (All (x,p)) => p in { F where F is Element of CQC-WFF : ex f being FinSequence of [:CQC-WFF,Proof_Step_Kinds:] st
( f is_a_proof_wrt X & Effect f = F ) }
reconsider pp = [((All (x,p)) => p),6] as Element of [:CQC-WFF,Proof_Step_Kinds:] by Th43, ZFMISC_1:106;
set f = <*pp*>;
A1: len <*pp*> = 1 by FINSEQ_1:57;
A2: <*pp*> . 1 = pp by FINSEQ_1:57;
then (<*pp*> . (len <*pp*>)) `1 = (All (x,p)) => p by A1, MCART_1:7;
then A4: Effect <*pp*> = (All (x,p)) => p by Def6;
for n being Element of NAT st 1 <= n & n <= len <*pp*> holds
<*pp*>,n is_a_correct_step_wrt X

proof

let n be Element of NAT ; :: thesis: ( 1 <= n & n <= len <*pp*> implies <*pp*>,n is_a_correct_step_wrt X )
assume ( 1 <= n & n <= len <*pp*> ) ; :: thesis: <*pp*>,n is_a_correct_step_wrt X
then A7: n = 1 by A1, XXREAL_0:1;
A8: (<*pp*> . 1) `2 = 6 by A2, MCART_1:7;
(<*pp*> . n) `1 = (All (x,p)) => p by A2, A7, MCART_1:7;
hence <*pp*>,n is_a_correct_step_wrt X by A7, A8, Def4; :: thesis: verum

end;

then <*pp*> is_a_proof_wrt X by Def5;
hence (All (x,p)) => p in { F where F is Element of CQC-WFF : ex f being FinSequence of [:CQC-WFF,Proof_Step_Kinds:] st
( f is_a_proof_wrt X & Effect f = F ) } by A4; :: thesis: verum