let x be bound_QC-variable; :: thesis: for A being non empty set
for J being interpretation of A
for v being Element of Valuations_in A
for S being Element of CQC-Sub-WFF
for xSQ being second_Q_comp of [S,x] holds
( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) iff for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 )
let A be non empty set ; :: thesis: for J being interpretation of A
for v being Element of Valuations_in A
for S being Element of CQC-Sub-WFF
for xSQ being second_Q_comp of [S,x] holds
( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) iff for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 )
let J be interpretation of A; :: thesis: for v being Element of Valuations_in A
for S being Element of CQC-Sub-WFF
for xSQ being second_Q_comp of [S,x] holds
( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) iff for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 )
let v be Element of Valuations_in A; :: thesis: for S being Element of CQC-Sub-WFF
for xSQ being second_Q_comp of [S,x] holds
( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) iff for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 )
let S be Element of CQC-Sub-WFF ; :: thesis: for xSQ being second_Q_comp of [S,x] holds
( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) iff for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 )
let xSQ be second_Q_comp of [S,x]; :: thesis: ( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) iff for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 )
thus ( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) implies for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 ) :: thesis: ( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 ) implies for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S )

proof

assume A1: for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ; :: thesis: for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1
let a be Element of A; :: thesis: J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1
( J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S iff J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 ) by Def3;
hence J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 by A1; :: thesis: verum

end;

thus ( ( for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 ) implies for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S ) :: thesis: verum

proof

assume A2: for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 ; :: thesis: for a being Element of A holds J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S
let a be Element of A; :: thesis: J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S
( J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S iff J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S `1 ) by Def3;
hence J,(v . (NEx_Val (v,S,x,xSQ))) . (x | a) |= S by A2; :: thesis: verum

end;