let A be QC-alphabet ; :: thesis: for F, H being Element of QC-WFF A holds Subformulae (H '&' F) = ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)}
let F, H be Element of QC-WFF A; :: thesis: Subformulae (H '&' F) = ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)}
thus Subformulae (H '&' F) c= ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} :: according to XBOOLE_0:def 10 :: thesis: ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} c= Subformulae (H '&' F)
proof
let a be object ; :: according to TARSKI:def 3 :: thesis: ( not a in Subformulae (H '&' F) or a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} )
assume a in Subformulae (H '&' F) ; :: thesis: a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)}
then consider G being Element of QC-WFF A such that
A1: G = a and
A2: G is_subformula_of H '&' F by Def22;
now :: thesis: ( G <> H '&' F implies a in (Subformulae H) \/ (Subformulae F) )end;
then ( a in (Subformulae H) \/ (Subformulae F) or a in {(H '&' F)} ) by A1, TARSKI:def 1;
hence a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} by XBOOLE_0:def 3; :: thesis: verum
end;
let a be object ; :: according to TARSKI:def 3 :: thesis: ( not a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} or a in Subformulae (H '&' F) )
assume A3: a in ((Subformulae H) \/ (Subformulae F)) \/ {(H '&' F)} ; :: thesis: a in Subformulae (H '&' F)
A4: now :: thesis: ( a in {(H '&' F)} implies a in Subformulae (H '&' F) )end;
A5: now :: thesis: ( a in Subformulae F implies a in Subformulae (H '&' F) )end;
A8: now :: thesis: ( a in Subformulae H implies a in Subformulae (H '&' F) )end;
( not a in (Subformulae H) \/ (Subformulae F) or a in Subformulae H or a in Subformulae F ) by XBOOLE_0:def 3;
hence a in Subformulae (H '&' F) by A3, A8, A5, A4, XBOOLE_0:def 3; :: thesis: verum