let p, q be ZF-formula; :: thesis: for M being non empty set
for v being Function of VAR,M holds
( M,v |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) & M |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) )
let M be non empty set ; :: thesis: for v being Function of VAR,M holds
( M,v |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) & M |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) )
let v be Function of VAR,M; :: thesis: ( M,v |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) & M |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) )

now :: thesis: for v being Function of VAR,M holds M,v |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q))

let v be Function of VAR,M; :: thesis: M,v |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q))

now :: thesis: ( M,v |= 'not' (p '&' q) implies M,v |= ('not' p) 'or' ('not' q) )

assume M,v |= 'not' (p '&' q) ; :: thesis: M,v |= ('not' p) 'or' ('not' q)
then not M,v |= p '&' q by ZF_MODEL:14;
then ( not M,v |= p or not M,v |= q ) by ZF_MODEL:15;
then ( M,v |= 'not' p or M,v |= 'not' q ) by ZF_MODEL:14;
hence M,v |= ('not' p) 'or' ('not' q) by ZF_MODEL:17; :: thesis: verum

end;

hence M,v |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) by ZF_MODEL:18; :: thesis: verum

end;

hence ( M,v |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) & M |= ('not' (p '&' q)) => (('not' p) 'or' ('not' q)) ) ; :: thesis: verum