let A be QC-alphabet ; :: thesis: for H being Element of QC-WFF A holds Subformulae ('not' H) = (Subformulae H) \/ {('not' H)}
let H be Element of QC-WFF A; :: thesis: Subformulae ('not' H) = (Subformulae H) \/ {('not' H)}
thus Subformulae ('not' H) c= (Subformulae H) \/ {('not' H)} :: according to XBOOLE_0:def 10 :: thesis: (Subformulae H) \/ {('not' H)} c= Subformulae ('not' H)
proof end;
let a be object ; :: according to TARSKI:def 3 :: thesis: ( not a in (Subformulae H) \/ {('not' H)} or a in Subformulae ('not' H) )
assume A3: a in (Subformulae H) \/ {('not' H)} ; :: thesis: a in Subformulae ('not' H)
A4: now :: thesis: ( a in Subformulae H implies a in Subformulae ('not' H) )end;
now :: thesis: ( a in {('not' H)} implies a in Subformulae ('not' H) )end;
hence a in Subformulae ('not' H) by A3, A4, XBOOLE_0:def 3; :: thesis: verum