let H, F be ZF-formula; :: thesis: Subformulae (H '&' F) = ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)}
now
let a be set ; :: thesis: ( ( a in Subformulae (H '&' F) implies a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} ) & ( a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} implies a in Subformulae (H '&' F) ) )
thus ( a in Subformulae (H '&' F) implies a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} ) :: thesis: ( a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} implies a in Subformulae (H '&' F) )
proof end;
assume A2: a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} ; :: thesis: a in Subformulae (H '&' F)
A3: ( not a in (Subformulae H) \/ (Subformulae F) or a in Subformulae H or a in Subformulae F ) by XBOOLE_0:def 3;
A4: now end;
A6: now end;
now end;
hence a in Subformulae (H '&' F) by A2, A3, A4, A6, XBOOLE_0:def 3; :: thesis: verum
end;
hence Subformulae (H '&' F) = ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} by TARSKI:2; :: thesis: verum