let H be ZF-formula; :: thesis: Subformulae ('not' H) = (Subformulae H) \/ {('not' H)}
now :: thesis: for a being object holds
( ( a in Subformulae ('not' H) implies a in (Subformulae H) \/ {('not' H)} ) & ( a in (Subformulae H) \/ {('not' H)} implies a in Subformulae ('not' H) ) )
let a be object ; :: thesis: ( ( a in Subformulae ('not' H) implies a in (Subformulae H) \/ {('not' H)} ) & ( a in (Subformulae H) \/ {('not' H)} implies a in Subformulae ('not' H) ) )
A1: now :: thesis: ( a in {('not' H)} implies a in Subformulae ('not' H) )end;
thus ( a in Subformulae ('not' H) implies a in (Subformulae H) \/ {('not' H)} ) :: thesis: ( a in (Subformulae H) \/ {('not' H)} implies a in Subformulae ('not' H) )
proof end;
A5: now :: thesis: ( a in Subformulae H implies a in Subformulae ('not' H) )end;
assume a in (Subformulae H) \/ {('not' H)} ; :: thesis: a in Subformulae ('not' H)
hence a in Subformulae ('not' H) by A5, A1, XBOOLE_0:def 3; :: thesis: verum
end;
hence Subformulae ('not' H) = (Subformulae H) \/ {('not' H)} by TARSKI:2; :: thesis: verum